./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.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_power.opt-thin000_power.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_power.opt-thin000_power.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe006_power.opt-thin000_power.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:23,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:54:23,059 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:23,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:54:23,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:54:23,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:54:23,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:54:23,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:54:23,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:54:23,092 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:54:23,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:54:23,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:54:23,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:54:23,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:54:23,096 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:54:23,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:54:23,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:54:23,099 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:54:23,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:54:23,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:54:23,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:54:23,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:54:23,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:54:23,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:54:23,100 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:54:23,101 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:54:23,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:54:23,102 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:54:23,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:54:23,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:54:23,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:54:23,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:54:23,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:54:23,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:54:23,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:54:23,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:54:23,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:54:23,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:54:23,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:54:23,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:54:23,105 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:54:23,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:54:23,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:54:23,106 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:23,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:54:23,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:54:23,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:54:23,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:54:23,345 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:54:23,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2024-06-28 01:54:24,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:54:24,646 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:54:24,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2024-06-28 01:54:24,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e6f262e/24fa2c94425b45ea9ccec49e607f21a4/FLAG1cfa5a203 [2024-06-28 01:54:24,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e6f262e/24fa2c94425b45ea9ccec49e607f21a4 [2024-06-28 01:54:24,673 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:54:24,674 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:54:24,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe006_power.opt-thin000_power.opt.yml/witness.yml [2024-06-28 01:54:24,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:54:24,797 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:54:24,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:54:24,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:54:24,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:54:24,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:54:24" (1/2) ... [2024-06-28 01:54:24,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e90c776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:54:24, skipping insertion in model container [2024-06-28 01:54:24,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:54:24" (1/2) ... [2024-06-28 01:54:24,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@36a0c4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:54:24, skipping insertion in model container [2024-06-28 01:54:24,806 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:24" (2/2) ... [2024-06-28 01:54:24,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e90c776 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:54:24, skipping insertion in model container [2024-06-28 01:54:24,807 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:24" (2/2) ... [2024-06-28 01:54:24,807 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:54:24,876 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:54:24,877 INFO L97 edCorrectnessWitness]: Location invariant before [L829-L829] (((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX$read_delayed_var == 0 || (__unbuffered_p1_EAX$read_delayed_var == & x && (*__unbuffered_p1_EAX$read_delayed_var == 0 || *__unbuffered_p1_EAX$read_delayed_var == 1))))) && (! multithreaded || __unbuffered_p1_EAX$w_buff0 == 0)) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p1_EAX$flush_delayed == (_Bool)0) && __unbuffered_p1_EAX$mem_tmp == 0) && __unbuffered_p1_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p1_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p1_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p1_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p1_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p1_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p1_EAX$w_buff0 == 0) && __unbuffered_p1_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p1_EAX$w_buff1 == 0) && __unbuffered_p1_EAX$w_buff1_used == (_Bool)0) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EAX$read_delayed_var == 0 || (__unbuffered_p1_EAX$read_delayed_var == & x && (*__unbuffered_p1_EAX$read_delayed_var == 0 || *__unbuffered_p1_EAX$read_delayed_var == 1)))) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p1_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || __unbuffered_p1_EAX$mem_tmp == 0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || __unbuffered_p1_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p1_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-28 01:54:24,877 INFO L97 edCorrectnessWitness]: Location invariant before [L828-L828] (((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX$read_delayed_var == 0 || (__unbuffered_p1_EAX$read_delayed_var == & x && (*__unbuffered_p1_EAX$read_delayed_var == 0 || *__unbuffered_p1_EAX$read_delayed_var == 1))))) && (! multithreaded || __unbuffered_p1_EAX$w_buff0 == 0)) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p1_EAX$flush_delayed == (_Bool)0) && __unbuffered_p1_EAX$mem_tmp == 0) && __unbuffered_p1_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p1_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p1_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p1_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p1_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p1_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p1_EAX$w_buff0 == 0) && __unbuffered_p1_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p1_EAX$w_buff1 == 0) && __unbuffered_p1_EAX$w_buff1_used == (_Bool)0) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EAX$read_delayed_var == 0 || (__unbuffered_p1_EAX$read_delayed_var == & x && (*__unbuffered_p1_EAX$read_delayed_var == 0 || *__unbuffered_p1_EAX$read_delayed_var == 1)))) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || __unbuffered_p1_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || __unbuffered_p1_EAX$mem_tmp == 0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || __unbuffered_p1_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p1_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-28 01:54:24,878 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:54:24,878 INFO L106 edCorrectnessWitness]: ghost_update [L826-L826] multithreaded = 1; [2024-06-28 01:54:24,913 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:54:25,061 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] [2024-06-28 01:54:25,202 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:54:25,221 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:54:25,264 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:54:25,358 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:54:25,401 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:54:25,402 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:54:25 WrapperNode [2024-06-28 01:54:25,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:54:25,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:54:25,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:54:25,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:54:25,408 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:25" (1/1) ... [2024-06-28 01:54:25,430 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:25" (1/1) ... [2024-06-28 01:54:25,459 INFO L138 Inliner]: procedures = 174, calls = 66, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 211 [2024-06-28 01:54:25,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:54:25,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:54:25,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:54:25,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:54:25,469 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:25" (1/1) ... [2024-06-28 01:54:25,469 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:25" (1/1) ... [2024-06-28 01:54:25,472 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:25" (1/1) ... [2024-06-28 01:54:25,500 INFO L175 MemorySlicer]: Split 34 memory accesses to 2 slices as follows [2, 32]. 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:25,500 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:25" (1/1) ... [2024-06-28 01:54:25,500 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:25" (1/1) ... [2024-06-28 01:54:25,508 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:25" (1/1) ... [2024-06-28 01:54:25,522 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:25" (1/1) ... [2024-06-28 01:54:25,524 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:25" (1/1) ... [2024-06-28 01:54:25,526 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:25" (1/1) ... [2024-06-28 01:54:25,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:54:25,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:54:25,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:54:25,530 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:54:25,530 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:25" (1/1) ... [2024-06-28 01:54:25,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:54:25,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:54:25,579 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:25,596 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:25,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 01:54:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 01:54:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 01:54:25,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 01:54:25,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:54:25,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:54:25,609 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:54:25,609 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:54:25,610 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:54:25,610 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:54:25,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:54:25,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 01:54:25,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:54:25,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:54:25,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:54:25,613 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:25,755 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:54:25,756 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:54:26,099 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:54:26,100 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:54:26,332 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:54:26,333 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:54:26,333 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:54:26 BoogieIcfgContainer [2024-06-28 01:54:26,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:54:26,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:54:26,335 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:54:26,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:54:26,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:54:24" (1/4) ... [2024-06-28 01:54:26,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5d4f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:54:26, skipping insertion in model container [2024-06-28 01:54:26,338 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:24" (2/4) ... [2024-06-28 01:54:26,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5d4f14 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:54:26, skipping insertion in model container [2024-06-28 01:54:26,338 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:25" (3/4) ... [2024-06-28 01:54:26,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5d4f14 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:54:26, skipping insertion in model container [2024-06-28 01:54:26,339 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:26" (4/4) ... [2024-06-28 01:54:26,339 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2024-06-28 01:54:26,353 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:54:26,353 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-28 01:54:26,353 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:54:26,417 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:54:26,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 80 flow [2024-06-28 01:54:26,476 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2024-06-28 01:54:26,476 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:54:26,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 1/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-06-28 01:54:26,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 80 flow [2024-06-28 01:54:26,483 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 34 transitions, 74 flow [2024-06-28 01:54:26,495 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:54:26,515 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;@20fad48c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:54:26,516 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-28 01:54:26,521 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:54:26,521 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-28 01:54:26,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:54:26,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:26,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:54:26,523 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:54:26,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:26,527 INFO L85 PathProgramCache]: Analyzing trace with hash 703398510, now seen corresponding path program 1 times [2024-06-28 01:54:26,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:26,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980112251] [2024-06-28 01:54:26,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:26,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:27,847 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:27,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:27,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980112251] [2024-06-28 01:54:27,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980112251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:27,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:27,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:54:27,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469310422] [2024-06-28 01:54:27,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:27,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:54:27,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:27,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:54:27,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:54:27,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-28 01:54:27,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:27,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:27,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-28 01:54:27,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:28,198 INFO L124 PetriNetUnfolderBase]: 585/1086 cut-off events. [2024-06-28 01:54:28,199 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-28 01:54:28,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 1086 events. 585/1086 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5752 event pairs, 281 based on Foata normal form. 36/981 useless extension candidates. Maximal degree in co-relation 2067. Up to 964 conditions per place. [2024-06-28 01:54:28,206 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 34 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2024-06-28 01:54:28,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 179 flow [2024-06-28 01:54:28,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:54:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:54:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2024-06-28 01:54:28,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-06-28 01:54:28,217 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 74 flow. Second operand 3 states and 69 transitions. [2024-06-28 01:54:28,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 179 flow [2024-06-28 01:54:28,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:54:28,221 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 105 flow [2024-06-28 01:54:28,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2024-06-28 01:54:28,225 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-06-28 01:54:28,225 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 105 flow [2024-06-28 01:54:28,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states 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:28,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:28,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-28 01:54:28,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:54:28,226 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:54:28,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:28,226 INFO L85 PathProgramCache]: Analyzing trace with hash 330527094, now seen corresponding path program 1 times [2024-06-28 01:54:28,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:28,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419798354] [2024-06-28 01:54:28,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:28,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:28,267 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:28,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:28,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419798354] [2024-06-28 01:54:28,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419798354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:28,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:28,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:54:28,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764528717] [2024-06-28 01:54:28,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:28,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:54:28,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:28,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:54:28,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:54:28,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:54:28,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:28,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:28,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:54:28,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:28,433 INFO L124 PetriNetUnfolderBase]: 237/516 cut-off events. [2024-06-28 01:54:28,434 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-06-28 01:54:28,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 516 events. 237/516 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2741 event pairs, 129 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 1068. Up to 347 conditions per place. [2024-06-28 01:54:28,437 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 36 selfloop transitions, 3 changer transitions 2/51 dead transitions. [2024-06-28 01:54:28,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 218 flow [2024-06-28 01:54:28,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:54:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:54:28,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-28 01:54:28,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-06-28 01:54:28,439 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 105 flow. Second operand 3 states and 75 transitions. [2024-06-28 01:54:28,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 218 flow [2024-06-28 01:54:28,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:54:28,440 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 96 flow [2024-06-28 01:54:28,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2024-06-28 01:54:28,441 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-06-28 01:54:28,441 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 96 flow [2024-06-28 01:54:28,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:28,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:28,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:28,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:54:28,442 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:54:28,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:28,443 INFO L85 PathProgramCache]: Analyzing trace with hash -191030340, now seen corresponding path program 1 times [2024-06-28 01:54:28,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:28,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454564628] [2024-06-28 01:54:28,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:28,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:54:29,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:29,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454564628] [2024-06-28 01:54:29,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454564628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:29,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:29,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:54:29,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485159534] [2024-06-28 01:54:29,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:29,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:54:29,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:29,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:54:29,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:54:29,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-06-28 01:54:29,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:29,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:29,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-06-28 01:54:29,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:29,634 INFO L124 PetriNetUnfolderBase]: 523/985 cut-off events. [2024-06-28 01:54:29,635 INFO L125 PetriNetUnfolderBase]: For 211/213 co-relation queries the response was YES. [2024-06-28 01:54:29,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 985 events. 523/985 cut-off events. For 211/213 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4810 event pairs, 216 based on Foata normal form. 4/952 useless extension candidates. Maximal degree in co-relation 2104. Up to 829 conditions per place. [2024-06-28 01:54:29,638 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 45 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2024-06-28 01:54:29,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 58 transitions, 262 flow [2024-06-28 01:54:29,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:54:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:54:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2024-06-28 01:54:29,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2024-06-28 01:54:29,640 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 96 flow. Second operand 4 states and 83 transitions. [2024-06-28 01:54:29,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 58 transitions, 262 flow [2024-06-28 01:54:29,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:54:29,642 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 148 flow [2024-06-28 01:54:29,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2024-06-28 01:54:29,642 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-06-28 01:54:29,643 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 148 flow [2024-06-28 01:54:29,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:29,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:29,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:29,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:54:29,643 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:54:29,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:29,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1626972050, now seen corresponding path program 1 times [2024-06-28 01:54:29,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:29,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390430140] [2024-06-28 01:54:29,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:29,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:30,977 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:30,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:30,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390430140] [2024-06-28 01:54:30,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390430140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:30,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:30,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:54:30,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550996951] [2024-06-28 01:54:30,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:30,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:54:30,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:30,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:54:30,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:54:30,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-06-28 01:54:30,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:30,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:30,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-06-28 01:54:30,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:31,295 INFO L124 PetriNetUnfolderBase]: 522/983 cut-off events. [2024-06-28 01:54:31,296 INFO L125 PetriNetUnfolderBase]: For 380/386 co-relation queries the response was YES. [2024-06-28 01:54:31,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2321 conditions, 983 events. 522/983 cut-off events. For 380/386 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4805 event pairs, 162 based on Foata normal form. 8/954 useless extension candidates. Maximal degree in co-relation 2306. Up to 808 conditions per place. [2024-06-28 01:54:31,301 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 54 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2024-06-28 01:54:31,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 354 flow [2024-06-28 01:54:31,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:54:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:54:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-06-28 01:54:31,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5722222222222222 [2024-06-28 01:54:31,306 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 148 flow. Second operand 5 states and 103 transitions. [2024-06-28 01:54:31,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 354 flow [2024-06-28 01:54:31,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 344 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-28 01:54:31,310 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 186 flow [2024-06-28 01:54:31,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2024-06-28 01:54:31,312 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2024-06-28 01:54:31,312 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 186 flow [2024-06-28 01:54:31,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:31,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:31,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:31,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:54:31,313 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:54:31,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:31,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1103475227, now seen corresponding path program 1 times [2024-06-28 01:54:31,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:31,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719485345] [2024-06-28 01:54:31,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:31,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:54:32,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:32,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719485345] [2024-06-28 01:54:32,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719485345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:32,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:32,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:54:32,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897553248] [2024-06-28 01:54:32,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:32,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:54:32,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:32,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:54:32,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:54:32,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-06-28 01:54:32,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 186 flow. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:32,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:32,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-06-28 01:54:32,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:33,336 INFO L124 PetriNetUnfolderBase]: 521/980 cut-off events. [2024-06-28 01:54:33,337 INFO L125 PetriNetUnfolderBase]: For 707/713 co-relation queries the response was YES. [2024-06-28 01:54:33,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 980 events. 521/980 cut-off events. For 707/713 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4803 event pairs, 104 based on Foata normal form. 10/953 useless extension candidates. Maximal degree in co-relation 2474. Up to 767 conditions per place. [2024-06-28 01:54:33,342 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 59 selfloop transitions, 12 changer transitions 0/77 dead transitions. [2024-06-28 01:54:33,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 77 transitions, 414 flow [2024-06-28 01:54:33,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:54:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:54:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-06-28 01:54:33,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2024-06-28 01:54:33,345 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 186 flow. Second operand 6 states and 118 transitions. [2024-06-28 01:54:33,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 77 transitions, 414 flow [2024-06-28 01:54:33,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 77 transitions, 390 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-28 01:54:33,350 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 203 flow [2024-06-28 01:54:33,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=203, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2024-06-28 01:54:33,356 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2024-06-28 01:54:33,356 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 203 flow [2024-06-28 01:54:33,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:33,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:33,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:33,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:54:33,357 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:54:33,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:33,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1134894974, now seen corresponding path program 1 times [2024-06-28 01:54:33,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:33,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650764221] [2024-06-28 01:54:33,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:33,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:54:34,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:34,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650764221] [2024-06-28 01:54:34,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650764221] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:34,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:34,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:54:34,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967540637] [2024-06-28 01:54:34,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:34,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:54:34,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:34,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:54:34,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:54:34,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-06-28 01:54:34,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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:34,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:34,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-06-28 01:54:34,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:35,390 INFO L124 PetriNetUnfolderBase]: 424/795 cut-off events. [2024-06-28 01:54:35,391 INFO L125 PetriNetUnfolderBase]: For 882/882 co-relation queries the response was YES. [2024-06-28 01:54:35,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 795 events. 424/795 cut-off events. For 882/882 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3785 event pairs, 121 based on Foata normal form. 1/769 useless extension candidates. Maximal degree in co-relation 2158. Up to 686 conditions per place. [2024-06-28 01:54:35,394 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 47 selfloop transitions, 12 changer transitions 0/65 dead transitions. [2024-06-28 01:54:35,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 395 flow [2024-06-28 01:54:35,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:54:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:54:35,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-06-28 01:54:35,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-28 01:54:35,396 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 203 flow. Second operand 6 states and 96 transitions. [2024-06-28 01:54:35,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 65 transitions, 395 flow [2024-06-28 01:54:35,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 360 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-28 01:54:35,399 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 249 flow [2024-06-28 01:54:35,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2024-06-28 01:54:35,402 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2024-06-28 01:54:35,402 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 249 flow [2024-06-28 01:54:35,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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:35,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:35,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:35,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:54:35,403 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:54:35,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:35,403 INFO L85 PathProgramCache]: Analyzing trace with hash -837197407, now seen corresponding path program 1 times [2024-06-28 01:54:35,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:35,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615209889] [2024-06-28 01:54:35,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:35,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:54:36,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:36,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615209889] [2024-06-28 01:54:36,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615209889] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:36,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:36,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:54:36,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094163924] [2024-06-28 01:54:36,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:36,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:54:36,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:36,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:54:36,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:54:36,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:54:36,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:36,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:36,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:54:36,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:37,635 INFO L124 PetriNetUnfolderBase]: 513/958 cut-off events. [2024-06-28 01:54:37,635 INFO L125 PetriNetUnfolderBase]: For 1220/1220 co-relation queries the response was YES. [2024-06-28 01:54:37,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2671 conditions, 958 events. 513/958 cut-off events. For 1220/1220 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4591 event pairs, 135 based on Foata normal form. 2/926 useless extension candidates. Maximal degree in co-relation 2648. Up to 799 conditions per place. [2024-06-28 01:54:37,640 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 69 selfloop transitions, 10 changer transitions 0/84 dead transitions. [2024-06-28 01:54:37,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 536 flow [2024-06-28 01:54:37,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:54:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:54:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-28 01:54:37,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-28 01:54:37,642 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 249 flow. Second operand 6 states and 100 transitions. [2024-06-28 01:54:37,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 536 flow [2024-06-28 01:54:37,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 84 transitions, 522 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-28 01:54:37,645 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 329 flow [2024-06-28 01:54:37,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2024-06-28 01:54:37,646 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2024-06-28 01:54:37,646 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 329 flow [2024-06-28 01:54:37,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:37,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:37,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:37,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:54:37,647 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:54:37,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:37,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1613392102, now seen corresponding path program 1 times [2024-06-28 01:54:37,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:37,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986909830] [2024-06-28 01:54:37,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:37,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:39,716 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:39,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:39,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986909830] [2024-06-28 01:54:39,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986909830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:39,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:39,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:54:39,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057803713] [2024-06-28 01:54:39,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:39,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:54:39,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:39,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:54:39,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:54:39,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:54:39,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 329 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:39,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:39,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:54:39,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:40,151 INFO L124 PetriNetUnfolderBase]: 531/999 cut-off events. [2024-06-28 01:54:40,155 INFO L125 PetriNetUnfolderBase]: For 1491/1499 co-relation queries the response was YES. [2024-06-28 01:54:40,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2991 conditions, 999 events. 531/999 cut-off events. For 1491/1499 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4912 event pairs, 152 based on Foata normal form. 9/970 useless extension candidates. Maximal degree in co-relation 2963. Up to 823 conditions per place. [2024-06-28 01:54:40,160 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 69 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2024-06-28 01:54:40,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 87 transitions, 588 flow [2024-06-28 01:54:40,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:54:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:54:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-28 01:54:40,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-28 01:54:40,163 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 329 flow. Second operand 6 states and 102 transitions. [2024-06-28 01:54:40,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 87 transitions, 588 flow [2024-06-28 01:54:40,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 586 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:54:40,167 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 395 flow [2024-06-28 01:54:40,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=395, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2024-06-28 01:54:40,169 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2024-06-28 01:54:40,169 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 395 flow [2024-06-28 01:54:40,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:40,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:40,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:40,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:54:40,170 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:54:40,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:40,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1119117000, now seen corresponding path program 2 times [2024-06-28 01:54:40,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:40,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994712700] [2024-06-28 01:54:40,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:40,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:41,721 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:41,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:41,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994712700] [2024-06-28 01:54:41,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994712700] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:41,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:41,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:54:41,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329618549] [2024-06-28 01:54:41,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:41,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:54:41,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:41,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:54:41,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:54:41,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:54:41,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 395 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:41,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:41,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:54:41,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:42,454 INFO L124 PetriNetUnfolderBase]: 598/1110 cut-off events. [2024-06-28 01:54:42,454 INFO L125 PetriNetUnfolderBase]: For 2201/2211 co-relation queries the response was YES. [2024-06-28 01:54:42,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3579 conditions, 1110 events. 598/1110 cut-off events. For 2201/2211 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5553 event pairs, 146 based on Foata normal form. 11/1082 useless extension candidates. Maximal degree in co-relation 3547. Up to 823 conditions per place. [2024-06-28 01:54:42,460 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 78 selfloop transitions, 25 changer transitions 0/108 dead transitions. [2024-06-28 01:54:42,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 108 transitions, 801 flow [2024-06-28 01:54:42,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:54:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:54:42,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-28 01:54:42,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2024-06-28 01:54:42,462 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 395 flow. Second operand 7 states and 122 transitions. [2024-06-28 01:54:42,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 108 transitions, 801 flow [2024-06-28 01:54:42,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 108 transitions, 783 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-28 01:54:42,467 INFO L231 Difference]: Finished difference. Result has 73 places, 76 transitions, 567 flow [2024-06-28 01:54:42,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=567, PETRI_PLACES=73, PETRI_TRANSITIONS=76} [2024-06-28 01:54:42,468 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2024-06-28 01:54:42,468 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 76 transitions, 567 flow [2024-06-28 01:54:42,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:42,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:42,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:42,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:54:42,472 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:54:42,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:42,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1103923776, now seen corresponding path program 1 times [2024-06-28 01:54:42,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:42,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107764095] [2024-06-28 01:54:42,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:42,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:44,069 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:44,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:44,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107764095] [2024-06-28 01:54:44,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107764095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:44,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:44,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:54:44,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104121005] [2024-06-28 01:54:44,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:44,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:54:44,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:44,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:54:44,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:54:44,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:54:44,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 76 transitions, 567 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:44,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:44,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:54:44,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:45,007 INFO L124 PetriNetUnfolderBase]: 628/1171 cut-off events. [2024-06-28 01:54:45,008 INFO L125 PetriNetUnfolderBase]: For 3408/3422 co-relation queries the response was YES. [2024-06-28 01:54:45,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4336 conditions, 1171 events. 628/1171 cut-off events. For 3408/3422 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5905 event pairs, 155 based on Foata normal form. 16/1143 useless extension candidates. Maximal degree in co-relation 4300. Up to 905 conditions per place. [2024-06-28 01:54:45,016 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 73 selfloop transitions, 22 changer transitions 0/100 dead transitions. [2024-06-28 01:54:45,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 100 transitions, 842 flow [2024-06-28 01:54:45,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:54:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:54:45,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-28 01:54:45,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47685185185185186 [2024-06-28 01:54:45,017 INFO L175 Difference]: Start difference. First operand has 73 places, 76 transitions, 567 flow. Second operand 6 states and 103 transitions. [2024-06-28 01:54:45,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 100 transitions, 842 flow [2024-06-28 01:54:45,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 100 transitions, 820 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-28 01:54:45,026 INFO L231 Difference]: Finished difference. Result has 77 places, 78 transitions, 618 flow [2024-06-28 01:54:45,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=618, PETRI_PLACES=77, PETRI_TRANSITIONS=78} [2024-06-28 01:54:45,027 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2024-06-28 01:54:45,027 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 78 transitions, 618 flow [2024-06-28 01:54:45,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:45,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:45,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:45,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 01:54:45,028 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:54:45,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:45,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2090079598, now seen corresponding path program 2 times [2024-06-28 01:54:45,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:45,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070222682] [2024-06-28 01:54:45,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:45,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:54:46,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:46,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070222682] [2024-06-28 01:54:46,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070222682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:46,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:46,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:54:46,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429294189] [2024-06-28 01:54:46,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:46,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:54:46,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:46,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:54:46,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:54:46,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:54:46,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 618 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:46,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:46,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:54:46,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:47,328 INFO L124 PetriNetUnfolderBase]: 624/1159 cut-off events. [2024-06-28 01:54:47,328 INFO L125 PetriNetUnfolderBase]: For 3705/3719 co-relation queries the response was YES. [2024-06-28 01:54:47,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4509 conditions, 1159 events. 624/1159 cut-off events. For 3705/3719 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5775 event pairs, 155 based on Foata normal form. 16/1133 useless extension candidates. Maximal degree in co-relation 4471. Up to 861 conditions per place. [2024-06-28 01:54:47,336 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 81 selfloop transitions, 24 changer transitions 0/110 dead transitions. [2024-06-28 01:54:47,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 110 transitions, 949 flow [2024-06-28 01:54:47,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:54:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:54:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-28 01:54:47,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-28 01:54:47,338 INFO L175 Difference]: Start difference. First operand has 77 places, 78 transitions, 618 flow. Second operand 7 states and 120 transitions. [2024-06-28 01:54:47,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 110 transitions, 949 flow [2024-06-28 01:54:47,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 110 transitions, 911 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-28 01:54:47,350 INFO L231 Difference]: Finished difference. Result has 80 places, 80 transitions, 656 flow [2024-06-28 01:54:47,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=656, PETRI_PLACES=80, PETRI_TRANSITIONS=80} [2024-06-28 01:54:47,351 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 40 predicate places. [2024-06-28 01:54:47,351 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 80 transitions, 656 flow [2024-06-28 01:54:47,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:47,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:47,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:47,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 01:54:47,352 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:54:47,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:47,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1387764224, now seen corresponding path program 1 times [2024-06-28 01:54:47,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:47,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446036612] [2024-06-28 01:54:47,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:47,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:49,548 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:49,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:49,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446036612] [2024-06-28 01:54:49,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446036612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:49,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:49,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:54:49,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269222814] [2024-06-28 01:54:49,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:49,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:54:49,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:49,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:54:49,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:54:49,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:54:49,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 80 transitions, 656 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:49,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:49,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:54:49,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:50,329 INFO L124 PetriNetUnfolderBase]: 621/1150 cut-off events. [2024-06-28 01:54:50,329 INFO L125 PetriNetUnfolderBase]: For 4140/4140 co-relation queries the response was YES. [2024-06-28 01:54:50,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4603 conditions, 1150 events. 621/1150 cut-off events. For 4140/4140 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5698 event pairs, 149 based on Foata normal form. 2/1111 useless extension candidates. Maximal degree in co-relation 4564. Up to 940 conditions per place. [2024-06-28 01:54:50,336 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 97 selfloop transitions, 12 changer transitions 0/114 dead transitions. [2024-06-28 01:54:50,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 114 transitions, 995 flow [2024-06-28 01:54:50,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:54:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:54:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-28 01:54:50,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2024-06-28 01:54:50,338 INFO L175 Difference]: Start difference. First operand has 80 places, 80 transitions, 656 flow. Second operand 7 states and 115 transitions. [2024-06-28 01:54:50,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 114 transitions, 995 flow [2024-06-28 01:54:50,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 114 transitions, 942 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-28 01:54:50,345 INFO L231 Difference]: Finished difference. Result has 82 places, 80 transitions, 631 flow [2024-06-28 01:54:50,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=631, PETRI_PLACES=82, PETRI_TRANSITIONS=80} [2024-06-28 01:54:50,346 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 42 predicate places. [2024-06-28 01:54:50,346 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 80 transitions, 631 flow [2024-06-28 01:54:50,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:50,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:50,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:50,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 01:54:50,347 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:54:50,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:50,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2100264866, now seen corresponding path program 1 times [2024-06-28 01:54:50,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:50,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435788901] [2024-06-28 01:54:50,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:50,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:53,409 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,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:53,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435788901] [2024-06-28 01:54:53,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435788901] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:53,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:53,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:54:53,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516076317] [2024-06-28 01:54:53,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:53,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:54:53,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:53,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:54:53,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:54:53,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:54:53,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 80 transitions, 631 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:53,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:53,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:54:53,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:54,109 INFO L124 PetriNetUnfolderBase]: 639/1191 cut-off events. [2024-06-28 01:54:54,110 INFO L125 PetriNetUnfolderBase]: For 4212/4226 co-relation queries the response was YES. [2024-06-28 01:54:54,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4689 conditions, 1191 events. 639/1191 cut-off events. For 4212/4226 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6056 event pairs, 171 based on Foata normal form. 15/1161 useless extension candidates. Maximal degree in co-relation 4649. Up to 956 conditions per place. [2024-06-28 01:54:54,118 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 100 selfloop transitions, 21 changer transitions 0/126 dead transitions. [2024-06-28 01:54:54,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 126 transitions, 1041 flow [2024-06-28 01:54:54,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:54:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:54:54,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-28 01:54:54,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2024-06-28 01:54:54,120 INFO L175 Difference]: Start difference. First operand has 82 places, 80 transitions, 631 flow. Second operand 8 states and 138 transitions. [2024-06-28 01:54:54,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 126 transitions, 1041 flow [2024-06-28 01:54:54,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 126 transitions, 1009 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-28 01:54:54,129 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 695 flow [2024-06-28 01:54:54,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=695, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2024-06-28 01:54:54,130 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 45 predicate places. [2024-06-28 01:54:54,130 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 695 flow [2024-06-28 01:54:54,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:54,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:54,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:54,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 01:54:54,131 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:54:54,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:54,131 INFO L85 PathProgramCache]: Analyzing trace with hash -141824319, now seen corresponding path program 1 times [2024-06-28 01:54:54,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:54,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259622918] [2024-06-28 01:54:54,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:54,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:54:56,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:56,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259622918] [2024-06-28 01:54:56,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259622918] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:56,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:56,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:54:56,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869659135] [2024-06-28 01:54:56,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:56,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:54:56,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:56,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:54:56,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:54:56,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:54:56,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 695 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:56,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:56,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:54:56,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:56,703 INFO L124 PetriNetUnfolderBase]: 657/1219 cut-off events. [2024-06-28 01:54:56,703 INFO L125 PetriNetUnfolderBase]: For 4845/4859 co-relation queries the response was YES. [2024-06-28 01:54:56,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4922 conditions, 1219 events. 657/1219 cut-off events. For 4845/4859 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6212 event pairs, 171 based on Foata normal form. 16/1190 useless extension candidates. Maximal degree in co-relation 4881. Up to 992 conditions per place. [2024-06-28 01:54:56,710 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 97 selfloop transitions, 17 changer transitions 0/119 dead transitions. [2024-06-28 01:54:56,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 119 transitions, 1048 flow [2024-06-28 01:54:56,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:54:56,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:54:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-28 01:54:56,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-28 01:54:56,713 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 695 flow. Second operand 7 states and 119 transitions. [2024-06-28 01:54:56,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 119 transitions, 1048 flow [2024-06-28 01:54:56,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 119 transitions, 1011 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-28 01:54:56,722 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 719 flow [2024-06-28 01:54:56,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=719, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2024-06-28 01:54:56,722 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 48 predicate places. [2024-06-28 01:54:56,722 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 719 flow [2024-06-28 01:54:56,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:56,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:56,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:56,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 01:54:56,723 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:54:56,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:56,723 INFO L85 PathProgramCache]: Analyzing trace with hash -141824474, now seen corresponding path program 2 times [2024-06-28 01:54:56,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:56,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131723249] [2024-06-28 01:54:56,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:56,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:54:58,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:54:58,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:54:58,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131723249] [2024-06-28 01:54:58,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131723249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:54:58,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:54:58,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:54:58,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776787455] [2024-06-28 01:54:58,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:54:58,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:54:58,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:54:58,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:54:58,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:54:59,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:54:59,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 719 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:59,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:54:59,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:54:59,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:54:59,487 INFO L124 PetriNetUnfolderBase]: 675/1253 cut-off events. [2024-06-28 01:54:59,488 INFO L125 PetriNetUnfolderBase]: For 5277/5291 co-relation queries the response was YES. [2024-06-28 01:54:59,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5206 conditions, 1253 events. 675/1253 cut-off events. For 5277/5291 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6436 event pairs, 179 based on Foata normal form. 15/1221 useless extension candidates. Maximal degree in co-relation 5163. Up to 1036 conditions per place. [2024-06-28 01:54:59,495 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 99 selfloop transitions, 18 changer transitions 0/122 dead transitions. [2024-06-28 01:54:59,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 122 transitions, 1091 flow [2024-06-28 01:54:59,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:54:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:54:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-28 01:54:59,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2024-06-28 01:54:59,497 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 719 flow. Second operand 7 states and 118 transitions. [2024-06-28 01:54:59,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 122 transitions, 1091 flow [2024-06-28 01:54:59,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 122 transitions, 1047 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-28 01:54:59,507 INFO L231 Difference]: Finished difference. Result has 91 places, 91 transitions, 777 flow [2024-06-28 01:54:59,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=777, PETRI_PLACES=91, PETRI_TRANSITIONS=91} [2024-06-28 01:54:59,508 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 51 predicate places. [2024-06-28 01:54:59,508 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 91 transitions, 777 flow [2024-06-28 01:54:59,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:54:59,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:54:59,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:54:59,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 01:54:59,509 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:54:59,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:54:59,509 INFO L85 PathProgramCache]: Analyzing trace with hash 332890306, now seen corresponding path program 3 times [2024-06-28 01:54:59,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:54:59,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574187785] [2024-06-28 01:54:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:54:59,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:54:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:01,451 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:01,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:01,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574187785] [2024-06-28 01:55:01,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574187785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:01,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:01,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:01,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565146086] [2024-06-28 01:55:01,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:01,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:01,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:01,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:01,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:01,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:01,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 91 transitions, 777 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:01,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:01,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:01,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:02,039 INFO L124 PetriNetUnfolderBase]: 678/1258 cut-off events. [2024-06-28 01:55:02,039 INFO L125 PetriNetUnfolderBase]: For 5892/5906 co-relation queries the response was YES. [2024-06-28 01:55:02,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5353 conditions, 1258 events. 678/1258 cut-off events. For 5892/5906 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6447 event pairs, 177 based on Foata normal form. 15/1226 useless extension candidates. Maximal degree in co-relation 5308. Up to 1009 conditions per place. [2024-06-28 01:55:02,046 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 92 selfloop transitions, 25 changer transitions 0/122 dead transitions. [2024-06-28 01:55:02,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 122 transitions, 1140 flow [2024-06-28 01:55:02,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:55:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:55:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-28 01:55:02,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-28 01:55:02,048 INFO L175 Difference]: Start difference. First operand has 91 places, 91 transitions, 777 flow. Second operand 7 states and 117 transitions. [2024-06-28 01:55:02,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 122 transitions, 1140 flow [2024-06-28 01:55:02,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 122 transitions, 1093 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 01:55:02,059 INFO L231 Difference]: Finished difference. Result has 95 places, 95 transitions, 842 flow [2024-06-28 01:55:02,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=842, PETRI_PLACES=95, PETRI_TRANSITIONS=95} [2024-06-28 01:55:02,059 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 55 predicate places. [2024-06-28 01:55:02,059 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 95 transitions, 842 flow [2024-06-28 01:55:02,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:02,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:02,060 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:02,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 01:55:02,060 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:02,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:02,061 INFO L85 PathProgramCache]: Analyzing trace with hash 332890461, now seen corresponding path program 2 times [2024-06-28 01:55:02,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:02,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876175753] [2024-06-28 01:55:02,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:02,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:03,664 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:03,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:03,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876175753] [2024-06-28 01:55:03,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876175753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:03,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:03,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:03,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392417093] [2024-06-28 01:55:03,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:03,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:03,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:03,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:03,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:03,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:03,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 95 transitions, 842 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:03,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:03,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:03,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:04,758 INFO L124 PetriNetUnfolderBase]: 777/1418 cut-off events. [2024-06-28 01:55:04,758 INFO L125 PetriNetUnfolderBase]: For 7883/7897 co-relation queries the response was YES. [2024-06-28 01:55:04,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6358 conditions, 1418 events. 777/1418 cut-off events. For 7883/7897 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7373 event pairs, 144 based on Foata normal form. 16/1386 useless extension candidates. Maximal degree in co-relation 6311. Up to 975 conditions per place. [2024-06-28 01:55:04,766 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 113 selfloop transitions, 40 changer transitions 0/158 dead transitions. [2024-06-28 01:55:04,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 158 transitions, 1499 flow [2024-06-28 01:55:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:55:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:55:04,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-28 01:55:04,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845679012345679 [2024-06-28 01:55:04,768 INFO L175 Difference]: Start difference. First operand has 95 places, 95 transitions, 842 flow. Second operand 9 states and 157 transitions. [2024-06-28 01:55:04,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 158 transitions, 1499 flow [2024-06-28 01:55:04,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 158 transitions, 1426 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-28 01:55:04,787 INFO L231 Difference]: Finished difference. Result has 102 places, 110 transitions, 1027 flow [2024-06-28 01:55:04,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1027, PETRI_PLACES=102, PETRI_TRANSITIONS=110} [2024-06-28 01:55:04,788 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 62 predicate places. [2024-06-28 01:55:04,788 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 110 transitions, 1027 flow [2024-06-28 01:55:04,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:04,789 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:04,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 01:55:04,789 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:04,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:04,790 INFO L85 PathProgramCache]: Analyzing trace with hash -138099669, now seen corresponding path program 3 times [2024-06-28 01:55:04,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:04,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651490492] [2024-06-28 01:55:04,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:04,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:06,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:06,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:06,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651490492] [2024-06-28 01:55:06,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651490492] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:06,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:06,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:06,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960451612] [2024-06-28 01:55:06,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:06,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:06,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:06,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:06,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:06,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:06,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 110 transitions, 1027 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:06,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:06,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:06,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:07,061 INFO L124 PetriNetUnfolderBase]: 773/1430 cut-off events. [2024-06-28 01:55:07,062 INFO L125 PetriNetUnfolderBase]: For 9447/9461 co-relation queries the response was YES. [2024-06-28 01:55:07,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6922 conditions, 1430 events. 773/1430 cut-off events. For 9447/9461 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7548 event pairs, 177 based on Foata normal form. 16/1392 useless extension candidates. Maximal degree in co-relation 6872. Up to 1173 conditions per place. [2024-06-28 01:55:07,069 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 114 selfloop transitions, 18 changer transitions 0/137 dead transitions. [2024-06-28 01:55:07,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 137 transitions, 1389 flow [2024-06-28 01:55:07,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:55:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:55:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-28 01:55:07,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44841269841269843 [2024-06-28 01:55:07,072 INFO L175 Difference]: Start difference. First operand has 102 places, 110 transitions, 1027 flow. Second operand 7 states and 113 transitions. [2024-06-28 01:55:07,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 137 transitions, 1389 flow [2024-06-28 01:55:07,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 137 transitions, 1331 flow, removed 22 selfloop flow, removed 3 redundant places. [2024-06-28 01:55:07,092 INFO L231 Difference]: Finished difference. Result has 106 places, 110 transitions, 1011 flow [2024-06-28 01:55:07,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=969, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1011, PETRI_PLACES=106, PETRI_TRANSITIONS=110} [2024-06-28 01:55:07,093 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 66 predicate places. [2024-06-28 01:55:07,093 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 110 transitions, 1011 flow [2024-06-28 01:55:07,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:07,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:07,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 01:55:07,094 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:07,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:07,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1348005381, now seen corresponding path program 4 times [2024-06-28 01:55:07,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:07,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862366854] [2024-06-28 01:55:07,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:07,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:08,664 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:08,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:08,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862366854] [2024-06-28 01:55:08,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862366854] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:08,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:08,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 01:55:08,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309280512] [2024-06-28 01:55:08,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:08,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 01:55:08,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:08,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 01:55:08,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 01:55:08,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:08,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 110 transitions, 1011 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:08,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:08,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:09,373 INFO L124 PetriNetUnfolderBase]: 789/1455 cut-off events. [2024-06-28 01:55:09,374 INFO L125 PetriNetUnfolderBase]: For 9566/9580 co-relation queries the response was YES. [2024-06-28 01:55:09,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7020 conditions, 1455 events. 789/1455 cut-off events. For 9566/9580 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7675 event pairs, 169 based on Foata normal form. 17/1418 useless extension candidates. Maximal degree in co-relation 6968. Up to 1147 conditions per place. [2024-06-28 01:55:09,383 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 123 selfloop transitions, 26 changer transitions 0/154 dead transitions. [2024-06-28 01:55:09,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 154 transitions, 1555 flow [2024-06-28 01:55:09,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:55:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:55:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-28 01:55:09,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2024-06-28 01:55:09,385 INFO L175 Difference]: Start difference. First operand has 106 places, 110 transitions, 1011 flow. Second operand 8 states and 129 transitions. [2024-06-28 01:55:09,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 154 transitions, 1555 flow [2024-06-28 01:55:09,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 154 transitions, 1514 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-28 01:55:09,405 INFO L231 Difference]: Finished difference. Result has 110 places, 122 transitions, 1198 flow [2024-06-28 01:55:09,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1198, PETRI_PLACES=110, PETRI_TRANSITIONS=122} [2024-06-28 01:55:09,406 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 70 predicate places. [2024-06-28 01:55:09,406 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 122 transitions, 1198 flow [2024-06-28 01:55:09,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:09,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:09,406 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:09,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 01:55:09,406 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:09,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:09,407 INFO L85 PathProgramCache]: Analyzing trace with hash -104446653, now seen corresponding path program 1 times [2024-06-28 01:55:09,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:09,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5160625] [2024-06-28 01:55:09,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:09,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:11,184 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:11,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:11,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5160625] [2024-06-28 01:55:11,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5160625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:11,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:11,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:11,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359732824] [2024-06-28 01:55:11,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:11,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:11,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:11,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:11,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:11,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:11,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 122 transitions, 1198 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:11,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:11,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:12,044 INFO L124 PetriNetUnfolderBase]: 841/1547 cut-off events. [2024-06-28 01:55:12,045 INFO L125 PetriNetUnfolderBase]: For 12356/12370 co-relation queries the response was YES. [2024-06-28 01:55:12,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7861 conditions, 1547 events. 841/1547 cut-off events. For 12356/12370 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8357 event pairs, 111 based on Foata normal form. 16/1508 useless extension candidates. Maximal degree in co-relation 7806. Up to 1064 conditions per place. [2024-06-28 01:55:12,054 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 136 selfloop transitions, 36 changer transitions 0/177 dead transitions. [2024-06-28 01:55:12,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 177 transitions, 1894 flow [2024-06-28 01:55:12,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:55:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:55:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-28 01:55:12,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-28 01:55:12,069 INFO L175 Difference]: Start difference. First operand has 110 places, 122 transitions, 1198 flow. Second operand 8 states and 144 transitions. [2024-06-28 01:55:12,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 177 transitions, 1894 flow [2024-06-28 01:55:12,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 177 transitions, 1826 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-28 01:55:12,092 INFO L231 Difference]: Finished difference. Result has 117 places, 128 transitions, 1341 flow [2024-06-28 01:55:12,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1341, PETRI_PLACES=117, PETRI_TRANSITIONS=128} [2024-06-28 01:55:12,093 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 77 predicate places. [2024-06-28 01:55:12,093 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 128 transitions, 1341 flow [2024-06-28 01:55:12,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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:12,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:12,093 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:12,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 01:55:12,094 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:12,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:12,094 INFO L85 PathProgramCache]: Analyzing trace with hash -104386203, now seen corresponding path program 2 times [2024-06-28 01:55:12,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:12,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108306525] [2024-06-28 01:55:12,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:12,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:13,942 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,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:13,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108306525] [2024-06-28 01:55:13,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108306525] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:13,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:13,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:13,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104516579] [2024-06-28 01:55:13,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:13,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:13,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:13,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:13,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:13,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:13,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 128 transitions, 1341 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:13,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:13,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:14,699 INFO L124 PetriNetUnfolderBase]: 866/1596 cut-off events. [2024-06-28 01:55:14,700 INFO L125 PetriNetUnfolderBase]: For 14105/14119 co-relation queries the response was YES. [2024-06-28 01:55:14,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8398 conditions, 1596 events. 866/1596 cut-off events. For 14105/14119 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8697 event pairs, 160 based on Foata normal form. 16/1555 useless extension candidates. Maximal degree in co-relation 8339. Up to 1209 conditions per place. [2024-06-28 01:55:14,738 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 135 selfloop transitions, 38 changer transitions 0/178 dead transitions. [2024-06-28 01:55:14,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 178 transitions, 1961 flow [2024-06-28 01:55:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:55:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:55:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-28 01:55:14,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965277777777778 [2024-06-28 01:55:14,740 INFO L175 Difference]: Start difference. First operand has 117 places, 128 transitions, 1341 flow. Second operand 8 states and 143 transitions. [2024-06-28 01:55:14,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 178 transitions, 1961 flow [2024-06-28 01:55:14,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 178 transitions, 1904 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-06-28 01:55:14,804 INFO L231 Difference]: Finished difference. Result has 123 places, 131 transitions, 1415 flow [2024-06-28 01:55:14,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1415, PETRI_PLACES=123, PETRI_TRANSITIONS=131} [2024-06-28 01:55:14,804 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 83 predicate places. [2024-06-28 01:55:14,804 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 131 transitions, 1415 flow [2024-06-28 01:55:14,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:14,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:14,805 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:14,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 01:55:14,805 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:14,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:14,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1725082753, now seen corresponding path program 1 times [2024-06-28 01:55:14,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:14,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97398126] [2024-06-28 01:55:14,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:14,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:55:17,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:17,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97398126] [2024-06-28 01:55:17,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97398126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:17,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:17,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:17,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183802317] [2024-06-28 01:55:17,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:17,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:17,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:17,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:17,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:17,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:17,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 131 transitions, 1415 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:17,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:17,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:17,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:18,239 INFO L124 PetriNetUnfolderBase]: 933/1708 cut-off events. [2024-06-28 01:55:18,239 INFO L125 PetriNetUnfolderBase]: For 15247/15259 co-relation queries the response was YES. [2024-06-28 01:55:18,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9105 conditions, 1708 events. 933/1708 cut-off events. For 15247/15259 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9479 event pairs, 157 based on Foata normal form. 14/1662 useless extension candidates. Maximal degree in co-relation 9044. Up to 1296 conditions per place. [2024-06-28 01:55:18,250 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 147 selfloop transitions, 30 changer transitions 0/182 dead transitions. [2024-06-28 01:55:18,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 182 transitions, 2081 flow [2024-06-28 01:55:18,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:55:18,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:55:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-28 01:55:18,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2024-06-28 01:55:18,252 INFO L175 Difference]: Start difference. First operand has 123 places, 131 transitions, 1415 flow. Second operand 8 states and 145 transitions. [2024-06-28 01:55:18,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 182 transitions, 2081 flow [2024-06-28 01:55:18,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 182 transitions, 1978 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-28 01:55:18,278 INFO L231 Difference]: Finished difference. Result has 124 places, 135 transitions, 1441 flow [2024-06-28 01:55:18,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1441, PETRI_PLACES=124, PETRI_TRANSITIONS=135} [2024-06-28 01:55:18,278 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 84 predicate places. [2024-06-28 01:55:18,279 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 135 transitions, 1441 flow [2024-06-28 01:55:18,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:18,279 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:18,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 01:55:18,279 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:18,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:18,280 INFO L85 PathProgramCache]: Analyzing trace with hash -101584919, now seen corresponding path program 2 times [2024-06-28 01:55:18,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:18,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901572522] [2024-06-28 01:55:18,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:18,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:20,851 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,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:20,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901572522] [2024-06-28 01:55:20,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901572522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:20,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:20,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:20,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455871478] [2024-06-28 01:55:20,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:20,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:20,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:20,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:20,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:20,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:20,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 135 transitions, 1441 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:20,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:20,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:21,616 INFO L124 PetriNetUnfolderBase]: 969/1767 cut-off events. [2024-06-28 01:55:21,617 INFO L125 PetriNetUnfolderBase]: For 16429/16441 co-relation queries the response was YES. [2024-06-28 01:55:21,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9486 conditions, 1767 events. 969/1767 cut-off events. For 16429/16441 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9825 event pairs, 192 based on Foata normal form. 14/1720 useless extension candidates. Maximal degree in co-relation 9426. Up to 1457 conditions per place. [2024-06-28 01:55:21,640 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 153 selfloop transitions, 21 changer transitions 0/179 dead transitions. [2024-06-28 01:55:21,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 179 transitions, 2011 flow [2024-06-28 01:55:21,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:55:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:55:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-28 01:55:21,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-28 01:55:21,657 INFO L175 Difference]: Start difference. First operand has 124 places, 135 transitions, 1441 flow. Second operand 8 states and 136 transitions. [2024-06-28 01:55:21,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 179 transitions, 2011 flow [2024-06-28 01:55:21,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 179 transitions, 1964 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 01:55:21,687 INFO L231 Difference]: Finished difference. Result has 129 places, 140 transitions, 1519 flow [2024-06-28 01:55:21,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1519, PETRI_PLACES=129, PETRI_TRANSITIONS=140} [2024-06-28 01:55:21,688 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 89 predicate places. [2024-06-28 01:55:21,688 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 140 transitions, 1519 flow [2024-06-28 01:55:21,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:21,688 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:21,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 01:55:21,688 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:21,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:21,689 INFO L85 PathProgramCache]: Analyzing trace with hash -101589693, now seen corresponding path program 3 times [2024-06-28 01:55:21,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:21,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891675171] [2024-06-28 01:55:21,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:21,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:55:24,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:24,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891675171] [2024-06-28 01:55:24,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891675171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:24,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:24,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:24,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678122874] [2024-06-28 01:55:24,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:24,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:24,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:24,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:24,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:24,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:24,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 140 transitions, 1519 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:24,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:24,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:25,198 INFO L124 PetriNetUnfolderBase]: 973/1775 cut-off events. [2024-06-28 01:55:25,198 INFO L125 PetriNetUnfolderBase]: For 17146/17158 co-relation queries the response was YES. [2024-06-28 01:55:25,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9660 conditions, 1775 events. 973/1775 cut-off events. For 17146/17158 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9911 event pairs, 199 based on Foata normal form. 14/1728 useless extension candidates. Maximal degree in co-relation 9597. Up to 1479 conditions per place. [2024-06-28 01:55:25,210 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 155 selfloop transitions, 22 changer transitions 0/182 dead transitions. [2024-06-28 01:55:25,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 182 transitions, 2083 flow [2024-06-28 01:55:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:55:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:55:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-28 01:55:25,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2024-06-28 01:55:25,212 INFO L175 Difference]: Start difference. First operand has 129 places, 140 transitions, 1519 flow. Second operand 8 states and 134 transitions. [2024-06-28 01:55:25,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 182 transitions, 2083 flow [2024-06-28 01:55:25,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 182 transitions, 2018 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-28 01:55:25,245 INFO L231 Difference]: Finished difference. Result has 133 places, 143 transitions, 1561 flow [2024-06-28 01:55:25,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1561, PETRI_PLACES=133, PETRI_TRANSITIONS=143} [2024-06-28 01:55:25,246 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 93 predicate places. [2024-06-28 01:55:25,246 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 143 transitions, 1561 flow [2024-06-28 01:55:25,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:25,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:25,246 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:25,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 01:55:25,246 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:25,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:25,247 INFO L85 PathProgramCache]: Analyzing trace with hash -101589569, now seen corresponding path program 3 times [2024-06-28 01:55:25,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:25,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535849311] [2024-06-28 01:55:25,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:25,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:55:28,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:28,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535849311] [2024-06-28 01:55:28,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535849311] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:28,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:28,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:28,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819077790] [2024-06-28 01:55:28,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:28,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:28,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:28,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:28,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:28,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:28,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 143 transitions, 1561 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:28,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:28,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:28,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:29,281 INFO L124 PetriNetUnfolderBase]: 984/1788 cut-off events. [2024-06-28 01:55:29,281 INFO L125 PetriNetUnfolderBase]: For 17226/17238 co-relation queries the response was YES. [2024-06-28 01:55:29,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9707 conditions, 1788 events. 984/1788 cut-off events. For 17226/17238 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9977 event pairs, 188 based on Foata normal form. 14/1743 useless extension candidates. Maximal degree in co-relation 9642. Up to 1444 conditions per place. [2024-06-28 01:55:29,294 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 163 selfloop transitions, 27 changer transitions 0/195 dead transitions. [2024-06-28 01:55:29,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 195 transitions, 2216 flow [2024-06-28 01:55:29,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:55:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:55:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-28 01:55:29,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2024-06-28 01:55:29,296 INFO L175 Difference]: Start difference. First operand has 133 places, 143 transitions, 1561 flow. Second operand 9 states and 152 transitions. [2024-06-28 01:55:29,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 195 transitions, 2216 flow [2024-06-28 01:55:29,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 195 transitions, 2143 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-28 01:55:29,335 INFO L231 Difference]: Finished difference. Result has 139 places, 151 transitions, 1674 flow [2024-06-28 01:55:29,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1674, PETRI_PLACES=139, PETRI_TRANSITIONS=151} [2024-06-28 01:55:29,336 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 99 predicate places. [2024-06-28 01:55:29,336 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 151 transitions, 1674 flow [2024-06-28 01:55:29,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:29,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:29,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:29,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 01:55:29,337 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:29,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:29,337 INFO L85 PathProgramCache]: Analyzing trace with hash 13886175, now seen corresponding path program 1 times [2024-06-28 01:55:29,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:29,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922273276] [2024-06-28 01:55:29,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:29,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:31,338 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:31,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:31,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922273276] [2024-06-28 01:55:31,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922273276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:31,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:31,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:31,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149364137] [2024-06-28 01:55:31,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:31,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:31,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:31,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:31,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:31,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:31,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 151 transitions, 1674 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:31,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:31,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:32,182 INFO L124 PetriNetUnfolderBase]: 1006/1880 cut-off events. [2024-06-28 01:55:32,183 INFO L125 PetriNetUnfolderBase]: For 18703/18715 co-relation queries the response was YES. [2024-06-28 01:55:32,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10108 conditions, 1880 events. 1006/1880 cut-off events. For 18703/18715 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10822 event pairs, 192 based on Foata normal form. 14/1817 useless extension candidates. Maximal degree in co-relation 10040. Up to 1455 conditions per place. [2024-06-28 01:55:32,196 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 146 selfloop transitions, 30 changer transitions 0/181 dead transitions. [2024-06-28 01:55:32,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 181 transitions, 2170 flow [2024-06-28 01:55:32,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:55:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:55:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-28 01:55:32,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-28 01:55:32,198 INFO L175 Difference]: Start difference. First operand has 139 places, 151 transitions, 1674 flow. Second operand 7 states and 119 transitions. [2024-06-28 01:55:32,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 181 transitions, 2170 flow [2024-06-28 01:55:32,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 181 transitions, 2098 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-28 01:55:32,236 INFO L231 Difference]: Finished difference. Result has 141 places, 152 transitions, 1688 flow [2024-06-28 01:55:32,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1602, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1688, PETRI_PLACES=141, PETRI_TRANSITIONS=152} [2024-06-28 01:55:32,237 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 101 predicate places. [2024-06-28 01:55:32,237 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 152 transitions, 1688 flow [2024-06-28 01:55:32,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:32,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:32,238 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:32,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 01:55:32,238 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:32,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:32,238 INFO L85 PathProgramCache]: Analyzing trace with hash 13885927, now seen corresponding path program 1 times [2024-06-28 01:55:32,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:32,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131411839] [2024-06-28 01:55:32,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:32,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:34,303 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:34,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:34,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131411839] [2024-06-28 01:55:34,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131411839] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:34,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:34,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:34,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088927970] [2024-06-28 01:55:34,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:34,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:34,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:34,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:34,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:34,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:34,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 152 transitions, 1688 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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:34,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:34,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:34,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:35,409 INFO L124 PetriNetUnfolderBase]: 1069/1963 cut-off events. [2024-06-28 01:55:35,409 INFO L125 PetriNetUnfolderBase]: For 20343/20355 co-relation queries the response was YES. [2024-06-28 01:55:35,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10782 conditions, 1963 events. 1069/1963 cut-off events. For 20343/20355 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11167 event pairs, 206 based on Foata normal form. 13/1907 useless extension candidates. Maximal degree in co-relation 10712. Up to 1477 conditions per place. [2024-06-28 01:55:35,423 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 155 selfloop transitions, 45 changer transitions 0/205 dead transitions. [2024-06-28 01:55:35,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 205 transitions, 2490 flow [2024-06-28 01:55:35,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:55:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:55:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-28 01:55:35,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826388888888889 [2024-06-28 01:55:35,424 INFO L175 Difference]: Start difference. First operand has 141 places, 152 transitions, 1688 flow. Second operand 8 states and 139 transitions. [2024-06-28 01:55:35,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 205 transitions, 2490 flow [2024-06-28 01:55:35,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 205 transitions, 2411 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-28 01:55:35,464 INFO L231 Difference]: Finished difference. Result has 144 places, 164 transitions, 1900 flow [2024-06-28 01:55:35,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1611, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1900, PETRI_PLACES=144, PETRI_TRANSITIONS=164} [2024-06-28 01:55:35,464 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 104 predicate places. [2024-06-28 01:55:35,464 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 164 transitions, 1900 flow [2024-06-28 01:55:35,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:35,465 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:35,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 01:55:35,465 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:35,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:35,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1729671373, now seen corresponding path program 4 times [2024-06-28 01:55:35,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:35,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087860055] [2024-06-28 01:55:35,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:35,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:37,699 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:37,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:37,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087860055] [2024-06-28 01:55:37,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087860055] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:37,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:37,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:37,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480081648] [2024-06-28 01:55:37,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:37,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:37,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:37,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:37,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:37,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:37,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 164 transitions, 1900 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:37,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:37,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:38,976 INFO L124 PetriNetUnfolderBase]: 1142/2113 cut-off events. [2024-06-28 01:55:38,977 INFO L125 PetriNetUnfolderBase]: For 23312/23324 co-relation queries the response was YES. [2024-06-28 01:55:38,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11984 conditions, 2113 events. 1142/2113 cut-off events. For 23312/23324 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12392 event pairs, 198 based on Foata normal form. 14/2048 useless extension candidates. Maximal degree in co-relation 11913. Up to 1501 conditions per place. [2024-06-28 01:55:38,992 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 173 selfloop transitions, 76 changer transitions 0/254 dead transitions. [2024-06-28 01:55:38,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 254 transitions, 3242 flow [2024-06-28 01:55:38,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:55:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:55:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-06-28 01:55:38,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-06-28 01:55:38,993 INFO L175 Difference]: Start difference. First operand has 144 places, 164 transitions, 1900 flow. Second operand 10 states and 175 transitions. [2024-06-28 01:55:38,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 254 transitions, 3242 flow [2024-06-28 01:55:39,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 254 transitions, 3085 flow, removed 55 selfloop flow, removed 5 redundant places. [2024-06-28 01:55:39,043 INFO L231 Difference]: Finished difference. Result has 151 places, 204 transitions, 2601 flow [2024-06-28 01:55:39,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1811, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2601, PETRI_PLACES=151, PETRI_TRANSITIONS=204} [2024-06-28 01:55:39,043 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 111 predicate places. [2024-06-28 01:55:39,043 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 204 transitions, 2601 flow [2024-06-28 01:55:39,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:39,044 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,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 01:55:39,044 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:39,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:39,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1729666723, now seen corresponding path program 5 times [2024-06-28 01:55:39,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:39,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175402562] [2024-06-28 01:55:39,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:39,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:55:40,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:40,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175402562] [2024-06-28 01:55:40,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175402562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:40,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:40,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:40,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973047489] [2024-06-28 01:55:40,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:40,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:40,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:40,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:40,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:41,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:41,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 204 transitions, 2601 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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:41,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:41,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:41,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:42,128 INFO L124 PetriNetUnfolderBase]: 1252/2306 cut-off events. [2024-06-28 01:55:42,128 INFO L125 PetriNetUnfolderBase]: For 28419/28431 co-relation queries the response was YES. [2024-06-28 01:55:42,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14065 conditions, 2306 events. 1252/2306 cut-off events. For 28419/28431 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13758 event pairs, 200 based on Foata normal form. 14/2234 useless extension candidates. Maximal degree in co-relation 13991. Up to 1569 conditions per place. [2024-06-28 01:55:42,146 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 194 selfloop transitions, 107 changer transitions 0/306 dead transitions. [2024-06-28 01:55:42,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 306 transitions, 4388 flow [2024-06-28 01:55:42,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:55:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:55:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-28 01:55:42,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-06-28 01:55:42,147 INFO L175 Difference]: Start difference. First operand has 151 places, 204 transitions, 2601 flow. Second operand 10 states and 174 transitions. [2024-06-28 01:55:42,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 306 transitions, 4388 flow [2024-06-28 01:55:42,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 306 transitions, 3984 flow, removed 179 selfloop flow, removed 4 redundant places. [2024-06-28 01:55:42,224 INFO L231 Difference]: Finished difference. Result has 160 places, 254 transitions, 3459 flow [2024-06-28 01:55:42,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2390, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3459, PETRI_PLACES=160, PETRI_TRANSITIONS=254} [2024-06-28 01:55:42,226 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 120 predicate places. [2024-06-28 01:55:42,226 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 254 transitions, 3459 flow [2024-06-28 01:55:42,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:42,226 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:42,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 01:55:42,227 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:42,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:42,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1729666599, now seen corresponding path program 4 times [2024-06-28 01:55:42,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:42,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549164113] [2024-06-28 01:55:42,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:42,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:44,219 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:44,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:44,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549164113] [2024-06-28 01:55:44,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549164113] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:44,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:44,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:44,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791148859] [2024-06-28 01:55:44,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:44,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:44,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:44,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:44,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:44,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:44,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 254 transitions, 3459 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:44,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:44,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:44,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:45,250 INFO L124 PetriNetUnfolderBase]: 1263/2311 cut-off events. [2024-06-28 01:55:45,250 INFO L125 PetriNetUnfolderBase]: For 28887/28901 co-relation queries the response was YES. [2024-06-28 01:55:45,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14769 conditions, 2311 events. 1263/2311 cut-off events. For 28887/28901 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13691 event pairs, 224 based on Foata normal form. 16/2245 useless extension candidates. Maximal degree in co-relation 14690. Up to 1927 conditions per place. [2024-06-28 01:55:45,268 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 254 selfloop transitions, 55 changer transitions 0/314 dead transitions. [2024-06-28 01:55:45,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 314 transitions, 4502 flow [2024-06-28 01:55:45,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:55:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:55:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-28 01:55:45,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-28 01:55:45,277 INFO L175 Difference]: Start difference. First operand has 160 places, 254 transitions, 3459 flow. Second operand 9 states and 150 transitions. [2024-06-28 01:55:45,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 314 transitions, 4502 flow [2024-06-28 01:55:45,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 314 transitions, 4362 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-06-28 01:55:45,354 INFO L231 Difference]: Finished difference. Result has 168 places, 276 transitions, 3831 flow [2024-06-28 01:55:45,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3329, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3831, PETRI_PLACES=168, PETRI_TRANSITIONS=276} [2024-06-28 01:55:45,355 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 128 predicate places. [2024-06-28 01:55:45,355 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 276 transitions, 3831 flow [2024-06-28 01:55:45,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:45,355 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:45,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 01:55:45,356 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:45,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1729844353, now seen corresponding path program 6 times [2024-06-28 01:55:45,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:45,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273854359] [2024-06-28 01:55:45,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:45,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:55:47,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:47,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273854359] [2024-06-28 01:55:47,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273854359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:47,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:47,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:47,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76041579] [2024-06-28 01:55:47,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:47,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:47,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:47,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:47,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:47,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:47,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 276 transitions, 3831 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:47,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:47,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:47,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:48,422 INFO L124 PetriNetUnfolderBase]: 1267/2314 cut-off events. [2024-06-28 01:55:48,422 INFO L125 PetriNetUnfolderBase]: For 28910/28924 co-relation queries the response was YES. [2024-06-28 01:55:48,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14931 conditions, 2314 events. 1267/2314 cut-off events. For 28910/28924 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13666 event pairs, 217 based on Foata normal form. 16/2249 useless extension candidates. Maximal degree in co-relation 14847. Up to 1907 conditions per place. [2024-06-28 01:55:48,437 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 267 selfloop transitions, 50 changer transitions 0/322 dead transitions. [2024-06-28 01:55:48,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 322 transitions, 4803 flow [2024-06-28 01:55:48,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:55:48,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:55:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 156 transitions. [2024-06-28 01:55:48,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-28 01:55:48,439 INFO L175 Difference]: Start difference. First operand has 168 places, 276 transitions, 3831 flow. Second operand 10 states and 156 transitions. [2024-06-28 01:55:48,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 322 transitions, 4803 flow [2024-06-28 01:55:48,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 322 transitions, 4692 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-28 01:55:48,518 INFO L231 Difference]: Finished difference. Result has 177 places, 288 transitions, 4091 flow [2024-06-28 01:55:48,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3723, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4091, PETRI_PLACES=177, PETRI_TRANSITIONS=288} [2024-06-28 01:55:48,518 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 137 predicate places. [2024-06-28 01:55:48,519 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 288 transitions, 4091 flow [2024-06-28 01:55:48,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:48,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:48,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 01:55:48,519 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:48,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:48,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2093132993, now seen corresponding path program 2 times [2024-06-28 01:55:48,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:48,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053639734] [2024-06-28 01:55:48,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:48,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:50,420 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:50,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:50,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053639734] [2024-06-28 01:55:50,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053639734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:50,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:50,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:50,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12702046] [2024-06-28 01:55:50,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:50,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:50,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:50,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:50,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:50,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:50,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 288 transitions, 4091 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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:50,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:50,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:50,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:51,594 INFO L124 PetriNetUnfolderBase]: 1289/2376 cut-off events. [2024-06-28 01:55:51,594 INFO L125 PetriNetUnfolderBase]: For 31708/31722 co-relation queries the response was YES. [2024-06-28 01:55:51,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15410 conditions, 2376 events. 1289/2376 cut-off events. For 31708/31722 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14234 event pairs, 216 based on Foata normal form. 16/2303 useless extension candidates. Maximal degree in co-relation 15322. Up to 1892 conditions per place. [2024-06-28 01:55:51,615 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 274 selfloop transitions, 44 changer transitions 0/323 dead transitions. [2024-06-28 01:55:51,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 323 transitions, 4906 flow [2024-06-28 01:55:51,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:55:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:55:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-28 01:55:51,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-28 01:55:51,617 INFO L175 Difference]: Start difference. First operand has 177 places, 288 transitions, 4091 flow. Second operand 8 states and 136 transitions. [2024-06-28 01:55:51,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 323 transitions, 4906 flow [2024-06-28 01:55:51,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 323 transitions, 4771 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-28 01:55:51,715 INFO L231 Difference]: Finished difference. Result has 180 places, 289 transitions, 4072 flow [2024-06-28 01:55:51,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3956, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4072, PETRI_PLACES=180, PETRI_TRANSITIONS=289} [2024-06-28 01:55:51,716 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 140 predicate places. [2024-06-28 01:55:51,717 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 289 transitions, 4072 flow [2024-06-28 01:55:51,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:51,717 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:51,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 01:55:51,717 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:51,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:51,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1868500001, now seen corresponding path program 3 times [2024-06-28 01:55:51,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:51,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133761531] [2024-06-28 01:55:51,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:51,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:55:54,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:54,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133761531] [2024-06-28 01:55:54,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133761531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:54,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:54,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:54,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169821954] [2024-06-28 01:55:54,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:54,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:54,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:54,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:54,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:54,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:54,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 289 transitions, 4072 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:55:54,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:54,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:54,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:55,274 INFO L124 PetriNetUnfolderBase]: 1286/2365 cut-off events. [2024-06-28 01:55:55,274 INFO L125 PetriNetUnfolderBase]: For 32198/32212 co-relation queries the response was YES. [2024-06-28 01:55:55,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15326 conditions, 2365 events. 1286/2365 cut-off events. For 32198/32212 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14075 event pairs, 177 based on Foata normal form. 16/2294 useless extension candidates. Maximal degree in co-relation 15237. Up to 1787 conditions per place. [2024-06-28 01:55:55,292 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 278 selfloop transitions, 43 changer transitions 0/326 dead transitions. [2024-06-28 01:55:55,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 326 transitions, 4908 flow [2024-06-28 01:55:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:55:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:55:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-28 01:55:55,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44135802469135804 [2024-06-28 01:55:55,293 INFO L175 Difference]: Start difference. First operand has 180 places, 289 transitions, 4072 flow. Second operand 9 states and 143 transitions. [2024-06-28 01:55:55,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 326 transitions, 4908 flow [2024-06-28 01:55:55,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 326 transitions, 4815 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-28 01:55:55,388 INFO L231 Difference]: Finished difference. Result has 183 places, 289 transitions, 4069 flow [2024-06-28 01:55:55,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3979, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4069, PETRI_PLACES=183, PETRI_TRANSITIONS=289} [2024-06-28 01:55:55,389 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 143 predicate places. [2024-06-28 01:55:55,389 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 289 transitions, 4069 flow [2024-06-28 01:55:55,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:55,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:55,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 01:55:55,390 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:55,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:55,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1858969857, now seen corresponding path program 7 times [2024-06-28 01:55:55,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:55,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579931784] [2024-06-28 01:55:55,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:55,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:57,560 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:57,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:57,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579931784] [2024-06-28 01:55:57,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579931784] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:57,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:57,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 01:55:57,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546417745] [2024-06-28 01:55:57,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:57,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:55:57,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:57,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:55:57,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:55:57,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:55:57,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 289 transitions, 4069 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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:57,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:57,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:55:57,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:58,663 INFO L124 PetriNetUnfolderBase]: 1297/2380 cut-off events. [2024-06-28 01:55:58,664 INFO L125 PetriNetUnfolderBase]: For 32507/32521 co-relation queries the response was YES. [2024-06-28 01:55:58,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15482 conditions, 2380 events. 1297/2380 cut-off events. For 32507/32521 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14189 event pairs, 214 based on Foata normal form. 16/2310 useless extension candidates. Maximal degree in co-relation 15392. Up to 1846 conditions per place. [2024-06-28 01:55:58,685 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 280 selfloop transitions, 56 changer transitions 0/341 dead transitions. [2024-06-28 01:55:58,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 341 transitions, 5151 flow [2024-06-28 01:55:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:55:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:55:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-28 01:55:58,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2024-06-28 01:55:58,687 INFO L175 Difference]: Start difference. First operand has 183 places, 289 transitions, 4069 flow. Second operand 9 states and 154 transitions. [2024-06-28 01:55:58,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 341 transitions, 5151 flow [2024-06-28 01:55:58,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 341 transitions, 5041 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-28 01:55:58,776 INFO L231 Difference]: Finished difference. Result has 185 places, 299 transitions, 4310 flow [2024-06-28 01:55:58,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3959, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4310, PETRI_PLACES=185, PETRI_TRANSITIONS=299} [2024-06-28 01:55:58,776 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 145 predicate places. [2024-06-28 01:55:58,777 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 299 transitions, 4310 flow [2024-06-28 01:55:58,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:58,777 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:58,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 01:55:58,777 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:58,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:58,778 INFO L85 PathProgramCache]: Analyzing trace with hash -36055977, now seen corresponding path program 1 times [2024-06-28 01:55:58,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:58,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210811495] [2024-06-28 01:55:58,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:58,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:55:58,839 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,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:55:58,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210811495] [2024-06-28 01:55:58,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210811495] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:55:58,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:55:58,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:55:58,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420426054] [2024-06-28 01:55:58,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:55:58,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:55:58,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:55:58,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:55:58,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:55:58,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-28 01:55:58,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 299 transitions, 4310 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:55:58,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-28 01:55:58,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:55:59,125 INFO L124 PetriNetUnfolderBase]: 626/1216 cut-off events. [2024-06-28 01:55:59,125 INFO L125 PetriNetUnfolderBase]: For 24351/24414 co-relation queries the response was YES. [2024-06-28 01:55:59,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7908 conditions, 1216 events. 626/1216 cut-off events. For 24351/24414 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6701 event pairs, 142 based on Foata normal form. 117/1285 useless extension candidates. Maximal degree in co-relation 7831. Up to 443 conditions per place. [2024-06-28 01:55:59,134 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 83 selfloop transitions, 29 changer transitions 0/135 dead transitions. [2024-06-28 01:55:59,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 135 transitions, 2046 flow [2024-06-28 01:55:59,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:55:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:55:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2024-06-28 01:55:59,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2024-06-28 01:55:59,136 INFO L175 Difference]: Start difference. First operand has 185 places, 299 transitions, 4310 flow. Second operand 4 states and 85 transitions. [2024-06-28 01:55:59,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 135 transitions, 2046 flow [2024-06-28 01:55:59,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 135 transitions, 1605 flow, removed 59 selfloop flow, removed 53 redundant places. [2024-06-28 01:55:59,183 INFO L231 Difference]: Finished difference. Result has 136 places, 114 transitions, 1271 flow [2024-06-28 01:55:59,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1271, PETRI_PLACES=136, PETRI_TRANSITIONS=114} [2024-06-28 01:55:59,183 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 96 predicate places. [2024-06-28 01:55:59,184 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 114 transitions, 1271 flow [2024-06-28 01:55:59,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:55:59,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:55:59,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 01:55:59,184 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:55:59,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:55:59,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1634318442, now seen corresponding path program 1 times [2024-06-28 01:55:59,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:55:59,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545709001] [2024-06-28 01:55:59,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:55:59,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:55:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:01,262 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:01,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:01,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545709001] [2024-06-28 01:56:01,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545709001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:01,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:01,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:01,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20440262] [2024-06-28 01:56:01,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:01,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:01,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:01,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:01,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:01,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:56:01,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 114 transitions, 1271 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:01,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:01,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:56:01,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:02,356 INFO L124 PetriNetUnfolderBase]: 922/1767 cut-off events. [2024-06-28 01:56:02,357 INFO L125 PetriNetUnfolderBase]: For 28950/28952 co-relation queries the response was YES. [2024-06-28 01:56:02,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9863 conditions, 1767 events. 922/1767 cut-off events. For 28950/28952 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10087 event pairs, 282 based on Foata normal form. 10/1732 useless extension candidates. Maximal degree in co-relation 9807. Up to 812 conditions per place. [2024-06-28 01:56:02,369 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 122 selfloop transitions, 38 changer transitions 5/170 dead transitions. [2024-06-28 01:56:02,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 170 transitions, 1996 flow [2024-06-28 01:56:02,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:56:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:56:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-28 01:56:02,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-06-28 01:56:02,370 INFO L175 Difference]: Start difference. First operand has 136 places, 114 transitions, 1271 flow. Second operand 10 states and 172 transitions. [2024-06-28 01:56:02,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 170 transitions, 1996 flow [2024-06-28 01:56:02,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 170 transitions, 1960 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 01:56:02,417 INFO L231 Difference]: Finished difference. Result has 143 places, 113 transitions, 1313 flow [2024-06-28 01:56:02,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1313, PETRI_PLACES=143, PETRI_TRANSITIONS=113} [2024-06-28 01:56:02,418 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 103 predicate places. [2024-06-28 01:56:02,418 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 113 transitions, 1313 flow [2024-06-28 01:56:02,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:02,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:02,418 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:02,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 01:56:02,419 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:56:02,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:02,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1058996832, now seen corresponding path program 2 times [2024-06-28 01:56:02,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:02,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174285540] [2024-06-28 01:56:02,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:02,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:56:04,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:04,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174285540] [2024-06-28 01:56:04,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174285540] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:04,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:04,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:04,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130041383] [2024-06-28 01:56:04,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:04,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:04,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:04,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:04,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:04,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:56:04,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 113 transitions, 1313 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:04,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:04,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:56:04,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:05,437 INFO L124 PetriNetUnfolderBase]: 997/1953 cut-off events. [2024-06-28 01:56:05,438 INFO L125 PetriNetUnfolderBase]: For 37495/37497 co-relation queries the response was YES. [2024-06-28 01:56:05,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10903 conditions, 1953 events. 997/1953 cut-off events. For 37495/37497 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 11634 event pairs, 381 based on Foata normal form. 10/1900 useless extension candidates. Maximal degree in co-relation 10846. Up to 1319 conditions per place. [2024-06-28 01:56:05,451 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 138 selfloop transitions, 14 changer transitions 0/157 dead transitions. [2024-06-28 01:56:05,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 157 transitions, 1943 flow [2024-06-28 01:56:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:56:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:56:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-28 01:56:05,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44753086419753085 [2024-06-28 01:56:05,455 INFO L175 Difference]: Start difference. First operand has 143 places, 113 transitions, 1313 flow. Second operand 9 states and 145 transitions. [2024-06-28 01:56:05,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 157 transitions, 1943 flow [2024-06-28 01:56:05,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 157 transitions, 1814 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-28 01:56:05,499 INFO L231 Difference]: Finished difference. Result has 143 places, 113 transitions, 1225 flow [2024-06-28 01:56:05,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1225, PETRI_PLACES=143, PETRI_TRANSITIONS=113} [2024-06-28 01:56:05,500 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 103 predicate places. [2024-06-28 01:56:05,500 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 113 transitions, 1225 flow [2024-06-28 01:56:05,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:05,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:05,500 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:05,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 01:56:05,501 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:56:05,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1059000552, now seen corresponding path program 3 times [2024-06-28 01:56:05,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:05,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129655285] [2024-06-28 01:56:05,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:05,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:07,737 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:07,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:07,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129655285] [2024-06-28 01:56:07,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129655285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:07,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:07,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:07,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712359286] [2024-06-28 01:56:07,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:07,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:07,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:07,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:07,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:07,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:56:07,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 113 transitions, 1225 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:07,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:07,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:56:07,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:08,780 INFO L124 PetriNetUnfolderBase]: 882/1735 cut-off events. [2024-06-28 01:56:08,780 INFO L125 PetriNetUnfolderBase]: For 28068/28070 co-relation queries the response was YES. [2024-06-28 01:56:08,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8862 conditions, 1735 events. 882/1735 cut-off events. For 28068/28070 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 9955 event pairs, 388 based on Foata normal form. 12/1686 useless extension candidates. Maximal degree in co-relation 8806. Up to 1218 conditions per place. [2024-06-28 01:56:08,791 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 115 selfloop transitions, 32 changer transitions 0/152 dead transitions. [2024-06-28 01:56:08,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 152 transitions, 1722 flow [2024-06-28 01:56:08,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:56:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:56:08,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 154 transitions. [2024-06-28 01:56:08,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2024-06-28 01:56:08,793 INFO L175 Difference]: Start difference. First operand has 143 places, 113 transitions, 1225 flow. Second operand 10 states and 154 transitions. [2024-06-28 01:56:08,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 152 transitions, 1722 flow [2024-06-28 01:56:08,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 152 transitions, 1679 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 01:56:08,830 INFO L231 Difference]: Finished difference. Result has 147 places, 115 transitions, 1285 flow [2024-06-28 01:56:08,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1285, PETRI_PLACES=147, PETRI_TRANSITIONS=115} [2024-06-28 01:56:08,831 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 107 predicate places. [2024-06-28 01:56:08,831 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 115 transitions, 1285 flow [2024-06-28 01:56:08,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:08,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:08,832 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:08,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 01:56:08,832 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:56:08,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:08,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1145842464, now seen corresponding path program 1 times [2024-06-28 01:56:08,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:08,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324396166] [2024-06-28 01:56:08,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:08,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:12,347 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,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:12,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324396166] [2024-06-28 01:56:12,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324396166] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:12,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:12,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:12,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340192854] [2024-06-28 01:56:12,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:12,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:12,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:12,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:12,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:12,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:56:12,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 115 transitions, 1285 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:12,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:12,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:56:12,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:13,046 INFO L124 PetriNetUnfolderBase]: 904/1779 cut-off events. [2024-06-28 01:56:13,046 INFO L125 PetriNetUnfolderBase]: For 25652/25654 co-relation queries the response was YES. [2024-06-28 01:56:13,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9201 conditions, 1779 events. 904/1779 cut-off events. For 25652/25654 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 10292 event pairs, 399 based on Foata normal form. 4/1720 useless extension candidates. Maximal degree in co-relation 9143. Up to 1516 conditions per place. [2024-06-28 01:56:13,059 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 122 selfloop transitions, 13 changer transitions 0/140 dead transitions. [2024-06-28 01:56:13,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 140 transitions, 1666 flow [2024-06-28 01:56:13,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:56:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:56:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2024-06-28 01:56:13,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-28 01:56:13,060 INFO L175 Difference]: Start difference. First operand has 147 places, 115 transitions, 1285 flow. Second operand 8 states and 117 transitions. [2024-06-28 01:56:13,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 140 transitions, 1666 flow [2024-06-28 01:56:13,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 140 transitions, 1612 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 01:56:13,104 INFO L231 Difference]: Finished difference. Result has 147 places, 116 transitions, 1279 flow [2024-06-28 01:56:13,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1279, PETRI_PLACES=147, PETRI_TRANSITIONS=116} [2024-06-28 01:56:13,105 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 107 predicate places. [2024-06-28 01:56:13,105 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 116 transitions, 1279 flow [2024-06-28 01:56:13,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:13,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:13,105 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,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 01:56:13,105 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:56:13,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:13,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1145836512, now seen corresponding path program 4 times [2024-06-28 01:56:13,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:13,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208142529] [2024-06-28 01:56:13,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:13,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:15,691 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,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:15,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208142529] [2024-06-28 01:56:15,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208142529] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:15,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:15,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:15,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969508662] [2024-06-28 01:56:15,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:15,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:15,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:15,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:15,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:15,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:56:15,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 116 transitions, 1279 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:15,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:15,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:56:15,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:16,425 INFO L124 PetriNetUnfolderBase]: 998/1983 cut-off events. [2024-06-28 01:56:16,426 INFO L125 PetriNetUnfolderBase]: For 32873/32875 co-relation queries the response was YES. [2024-06-28 01:56:16,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10165 conditions, 1983 events. 998/1983 cut-off events. For 32873/32875 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 11943 event pairs, 466 based on Foata normal form. 12/1922 useless extension candidates. Maximal degree in co-relation 10106. Up to 1519 conditions per place. [2024-06-28 01:56:16,439 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 128 selfloop transitions, 14 changer transitions 0/147 dead transitions. [2024-06-28 01:56:16,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 147 transitions, 1734 flow [2024-06-28 01:56:16,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:56:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:56:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2024-06-28 01:56:16,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-28 01:56:16,440 INFO L175 Difference]: Start difference. First operand has 147 places, 116 transitions, 1279 flow. Second operand 9 states and 132 transitions. [2024-06-28 01:56:16,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 147 transitions, 1734 flow [2024-06-28 01:56:16,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 147 transitions, 1702 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-28 01:56:16,489 INFO L231 Difference]: Finished difference. Result has 150 places, 116 transitions, 1279 flow [2024-06-28 01:56:16,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1279, PETRI_PLACES=150, PETRI_TRANSITIONS=116} [2024-06-28 01:56:16,498 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 110 predicate places. [2024-06-28 01:56:16,498 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 116 transitions, 1279 flow [2024-06-28 01:56:16,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:16,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:16,499 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,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 01:56:16,499 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:56:16,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:16,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1145692362, now seen corresponding path program 5 times [2024-06-28 01:56:16,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:16,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293823344] [2024-06-28 01:56:16,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:16,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:19,335 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:19,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:19,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293823344] [2024-06-28 01:56:19,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293823344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:19,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:19,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748509848] [2024-06-28 01:56:19,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:19,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:19,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:19,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:19,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:19,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:56:19,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 116 transitions, 1279 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:19,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:19,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:56:19,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:20,160 INFO L124 PetriNetUnfolderBase]: 1092/2187 cut-off events. [2024-06-28 01:56:20,161 INFO L125 PetriNetUnfolderBase]: For 35846/35848 co-relation queries the response was YES. [2024-06-28 01:56:20,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11062 conditions, 2187 events. 1092/2187 cut-off events. For 35846/35848 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 13653 event pairs, 540 based on Foata normal form. 12/2116 useless extension candidates. Maximal degree in co-relation 11002. Up to 1678 conditions per place. [2024-06-28 01:56:20,176 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 126 selfloop transitions, 17 changer transitions 0/148 dead transitions. [2024-06-28 01:56:20,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 148 transitions, 1748 flow [2024-06-28 01:56:20,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:56:20,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:56:20,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2024-06-28 01:56:20,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-28 01:56:20,178 INFO L175 Difference]: Start difference. First operand has 150 places, 116 transitions, 1279 flow. Second operand 9 states and 135 transitions. [2024-06-28 01:56:20,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 148 transitions, 1748 flow [2024-06-28 01:56:20,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 148 transitions, 1722 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 01:56:20,234 INFO L231 Difference]: Finished difference. Result has 152 places, 116 transitions, 1291 flow [2024-06-28 01:56:20,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1291, PETRI_PLACES=152, PETRI_TRANSITIONS=116} [2024-06-28 01:56:20,235 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 112 predicate places. [2024-06-28 01:56:20,235 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 116 transitions, 1291 flow [2024-06-28 01:56:20,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:20,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:20,235 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:20,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 01:56:20,236 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:56:20,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:20,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1145688642, now seen corresponding path program 6 times [2024-06-28 01:56:20,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:20,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523490567] [2024-06-28 01:56:20,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:20,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:56:23,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:23,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523490567] [2024-06-28 01:56:23,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523490567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:23,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:23,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:23,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265245744] [2024-06-28 01:56:23,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:23,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:23,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:23,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:23,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:23,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:56:23,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 116 transitions, 1291 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:23,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:23,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:56:23,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:24,349 INFO L124 PetriNetUnfolderBase]: 1164/2323 cut-off events. [2024-06-28 01:56:24,349 INFO L125 PetriNetUnfolderBase]: For 37481/37483 co-relation queries the response was YES. [2024-06-28 01:56:24,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11768 conditions, 2323 events. 1164/2323 cut-off events. For 37481/37483 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 14717 event pairs, 499 based on Foata normal form. 10/2250 useless extension candidates. Maximal degree in co-relation 11707. Up to 1454 conditions per place. [2024-06-28 01:56:24,365 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 134 selfloop transitions, 17 changer transitions 0/156 dead transitions. [2024-06-28 01:56:24,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 156 transitions, 1847 flow [2024-06-28 01:56:24,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:56:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:56:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-28 01:56:24,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4382716049382716 [2024-06-28 01:56:24,367 INFO L175 Difference]: Start difference. First operand has 152 places, 116 transitions, 1291 flow. Second operand 9 states and 142 transitions. [2024-06-28 01:56:24,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 156 transitions, 1847 flow [2024-06-28 01:56:24,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 156 transitions, 1805 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-28 01:56:24,440 INFO L231 Difference]: Finished difference. Result has 153 places, 116 transitions, 1286 flow [2024-06-28 01:56:24,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1249, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1286, PETRI_PLACES=153, PETRI_TRANSITIONS=116} [2024-06-28 01:56:24,440 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 113 predicate places. [2024-06-28 01:56:24,440 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 116 transitions, 1286 flow [2024-06-28 01:56:24,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:24,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:24,441 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:24,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 01:56:24,441 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:56:24,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:24,442 INFO L85 PathProgramCache]: Analyzing trace with hash 430465628, now seen corresponding path program 2 times [2024-06-28 01:56:24,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:24,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895691065] [2024-06-28 01:56:24,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:24,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:26,729 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:26,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:26,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895691065] [2024-06-28 01:56:26,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895691065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:26,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:26,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:26,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889870277] [2024-06-28 01:56:26,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:26,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:26,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:26,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:26,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:26,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:56:26,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 116 transitions, 1286 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:26,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:26,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:56:26,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:27,696 INFO L124 PetriNetUnfolderBase]: 1165/2356 cut-off events. [2024-06-28 01:56:27,696 INFO L125 PetriNetUnfolderBase]: For 34044/34046 co-relation queries the response was YES. [2024-06-28 01:56:27,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11716 conditions, 2356 events. 1165/2356 cut-off events. For 34044/34046 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 15158 event pairs, 607 based on Foata normal form. 6/2269 useless extension candidates. Maximal degree in co-relation 11655. Up to 1965 conditions per place. [2024-06-28 01:56:27,713 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 107 selfloop transitions, 23 changer transitions 0/135 dead transitions. [2024-06-28 01:56:27,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 135 transitions, 1625 flow [2024-06-28 01:56:27,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:56:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:56:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-28 01:56:27,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-28 01:56:27,714 INFO L175 Difference]: Start difference. First operand has 153 places, 116 transitions, 1286 flow. Second operand 8 states and 116 transitions. [2024-06-28 01:56:27,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 135 transitions, 1625 flow [2024-06-28 01:56:27,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 135 transitions, 1582 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-28 01:56:27,775 INFO L231 Difference]: Finished difference. Result has 154 places, 117 transitions, 1316 flow [2024-06-28 01:56:27,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1316, PETRI_PLACES=154, PETRI_TRANSITIONS=117} [2024-06-28 01:56:27,776 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 114 predicate places. [2024-06-28 01:56:27,776 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 117 transitions, 1316 flow [2024-06-28 01:56:27,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:27,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:27,776 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:27,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 01:56:27,777 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:56:27,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:27,777 INFO L85 PathProgramCache]: Analyzing trace with hash 430473068, now seen corresponding path program 3 times [2024-06-28 01:56:27,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:27,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637327274] [2024-06-28 01:56:27,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:27,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:29,740 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:29,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:29,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637327274] [2024-06-28 01:56:29,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637327274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:29,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:29,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:29,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631677548] [2024-06-28 01:56:29,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:29,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:29,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:29,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:29,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:29,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:56:29,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 117 transitions, 1316 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:29,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:29,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:56:29,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:30,615 INFO L124 PetriNetUnfolderBase]: 1187/2394 cut-off events. [2024-06-28 01:56:30,616 INFO L125 PetriNetUnfolderBase]: For 33624/33626 co-relation queries the response was YES. [2024-06-28 01:56:30,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12036 conditions, 2394 events. 1187/2394 cut-off events. For 33624/33626 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 15374 event pairs, 578 based on Foata normal form. 4/2305 useless extension candidates. Maximal degree in co-relation 11974. Up to 1997 conditions per place. [2024-06-28 01:56:30,635 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 119 selfloop transitions, 20 changer transitions 0/144 dead transitions. [2024-06-28 01:56:30,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 144 transitions, 1748 flow [2024-06-28 01:56:30,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:56:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:56:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2024-06-28 01:56:30,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131944444444444 [2024-06-28 01:56:30,637 INFO L175 Difference]: Start difference. First operand has 154 places, 117 transitions, 1316 flow. Second operand 8 states and 119 transitions. [2024-06-28 01:56:30,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 144 transitions, 1748 flow [2024-06-28 01:56:30,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 144 transitions, 1699 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-28 01:56:30,712 INFO L231 Difference]: Finished difference. Result has 157 places, 122 transitions, 1402 flow [2024-06-28 01:56:30,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1402, PETRI_PLACES=157, PETRI_TRANSITIONS=122} [2024-06-28 01:56:30,712 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 117 predicate places. [2024-06-28 01:56:30,712 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 122 transitions, 1402 flow [2024-06-28 01:56:30,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:30,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:30,713 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:30,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 01:56:30,713 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:56:30,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:30,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2085569096, now seen corresponding path program 7 times [2024-06-28 01:56:30,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:30,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506186601] [2024-06-28 01:56:30,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:30,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:32,906 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:32,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:32,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506186601] [2024-06-28 01:56:32,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506186601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:32,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:32,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:32,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311893582] [2024-06-28 01:56:32,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:32,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:32,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:32,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:32,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:32,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:56:32,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 122 transitions, 1402 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:32,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:32,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:56:32,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:34,116 INFO L124 PetriNetUnfolderBase]: 1265/2532 cut-off events. [2024-06-28 01:56:34,116 INFO L125 PetriNetUnfolderBase]: For 42524/42526 co-relation queries the response was YES. [2024-06-28 01:56:34,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12953 conditions, 2532 events. 1265/2532 cut-off events. For 42524/42526 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 16422 event pairs, 641 based on Foata normal form. 12/2451 useless extension candidates. Maximal degree in co-relation 12889. Up to 1876 conditions per place. [2024-06-28 01:56:34,134 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 106 selfloop transitions, 47 changer transitions 0/158 dead transitions. [2024-06-28 01:56:34,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 158 transitions, 1958 flow [2024-06-28 01:56:34,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:56:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:56:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 156 transitions. [2024-06-28 01:56:34,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-28 01:56:34,136 INFO L175 Difference]: Start difference. First operand has 157 places, 122 transitions, 1402 flow. Second operand 10 states and 156 transitions. [2024-06-28 01:56:34,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 158 transitions, 1958 flow [2024-06-28 01:56:34,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 158 transitions, 1898 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-28 01:56:34,199 INFO L231 Difference]: Finished difference. Result has 162 places, 123 transitions, 1469 flow [2024-06-28 01:56:34,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1469, PETRI_PLACES=162, PETRI_TRANSITIONS=123} [2024-06-28 01:56:34,200 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 122 predicate places. [2024-06-28 01:56:34,200 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 123 transitions, 1469 flow [2024-06-28 01:56:34,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:34,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:34,200 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:34,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 01:56:34,200 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:56:34,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:34,201 INFO L85 PathProgramCache]: Analyzing trace with hash 424747616, now seen corresponding path program 8 times [2024-06-28 01:56:34,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:34,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152537732] [2024-06-28 01:56:34,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:34,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:36,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:56:36,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:36,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152537732] [2024-06-28 01:56:36,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152537732] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:36,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:36,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:36,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094595123] [2024-06-28 01:56:36,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:36,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:36,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:36,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:36,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:36,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:56:36,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 123 transitions, 1469 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:36,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:36,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:56:36,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:37,578 INFO L124 PetriNetUnfolderBase]: 1416/2801 cut-off events. [2024-06-28 01:56:37,579 INFO L125 PetriNetUnfolderBase]: For 54469/54471 co-relation queries the response was YES. [2024-06-28 01:56:37,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14937 conditions, 2801 events. 1416/2801 cut-off events. For 54469/54471 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 18368 event pairs, 699 based on Foata normal form. 10/2718 useless extension candidates. Maximal degree in co-relation 14872. Up to 1949 conditions per place. [2024-06-28 01:56:37,601 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 117 selfloop transitions, 39 changer transitions 0/161 dead transitions. [2024-06-28 01:56:37,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 161 transitions, 2103 flow [2024-06-28 01:56:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:56:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:56:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 162 transitions. [2024-06-28 01:56:37,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-28 01:56:37,602 INFO L175 Difference]: Start difference. First operand has 162 places, 123 transitions, 1469 flow. Second operand 11 states and 162 transitions. [2024-06-28 01:56:37,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 161 transitions, 2103 flow [2024-06-28 01:56:37,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 161 transitions, 2035 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-28 01:56:37,693 INFO L231 Difference]: Finished difference. Result has 166 places, 125 transitions, 1537 flow [2024-06-28 01:56:37,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1537, PETRI_PLACES=166, PETRI_TRANSITIONS=125} [2024-06-28 01:56:37,693 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 126 predicate places. [2024-06-28 01:56:37,694 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 125 transitions, 1537 flow [2024-06-28 01:56:37,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:37,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:37,694 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:37,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 01:56:37,694 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:56:37,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:37,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2080212668, now seen corresponding path program 4 times [2024-06-28 01:56:37,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:37,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107816391] [2024-06-28 01:56:37,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:37,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:39,939 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:39,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:39,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107816391] [2024-06-28 01:56:39,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107816391] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:39,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:39,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:39,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825160404] [2024-06-28 01:56:39,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:39,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:39,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:39,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:39,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:39,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:56:39,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 125 transitions, 1537 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:39,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:39,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:56:39,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:40,920 INFO L124 PetriNetUnfolderBase]: 1420/2815 cut-off events. [2024-06-28 01:56:40,921 INFO L125 PetriNetUnfolderBase]: For 50853/50855 co-relation queries the response was YES. [2024-06-28 01:56:40,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15033 conditions, 2815 events. 1420/2815 cut-off events. For 50853/50855 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 18526 event pairs, 749 based on Foata normal form. 4/2724 useless extension candidates. Maximal degree in co-relation 14967. Up to 2436 conditions per place. [2024-06-28 01:56:40,946 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 119 selfloop transitions, 22 changer transitions 0/146 dead transitions. [2024-06-28 01:56:40,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 146 transitions, 1910 flow [2024-06-28 01:56:40,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:56:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:56:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2024-06-28 01:56:40,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3950617283950617 [2024-06-28 01:56:40,948 INFO L175 Difference]: Start difference. First operand has 166 places, 125 transitions, 1537 flow. Second operand 9 states and 128 transitions. [2024-06-28 01:56:40,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 146 transitions, 1910 flow [2024-06-28 01:56:41,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 146 transitions, 1837 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-28 01:56:41,043 INFO L231 Difference]: Finished difference. Result has 168 places, 126 transitions, 1537 flow [2024-06-28 01:56:41,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1537, PETRI_PLACES=168, PETRI_TRANSITIONS=126} [2024-06-28 01:56:41,044 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 128 predicate places. [2024-06-28 01:56:41,044 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 126 transitions, 1537 flow [2024-06-28 01:56:41,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:41,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:41,044 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:41,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 01:56:41,045 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:56:41,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:41,045 INFO L85 PathProgramCache]: Analyzing trace with hash 424751336, now seen corresponding path program 9 times [2024-06-28 01:56:41,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:41,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785008014] [2024-06-28 01:56:41,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:41,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:43,549 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:43,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:43,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785008014] [2024-06-28 01:56:43,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785008014] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:43,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:43,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:43,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919813051] [2024-06-28 01:56:43,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:43,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:43,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:43,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:43,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:43,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:56:43,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 126 transitions, 1537 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:43,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:43,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:56:43,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:44,894 INFO L124 PetriNetUnfolderBase]: 1498/2953 cut-off events. [2024-06-28 01:56:44,894 INFO L125 PetriNetUnfolderBase]: For 59768/59770 co-relation queries the response was YES. [2024-06-28 01:56:44,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15778 conditions, 2953 events. 1498/2953 cut-off events. For 59768/59770 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 19581 event pairs, 768 based on Foata normal form. 12/2870 useless extension candidates. Maximal degree in co-relation 15710. Up to 2242 conditions per place. [2024-06-28 01:56:44,920 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 105 selfloop transitions, 55 changer transitions 0/165 dead transitions. [2024-06-28 01:56:44,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 165 transitions, 2131 flow [2024-06-28 01:56:44,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:56:44,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:56:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-06-28 01:56:44,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-28 01:56:44,921 INFO L175 Difference]: Start difference. First operand has 168 places, 126 transitions, 1537 flow. Second operand 11 states and 168 transitions. [2024-06-28 01:56:44,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 165 transitions, 2131 flow [2024-06-28 01:56:45,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 165 transitions, 2078 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-28 01:56:45,075 INFO L231 Difference]: Finished difference. Result has 172 places, 127 transitions, 1627 flow [2024-06-28 01:56:45,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1627, PETRI_PLACES=172, PETRI_TRANSITIONS=127} [2024-06-28 01:56:45,076 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 132 predicate places. [2024-06-28 01:56:45,076 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 127 transitions, 1627 flow [2024-06-28 01:56:45,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:45,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:45,076 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:45,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 01:56:45,076 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:56:45,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:45,077 INFO L85 PathProgramCache]: Analyzing trace with hash 2080206716, now seen corresponding path program 10 times [2024-06-28 01:56:45,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:45,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518891788] [2024-06-28 01:56:45,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:47,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:56:47,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:47,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518891788] [2024-06-28 01:56:47,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518891788] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:47,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:47,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:47,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066182942] [2024-06-28 01:56:47,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:47,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:47,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:47,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:47,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:47,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:56:47,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 127 transitions, 1627 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:47,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:47,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:56:47,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:48,433 INFO L124 PetriNetUnfolderBase]: 1485/2930 cut-off events. [2024-06-28 01:56:48,433 INFO L125 PetriNetUnfolderBase]: For 53547/53549 co-relation queries the response was YES. [2024-06-28 01:56:48,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15462 conditions, 2930 events. 1485/2930 cut-off events. For 53547/53549 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 19403 event pairs, 788 based on Foata normal form. 12/2847 useless extension candidates. Maximal degree in co-relation 15393. Up to 2411 conditions per place. [2024-06-28 01:56:48,457 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 120 selfloop transitions, 28 changer transitions 0/153 dead transitions. [2024-06-28 01:56:48,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 153 transitions, 2050 flow [2024-06-28 01:56:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:56:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:56:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2024-06-28 01:56:48,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3972222222222222 [2024-06-28 01:56:48,459 INFO L175 Difference]: Start difference. First operand has 172 places, 127 transitions, 1627 flow. Second operand 10 states and 143 transitions. [2024-06-28 01:56:48,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 153 transitions, 2050 flow [2024-06-28 01:56:48,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 153 transitions, 1952 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-28 01:56:48,562 INFO L231 Difference]: Finished difference. Result has 174 places, 127 transitions, 1590 flow [2024-06-28 01:56:48,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1529, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1590, PETRI_PLACES=174, PETRI_TRANSITIONS=127} [2024-06-28 01:56:48,563 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 134 predicate places. [2024-06-28 01:56:48,563 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 127 transitions, 1590 flow [2024-06-28 01:56:48,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:48,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:48,564 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,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 01:56:48,564 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:56:48,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash 177507676, now seen corresponding path program 5 times [2024-06-28 01:56:48,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:48,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974661123] [2024-06-28 01:56:48,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:48,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:50,735 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,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:50,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974661123] [2024-06-28 01:56:50,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974661123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:50,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:50,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:50,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391531294] [2024-06-28 01:56:50,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:50,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:50,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:50,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:50,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:50,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:56:50,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 127 transitions, 1590 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:50,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:50,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:56:50,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:51,832 INFO L124 PetriNetUnfolderBase]: 1489/2944 cut-off events. [2024-06-28 01:56:51,833 INFO L125 PetriNetUnfolderBase]: For 44981/44983 co-relation queries the response was YES. [2024-06-28 01:56:51,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15317 conditions, 2944 events. 1489/2944 cut-off events. For 44981/44983 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 19590 event pairs, 785 based on Foata normal form. 4/2851 useless extension candidates. Maximal degree in co-relation 15247. Up to 2543 conditions per place. [2024-06-28 01:56:51,856 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 123 selfloop transitions, 22 changer transitions 0/150 dead transitions. [2024-06-28 01:56:51,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 150 transitions, 1997 flow [2024-06-28 01:56:51,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:56:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:56:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2024-06-28 01:56:51,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3950617283950617 [2024-06-28 01:56:51,857 INFO L175 Difference]: Start difference. First operand has 174 places, 127 transitions, 1590 flow. Second operand 9 states and 128 transitions. [2024-06-28 01:56:51,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 150 transitions, 1997 flow [2024-06-28 01:56:51,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 150 transitions, 1924 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-28 01:56:51,946 INFO L231 Difference]: Finished difference. Result has 174 places, 128 transitions, 1592 flow [2024-06-28 01:56:51,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1592, PETRI_PLACES=174, PETRI_TRANSITIONS=128} [2024-06-28 01:56:51,947 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 134 predicate places. [2024-06-28 01:56:51,947 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 128 transitions, 1592 flow [2024-06-28 01:56:51,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:51,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:51,948 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:51,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-28 01:56:51,948 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:56:51,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:51,948 INFO L85 PathProgramCache]: Analyzing trace with hash 177515116, now seen corresponding path program 6 times [2024-06-28 01:56:51,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:51,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591820774] [2024-06-28 01:56:51,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:51,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:54,472 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,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:54,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591820774] [2024-06-28 01:56:54,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591820774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:54,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:54,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:54,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887461503] [2024-06-28 01:56:54,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:54,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:54,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:54,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:54,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:54,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:56:54,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 128 transitions, 1592 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:54,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:54,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:56:54,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:55,621 INFO L124 PetriNetUnfolderBase]: 1511/2988 cut-off events. [2024-06-28 01:56:55,622 INFO L125 PetriNetUnfolderBase]: For 45869/45871 co-relation queries the response was YES. [2024-06-28 01:56:55,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15608 conditions, 2988 events. 1511/2988 cut-off events. For 45869/45871 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 19939 event pairs, 784 based on Foata normal form. 4/2893 useless extension candidates. Maximal degree in co-relation 15537. Up to 2576 conditions per place. [2024-06-28 01:56:55,644 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 131 selfloop transitions, 21 changer transitions 0/157 dead transitions. [2024-06-28 01:56:55,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 157 transitions, 2079 flow [2024-06-28 01:56:55,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:56:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:56:55,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2024-06-28 01:56:55,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4012345679012346 [2024-06-28 01:56:55,646 INFO L175 Difference]: Start difference. First operand has 174 places, 128 transitions, 1592 flow. Second operand 9 states and 130 transitions. [2024-06-28 01:56:55,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 157 transitions, 2079 flow [2024-06-28 01:56:55,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 157 transitions, 2022 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-28 01:56:55,742 INFO L231 Difference]: Finished difference. Result has 177 places, 132 transitions, 1675 flow [2024-06-28 01:56:55,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1535, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1675, PETRI_PLACES=177, PETRI_TRANSITIONS=132} [2024-06-28 01:56:55,743 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 137 predicate places. [2024-06-28 01:56:55,743 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 132 transitions, 1675 flow [2024-06-28 01:56:55,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:55,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:55,743 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:55,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-28 01:56:55,744 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:56:55,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:55,744 INFO L85 PathProgramCache]: Analyzing trace with hash 177299914, now seen corresponding path program 11 times [2024-06-28 01:56:55,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:55,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025068205] [2024-06-28 01:56:55,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:55,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:56:58,068 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,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:56:58,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025068205] [2024-06-28 01:56:58,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025068205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:56:58,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:56:58,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:56:58,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073254471] [2024-06-28 01:56:58,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:56:58,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:56:58,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:56:58,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:56:58,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:56:58,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:56:58,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 132 transitions, 1675 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:58,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:56:58,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:56:58,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:56:59,163 INFO L124 PetriNetUnfolderBase]: 1547/3056 cut-off events. [2024-06-28 01:56:59,163 INFO L125 PetriNetUnfolderBase]: For 51468/51470 co-relation queries the response was YES. [2024-06-28 01:56:59,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15817 conditions, 3056 events. 1547/3056 cut-off events. For 51468/51470 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 20504 event pairs, 822 based on Foata normal form. 12/2969 useless extension candidates. Maximal degree in co-relation 15744. Up to 2524 conditions per place. [2024-06-28 01:56:59,187 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 133 selfloop transitions, 27 changer transitions 0/165 dead transitions. [2024-06-28 01:56:59,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 165 transitions, 2192 flow [2024-06-28 01:56:59,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:56:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:56:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 163 transitions. [2024-06-28 01:56:59,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3773148148148148 [2024-06-28 01:56:59,195 INFO L175 Difference]: Start difference. First operand has 177 places, 132 transitions, 1675 flow. Second operand 12 states and 163 transitions. [2024-06-28 01:56:59,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 165 transitions, 2192 flow [2024-06-28 01:56:59,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 165 transitions, 2116 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-28 01:56:59,311 INFO L231 Difference]: Finished difference. Result has 184 places, 135 transitions, 1725 flow [2024-06-28 01:56:59,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1725, PETRI_PLACES=184, PETRI_TRANSITIONS=135} [2024-06-28 01:56:59,312 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 144 predicate places. [2024-06-28 01:56:59,312 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 135 transitions, 1725 flow [2024-06-28 01:56:59,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:56:59,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:56:59,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:56:59,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-28 01:56:59,313 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:56:59,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:56:59,313 INFO L85 PathProgramCache]: Analyzing trace with hash 472734316, now seen corresponding path program 7 times [2024-06-28 01:56:59,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:56:59,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587617999] [2024-06-28 01:56:59,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:56:59,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:56:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:01,455 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:01,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:01,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587617999] [2024-06-28 01:57:01,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587617999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:01,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:01,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:57:01,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003065922] [2024-06-28 01:57:01,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:01,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:57:01,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:01,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:57:01,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:57:01,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:57:01,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 135 transitions, 1725 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:01,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:01,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:57:01,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:02,616 INFO L124 PetriNetUnfolderBase]: 1544/3051 cut-off events. [2024-06-28 01:57:02,616 INFO L125 PetriNetUnfolderBase]: For 43528/43530 co-relation queries the response was YES. [2024-06-28 01:57:02,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15895 conditions, 3051 events. 1544/3051 cut-off events. For 43528/43530 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 20331 event pairs, 759 based on Foata normal form. 4/2956 useless extension candidates. Maximal degree in co-relation 15820. Up to 2584 conditions per place. [2024-06-28 01:57:02,641 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 135 selfloop transitions, 25 changer transitions 0/165 dead transitions. [2024-06-28 01:57:02,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 165 transitions, 2203 flow [2024-06-28 01:57:02,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2024-06-28 01:57:02,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4104938271604938 [2024-06-28 01:57:02,643 INFO L175 Difference]: Start difference. First operand has 184 places, 135 transitions, 1725 flow. Second operand 9 states and 133 transitions. [2024-06-28 01:57:02,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 165 transitions, 2203 flow [2024-06-28 01:57:02,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 165 transitions, 2114 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-28 01:57:02,746 INFO L231 Difference]: Finished difference. Result has 185 places, 138 transitions, 1760 flow [2024-06-28 01:57:02,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1638, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1760, PETRI_PLACES=185, PETRI_TRANSITIONS=138} [2024-06-28 01:57:02,747 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 145 predicate places. [2024-06-28 01:57:02,747 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 138 transitions, 1760 flow [2024-06-28 01:57:02,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:02,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:02,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:02,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-28 01:57:02,748 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:02,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:02,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1161379690, now seen corresponding path program 1 times [2024-06-28 01:57:02,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:02,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560748724] [2024-06-28 01:57:02,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:02,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:08,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:08,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560748724] [2024-06-28 01:57:08,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560748724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:08,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:08,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:57:08,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847033655] [2024-06-28 01:57:08,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:08,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:57:08,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:08,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:57:08,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:57:08,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:57:08,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 138 transitions, 1760 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:08,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:08,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:57:08,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:09,180 INFO L124 PetriNetUnfolderBase]: 1594/3149 cut-off events. [2024-06-28 01:57:09,180 INFO L125 PetriNetUnfolderBase]: For 49337/49339 co-relation queries the response was YES. [2024-06-28 01:57:09,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16442 conditions, 3149 events. 1594/3149 cut-off events. For 49337/49339 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 21383 event pairs, 801 based on Foata normal form. 8/3058 useless extension candidates. Maximal degree in co-relation 16365. Up to 2674 conditions per place. [2024-06-28 01:57:09,206 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 153 selfloop transitions, 14 changer transitions 0/172 dead transitions. [2024-06-28 01:57:09,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 172 transitions, 2292 flow [2024-06-28 01:57:09,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2024-06-28 01:57:09,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4104938271604938 [2024-06-28 01:57:09,207 INFO L175 Difference]: Start difference. First operand has 185 places, 138 transitions, 1760 flow. Second operand 9 states and 133 transitions. [2024-06-28 01:57:09,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 172 transitions, 2292 flow [2024-06-28 01:57:09,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 172 transitions, 2166 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-28 01:57:09,330 INFO L231 Difference]: Finished difference. Result has 188 places, 140 transitions, 1712 flow [2024-06-28 01:57:09,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1635, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1712, PETRI_PLACES=188, PETRI_TRANSITIONS=140} [2024-06-28 01:57:09,331 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 148 predicate places. [2024-06-28 01:57:09,331 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 140 transitions, 1712 flow [2024-06-28 01:57:09,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:09,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:09,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-28 01:57:09,332 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:09,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:09,332 INFO L85 PathProgramCache]: Analyzing trace with hash 234805472, now seen corresponding path program 2 times [2024-06-28 01:57:09,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:09,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434542543] [2024-06-28 01:57:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:09,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:12,373 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:12,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:12,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434542543] [2024-06-28 01:57:12,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434542543] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:12,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:12,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:57:12,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728189069] [2024-06-28 01:57:12,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:12,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:57:12,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:12,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:57:12,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:57:12,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:57:12,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 140 transitions, 1712 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:12,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:12,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:57:12,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:13,608 INFO L124 PetriNetUnfolderBase]: 1644/3247 cut-off events. [2024-06-28 01:57:13,608 INFO L125 PetriNetUnfolderBase]: For 51133/51135 co-relation queries the response was YES. [2024-06-28 01:57:13,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16801 conditions, 3247 events. 1644/3247 cut-off events. For 51133/51135 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 22135 event pairs, 817 based on Foata normal form. 8/3156 useless extension candidates. Maximal degree in co-relation 16722. Up to 2724 conditions per place. [2024-06-28 01:57:13,635 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 146 selfloop transitions, 21 changer transitions 0/172 dead transitions. [2024-06-28 01:57:13,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 172 transitions, 2218 flow [2024-06-28 01:57:13,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:57:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:57:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-06-28 01:57:13,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41975308641975306 [2024-06-28 01:57:13,637 INFO L175 Difference]: Start difference. First operand has 188 places, 140 transitions, 1712 flow. Second operand 9 states and 136 transitions. [2024-06-28 01:57:13,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 172 transitions, 2218 flow [2024-06-28 01:57:13,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 172 transitions, 2160 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-28 01:57:13,760 INFO L231 Difference]: Finished difference. Result has 191 places, 141 transitions, 1735 flow [2024-06-28 01:57:13,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1735, PETRI_PLACES=191, PETRI_TRANSITIONS=141} [2024-06-28 01:57:13,761 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 151 predicate places. [2024-06-28 01:57:13,761 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 141 transitions, 1735 flow [2024-06-28 01:57:13,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:13,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:13,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-28 01:57:13,762 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:13,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:13,762 INFO L85 PathProgramCache]: Analyzing trace with hash 234574832, now seen corresponding path program 3 times [2024-06-28 01:57:13,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:13,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297146362] [2024-06-28 01:57:13,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:13,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:16,274 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:16,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297146362] [2024-06-28 01:57:16,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297146362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:16,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:16,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:57:16,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716069442] [2024-06-28 01:57:16,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:16,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:57:16,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:16,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:57:16,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:57:16,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:57:16,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 141 transitions, 1735 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:16,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:16,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:57:16,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:17,419 INFO L124 PetriNetUnfolderBase]: 1686/3325 cut-off events. [2024-06-28 01:57:17,420 INFO L125 PetriNetUnfolderBase]: For 54458/54460 co-relation queries the response was YES. [2024-06-28 01:57:17,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17293 conditions, 3325 events. 1686/3325 cut-off events. For 54458/54460 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 22878 event pairs, 908 based on Foata normal form. 8/3234 useless extension candidates. Maximal degree in co-relation 17213. Up to 2828 conditions per place. [2024-06-28 01:57:17,448 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 139 selfloop transitions, 26 changer transitions 0/170 dead transitions. [2024-06-28 01:57:17,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 170 transitions, 2232 flow [2024-06-28 01:57:17,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:57:17,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:57:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2024-06-28 01:57:17,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2024-06-28 01:57:17,450 INFO L175 Difference]: Start difference. First operand has 191 places, 141 transitions, 1735 flow. Second operand 10 states and 142 transitions. [2024-06-28 01:57:17,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 170 transitions, 2232 flow [2024-06-28 01:57:17,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 170 transitions, 2167 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-28 01:57:17,647 INFO L231 Difference]: Finished difference. Result has 195 places, 144 transitions, 1817 flow [2024-06-28 01:57:17,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1670, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1817, PETRI_PLACES=195, PETRI_TRANSITIONS=144} [2024-06-28 01:57:17,647 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 155 predicate places. [2024-06-28 01:57:17,647 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 144 transitions, 1817 flow [2024-06-28 01:57:17,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:17,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:17,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-28 01:57:17,648 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:17,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:17,649 INFO L85 PathProgramCache]: Analyzing trace with hash 62084942, now seen corresponding path program 4 times [2024-06-28 01:57:17,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:17,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472864246] [2024-06-28 01:57:17,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:17,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:20,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:57:20,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:20,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472864246] [2024-06-28 01:57:20,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472864246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:20,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:20,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:57:20,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721947230] [2024-06-28 01:57:20,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:20,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:57:20,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:20,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:57:20,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:57:20,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:57:20,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 144 transitions, 1817 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:20,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:57:20,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:21,509 INFO L124 PetriNetUnfolderBase]: 1728/3403 cut-off events. [2024-06-28 01:57:21,509 INFO L125 PetriNetUnfolderBase]: For 57340/57342 co-relation queries the response was YES. [2024-06-28 01:57:21,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17782 conditions, 3403 events. 1728/3403 cut-off events. For 57340/57342 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 23551 event pairs, 942 based on Foata normal form. 8/3312 useless extension candidates. Maximal degree in co-relation 17700. Up to 2919 conditions per place. [2024-06-28 01:57:21,540 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 139 selfloop transitions, 29 changer transitions 0/173 dead transitions. [2024-06-28 01:57:21,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 173 transitions, 2324 flow [2024-06-28 01:57:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:57:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:57:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 144 transitions. [2024-06-28 01:57:21,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-28 01:57:21,542 INFO L175 Difference]: Start difference. First operand has 195 places, 144 transitions, 1817 flow. Second operand 10 states and 144 transitions. [2024-06-28 01:57:21,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 173 transitions, 2324 flow [2024-06-28 01:57:21,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 173 transitions, 2241 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-28 01:57:21,713 INFO L231 Difference]: Finished difference. Result has 200 places, 147 transitions, 1888 flow [2024-06-28 01:57:21,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1888, PETRI_PLACES=200, PETRI_TRANSITIONS=147} [2024-06-28 01:57:21,714 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 160 predicate places. [2024-06-28 01:57:21,714 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 147 transitions, 1888 flow [2024-06-28 01:57:21,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:21,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:21,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:21,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-28 01:57:21,715 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:21,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:21,715 INFO L85 PathProgramCache]: Analyzing trace with hash -229867408, now seen corresponding path program 5 times [2024-06-28 01:57:21,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:21,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971665541] [2024-06-28 01:57:21,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:21,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:24,219 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,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:24,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971665541] [2024-06-28 01:57:24,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971665541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:24,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:24,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:57:24,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935874843] [2024-06-28 01:57:24,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:24,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:57:24,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:24,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:57:24,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:57:24,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:57:24,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 147 transitions, 1888 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:24,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:57:24,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:25,364 INFO L124 PetriNetUnfolderBase]: 1770/3481 cut-off events. [2024-06-28 01:57:25,364 INFO L125 PetriNetUnfolderBase]: For 59941/59943 co-relation queries the response was YES. [2024-06-28 01:57:25,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18285 conditions, 3481 events. 1770/3481 cut-off events. For 59941/59943 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 24232 event pairs, 972 based on Foata normal form. 8/3390 useless extension candidates. Maximal degree in co-relation 18200. Up to 2996 conditions per place. [2024-06-28 01:57:25,394 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 147 selfloop transitions, 25 changer transitions 0/177 dead transitions. [2024-06-28 01:57:25,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 177 transitions, 2421 flow [2024-06-28 01:57:25,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:57:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:57:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2024-06-28 01:57:25,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3972222222222222 [2024-06-28 01:57:25,396 INFO L175 Difference]: Start difference. First operand has 200 places, 147 transitions, 1888 flow. Second operand 10 states and 143 transitions. [2024-06-28 01:57:25,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 177 transitions, 2421 flow [2024-06-28 01:57:25,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 177 transitions, 2325 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-28 01:57:25,555 INFO L231 Difference]: Finished difference. Result has 205 places, 150 transitions, 1939 flow [2024-06-28 01:57:25,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1792, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1939, PETRI_PLACES=205, PETRI_TRANSITIONS=150} [2024-06-28 01:57:25,556 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 165 predicate places. [2024-06-28 01:57:25,556 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 150 transitions, 1939 flow [2024-06-28 01:57:25,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:25,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:25,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:25,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-28 01:57:25,556 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:25,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:25,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1208002974, now seen corresponding path program 6 times [2024-06-28 01:57:25,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:25,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277981769] [2024-06-28 01:57:25,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:25,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:28,061 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:28,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:28,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277981769] [2024-06-28 01:57:28,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277981769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:28,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:28,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 01:57:28,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445397328] [2024-06-28 01:57:28,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:28,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 01:57:28,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:28,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 01:57:28,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-28 01:57:28,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:57:28,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 150 transitions, 1939 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:28,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:28,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:57:28,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:29,397 INFO L124 PetriNetUnfolderBase]: 1815/3564 cut-off events. [2024-06-28 01:57:29,397 INFO L125 PetriNetUnfolderBase]: For 62955/62957 co-relation queries the response was YES. [2024-06-28 01:57:29,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18818 conditions, 3564 events. 1815/3564 cut-off events. For 62955/62957 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 24938 event pairs, 1008 based on Foata normal form. 8/3473 useless extension candidates. Maximal degree in co-relation 18730. Up to 3066 conditions per place. [2024-06-28 01:57:29,429 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 155 selfloop transitions, 28 changer transitions 0/188 dead transitions. [2024-06-28 01:57:29,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 188 transitions, 2606 flow [2024-06-28 01:57:29,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:57:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:57:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2024-06-28 01:57:29,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39141414141414144 [2024-06-28 01:57:29,431 INFO L175 Difference]: Start difference. First operand has 205 places, 150 transitions, 1939 flow. Second operand 11 states and 155 transitions. [2024-06-28 01:57:29,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 188 transitions, 2606 flow [2024-06-28 01:57:29,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 188 transitions, 2503 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-06-28 01:57:29,613 INFO L231 Difference]: Finished difference. Result has 212 places, 157 transitions, 2108 flow [2024-06-28 01:57:29,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2108, PETRI_PLACES=212, PETRI_TRANSITIONS=157} [2024-06-28 01:57:29,614 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 172 predicate places. [2024-06-28 01:57:29,614 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 157 transitions, 2108 flow [2024-06-28 01:57:29,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:29,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:29,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-28 01:57:29,615 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:29,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:29,615 INFO L85 PathProgramCache]: Analyzing trace with hash 332223840, now seen corresponding path program 7 times [2024-06-28 01:57:29,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:29,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911855445] [2024-06-28 01:57:29,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:29,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:57:32,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:32,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911855445] [2024-06-28 01:57:32,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911855445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:32,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:32,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-28 01:57:32,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185192094] [2024-06-28 01:57:32,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:32,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-28 01:57:32,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:32,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-28 01:57:32,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-28 01:57:32,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:57:32,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 157 transitions, 2108 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:32,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:32,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:57:32,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:33,898 INFO L124 PetriNetUnfolderBase]: 1830/3589 cut-off events. [2024-06-28 01:57:33,898 INFO L125 PetriNetUnfolderBase]: For 57866/57868 co-relation queries the response was YES. [2024-06-28 01:57:33,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18767 conditions, 3589 events. 1830/3589 cut-off events. For 57866/57868 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 24987 event pairs, 880 based on Foata normal form. 8/3498 useless extension candidates. Maximal degree in co-relation 18675. Up to 2885 conditions per place. [2024-06-28 01:57:33,933 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 147 selfloop transitions, 54 changer transitions 0/206 dead transitions. [2024-06-28 01:57:33,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 206 transitions, 2664 flow [2024-06-28 01:57:33,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:57:33,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:57:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 182 transitions. [2024-06-28 01:57:33,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212962962962963 [2024-06-28 01:57:33,935 INFO L175 Difference]: Start difference. First operand has 212 places, 157 transitions, 2108 flow. Second operand 12 states and 182 transitions. [2024-06-28 01:57:33,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 206 transitions, 2664 flow [2024-06-28 01:57:34,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 206 transitions, 2299 flow, removed 97 selfloop flow, removed 45 redundant places. [2024-06-28 01:57:34,072 INFO L231 Difference]: Finished difference. Result has 178 places, 162 transitions, 1923 flow [2024-06-28 01:57:34,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1923, PETRI_PLACES=178, PETRI_TRANSITIONS=162} [2024-06-28 01:57:34,073 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 138 predicate places. [2024-06-28 01:57:34,073 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 162 transitions, 1923 flow [2024-06-28 01:57:34,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:34,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:34,073 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:34,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-28 01:57:34,073 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:34,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:34,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1285975450, now seen corresponding path program 1 times [2024-06-28 01:57:34,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:34,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107265865] [2024-06-28 01:57:34,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:34,149 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:34,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:34,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107265865] [2024-06-28 01:57:34,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107265865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:34,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:34,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:57:34,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018463319] [2024-06-28 01:57:34,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:34,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:57:34,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:34,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:57:34,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:57:34,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-28 01:57:34,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 162 transitions, 1923 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:34,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:34,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-28 01:57:34,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:34,501 INFO L124 PetriNetUnfolderBase]: 1162/2377 cut-off events. [2024-06-28 01:57:34,502 INFO L125 PetriNetUnfolderBase]: For 18036/18046 co-relation queries the response was YES. [2024-06-28 01:57:34,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10345 conditions, 2377 events. 1162/2377 cut-off events. For 18036/18046 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 15703 event pairs, 196 based on Foata normal form. 175/2493 useless extension candidates. Maximal degree in co-relation 10290. Up to 808 conditions per place. [2024-06-28 01:57:34,515 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 79 selfloop transitions, 33 changer transitions 1/135 dead transitions. [2024-06-28 01:57:34,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 135 transitions, 1680 flow [2024-06-28 01:57:34,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:57:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:57:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-28 01:57:34,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-06-28 01:57:34,516 INFO L175 Difference]: Start difference. First operand has 178 places, 162 transitions, 1923 flow. Second operand 5 states and 92 transitions. [2024-06-28 01:57:34,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 135 transitions, 1680 flow [2024-06-28 01:57:34,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 135 transitions, 1303 flow, removed 89 selfloop flow, removed 43 redundant places. [2024-06-28 01:57:34,553 INFO L231 Difference]: Finished difference. Result has 141 places, 121 transitions, 1136 flow [2024-06-28 01:57:34,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1136, PETRI_PLACES=141, PETRI_TRANSITIONS=121} [2024-06-28 01:57:34,554 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 101 predicate places. [2024-06-28 01:57:34,554 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 121 transitions, 1136 flow [2024-06-28 01:57:34,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:34,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:34,554 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:34,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-28 01:57:34,554 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:34,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:34,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1088836299, now seen corresponding path program 1 times [2024-06-28 01:57:34,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:34,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490772775] [2024-06-28 01:57:34,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:34,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:57:34,704 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:34,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:57:34,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490772775] [2024-06-28 01:57:34,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490772775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:57:34,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:57:34,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:57:34,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477733289] [2024-06-28 01:57:34,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:57:34,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:57:34,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:57:34,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:57:34,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:57:34,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-28 01:57:34,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 121 transitions, 1136 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:57:34,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:57:34,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-28 01:57:34,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:57:35,021 INFO L124 PetriNetUnfolderBase]: 844/1848 cut-off events. [2024-06-28 01:57:35,021 INFO L125 PetriNetUnfolderBase]: For 6041/6058 co-relation queries the response was YES. [2024-06-28 01:57:35,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7127 conditions, 1848 events. 844/1848 cut-off events. For 6041/6058 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12256 event pairs, 327 based on Foata normal form. 32/1851 useless extension candidates. Maximal degree in co-relation 7091. Up to 963 conditions per place. [2024-06-28 01:57:35,030 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 38 selfloop transitions, 5 changer transitions 81/137 dead transitions. [2024-06-28 01:57:35,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 137 transitions, 1390 flow [2024-06-28 01:57:35,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:57:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:57:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-28 01:57:35,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-28 01:57:35,031 INFO L175 Difference]: Start difference. First operand has 141 places, 121 transitions, 1136 flow. Second operand 6 states and 99 transitions. [2024-06-28 01:57:35,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 137 transitions, 1390 flow [2024-06-28 01:57:35,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 137 transitions, 1226 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-06-28 01:57:35,051 INFO L231 Difference]: Finished difference. Result has 137 places, 51 transitions, 379 flow [2024-06-28 01:57:35,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=379, PETRI_PLACES=137, PETRI_TRANSITIONS=51} [2024-06-28 01:57:35,051 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 97 predicate places. [2024-06-28 01:57:35,051 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 51 transitions, 379 flow [2024-06-28 01:57:35,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:57:35,052 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:35,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-28 01:57:35,052 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 01:57:35,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:57:35,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1353207895, now seen corresponding path program 2 times [2024-06-28 01:57:35,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:57:35,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134591651] [2024-06-28 01:57:35,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:57:35,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:57:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:57:35,079 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-28 01:57:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:57:35,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-28 01:57:35,135 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-28 01:57:35,136 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-28 01:57:35,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-28 01:57:35,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-28 01:57:35,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-28 01:57:35,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-28 01:57:35,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-28 01:57:35,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-28 01:57:35,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-28 01:57:35,148 INFO L445 BasicCegarLoop]: Path program histogram: [11, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:57:35,161 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 01:57:35,161 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 01:57:35,211 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:35,211 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:35,211 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:35,211 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:35,211 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:35,211 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:35,212 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:35,212 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:35,214 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:35,214 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:35,214 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:35,214 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:35,214 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:35,214 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:35,214 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:35,214 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-28 01:57:35,224 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-28 01:57:35,234 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-28 01:57:35,234 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-28 01:57:35,235 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 01:57:35 BasicIcfg [2024-06-28 01:57:35,235 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 01:57:35,235 INFO L158 Benchmark]: Toolchain (without parser) took 190438.96ms. Allocated memory was 190.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 151.8MB in the beginning and 939.5MB in the end (delta: -787.7MB). Peak memory consumption was 498.9MB. Max. memory is 16.1GB. [2024-06-28 01:57:35,236 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory was 86.0MB in the beginning and 85.9MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:57:35,236 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 190.8MB. Free memory is still 160.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:57:35,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.22ms. Allocated memory is still 190.8MB. Free memory was 151.8MB in the beginning and 112.0MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-06-28 01:57:35,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.13ms. Allocated memory is still 190.8MB. Free memory was 112.0MB in the beginning and 107.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-28 01:57:35,236 INFO L158 Benchmark]: Boogie Preprocessor took 68.57ms. Allocated memory is still 190.8MB. Free memory was 107.8MB in the beginning and 103.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-28 01:57:35,237 INFO L158 Benchmark]: RCFGBuilder took 803.98ms. Allocated memory is still 190.8MB. Free memory was 103.6MB in the beginning and 69.8MB in the end (delta: 33.8MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2024-06-28 01:57:35,237 INFO L158 Benchmark]: TraceAbstraction took 188900.46ms. Allocated memory was 190.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 68.8MB in the beginning and 939.5MB in the end (delta: -870.7MB). Peak memory consumption was 415.9MB. Max. memory is 16.1GB. [2024-06-28 01:57:35,238 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.14ms. Allocated memory is still 121.6MB. Free memory was 86.0MB in the beginning and 85.9MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 190.8MB. Free memory is still 160.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.22ms. Allocated memory is still 190.8MB. Free memory was 151.8MB in the beginning and 112.0MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.13ms. Allocated memory is still 190.8MB. Free memory was 112.0MB in the beginning and 107.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.57ms. Allocated memory is still 190.8MB. Free memory was 107.8MB in the beginning and 103.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 803.98ms. Allocated memory is still 190.8MB. Free memory was 103.6MB in the beginning and 69.8MB in the end (delta: 33.8MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. * TraceAbstraction took 188900.46ms. Allocated memory was 190.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 68.8MB in the beginning and 939.5MB in the end (delta: -870.7MB). Peak memory consumption was 415.9MB. 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L728] 0 _Bool main$tmp_guard1; [L730] 0 int x = 0; [L730] 0 int x = 0; [L731] 0 _Bool x$flush_delayed; [L732] 0 int x$mem_tmp; [L733] 0 _Bool x$r_buff0_thd0; [L734] 0 _Bool x$r_buff0_thd1; [L735] 0 _Bool x$r_buff0_thd2; [L736] 0 _Bool x$r_buff1_thd0; [L737] 0 _Bool x$r_buff1_thd1; [L738] 0 _Bool x$r_buff1_thd2; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice1; [L749] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1923; [L826] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L826] FCALL, FORK 0 pthread_create(&t1923, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L827] 0 pthread_t t1924; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L828] 0 //@ assert ((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX$read_delayed_var == 0) || ((__unbuffered_p1_EAX$read_delayed_var == &x) && ((*__unbuffered_p1_EAX$read_delayed_var == 0) || (*__unbuffered_p1_EAX$read_delayed_var == 1)))))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0 == 0))) && (!multithreaded || ((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (__unbuffered_p1_EAX$flush_delayed == (_Bool) 0)) && (__unbuffered_p1_EAX$mem_tmp == 0)) && (__unbuffered_p1_EAX$r_buff0_thd0 == (_Bool) 0)) && (__unbuffered_p1_EAX$r_buff0_thd1 == (_Bool) 0)) && (__unbuffered_p1_EAX$r_buff0_thd2 == (_Bool) 0)) && (__unbuffered_p1_EAX$r_buff1_thd0 == (_Bool) 0)) && (__unbuffered_p1_EAX$r_buff1_thd1 == (_Bool) 0)) && (__unbuffered_p1_EAX$r_buff1_thd2 == (_Bool) 0)) && (__unbuffered_p1_EAX$w_buff0 == 0)) && (__unbuffered_p1_EAX$w_buff0_used == (_Bool) 0)) && (__unbuffered_p1_EAX$w_buff1 == 0)) && (__unbuffered_p1_EAX$w_buff1_used == (_Bool) 0)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd2 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd2 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EAX$read_delayed_var == 0) || ((__unbuffered_p1_EAX$read_delayed_var == &x) && ((*__unbuffered_p1_EAX$read_delayed_var == 0) || (*__unbuffered_p1_EAX$read_delayed_var == 1))))) && ((x == 0) || (x == 1))) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 1)))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (__unbuffered_p1_EAX$mem_tmp == 0))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 1)))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || ((x$mem_tmp == 0) || (x$mem_tmp == 1)))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p1_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 x [L828] 0 x [L828] 0 x [L828] 0 x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L828] FCALL, FORK 0 pthread_create(&t1924, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923=-1, t1924=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L781] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 2 x$flush_delayed = weak$$choice2 [L784] EXPR 2 \read(x) [L784] 2 x$mem_tmp = x [L785] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] EXPR 2 \read(x) [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L793] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L794] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L795] EXPR 2 \read(x) [L795] 2 __unbuffered_p1_EAX = x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] 2 x = x$flush_delayed ? x$mem_tmp : x [L797] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 __unbuffered_p1_EAX$read_delayed_var [L828] 0 x [L828] 0 x [L828] 0 x [L828] 0 x [L829] 0 //@ assert ((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX$read_delayed_var == 0) || ((__unbuffered_p1_EAX$read_delayed_var == &x) && ((*__unbuffered_p1_EAX$read_delayed_var == 0) || (*__unbuffered_p1_EAX$read_delayed_var == 1)))))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0 == 0))) && (!multithreaded || ((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (__unbuffered_p1_EAX$flush_delayed == (_Bool) 0)) && (__unbuffered_p1_EAX$mem_tmp == 0)) && (__unbuffered_p1_EAX$r_buff0_thd0 == (_Bool) 0)) && (__unbuffered_p1_EAX$r_buff0_thd1 == (_Bool) 0)) && (__unbuffered_p1_EAX$r_buff0_thd2 == (_Bool) 0)) && (__unbuffered_p1_EAX$r_buff1_thd0 == (_Bool) 0)) && (__unbuffered_p1_EAX$r_buff1_thd1 == (_Bool) 0)) && (__unbuffered_p1_EAX$r_buff1_thd2 == (_Bool) 0)) && (__unbuffered_p1_EAX$w_buff0 == 0)) && (__unbuffered_p1_EAX$w_buff0_used == (_Bool) 0)) && (__unbuffered_p1_EAX$w_buff1 == 0)) && (__unbuffered_p1_EAX$w_buff1_used == (_Bool) 0)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd2 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd2 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EAX$read_delayed_var == 0) || ((__unbuffered_p1_EAX$read_delayed_var == &x) && ((*__unbuffered_p1_EAX$read_delayed_var == 0) || (*__unbuffered_p1_EAX$read_delayed_var == 1))))) && ((x == 0) || (x == 1))) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))) && ((y == 0) || (y == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 1)))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (__unbuffered_p1_EAX$mem_tmp == 0))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 1)))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || ((x$mem_tmp == 0) || (x$mem_tmp == 1)))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p1_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); [L829] 0 __unbuffered_p1_EAX$read_delayed_var [L829] 0 __unbuffered_p1_EAX$read_delayed_var [L829] 0 __unbuffered_p1_EAX$read_delayed_var [L829] 0 __unbuffered_p1_EAX$read_delayed_var [L829] 0 x [L829] 0 x [L829] 0 x [L829] 0 x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1923=-1, t1924=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L800] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L753] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 \read(x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L756] 1 x$w_buff1 = x$w_buff0 [L757] 1 x$w_buff0 = 1 [L758] 1 x$w_buff1_used = x$w_buff0_used [L759] 1 x$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L768] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L769] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L770] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L771] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L829] 0 __unbuffered_p1_EAX$read_delayed_var [L829] 0 __unbuffered_p1_EAX$read_delayed_var [L829] 0 __unbuffered_p1_EAX$read_delayed_var [L829] 0 __unbuffered_p1_EAX$read_delayed_var [L829] 0 x [L829] 0 x [L829] 0 x [L829] 0 x [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923=-1, t1924=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 \read(x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923=-1, t1924=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L841] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923=-1, t1924=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 828]: 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: 826]: 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, 53 locations, 7 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: 188.7s, OverallIterations: 63, TraceHistogramMax: 1, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 59.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3134 SdHoareTripleChecker+Valid, 20.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2948 mSDsluCounter, 1714 SdHoareTripleChecker+Invalid, 18.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1491 mSDsCounter, 947 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22461 IncrementalHoareTripleChecker+Invalid, 23408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 947 mSolverCounterUnsat, 223 mSDtfsCounter, 22461 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 661 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 655 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 47.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4310occurred in iteration=34, InterpolantAutomatonStates: 504, 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.8s SatisfiabilityAnalysisTime, 127.3s InterpolantComputationTime, 997 NumberOfCodeBlocks, 997 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 909 ConstructedInterpolants, 0 QuantifiedInterpolants, 84095 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 62 InterpolantComputations, 62 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:35,300 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