./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/safe029_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/safe029_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/safe029_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 12:21:11,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 12:21:11,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 12:21:12,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 12:21:12,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 12:21:12,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 12:21:12,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 12:21:12,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 12:21:12,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 12:21:12,032 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 12:21:12,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 12:21:12,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 12:21:12,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 12:21:12,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 12:21:12,035 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 12:21:12,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 12:21:12,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 12:21:12,035 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 12:21:12,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 12:21:12,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 12:21:12,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 12:21:12,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 12:21:12,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 12:21:12,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 12:21:12,037 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 12:21:12,037 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 12:21:12,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 12:21:12,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 12:21:12,038 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 12:21:12,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 12:21:12,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 12:21:12,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 12:21:12,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:21:12,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 12:21:12,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 12:21:12,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 12:21:12,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 12:21:12,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 12:21:12,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 12:21:12,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 12:21:12,041 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 12:21:12,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 12:21:12,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 12:21:12,041 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-05-12 12:21:12,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 12:21:12,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 12:21:12,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 12:21:12,269 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 12:21:12,269 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 12:21:12,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-05-12 12:21:13,348 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 12:21:13,556 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 12:21:13,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-05-12 12:21:13,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1f64697a/948a0779a5fa435cb124b960889b2f10/FLAG6f08fa019 [2024-05-12 12:21:13,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1f64697a/948a0779a5fa435cb124b960889b2f10 [2024-05-12 12:21:13,590 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 12:21:13,590 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 12:21:13,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/safe029_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-05-12 12:21:13,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 12:21:13,739 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 12:21:13,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 12:21:13,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 12:21:13,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 12:21:13,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:21:13" (1/2) ... [2024-05-12 12:21:13,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6252382b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:13, skipping insertion in model container [2024-05-12 12:21:13,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:21:13" (1/2) ... [2024-05-12 12:21:13,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@205009f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:21:13, skipping insertion in model container [2024-05-12 12:21:13,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:21:13" (2/2) ... [2024-05-12 12:21:13,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6252382b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:13, skipping insertion in model container [2024-05-12 12:21:13,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:21:13" (2/2) ... [2024-05-12 12:21:13,762 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 12:21:13,816 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 12:21:13,818 INFO L97 edCorrectnessWitness]: Location invariant before [L794-L794] (((((((((((((! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-05-12 12:21:13,818 INFO L97 edCorrectnessWitness]: Location invariant before [L793-L793] (((((((((((((! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-05-12 12:21:13,819 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 12:21:13,819 INFO L106 edCorrectnessWitness]: ghost_update [L791-L791] multithreaded = 1; [2024-05-12 12:21:13,856 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 12:21:13,977 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2024-05-12 12:21:14,127 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:21:14,139 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 12:21:14,187 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 12:21:14,411 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:21:14,455 INFO L206 MainTranslator]: Completed translation [2024-05-12 12:21:14,457 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:14 WrapperNode [2024-05-12 12:21:14,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 12:21:14,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 12:21:14,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 12:21:14,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 12:21:14,463 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 12.05 12:21:14" (1/1) ... [2024-05-12 12:21:14,491 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 12.05 12:21:14" (1/1) ... [2024-05-12 12:21:14,596 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2024-05-12 12:21:14,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 12:21:14,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 12:21:14,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 12:21:14,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 12:21:14,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:14" (1/1) ... [2024-05-12 12:21:14,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:14" (1/1) ... [2024-05-12 12:21:14,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:14" (1/1) ... [2024-05-12 12:21:14,680 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-05-12 12:21:14,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:14" (1/1) ... [2024-05-12 12:21:14,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:14" (1/1) ... [2024-05-12 12:21:14,699 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:14" (1/1) ... [2024-05-12 12:21:14,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:14" (1/1) ... [2024-05-12 12:21:14,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:14" (1/1) ... [2024-05-12 12:21:14,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:14" (1/1) ... [2024-05-12 12:21:14,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 12:21:14,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 12:21:14,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 12:21:14,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 12:21:14,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:14" (1/1) ... [2024-05-12 12:21:14,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:21:14,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:21:14,746 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-05-12 12:21:14,778 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-05-12 12:21:14,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 12:21:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 12:21:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 12:21:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 12:21:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 12:21:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 12:21:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 12:21:14,821 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 12:21:14,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 12:21:14,822 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 12:21:14,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 12:21:14,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 12:21:14,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 12:21:14,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 12:21:14,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 12:21:14,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 12:21:14,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 12:21:14,824 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 12:21:14,940 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 12:21:14,942 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 12:21:15,540 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 12:21:15,540 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 12:21:15,681 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 12:21:15,682 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 12:21:15,682 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:21:15 BoogieIcfgContainer [2024-05-12 12:21:15,682 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 12:21:15,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 12:21:15,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 12:21:15,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 12:21:15,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 12:21:13" (1/4) ... [2024-05-12 12:21:15,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e378b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:21:15, skipping insertion in model container [2024-05-12 12:21:15,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:21:13" (2/4) ... [2024-05-12 12:21:15,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e378b90 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:21:15, skipping insertion in model container [2024-05-12 12:21:15,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:21:14" (3/4) ... [2024-05-12 12:21:15,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e378b90 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:21:15, skipping insertion in model container [2024-05-12 12:21:15,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:21:15" (4/4) ... [2024-05-12 12:21:15,691 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-05-12 12:21:15,704 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 12:21:15,704 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 12:21:15,704 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 12:21:15,762 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 12:21:15,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 80 flow [2024-05-12 12:21:15,830 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2024-05-12 12:21:15,831 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:21:15,833 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 44 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-05-12 12:21:15,834 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 80 flow [2024-05-12 12:21:15,837 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 34 transitions, 74 flow [2024-05-12 12:21:15,848 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 12:21:15,856 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;@6ce25379, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 12:21:15,857 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 12:21:15,862 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 12:21:15,863 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 12:21:15,863 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:21:15,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:15,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:21:15,864 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-05-12 12:21:15,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:15,868 INFO L85 PathProgramCache]: Analyzing trace with hash 944266513, now seen corresponding path program 1 times [2024-05-12 12:21:15,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:15,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110416591] [2024-05-12 12:21:15,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:15,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:18,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:18,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110416591] [2024-05-12 12:21:18,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110416591] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:18,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:18,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:21:18,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615557882] [2024-05-12 12:21:18,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:18,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:21:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:18,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:21:18,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:21:18,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:18,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:18,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:18,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:18,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:18,850 INFO L124 PetriNetUnfolderBase]: 546/918 cut-off events. [2024-05-12 12:21:18,851 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-05-12 12:21:18,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 918 events. 546/918 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4445 event pairs, 202 based on Foata normal form. 43/902 useless extension candidates. Maximal degree in co-relation 1835. Up to 899 conditions per place. [2024-05-12 12:21:18,857 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 34 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-05-12 12:21:18,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 175 flow [2024-05-12 12:21:18,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:21:18,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:21:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2024-05-12 12:21:18,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-05-12 12:21:18,868 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 74 flow. Second operand 3 states and 69 transitions. [2024-05-12 12:21:18,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 175 flow [2024-05-12 12:21:18,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:21:18,872 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 98 flow [2024-05-12 12:21:18,873 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=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2024-05-12 12:21:18,875 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-05-12 12:21:18,876 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 98 flow [2024-05-12 12:21:18,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:18,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:18,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:21:18,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 12:21:18,877 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:18,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:18,877 INFO L85 PathProgramCache]: Analyzing trace with hash 944267357, now seen corresponding path program 1 times [2024-05-12 12:21:18,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:18,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53738760] [2024-05-12 12:21:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:18,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:18,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:18,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53738760] [2024-05-12 12:21:18,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53738760] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:18,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:18,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:21:18,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831215395] [2024-05-12 12:21:18,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:18,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:21:18,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:18,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:21:18,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:21:18,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 36 [2024-05-12 12:21:18,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-05-12 12:21:18,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:18,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 36 [2024-05-12 12:21:18,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:19,009 INFO L124 PetriNetUnfolderBase]: 129/319 cut-off events. [2024-05-12 12:21:19,009 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-05-12 12:21:19,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 319 events. 129/319 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1626 event pairs, 41 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 612. Up to 195 conditions per place. [2024-05-12 12:21:19,011 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 25 selfloop transitions, 3 changer transitions 2/45 dead transitions. [2024-05-12 12:21:19,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 173 flow [2024-05-12 12:21:19,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:21:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:21:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-05-12 12:21:19,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2024-05-12 12:21:19,013 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 98 flow. Second operand 3 states and 78 transitions. [2024-05-12 12:21:19,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 173 flow [2024-05-12 12:21:19,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:21:19,015 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 90 flow [2024-05-12 12:21:19,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2024-05-12 12:21:19,016 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-05-12 12:21:19,016 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 90 flow [2024-05-12 12:21:19,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-05-12 12:21:19,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:19,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:19,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 12:21:19,017 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-05-12 12:21:19,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:19,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1202034831, now seen corresponding path program 1 times [2024-05-12 12:21:19,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:19,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283003715] [2024-05-12 12:21:19,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:19,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:20,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:20,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283003715] [2024-05-12 12:21:20,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283003715] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:20,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:20,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:21:20,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18000765] [2024-05-12 12:21:20,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:20,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:21:20,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:20,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:21:20,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:21:20,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:20,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:20,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:20,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:20,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:21,000 INFO L124 PetriNetUnfolderBase]: 404/797 cut-off events. [2024-05-12 12:21:21,000 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2024-05-12 12:21:21,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 797 events. 404/797 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4064 event pairs, 207 based on Foata normal form. 2/762 useless extension candidates. Maximal degree in co-relation 1652. Up to 660 conditions per place. [2024-05-12 12:21:21,004 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 38 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-05-12 12:21:21,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 226 flow [2024-05-12 12:21:21,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:21:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:21:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2024-05-12 12:21:21,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-05-12 12:21:21,006 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 90 flow. Second operand 4 states and 80 transitions. [2024-05-12 12:21:21,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 226 flow [2024-05-12 12:21:21,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:21:21,007 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 133 flow [2024-05-12 12:21:21,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=84, 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=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2024-05-12 12:21:21,008 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-05-12 12:21:21,008 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 133 flow [2024-05-12 12:21:21,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:21,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:21,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:21,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 12:21:21,009 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-05-12 12:21:21,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:21,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1391625334, now seen corresponding path program 1 times [2024-05-12 12:21:21,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:21,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176023674] [2024-05-12 12:21:21,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:21,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:22,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:22,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176023674] [2024-05-12 12:21:22,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176023674] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:22,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:22,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:21:22,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327359145] [2024-05-12 12:21:22,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:22,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:21:22,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:22,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:21:22,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:21:22,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:22,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-05-12 12:21:22,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:22,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:22,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:22,820 INFO L124 PetriNetUnfolderBase]: 428/843 cut-off events. [2024-05-12 12:21:22,820 INFO L125 PetriNetUnfolderBase]: For 339/339 co-relation queries the response was YES. [2024-05-12 12:21:22,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1912 conditions, 843 events. 428/843 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4426 event pairs, 166 based on Foata normal form. 3/807 useless extension candidates. Maximal degree in co-relation 1894. Up to 635 conditions per place. [2024-05-12 12:21:22,824 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 50 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2024-05-12 12:21:22,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 351 flow [2024-05-12 12:21:22,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:21:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:21:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-05-12 12:21:22,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-05-12 12:21:22,826 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 133 flow. Second operand 5 states and 105 transitions. [2024-05-12 12:21:22,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 351 flow [2024-05-12 12:21:22,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 344 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-05-12 12:21:22,828 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 214 flow [2024-05-12 12:21:22,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2024-05-12 12:21:22,829 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2024-05-12 12:21:22,829 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 214 flow [2024-05-12 12:21:22,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-05-12 12:21:22,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:22,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:22,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 12:21:22,830 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-05-12 12:21:22,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:22,830 INFO L85 PathProgramCache]: Analyzing trace with hash 557340216, now seen corresponding path program 1 times [2024-05-12 12:21:22,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:22,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819155271] [2024-05-12 12:21:22,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:22,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:24,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:24,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819155271] [2024-05-12 12:21:24,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819155271] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:24,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:24,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:21:24,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089743822] [2024-05-12 12:21:24,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:24,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:21:24,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:24,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:21:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:21:24,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:24,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:24,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:24,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:24,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:25,038 INFO L124 PetriNetUnfolderBase]: 442/865 cut-off events. [2024-05-12 12:21:25,039 INFO L125 PetriNetUnfolderBase]: For 839/839 co-relation queries the response was YES. [2024-05-12 12:21:25,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2335 conditions, 865 events. 442/865 cut-off events. For 839/839 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4564 event pairs, 126 based on Foata normal form. 3/829 useless extension candidates. Maximal degree in co-relation 2313. Up to 630 conditions per place. [2024-05-12 12:21:25,044 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 57 selfloop transitions, 17 changer transitions 0/81 dead transitions. [2024-05-12 12:21:25,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 470 flow [2024-05-12 12:21:25,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:21:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:21:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2024-05-12 12:21:25,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5787037037037037 [2024-05-12 12:21:25,045 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 214 flow. Second operand 6 states and 125 transitions. [2024-05-12 12:21:25,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 470 flow [2024-05-12 12:21:25,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 466 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-05-12 12:21:25,049 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 277 flow [2024-05-12 12:21:25,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2024-05-12 12:21:25,050 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2024-05-12 12:21:25,050 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 277 flow [2024-05-12 12:21:25,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:25,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:25,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:25,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 12:21:25,051 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:25,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:25,051 INFO L85 PathProgramCache]: Analyzing trace with hash 97678143, now seen corresponding path program 1 times [2024-05-12 12:21:25,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:25,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544189431] [2024-05-12 12:21:25,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:25,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:26,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:26,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544189431] [2024-05-12 12:21:26,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544189431] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:26,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:26,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:21:26,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203634696] [2024-05-12 12:21:26,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:26,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:21:26,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:26,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:21:26,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:21:26,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:26,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 277 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:26,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:26,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:26,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:27,290 INFO L124 PetriNetUnfolderBase]: 462/901 cut-off events. [2024-05-12 12:21:27,290 INFO L125 PetriNetUnfolderBase]: For 1257/1257 co-relation queries the response was YES. [2024-05-12 12:21:27,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2744 conditions, 901 events. 462/901 cut-off events. For 1257/1257 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4783 event pairs, 79 based on Foata normal form. 6/868 useless extension candidates. Maximal degree in co-relation 2719. Up to 612 conditions per place. [2024-05-12 12:21:27,295 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 61 selfloop transitions, 20 changer transitions 0/88 dead transitions. [2024-05-12 12:21:27,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 88 transitions, 563 flow [2024-05-12 12:21:27,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:21:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:21:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-05-12 12:21:27,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2024-05-12 12:21:27,297 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 277 flow. Second operand 7 states and 141 transitions. [2024-05-12 12:21:27,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 88 transitions, 563 flow [2024-05-12 12:21:27,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 88 transitions, 526 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 12:21:27,300 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 302 flow [2024-05-12 12:21:27,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=302, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-05-12 12:21:27,301 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2024-05-12 12:21:27,301 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 302 flow [2024-05-12 12:21:27,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:27,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:27,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:27,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 12:21:27,302 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-05-12 12:21:27,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:27,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1747191880, now seen corresponding path program 1 times [2024-05-12 12:21:27,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:27,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366267114] [2024-05-12 12:21:27,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:27,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:30,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:30,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366267114] [2024-05-12 12:21:30,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366267114] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:30,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:30,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:21:30,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163300586] [2024-05-12 12:21:30,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:30,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:21:30,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:30,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:21:30,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:21:30,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:21:30,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 302 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-05-12 12:21:30,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:30,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:21:30,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:30,787 INFO L124 PetriNetUnfolderBase]: 527/1020 cut-off events. [2024-05-12 12:21:30,788 INFO L125 PetriNetUnfolderBase]: For 1684/1684 co-relation queries the response was YES. [2024-05-12 12:21:30,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3232 conditions, 1020 events. 527/1020 cut-off events. For 1684/1684 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5346 event pairs, 169 based on Foata normal form. 1/976 useless extension candidates. Maximal degree in co-relation 3206. Up to 857 conditions per place. [2024-05-12 12:21:30,793 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 52 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2024-05-12 12:21:30,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 476 flow [2024-05-12 12:21:30,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:21:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:21:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2024-05-12 12:21:30,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-05-12 12:21:30,795 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 302 flow. Second operand 5 states and 84 transitions. [2024-05-12 12:21:30,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 476 flow [2024-05-12 12:21:30,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 426 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-05-12 12:21:30,800 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 298 flow [2024-05-12 12:21:30,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=298, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2024-05-12 12:21:30,801 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2024-05-12 12:21:30,801 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 298 flow [2024-05-12 12:21:30,801 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-05-12 12:21:30,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:30,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:30,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 12:21:30,802 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-05-12 12:21:30,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:30,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1670848793, now seen corresponding path program 1 times [2024-05-12 12:21:30,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:30,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683419870] [2024-05-12 12:21:30,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:30,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:34,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:34,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683419870] [2024-05-12 12:21:34,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683419870] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:34,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:34,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:21:34,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676087973] [2024-05-12 12:21:34,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:34,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:21:34,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:34,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:21:34,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:21:34,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:21:34,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 298 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:34,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:34,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:21:34,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:34,640 INFO L124 PetriNetUnfolderBase]: 523/1020 cut-off events. [2024-05-12 12:21:34,640 INFO L125 PetriNetUnfolderBase]: For 1719/1719 co-relation queries the response was YES. [2024-05-12 12:21:34,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3111 conditions, 1020 events. 523/1020 cut-off events. For 1719/1719 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5393 event pairs, 164 based on Foata normal form. 2/975 useless extension candidates. Maximal degree in co-relation 3083. Up to 839 conditions per place. [2024-05-12 12:21:34,646 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 57 selfloop transitions, 15 changer transitions 0/78 dead transitions. [2024-05-12 12:21:34,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 78 transitions, 541 flow [2024-05-12 12:21:34,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:21:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:21:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-05-12 12:21:34,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2024-05-12 12:21:34,649 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 298 flow. Second operand 6 states and 98 transitions. [2024-05-12 12:21:34,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 78 transitions, 541 flow [2024-05-12 12:21:34,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 78 transitions, 516 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-05-12 12:21:34,653 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 402 flow [2024-05-12 12:21:34,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=402, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2024-05-12 12:21:34,655 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2024-05-12 12:21:34,655 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 402 flow [2024-05-12 12:21:34,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:34,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:34,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:34,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 12:21:34,656 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-05-12 12:21:34,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:34,657 INFO L85 PathProgramCache]: Analyzing trace with hash -470286060, now seen corresponding path program 1 times [2024-05-12 12:21:34,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:34,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643058126] [2024-05-12 12:21:34,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:34,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:37,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:37,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:37,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643058126] [2024-05-12 12:21:37,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643058126] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:37,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:37,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:21:37,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650679325] [2024-05-12 12:21:37,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:37,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:21:37,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:37,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:21:37,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:21:37,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:21:37,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 402 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:37,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:37,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:21:37,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:37,952 INFO L124 PetriNetUnfolderBase]: 534/1028 cut-off events. [2024-05-12 12:21:37,952 INFO L125 PetriNetUnfolderBase]: For 2036/2036 co-relation queries the response was YES. [2024-05-12 12:21:37,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3355 conditions, 1028 events. 534/1028 cut-off events. For 2036/2036 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5445 event pairs, 103 based on Foata normal form. 2/986 useless extension candidates. Maximal degree in co-relation 3324. Up to 784 conditions per place. [2024-05-12 12:21:37,959 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 69 selfloop transitions, 16 changer transitions 0/91 dead transitions. [2024-05-12 12:21:37,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 91 transitions, 673 flow [2024-05-12 12:21:37,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:21:37,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:21:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-05-12 12:21:37,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-05-12 12:21:37,960 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 402 flow. Second operand 7 states and 119 transitions. [2024-05-12 12:21:37,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 91 transitions, 673 flow [2024-05-12 12:21:37,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 91 transitions, 651 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-05-12 12:21:37,966 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 434 flow [2024-05-12 12:21:37,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=434, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2024-05-12 12:21:37,967 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2024-05-12 12:21:37,967 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 434 flow [2024-05-12 12:21:37,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:37,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:37,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:37,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 12:21:37,968 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-05-12 12:21:37,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:37,968 INFO L85 PathProgramCache]: Analyzing trace with hash 256696800, now seen corresponding path program 2 times [2024-05-12 12:21:37,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:37,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121882316] [2024-05-12 12:21:37,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:37,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:40,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:40,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121882316] [2024-05-12 12:21:40,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121882316] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:40,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:40,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:21:40,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546139196] [2024-05-12 12:21:40,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:40,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:21:40,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:40,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:21:40,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:21:40,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:21:40,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 434 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:40,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:40,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:21:40,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:40,946 INFO L124 PetriNetUnfolderBase]: 529/1030 cut-off events. [2024-05-12 12:21:40,946 INFO L125 PetriNetUnfolderBase]: For 2339/2339 co-relation queries the response was YES. [2024-05-12 12:21:40,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3452 conditions, 1030 events. 529/1030 cut-off events. For 2339/2339 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5445 event pairs, 165 based on Foata normal form. 1/983 useless extension candidates. Maximal degree in co-relation 3418. Up to 857 conditions per place. [2024-05-12 12:21:40,953 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 65 selfloop transitions, 10 changer transitions 0/81 dead transitions. [2024-05-12 12:21:40,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 81 transitions, 626 flow [2024-05-12 12:21:40,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:21:40,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:21:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-05-12 12:21:40,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-05-12 12:21:40,955 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 434 flow. Second operand 6 states and 96 transitions. [2024-05-12 12:21:40,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 81 transitions, 626 flow [2024-05-12 12:21:40,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 81 transitions, 597 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 12:21:40,959 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 430 flow [2024-05-12 12:21:40,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=430, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2024-05-12 12:21:40,960 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2024-05-12 12:21:40,960 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 430 flow [2024-05-12 12:21:40,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:40,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:40,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:40,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 12:21:40,961 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-05-12 12:21:40,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:40,962 INFO L85 PathProgramCache]: Analyzing trace with hash 914022369, now seen corresponding path program 1 times [2024-05-12 12:21:40,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:40,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127874899] [2024-05-12 12:21:40,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:40,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:43,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-05-12 12:21:43,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:43,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127874899] [2024-05-12 12:21:43,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127874899] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:43,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:43,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:21:43,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009239610] [2024-05-12 12:21:43,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:43,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:21:43,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:43,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:21:43,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:21:43,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:21:43,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 430 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:43,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:43,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:21:43,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:44,309 INFO L124 PetriNetUnfolderBase]: 621/1151 cut-off events. [2024-05-12 12:21:44,309 INFO L125 PetriNetUnfolderBase]: For 2903/2903 co-relation queries the response was YES. [2024-05-12 12:21:44,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3875 conditions, 1151 events. 621/1151 cut-off events. For 2903/2903 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5990 event pairs, 98 based on Foata normal form. 6/1115 useless extension candidates. Maximal degree in co-relation 3841. Up to 672 conditions per place. [2024-05-12 12:21:44,315 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 88 selfloop transitions, 34 changer transitions 0/128 dead transitions. [2024-05-12 12:21:44,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 128 transitions, 999 flow [2024-05-12 12:21:44,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:21:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:21:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-05-12 12:21:44,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-05-12 12:21:44,317 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 430 flow. Second operand 8 states and 146 transitions. [2024-05-12 12:21:44,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 128 transitions, 999 flow [2024-05-12 12:21:44,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 128 transitions, 942 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 12:21:44,323 INFO L231 Difference]: Finished difference. Result has 74 places, 86 transitions, 648 flow [2024-05-12 12:21:44,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=648, PETRI_PLACES=74, PETRI_TRANSITIONS=86} [2024-05-12 12:21:44,324 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2024-05-12 12:21:44,324 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 86 transitions, 648 flow [2024-05-12 12:21:44,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:44,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:44,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:44,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 12:21:44,325 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-05-12 12:21:44,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:44,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1488234457, now seen corresponding path program 2 times [2024-05-12 12:21:44,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:44,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184144382] [2024-05-12 12:21:44,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:44,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:47,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:47,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184144382] [2024-05-12 12:21:47,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184144382] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:47,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:47,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:21:47,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394537464] [2024-05-12 12:21:47,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:47,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:21:47,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:47,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:21:47,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:21:47,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:21:47,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 86 transitions, 648 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:47,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:47,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:21:47,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:47,499 INFO L124 PetriNetUnfolderBase]: 641/1181 cut-off events. [2024-05-12 12:21:47,499 INFO L125 PetriNetUnfolderBase]: For 3875/3875 co-relation queries the response was YES. [2024-05-12 12:21:47,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4606 conditions, 1181 events. 641/1181 cut-off events. For 3875/3875 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6112 event pairs, 149 based on Foata normal form. 2/1141 useless extension candidates. Maximal degree in co-relation 4569. Up to 961 conditions per place. [2024-05-12 12:21:47,507 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 89 selfloop transitions, 22 changer transitions 0/117 dead transitions. [2024-05-12 12:21:47,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 117 transitions, 1029 flow [2024-05-12 12:21:47,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:21:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:21:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-05-12 12:21:47,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2024-05-12 12:21:47,509 INFO L175 Difference]: Start difference. First operand has 74 places, 86 transitions, 648 flow. Second operand 7 states and 118 transitions. [2024-05-12 12:21:47,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 117 transitions, 1029 flow [2024-05-12 12:21:47,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 117 transitions, 977 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-05-12 12:21:47,516 INFO L231 Difference]: Finished difference. Result has 78 places, 95 transitions, 749 flow [2024-05-12 12:21:47,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=749, PETRI_PLACES=78, PETRI_TRANSITIONS=95} [2024-05-12 12:21:47,517 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 38 predicate places. [2024-05-12 12:21:47,517 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 95 transitions, 749 flow [2024-05-12 12:21:47,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:47,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:47,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:47,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 12:21:47,518 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-05-12 12:21:47,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:47,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1487968477, now seen corresponding path program 3 times [2024-05-12 12:21:47,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:47,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716039488] [2024-05-12 12:21:47,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:47,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:50,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:50,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716039488] [2024-05-12 12:21:50,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716039488] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:50,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:50,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:21:50,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349308739] [2024-05-12 12:21:50,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:50,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:21:50,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:50,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:21:50,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:21:50,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:21:50,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 95 transitions, 749 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:50,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:50,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:21:50,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:50,745 INFO L124 PetriNetUnfolderBase]: 653/1202 cut-off events. [2024-05-12 12:21:50,746 INFO L125 PetriNetUnfolderBase]: For 4470/4470 co-relation queries the response was YES. [2024-05-12 12:21:50,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4797 conditions, 1202 events. 653/1202 cut-off events. For 4470/4470 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6220 event pairs, 152 based on Foata normal form. 2/1161 useless extension candidates. Maximal degree in co-relation 4758. Up to 1014 conditions per place. [2024-05-12 12:21:50,753 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 93 selfloop transitions, 22 changer transitions 0/121 dead transitions. [2024-05-12 12:21:50,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 1088 flow [2024-05-12 12:21:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:21:50,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:21:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-05-12 12:21:50,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2024-05-12 12:21:50,755 INFO L175 Difference]: Start difference. First operand has 78 places, 95 transitions, 749 flow. Second operand 7 states and 115 transitions. [2024-05-12 12:21:50,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 1088 flow [2024-05-12 12:21:50,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 121 transitions, 1050 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-05-12 12:21:50,763 INFO L231 Difference]: Finished difference. Result has 83 places, 102 transitions, 838 flow [2024-05-12 12:21:50,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=838, PETRI_PLACES=83, PETRI_TRANSITIONS=102} [2024-05-12 12:21:50,764 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2024-05-12 12:21:50,764 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 102 transitions, 838 flow [2024-05-12 12:21:50,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:50,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:50,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:50,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 12:21:50,765 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-05-12 12:21:50,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:50,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1487958588, now seen corresponding path program 1 times [2024-05-12 12:21:50,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:50,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936699073] [2024-05-12 12:21:50,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:50,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:53,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:53,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936699073] [2024-05-12 12:21:53,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936699073] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:53,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:53,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:21:53,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232069283] [2024-05-12 12:21:53,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:53,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:21:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:53,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:21:53,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:21:53,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:21:53,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 102 transitions, 838 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:53,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:53,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:21:53,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:54,179 INFO L124 PetriNetUnfolderBase]: 650/1197 cut-off events. [2024-05-12 12:21:54,179 INFO L125 PetriNetUnfolderBase]: For 4687/4687 co-relation queries the response was YES. [2024-05-12 12:21:54,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4944 conditions, 1197 events. 650/1197 cut-off events. For 4687/4687 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6208 event pairs, 148 based on Foata normal form. 2/1156 useless extension candidates. Maximal degree in co-relation 4902. Up to 1009 conditions per place. [2024-05-12 12:21:54,189 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 98 selfloop transitions, 19 changer transitions 0/123 dead transitions. [2024-05-12 12:21:54,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 123 transitions, 1144 flow [2024-05-12 12:21:54,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:21:54,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:21:54,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-05-12 12:21:54,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44841269841269843 [2024-05-12 12:21:54,190 INFO L175 Difference]: Start difference. First operand has 83 places, 102 transitions, 838 flow. Second operand 7 states and 113 transitions. [2024-05-12 12:21:54,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 123 transitions, 1144 flow [2024-05-12 12:21:54,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 123 transitions, 1104 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-05-12 12:21:54,200 INFO L231 Difference]: Finished difference. Result has 87 places, 104 transitions, 863 flow [2024-05-12 12:21:54,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=863, PETRI_PLACES=87, PETRI_TRANSITIONS=104} [2024-05-12 12:21:54,201 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2024-05-12 12:21:54,201 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 104 transitions, 863 flow [2024-05-12 12:21:54,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:54,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:54,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:54,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 12:21:54,202 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-05-12 12:21:54,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:54,202 INFO L85 PathProgramCache]: Analyzing trace with hash -977132461, now seen corresponding path program 1 times [2024-05-12 12:21:54,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:54,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965874384] [2024-05-12 12:21:54,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:54,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:57,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:57,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965874384] [2024-05-12 12:21:57,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965874384] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:57,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:57,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:21:57,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267022366] [2024-05-12 12:21:57,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:57,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:21:57,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:57,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:21:57,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:21:57,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:21:57,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 104 transitions, 863 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:57,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:57,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:21:57,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:57,720 INFO L124 PetriNetUnfolderBase]: 684/1242 cut-off events. [2024-05-12 12:21:57,720 INFO L125 PetriNetUnfolderBase]: For 5215/5215 co-relation queries the response was YES. [2024-05-12 12:21:57,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5227 conditions, 1242 events. 684/1242 cut-off events. For 5215/5215 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6450 event pairs, 106 based on Foata normal form. 1/1202 useless extension candidates. Maximal degree in co-relation 5184. Up to 755 conditions per place. [2024-05-12 12:21:57,728 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 107 selfloop transitions, 46 changer transitions 0/159 dead transitions. [2024-05-12 12:21:57,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 159 transitions, 1524 flow [2024-05-12 12:21:57,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:21:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:21:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-05-12 12:21:57,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 12:21:57,731 INFO L175 Difference]: Start difference. First operand has 87 places, 104 transitions, 863 flow. Second operand 8 states and 144 transitions. [2024-05-12 12:21:57,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 159 transitions, 1524 flow [2024-05-12 12:21:57,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 159 transitions, 1477 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 12:21:57,742 INFO L231 Difference]: Finished difference. Result has 92 places, 122 transitions, 1140 flow [2024-05-12 12:21:57,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1140, PETRI_PLACES=92, PETRI_TRANSITIONS=122} [2024-05-12 12:21:57,742 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 52 predicate places. [2024-05-12 12:21:57,742 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 122 transitions, 1140 flow [2024-05-12 12:21:57,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:57,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:57,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:57,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 12:21:57,743 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-05-12 12:21:57,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:57,743 INFO L85 PathProgramCache]: Analyzing trace with hash -977042251, now seen corresponding path program 2 times [2024-05-12 12:21:57,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:57,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318429883] [2024-05-12 12:21:57,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:57,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:00,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:00,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318429883] [2024-05-12 12:22:00,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318429883] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:00,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:00,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:22:00,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872754365] [2024-05-12 12:22:00,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:00,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:22:00,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:00,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:22:00,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:22:00,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:00,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 122 transitions, 1140 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:00,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:00,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:00,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:01,267 INFO L124 PetriNetUnfolderBase]: 676/1223 cut-off events. [2024-05-12 12:22:01,267 INFO L125 PetriNetUnfolderBase]: For 6045/6045 co-relation queries the response was YES. [2024-05-12 12:22:01,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5572 conditions, 1223 events. 676/1223 cut-off events. For 6045/6045 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6287 event pairs, 97 based on Foata normal form. 3/1187 useless extension candidates. Maximal degree in co-relation 5526. Up to 810 conditions per place. [2024-05-12 12:22:01,275 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 110 selfloop transitions, 41 changer transitions 0/157 dead transitions. [2024-05-12 12:22:01,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 157 transitions, 1616 flow [2024-05-12 12:22:01,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:01,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-05-12 12:22:01,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2024-05-12 12:22:01,277 INFO L175 Difference]: Start difference. First operand has 92 places, 122 transitions, 1140 flow. Second operand 8 states and 142 transitions. [2024-05-12 12:22:01,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 157 transitions, 1616 flow [2024-05-12 12:22:01,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 157 transitions, 1548 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-05-12 12:22:01,293 INFO L231 Difference]: Finished difference. Result has 97 places, 123 transitions, 1173 flow [2024-05-12 12:22:01,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1173, PETRI_PLACES=97, PETRI_TRANSITIONS=123} [2024-05-12 12:22:01,293 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 57 predicate places. [2024-05-12 12:22:01,294 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 123 transitions, 1173 flow [2024-05-12 12:22:01,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:01,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:01,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:01,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 12:22:01,294 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-05-12 12:22:01,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:01,295 INFO L85 PathProgramCache]: Analyzing trace with hash -973317446, now seen corresponding path program 1 times [2024-05-12 12:22:01,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:01,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874602495] [2024-05-12 12:22:01,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:01,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:03,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:03,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874602495] [2024-05-12 12:22:03,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874602495] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:03,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:03,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:22:03,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605838576] [2024-05-12 12:22:03,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:03,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:22:03,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:03,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:22:03,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:22:03,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:03,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 123 transitions, 1173 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:03,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:03,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:03,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:04,388 INFO L124 PetriNetUnfolderBase]: 720/1293 cut-off events. [2024-05-12 12:22:04,389 INFO L125 PetriNetUnfolderBase]: For 7433/7433 co-relation queries the response was YES. [2024-05-12 12:22:04,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6122 conditions, 1293 events. 720/1293 cut-off events. For 7433/7433 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6689 event pairs, 112 based on Foata normal form. 2/1254 useless extension candidates. Maximal degree in co-relation 6074. Up to 716 conditions per place. [2024-05-12 12:22:04,400 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 96 selfloop transitions, 59 changer transitions 0/161 dead transitions. [2024-05-12 12:22:04,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 161 transitions, 1759 flow [2024-05-12 12:22:04,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:22:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:22:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-05-12 12:22:04,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2024-05-12 12:22:04,402 INFO L175 Difference]: Start difference. First operand has 97 places, 123 transitions, 1173 flow. Second operand 7 states and 129 transitions. [2024-05-12 12:22:04,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 161 transitions, 1759 flow [2024-05-12 12:22:04,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 161 transitions, 1712 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-05-12 12:22:04,420 INFO L231 Difference]: Finished difference. Result has 101 places, 131 transitions, 1398 flow [2024-05-12 12:22:04,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1398, PETRI_PLACES=101, PETRI_TRANSITIONS=131} [2024-05-12 12:22:04,421 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 61 predicate places. [2024-05-12 12:22:04,421 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 131 transitions, 1398 flow [2024-05-12 12:22:04,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:04,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:04,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:04,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 12:22:04,421 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-05-12 12:22:04,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:04,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1730082764, now seen corresponding path program 2 times [2024-05-12 12:22:04,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:04,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397428331] [2024-05-12 12:22:04,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:04,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:07,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-05-12 12:22:07,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:07,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397428331] [2024-05-12 12:22:07,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397428331] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:07,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:07,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:22:07,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440069023] [2024-05-12 12:22:07,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:07,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:22:07,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:07,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:22:07,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:22:07,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:07,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 131 transitions, 1398 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:07,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:07,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:07,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:07,780 INFO L124 PetriNetUnfolderBase]: 712/1280 cut-off events. [2024-05-12 12:22:07,780 INFO L125 PetriNetUnfolderBase]: For 8391/8391 co-relation queries the response was YES. [2024-05-12 12:22:07,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6362 conditions, 1280 events. 712/1280 cut-off events. For 8391/8391 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6617 event pairs, 105 based on Foata normal form. 4/1244 useless extension candidates. Maximal degree in co-relation 6312. Up to 712 conditions per place. [2024-05-12 12:22:07,789 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 98 selfloop transitions, 65 changer transitions 0/169 dead transitions. [2024-05-12 12:22:07,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 169 transitions, 1951 flow [2024-05-12 12:22:07,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-05-12 12:22:07,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-05-12 12:22:07,791 INFO L175 Difference]: Start difference. First operand has 101 places, 131 transitions, 1398 flow. Second operand 8 states and 148 transitions. [2024-05-12 12:22:07,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 169 transitions, 1951 flow [2024-05-12 12:22:07,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 169 transitions, 1867 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-05-12 12:22:07,810 INFO L231 Difference]: Finished difference. Result has 108 places, 135 transitions, 1583 flow [2024-05-12 12:22:07,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1583, PETRI_PLACES=108, PETRI_TRANSITIONS=135} [2024-05-12 12:22:07,811 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 68 predicate places. [2024-05-12 12:22:07,811 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 135 transitions, 1583 flow [2024-05-12 12:22:07,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:07,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:07,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:07,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 12:22:07,812 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-05-12 12:22:07,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:07,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1872718529, now seen corresponding path program 1 times [2024-05-12 12:22:07,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:07,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929414245] [2024-05-12 12:22:07,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:07,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:10,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:10,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:10,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929414245] [2024-05-12 12:22:10,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929414245] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:10,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:10,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:10,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209633363] [2024-05-12 12:22:10,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:10,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:10,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:10,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:10,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:10,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:10,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 135 transitions, 1583 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:10,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:10,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:10,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:11,424 INFO L124 PetriNetUnfolderBase]: 714/1280 cut-off events. [2024-05-12 12:22:11,424 INFO L125 PetriNetUnfolderBase]: For 9696/9696 co-relation queries the response was YES. [2024-05-12 12:22:11,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6731 conditions, 1280 events. 714/1280 cut-off events. For 9696/9696 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6542 event pairs, 156 based on Foata normal form. 1/1242 useless extension candidates. Maximal degree in co-relation 6678. Up to 1095 conditions per place. [2024-05-12 12:22:11,434 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 126 selfloop transitions, 28 changer transitions 0/160 dead transitions. [2024-05-12 12:22:11,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 160 transitions, 2049 flow [2024-05-12 12:22:11,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:22:11,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:22:11,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-05-12 12:22:11,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-05-12 12:22:11,438 INFO L175 Difference]: Start difference. First operand has 108 places, 135 transitions, 1583 flow. Second operand 7 states and 116 transitions. [2024-05-12 12:22:11,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 160 transitions, 2049 flow [2024-05-12 12:22:11,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 160 transitions, 1875 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-05-12 12:22:11,462 INFO L231 Difference]: Finished difference. Result has 110 places, 142 transitions, 1602 flow [2024-05-12 12:22:11,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1602, PETRI_PLACES=110, PETRI_TRANSITIONS=142} [2024-05-12 12:22:11,463 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 70 predicate places. [2024-05-12 12:22:11,463 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 142 transitions, 1602 flow [2024-05-12 12:22:11,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:11,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:11,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:11,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 12:22:11,464 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-05-12 12:22:11,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:11,464 INFO L85 PathProgramCache]: Analyzing trace with hash -829225106, now seen corresponding path program 3 times [2024-05-12 12:22:11,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:11,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39700822] [2024-05-12 12:22:11,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:11,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:14,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:14,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39700822] [2024-05-12 12:22:14,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39700822] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:14,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:14,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:22:14,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238504942] [2024-05-12 12:22:14,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:14,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:22:14,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:14,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:22:14,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:22:14,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:14,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 142 transitions, 1602 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:14,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:14,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:14,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:14,951 INFO L124 PetriNetUnfolderBase]: 724/1296 cut-off events. [2024-05-12 12:22:14,952 INFO L125 PetriNetUnfolderBase]: For 9785/9785 co-relation queries the response was YES. [2024-05-12 12:22:14,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6688 conditions, 1296 events. 724/1296 cut-off events. For 9785/9785 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6679 event pairs, 163 based on Foata normal form. 2/1259 useless extension candidates. Maximal degree in co-relation 6633. Up to 1096 conditions per place. [2024-05-12 12:22:14,978 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 133 selfloop transitions, 26 changer transitions 0/165 dead transitions. [2024-05-12 12:22:14,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 165 transitions, 2027 flow [2024-05-12 12:22:14,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:22:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:22:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-05-12 12:22:14,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-05-12 12:22:14,981 INFO L175 Difference]: Start difference. First operand has 110 places, 142 transitions, 1602 flow. Second operand 7 states and 117 transitions. [2024-05-12 12:22:14,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 165 transitions, 2027 flow [2024-05-12 12:22:14,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 165 transitions, 1984 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-05-12 12:22:15,000 INFO L231 Difference]: Finished difference. Result has 114 places, 145 transitions, 1666 flow [2024-05-12 12:22:15,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1666, PETRI_PLACES=114, PETRI_TRANSITIONS=145} [2024-05-12 12:22:15,001 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 74 predicate places. [2024-05-12 12:22:15,001 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 145 transitions, 1666 flow [2024-05-12 12:22:15,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:15,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:15,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:15,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 12:22:15,002 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-05-12 12:22:15,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:15,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1578750848, now seen corresponding path program 1 times [2024-05-12 12:22:15,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:15,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998105170] [2024-05-12 12:22:15,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:15,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:17,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:17,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998105170] [2024-05-12 12:22:17,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998105170] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:17,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:17,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:17,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535824183] [2024-05-12 12:22:17,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:17,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:17,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:17,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:17,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:18,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:18,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 145 transitions, 1666 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:18,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:18,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:18,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:18,564 INFO L124 PetriNetUnfolderBase]: 757/1353 cut-off events. [2024-05-12 12:22:18,564 INFO L125 PetriNetUnfolderBase]: For 10537/10537 co-relation queries the response was YES. [2024-05-12 12:22:18,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7089 conditions, 1353 events. 757/1353 cut-off events. For 10537/10537 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7109 event pairs, 72 based on Foata normal form. 2/1316 useless extension candidates. Maximal degree in co-relation 7033. Up to 949 conditions per place. [2024-05-12 12:22:18,602 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 153 selfloop transitions, 37 changer transitions 0/196 dead transitions. [2024-05-12 12:22:18,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 196 transitions, 2412 flow [2024-05-12 12:22:18,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:18,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-05-12 12:22:18,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2024-05-12 12:22:18,612 INFO L175 Difference]: Start difference. First operand has 114 places, 145 transitions, 1666 flow. Second operand 8 states and 142 transitions. [2024-05-12 12:22:18,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 196 transitions, 2412 flow [2024-05-12 12:22:18,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 196 transitions, 2350 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-05-12 12:22:18,636 INFO L231 Difference]: Finished difference. Result has 118 places, 157 transitions, 1874 flow [2024-05-12 12:22:18,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1874, PETRI_PLACES=118, PETRI_TRANSITIONS=157} [2024-05-12 12:22:18,637 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 78 predicate places. [2024-05-12 12:22:18,637 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 157 transitions, 1874 flow [2024-05-12 12:22:18,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:18,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:18,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:18,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 12:22:18,638 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-05-12 12:22:18,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:18,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1578753638, now seen corresponding path program 2 times [2024-05-12 12:22:18,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:18,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651595749] [2024-05-12 12:22:18,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:18,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:22,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:22,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651595749] [2024-05-12 12:22:22,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651595749] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:22,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:22,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:22,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653689985] [2024-05-12 12:22:22,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:22,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:22,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:22,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:22,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:22,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:22,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 157 transitions, 1874 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:22,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:22,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:22,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:22,719 INFO L124 PetriNetUnfolderBase]: 754/1369 cut-off events. [2024-05-12 12:22:22,719 INFO L125 PetriNetUnfolderBase]: For 10804/10804 co-relation queries the response was YES. [2024-05-12 12:22:22,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7279 conditions, 1369 events. 754/1369 cut-off events. For 10804/10804 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7332 event pairs, 115 based on Foata normal form. 2/1325 useless extension candidates. Maximal degree in co-relation 7221. Up to 1038 conditions per place. [2024-05-12 12:22:22,731 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 153 selfloop transitions, 40 changer transitions 0/199 dead transitions. [2024-05-12 12:22:22,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 199 transitions, 2448 flow [2024-05-12 12:22:22,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:22:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:22:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-05-12 12:22:22,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845679012345679 [2024-05-12 12:22:22,751 INFO L175 Difference]: Start difference. First operand has 118 places, 157 transitions, 1874 flow. Second operand 9 states and 157 transitions. [2024-05-12 12:22:22,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 199 transitions, 2448 flow [2024-05-12 12:22:22,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 199 transitions, 2376 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-05-12 12:22:22,779 INFO L231 Difference]: Finished difference. Result has 124 places, 157 transitions, 1889 flow [2024-05-12 12:22:22,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1802, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1889, PETRI_PLACES=124, PETRI_TRANSITIONS=157} [2024-05-12 12:22:22,780 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 84 predicate places. [2024-05-12 12:22:22,780 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 157 transitions, 1889 flow [2024-05-12 12:22:22,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:22,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:22,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:22,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 12:22:22,781 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-05-12 12:22:22,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:22,781 INFO L85 PathProgramCache]: Analyzing trace with hash -108242254, now seen corresponding path program 1 times [2024-05-12 12:22:22,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:22,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634922024] [2024-05-12 12:22:22,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:22,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:25,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:25,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634922024] [2024-05-12 12:22:25,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634922024] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:25,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:25,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:22:25,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086528681] [2024-05-12 12:22:25,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:25,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:22:25,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:25,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:22:25,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:22:25,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:25,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 157 transitions, 1889 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:25,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:25,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:25,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:26,239 INFO L124 PetriNetUnfolderBase]: 751/1347 cut-off events. [2024-05-12 12:22:26,240 INFO L125 PetriNetUnfolderBase]: For 9981/9981 co-relation queries the response was YES. [2024-05-12 12:22:26,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7162 conditions, 1347 events. 751/1347 cut-off events. For 9981/9981 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7124 event pairs, 106 based on Foata normal form. 2/1308 useless extension candidates. Maximal degree in co-relation 7102. Up to 858 conditions per place. [2024-05-12 12:22:26,271 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 118 selfloop transitions, 65 changer transitions 0/189 dead transitions. [2024-05-12 12:22:26,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 189 transitions, 2399 flow [2024-05-12 12:22:26,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:22:26,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:22:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-05-12 12:22:26,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-05-12 12:22:26,273 INFO L175 Difference]: Start difference. First operand has 124 places, 157 transitions, 1889 flow. Second operand 7 states and 135 transitions. [2024-05-12 12:22:26,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 189 transitions, 2399 flow [2024-05-12 12:22:26,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 189 transitions, 2285 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-05-12 12:22:26,302 INFO L231 Difference]: Finished difference. Result has 123 places, 157 transitions, 1921 flow [2024-05-12 12:22:26,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1775, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1921, PETRI_PLACES=123, PETRI_TRANSITIONS=157} [2024-05-12 12:22:26,303 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 83 predicate places. [2024-05-12 12:22:26,303 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 157 transitions, 1921 flow [2024-05-12 12:22:26,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:26,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:26,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:26,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 12:22:26,303 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-05-12 12:22:26,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:26,304 INFO L85 PathProgramCache]: Analyzing trace with hash -108062330, now seen corresponding path program 1 times [2024-05-12 12:22:26,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:26,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009330610] [2024-05-12 12:22:26,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:26,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:29,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:29,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009330610] [2024-05-12 12:22:29,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009330610] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:29,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:29,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:22:29,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388312541] [2024-05-12 12:22:29,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:29,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:22:29,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:29,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:22:29,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:22:29,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:29,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 157 transitions, 1921 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:29,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:29,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:29,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:30,319 INFO L124 PetriNetUnfolderBase]: 826/1468 cut-off events. [2024-05-12 12:22:30,319 INFO L125 PetriNetUnfolderBase]: For 13235/13235 co-relation queries the response was YES. [2024-05-12 12:22:30,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7783 conditions, 1468 events. 826/1468 cut-off events. For 13235/13235 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7853 event pairs, 114 based on Foata normal form. 10/1439 useless extension candidates. Maximal degree in co-relation 7722. Up to 796 conditions per place. [2024-05-12 12:22:30,330 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 113 selfloop transitions, 79 changer transitions 0/198 dead transitions. [2024-05-12 12:22:30,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 198 transitions, 2513 flow [2024-05-12 12:22:30,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:22:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:22:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-05-12 12:22:30,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2024-05-12 12:22:30,332 INFO L175 Difference]: Start difference. First operand has 123 places, 157 transitions, 1921 flow. Second operand 9 states and 165 transitions. [2024-05-12 12:22:30,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 198 transitions, 2513 flow [2024-05-12 12:22:30,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 198 transitions, 2387 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-05-12 12:22:30,363 INFO L231 Difference]: Finished difference. Result has 127 places, 162 transitions, 2021 flow [2024-05-12 12:22:30,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2021, PETRI_PLACES=127, PETRI_TRANSITIONS=162} [2024-05-12 12:22:30,364 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 87 predicate places. [2024-05-12 12:22:30,364 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 162 transitions, 2021 flow [2024-05-12 12:22:30,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:30,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:30,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:30,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 12:22:30,365 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-05-12 12:22:30,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:30,365 INFO L85 PathProgramCache]: Analyzing trace with hash 295917954, now seen corresponding path program 2 times [2024-05-12 12:22:30,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:30,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639004130] [2024-05-12 12:22:30,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:30,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:33,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:33,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639004130] [2024-05-12 12:22:33,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639004130] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:33,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:33,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:22:33,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280639370] [2024-05-12 12:22:33,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:33,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:22:33,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:33,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:22:33,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:22:33,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:33,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 162 transitions, 2021 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:33,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:33,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:33,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:34,117 INFO L124 PetriNetUnfolderBase]: 844/1501 cut-off events. [2024-05-12 12:22:34,117 INFO L125 PetriNetUnfolderBase]: For 13226/13226 co-relation queries the response was YES. [2024-05-12 12:22:34,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8204 conditions, 1501 events. 844/1501 cut-off events. For 13226/13226 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8060 event pairs, 179 based on Foata normal form. 2/1463 useless extension candidates. Maximal degree in co-relation 8142. Up to 1301 conditions per place. [2024-05-12 12:22:34,129 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 156 selfloop transitions, 27 changer transitions 0/189 dead transitions. [2024-05-12 12:22:34,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 189 transitions, 2493 flow [2024-05-12 12:22:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:34,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-05-12 12:22:34,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4513888888888889 [2024-05-12 12:22:34,138 INFO L175 Difference]: Start difference. First operand has 127 places, 162 transitions, 2021 flow. Second operand 8 states and 130 transitions. [2024-05-12 12:22:34,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 189 transitions, 2493 flow [2024-05-12 12:22:34,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 189 transitions, 2305 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-05-12 12:22:34,178 INFO L231 Difference]: Finished difference. Result has 129 places, 167 transitions, 1956 flow [2024-05-12 12:22:34,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1833, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1956, PETRI_PLACES=129, PETRI_TRANSITIONS=167} [2024-05-12 12:22:34,179 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 89 predicate places. [2024-05-12 12:22:34,179 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 167 transitions, 1956 flow [2024-05-12 12:22:34,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:34,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:34,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:34,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 12:22:34,180 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-05-12 12:22:34,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:34,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1816979326, now seen corresponding path program 1 times [2024-05-12 12:22:34,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:34,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039329980] [2024-05-12 12:22:34,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:34,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:37,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:37,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039329980] [2024-05-12 12:22:37,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039329980] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:37,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:37,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:37,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118398832] [2024-05-12 12:22:37,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:37,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:37,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:37,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:37,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:37,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:37,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 167 transitions, 1956 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:37,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:37,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:37,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:37,905 INFO L124 PetriNetUnfolderBase]: 843/1499 cut-off events. [2024-05-12 12:22:37,905 INFO L125 PetriNetUnfolderBase]: For 12398/12398 co-relation queries the response was YES. [2024-05-12 12:22:37,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7895 conditions, 1499 events. 843/1499 cut-off events. For 12398/12398 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8060 event pairs, 181 based on Foata normal form. 1/1460 useless extension candidates. Maximal degree in co-relation 7831. Up to 1279 conditions per place. [2024-05-12 12:22:37,917 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 153 selfloop transitions, 34 changer transitions 0/193 dead transitions. [2024-05-12 12:22:37,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 193 transitions, 2457 flow [2024-05-12 12:22:37,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:37,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-05-12 12:22:37,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-05-12 12:22:37,932 INFO L175 Difference]: Start difference. First operand has 129 places, 167 transitions, 1956 flow. Second operand 8 states and 132 transitions. [2024-05-12 12:22:37,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 193 transitions, 2457 flow [2024-05-12 12:22:37,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 193 transitions, 2350 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-05-12 12:22:37,970 INFO L231 Difference]: Finished difference. Result has 132 places, 170 transitions, 1986 flow [2024-05-12 12:22:37,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1855, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1986, PETRI_PLACES=132, PETRI_TRANSITIONS=170} [2024-05-12 12:22:37,986 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 92 predicate places. [2024-05-12 12:22:37,987 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 170 transitions, 1986 flow [2024-05-12 12:22:37,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:37,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:37,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:37,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 12:22:37,987 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-05-12 12:22:37,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:37,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1164002070, now seen corresponding path program 3 times [2024-05-12 12:22:37,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:37,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172522090] [2024-05-12 12:22:37,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:37,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:41,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:41,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172522090] [2024-05-12 12:22:41,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172522090] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:41,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:41,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:22:41,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019784653] [2024-05-12 12:22:41,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:41,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:22:41,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:41,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:22:41,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:22:41,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:41,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 170 transitions, 1986 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:41,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:41,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:41,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:41,864 INFO L124 PetriNetUnfolderBase]: 858/1521 cut-off events. [2024-05-12 12:22:41,865 INFO L125 PetriNetUnfolderBase]: For 13494/13494 co-relation queries the response was YES. [2024-05-12 12:22:41,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8017 conditions, 1521 events. 858/1521 cut-off events. For 13494/13494 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8172 event pairs, 180 based on Foata normal form. 2/1484 useless extension candidates. Maximal degree in co-relation 7952. Up to 1287 conditions per place. [2024-05-12 12:22:41,876 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 156 selfloop transitions, 35 changer transitions 0/197 dead transitions. [2024-05-12 12:22:41,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 197 transitions, 2490 flow [2024-05-12 12:22:41,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:41,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-05-12 12:22:41,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-05-12 12:22:41,878 INFO L175 Difference]: Start difference. First operand has 132 places, 170 transitions, 1986 flow. Second operand 8 states and 132 transitions. [2024-05-12 12:22:41,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 197 transitions, 2490 flow [2024-05-12 12:22:41,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 197 transitions, 2410 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-05-12 12:22:41,915 INFO L231 Difference]: Finished difference. Result has 134 places, 172 transitions, 2019 flow [2024-05-12 12:22:41,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1906, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2019, PETRI_PLACES=134, PETRI_TRANSITIONS=172} [2024-05-12 12:22:41,916 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 94 predicate places. [2024-05-12 12:22:41,916 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 172 transitions, 2019 flow [2024-05-12 12:22:41,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:41,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:41,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:41,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 12:22:41,917 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-05-12 12:22:41,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:41,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1920882484, now seen corresponding path program 4 times [2024-05-12 12:22:41,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:41,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900819165] [2024-05-12 12:22:41,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:41,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:45,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:45,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900819165] [2024-05-12 12:22:45,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900819165] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:45,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:45,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:22:45,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301821128] [2024-05-12 12:22:45,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:45,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:22:45,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:45,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:22:45,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:22:45,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:45,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 172 transitions, 2019 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:45,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:45,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:45,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:45,850 INFO L124 PetriNetUnfolderBase]: 873/1546 cut-off events. [2024-05-12 12:22:45,850 INFO L125 PetriNetUnfolderBase]: For 14252/14252 co-relation queries the response was YES. [2024-05-12 12:22:45,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8239 conditions, 1546 events. 873/1546 cut-off events. For 14252/14252 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8330 event pairs, 185 based on Foata normal form. 2/1509 useless extension candidates. Maximal degree in co-relation 8173. Up to 1352 conditions per place. [2024-05-12 12:22:45,862 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 164 selfloop transitions, 27 changer transitions 0/197 dead transitions. [2024-05-12 12:22:45,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 197 transitions, 2511 flow [2024-05-12 12:22:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-05-12 12:22:45,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4513888888888889 [2024-05-12 12:22:45,864 INFO L175 Difference]: Start difference. First operand has 134 places, 172 transitions, 2019 flow. Second operand 8 states and 130 transitions. [2024-05-12 12:22:45,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 197 transitions, 2511 flow [2024-05-12 12:22:45,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 197 transitions, 2414 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-05-12 12:22:45,904 INFO L231 Difference]: Finished difference. Result has 136 places, 174 transitions, 2023 flow [2024-05-12 12:22:45,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2023, PETRI_PLACES=136, PETRI_TRANSITIONS=174} [2024-05-12 12:22:45,904 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 96 predicate places. [2024-05-12 12:22:45,905 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 174 transitions, 2023 flow [2024-05-12 12:22:45,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:45,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:45,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:45,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 12:22:45,905 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-05-12 12:22:45,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:45,906 INFO L85 PathProgramCache]: Analyzing trace with hash 37304484, now seen corresponding path program 5 times [2024-05-12 12:22:45,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:45,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63758815] [2024-05-12 12:22:45,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:45,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:49,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:49,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63758815] [2024-05-12 12:22:49,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63758815] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:49,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:49,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:22:49,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656237126] [2024-05-12 12:22:49,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:49,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:22:49,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:49,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:22:49,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:22:49,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:49,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 174 transitions, 2023 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:49,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:49,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:49,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:49,793 INFO L124 PetriNetUnfolderBase]: 873/1552 cut-off events. [2024-05-12 12:22:49,794 INFO L125 PetriNetUnfolderBase]: For 14088/14088 co-relation queries the response was YES. [2024-05-12 12:22:49,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8157 conditions, 1552 events. 873/1552 cut-off events. For 14088/14088 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8420 event pairs, 181 based on Foata normal form. 2/1513 useless extension candidates. Maximal degree in co-relation 8090. Up to 1325 conditions per place. [2024-05-12 12:22:49,805 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 161 selfloop transitions, 32 changer transitions 0/199 dead transitions. [2024-05-12 12:22:49,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 199 transitions, 2523 flow [2024-05-12 12:22:49,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-05-12 12:22:49,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4548611111111111 [2024-05-12 12:22:49,807 INFO L175 Difference]: Start difference. First operand has 136 places, 174 transitions, 2023 flow. Second operand 8 states and 131 transitions. [2024-05-12 12:22:49,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 199 transitions, 2523 flow [2024-05-12 12:22:49,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 199 transitions, 2438 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-05-12 12:22:49,865 INFO L231 Difference]: Finished difference. Result has 138 places, 176 transitions, 2056 flow [2024-05-12 12:22:49,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1938, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2056, PETRI_PLACES=138, PETRI_TRANSITIONS=176} [2024-05-12 12:22:49,871 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 98 predicate places. [2024-05-12 12:22:49,871 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 176 transitions, 2056 flow [2024-05-12 12:22:49,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:49,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:49,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:49,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 12:22:49,872 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:49,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:49,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1158054854, now seen corresponding path program 1 times [2024-05-12 12:22:49,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:49,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744778176] [2024-05-12 12:22:49,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:49,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:50,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:50,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744778176] [2024-05-12 12:22:50,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744778176] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:50,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:50,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:22:50,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568273221] [2024-05-12 12:22:50,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:50,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:22:50,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:50,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:22:50,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:22:50,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-05-12 12:22:50,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 176 transitions, 2056 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:50,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:50,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-05-12 12:22:50,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:50,385 INFO L124 PetriNetUnfolderBase]: 847/1599 cut-off events. [2024-05-12 12:22:50,386 INFO L125 PetriNetUnfolderBase]: For 13400/13431 co-relation queries the response was YES. [2024-05-12 12:22:50,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8119 conditions, 1599 events. 847/1599 cut-off events. For 13400/13431 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 9707 event pairs, 149 based on Foata normal form. 27/1567 useless extension candidates. Maximal degree in co-relation 8051. Up to 882 conditions per place. [2024-05-12 12:22:50,398 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 123 selfloop transitions, 8 changer transitions 46/237 dead transitions. [2024-05-12 12:22:50,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 237 transitions, 2943 flow [2024-05-12 12:22:50,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-05-12 12:22:50,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-05-12 12:22:50,399 INFO L175 Difference]: Start difference. First operand has 138 places, 176 transitions, 2056 flow. Second operand 8 states and 160 transitions. [2024-05-12 12:22:50,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 237 transitions, 2943 flow [2024-05-12 12:22:50,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 237 transitions, 2835 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-05-12 12:22:50,439 INFO L231 Difference]: Finished difference. Result has 143 places, 170 transitions, 1932 flow [2024-05-12 12:22:50,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1958, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1932, PETRI_PLACES=143, PETRI_TRANSITIONS=170} [2024-05-12 12:22:50,440 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 103 predicate places. [2024-05-12 12:22:50,440 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 170 transitions, 1932 flow [2024-05-12 12:22:50,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:50,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:50,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:50,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 12:22:50,440 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-05-12 12:22:50,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:50,441 INFO L85 PathProgramCache]: Analyzing trace with hash -753581501, now seen corresponding path program 1 times [2024-05-12 12:22:50,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:50,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309869673] [2024-05-12 12:22:50,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:50,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:54,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:54,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309869673] [2024-05-12 12:22:54,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309869673] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:54,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:54,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:54,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933744987] [2024-05-12 12:22:54,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:54,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:54,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:54,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:54,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:54,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:54,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 170 transitions, 1932 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:54,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:54,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:54,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:55,253 INFO L124 PetriNetUnfolderBase]: 1485/2567 cut-off events. [2024-05-12 12:22:55,254 INFO L125 PetriNetUnfolderBase]: For 26076/26078 co-relation queries the response was YES. [2024-05-12 12:22:55,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13421 conditions, 2567 events. 1485/2567 cut-off events. For 26076/26078 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 15207 event pairs, 206 based on Foata normal form. 9/2575 useless extension candidates. Maximal degree in co-relation 13350. Up to 1043 conditions per place. [2024-05-12 12:22:55,276 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 184 selfloop transitions, 106 changer transitions 0/296 dead transitions. [2024-05-12 12:22:55,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 296 transitions, 3730 flow [2024-05-12 12:22:55,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:22:55,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:22:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-05-12 12:22:55,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5246913580246914 [2024-05-12 12:22:55,278 INFO L175 Difference]: Start difference. First operand has 143 places, 170 transitions, 1932 flow. Second operand 9 states and 170 transitions. [2024-05-12 12:22:55,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 296 transitions, 3730 flow [2024-05-12 12:22:55,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 296 transitions, 3638 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-05-12 12:22:55,341 INFO L231 Difference]: Finished difference. Result has 145 places, 220 transitions, 2782 flow [2024-05-12 12:22:55,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1866, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2782, PETRI_PLACES=145, PETRI_TRANSITIONS=220} [2024-05-12 12:22:55,342 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 105 predicate places. [2024-05-12 12:22:55,342 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 220 transitions, 2782 flow [2024-05-12 12:22:55,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:55,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:55,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:55,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 12:22:55,343 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-05-12 12:22:55,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:55,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1571685329, now seen corresponding path program 2 times [2024-05-12 12:22:55,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:55,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630125745] [2024-05-12 12:22:55,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:55,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:58,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:58,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630125745] [2024-05-12 12:22:58,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630125745] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:58,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:58,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:58,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037355246] [2024-05-12 12:22:58,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:58,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:58,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:58,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:58,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:58,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:22:58,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 220 transitions, 2782 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:58,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:58,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:22:58,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:59,336 INFO L124 PetriNetUnfolderBase]: 1603/2748 cut-off events. [2024-05-12 12:22:59,336 INFO L125 PetriNetUnfolderBase]: For 31831/31833 co-relation queries the response was YES. [2024-05-12 12:22:59,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15164 conditions, 2748 events. 1603/2748 cut-off events. For 31831/31833 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 16360 event pairs, 314 based on Foata normal form. 9/2757 useless extension candidates. Maximal degree in co-relation 15092. Up to 1037 conditions per place. [2024-05-12 12:22:59,359 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 146 selfloop transitions, 120 changer transitions 0/272 dead transitions. [2024-05-12 12:22:59,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 272 transitions, 3717 flow [2024-05-12 12:22:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:22:59,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:22:59,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-05-12 12:22:59,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49691358024691357 [2024-05-12 12:22:59,361 INFO L175 Difference]: Start difference. First operand has 145 places, 220 transitions, 2782 flow. Second operand 9 states and 161 transitions. [2024-05-12 12:22:59,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 272 transitions, 3717 flow [2024-05-12 12:22:59,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 272 transitions, 3687 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-05-12 12:22:59,438 INFO L231 Difference]: Finished difference. Result has 154 places, 227 transitions, 3195 flow [2024-05-12 12:22:59,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2752, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3195, PETRI_PLACES=154, PETRI_TRANSITIONS=227} [2024-05-12 12:22:59,439 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 114 predicate places. [2024-05-12 12:22:59,439 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 227 transitions, 3195 flow [2024-05-12 12:22:59,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:59,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:59,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:59,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 12:22:59,439 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-05-12 12:22:59,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:59,440 INFO L85 PathProgramCache]: Analyzing trace with hash 260040975, now seen corresponding path program 3 times [2024-05-12 12:22:59,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:59,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623701765] [2024-05-12 12:22:59,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:59,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:02,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:02,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623701765] [2024-05-12 12:23:02,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623701765] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:02,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:02,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:02,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395646643] [2024-05-12 12:23:02,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:02,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:02,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:02,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:02,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:02,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:02,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 227 transitions, 3195 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:02,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:02,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:02,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:03,027 INFO L124 PetriNetUnfolderBase]: 1862/3209 cut-off events. [2024-05-12 12:23:03,027 INFO L125 PetriNetUnfolderBase]: For 49103/49111 co-relation queries the response was YES. [2024-05-12 12:23:03,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18281 conditions, 3209 events. 1862/3209 cut-off events. For 49103/49111 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 20043 event pairs, 312 based on Foata normal form. 23/3231 useless extension candidates. Maximal degree in co-relation 18205. Up to 1536 conditions per place. [2024-05-12 12:23:03,052 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 158 selfloop transitions, 122 changer transitions 0/286 dead transitions. [2024-05-12 12:23:03,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 286 transitions, 4172 flow [2024-05-12 12:23:03,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:23:03,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:23:03,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-05-12 12:23:03,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2024-05-12 12:23:03,054 INFO L175 Difference]: Start difference. First operand has 154 places, 227 transitions, 3195 flow. Second operand 10 states and 187 transitions. [2024-05-12 12:23:03,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 286 transitions, 4172 flow [2024-05-12 12:23:03,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 286 transitions, 4007 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-05-12 12:23:03,177 INFO L231 Difference]: Finished difference. Result has 160 places, 233 transitions, 3443 flow [2024-05-12 12:23:03,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3032, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3443, PETRI_PLACES=160, PETRI_TRANSITIONS=233} [2024-05-12 12:23:03,178 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 120 predicate places. [2024-05-12 12:23:03,178 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 233 transitions, 3443 flow [2024-05-12 12:23:03,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:03,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:03,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:03,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 12:23:03,178 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-05-12 12:23:03,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:03,179 INFO L85 PathProgramCache]: Analyzing trace with hash 263763765, now seen corresponding path program 4 times [2024-05-12 12:23:03,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:03,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018021835] [2024-05-12 12:23:03,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:03,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:06,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:06,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018021835] [2024-05-12 12:23:06,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018021835] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:06,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:06,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:23:06,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040095990] [2024-05-12 12:23:06,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:06,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:23:06,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:06,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:23:06,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:23:06,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:06,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 233 transitions, 3443 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:06,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:06,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:06,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:07,395 INFO L124 PetriNetUnfolderBase]: 1953/3374 cut-off events. [2024-05-12 12:23:07,395 INFO L125 PetriNetUnfolderBase]: For 50235/50243 co-relation queries the response was YES. [2024-05-12 12:23:07,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19554 conditions, 3374 events. 1953/3374 cut-off events. For 50235/50243 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 21423 event pairs, 403 based on Foata normal form. 27/3400 useless extension candidates. Maximal degree in co-relation 19476. Up to 2446 conditions per place. [2024-05-12 12:23:07,425 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 181 selfloop transitions, 89 changer transitions 0/276 dead transitions. [2024-05-12 12:23:07,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 276 transitions, 4268 flow [2024-05-12 12:23:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:23:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:23:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-05-12 12:23:07,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-05-12 12:23:07,427 INFO L175 Difference]: Start difference. First operand has 160 places, 233 transitions, 3443 flow. Second operand 8 states and 146 transitions. [2024-05-12 12:23:07,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 276 transitions, 4268 flow [2024-05-12 12:23:07,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 276 transitions, 4122 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-05-12 12:23:07,574 INFO L231 Difference]: Finished difference. Result has 164 places, 239 transitions, 3620 flow [2024-05-12 12:23:07,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3309, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3620, PETRI_PLACES=164, PETRI_TRANSITIONS=239} [2024-05-12 12:23:07,575 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 124 predicate places. [2024-05-12 12:23:07,575 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 239 transitions, 3620 flow [2024-05-12 12:23:07,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:07,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:07,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:07,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 12:23:07,575 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:07,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:07,576 INFO L85 PathProgramCache]: Analyzing trace with hash 939310063, now seen corresponding path program 5 times [2024-05-12 12:23:07,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:07,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652361867] [2024-05-12 12:23:07,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:07,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:10,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:10,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652361867] [2024-05-12 12:23:10,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652361867] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:10,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:10,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:23:10,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57627500] [2024-05-12 12:23:10,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:10,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:23:10,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:10,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:23:10,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:23:11,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:11,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 239 transitions, 3620 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:11,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:11,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:11,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:12,065 INFO L124 PetriNetUnfolderBase]: 2171/3767 cut-off events. [2024-05-12 12:23:12,066 INFO L125 PetriNetUnfolderBase]: For 58292/58300 co-relation queries the response was YES. [2024-05-12 12:23:12,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22029 conditions, 3767 events. 2171/3767 cut-off events. For 58292/58300 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 24690 event pairs, 370 based on Foata normal form. 23/3790 useless extension candidates. Maximal degree in co-relation 21949. Up to 2189 conditions per place. [2024-05-12 12:23:12,096 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 164 selfloop transitions, 120 changer transitions 0/290 dead transitions. [2024-05-12 12:23:12,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 290 transitions, 4577 flow [2024-05-12 12:23:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-05-12 12:23:12,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-05-12 12:23:12,098 INFO L175 Difference]: Start difference. First operand has 164 places, 239 transitions, 3620 flow. Second operand 9 states and 167 transitions. [2024-05-12 12:23:12,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 290 transitions, 4577 flow [2024-05-12 12:23:12,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 290 transitions, 4387 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-05-12 12:23:12,265 INFO L231 Difference]: Finished difference. Result has 168 places, 245 transitions, 3851 flow [2024-05-12 12:23:12,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3430, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3851, PETRI_PLACES=168, PETRI_TRANSITIONS=245} [2024-05-12 12:23:12,266 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 128 predicate places. [2024-05-12 12:23:12,266 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 245 transitions, 3851 flow [2024-05-12 12:23:12,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:12,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:12,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:12,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 12:23:12,266 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-05-12 12:23:12,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:12,267 INFO L85 PathProgramCache]: Analyzing trace with hash 939313783, now seen corresponding path program 6 times [2024-05-12 12:23:12,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:12,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105231927] [2024-05-12 12:23:12,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:12,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:15,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:15,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105231927] [2024-05-12 12:23:15,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105231927] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:15,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:15,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:23:15,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320554083] [2024-05-12 12:23:15,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:15,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:23:15,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:15,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:23:15,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:23:15,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:15,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 245 transitions, 3851 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:15,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:15,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:15,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:16,515 INFO L124 PetriNetUnfolderBase]: 2331/4047 cut-off events. [2024-05-12 12:23:16,515 INFO L125 PetriNetUnfolderBase]: For 66809/66817 co-relation queries the response was YES. [2024-05-12 12:23:16,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23595 conditions, 4047 events. 2331/4047 cut-off events. For 66809/66817 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 27112 event pairs, 483 based on Foata normal form. 31/4078 useless extension candidates. Maximal degree in co-relation 23513. Up to 2880 conditions per place. [2024-05-12 12:23:16,551 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 166 selfloop transitions, 117 changer transitions 0/289 dead transitions. [2024-05-12 12:23:16,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 289 transitions, 4663 flow [2024-05-12 12:23:16,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-05-12 12:23:16,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2024-05-12 12:23:16,552 INFO L175 Difference]: Start difference. First operand has 168 places, 245 transitions, 3851 flow. Second operand 9 states and 164 transitions. [2024-05-12 12:23:16,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 289 transitions, 4663 flow [2024-05-12 12:23:16,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 289 transitions, 4474 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-05-12 12:23:16,760 INFO L231 Difference]: Finished difference. Result has 172 places, 248 transitions, 3984 flow [2024-05-12 12:23:16,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3666, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3984, PETRI_PLACES=172, PETRI_TRANSITIONS=248} [2024-05-12 12:23:16,761 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 132 predicate places. [2024-05-12 12:23:16,761 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 248 transitions, 3984 flow [2024-05-12 12:23:16,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:16,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:16,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:16,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 12:23:16,762 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-05-12 12:23:16,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:16,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1325337093, now seen corresponding path program 1 times [2024-05-12 12:23:16,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:16,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854366730] [2024-05-12 12:23:16,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:16,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:20,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:20,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854366730] [2024-05-12 12:23:20,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854366730] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:20,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:20,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:20,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898712839] [2024-05-12 12:23:20,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:20,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:20,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:20,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:20,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:20,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:20,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 248 transitions, 3984 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:20,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:20,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:20,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:21,329 INFO L124 PetriNetUnfolderBase]: 2354/4085 cut-off events. [2024-05-12 12:23:21,329 INFO L125 PetriNetUnfolderBase]: For 60775/60777 co-relation queries the response was YES. [2024-05-12 12:23:21,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24216 conditions, 4085 events. 2354/4085 cut-off events. For 60775/60777 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 27456 event pairs, 491 based on Foata normal form. 5/4090 useless extension candidates. Maximal degree in co-relation 24132. Up to 3157 conditions per place. [2024-05-12 12:23:21,363 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 164 selfloop transitions, 115 changer transitions 0/285 dead transitions. [2024-05-12 12:23:21,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 285 transitions, 4755 flow [2024-05-12 12:23:21,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-05-12 12:23:21,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783950617283951 [2024-05-12 12:23:21,364 INFO L175 Difference]: Start difference. First operand has 172 places, 248 transitions, 3984 flow. Second operand 9 states and 155 transitions. [2024-05-12 12:23:21,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 285 transitions, 4755 flow [2024-05-12 12:23:21,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 285 transitions, 4500 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-05-12 12:23:21,580 INFO L231 Difference]: Finished difference. Result has 174 places, 251 transitions, 4045 flow [2024-05-12 12:23:21,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3729, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4045, PETRI_PLACES=174, PETRI_TRANSITIONS=251} [2024-05-12 12:23:21,581 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 134 predicate places. [2024-05-12 12:23:21,581 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 251 transitions, 4045 flow [2024-05-12 12:23:21,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:21,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:21,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:21,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 12:23:21,581 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-05-12 12:23:21,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:21,582 INFO L85 PathProgramCache]: Analyzing trace with hash 939457933, now seen corresponding path program 7 times [2024-05-12 12:23:21,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:21,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135408961] [2024-05-12 12:23:21,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:21,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:25,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:25,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135408961] [2024-05-12 12:23:25,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135408961] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:25,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:25,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:23:25,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990097608] [2024-05-12 12:23:25,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:25,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:23:25,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:25,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:23:25,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:23:25,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:25,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 251 transitions, 4045 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:25,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:25,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:25,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:26,297 INFO L124 PetriNetUnfolderBase]: 2410/4191 cut-off events. [2024-05-12 12:23:26,297 INFO L125 PetriNetUnfolderBase]: For 64197/64205 co-relation queries the response was YES. [2024-05-12 12:23:26,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24503 conditions, 4191 events. 2410/4191 cut-off events. For 64197/64205 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 28276 event pairs, 407 based on Foata normal form. 27/4218 useless extension candidates. Maximal degree in co-relation 24418. Up to 3138 conditions per place. [2024-05-12 12:23:26,332 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 191 selfloop transitions, 101 changer transitions 0/298 dead transitions. [2024-05-12 12:23:26,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 298 transitions, 4885 flow [2024-05-12 12:23:26,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:26,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-05-12 12:23:26,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-05-12 12:23:26,334 INFO L175 Difference]: Start difference. First operand has 174 places, 251 transitions, 4045 flow. Second operand 9 states and 167 transitions. [2024-05-12 12:23:26,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 298 transitions, 4885 flow [2024-05-12 12:23:26,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 298 transitions, 4610 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-05-12 12:23:26,565 INFO L231 Difference]: Finished difference. Result has 176 places, 253 transitions, 4058 flow [2024-05-12 12:23:26,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3770, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4058, PETRI_PLACES=176, PETRI_TRANSITIONS=253} [2024-05-12 12:23:26,565 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 136 predicate places. [2024-05-12 12:23:26,565 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 253 transitions, 4058 flow [2024-05-12 12:23:26,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:26,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:26,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:26,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 12:23:26,566 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-05-12 12:23:26,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:26,566 INFO L85 PathProgramCache]: Analyzing trace with hash 945035515, now seen corresponding path program 2 times [2024-05-12 12:23:26,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:26,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118903049] [2024-05-12 12:23:26,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:26,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:29,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:29,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118903049] [2024-05-12 12:23:29,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118903049] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:29,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:29,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:29,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611778613] [2024-05-12 12:23:29,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:29,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:29,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:29,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:29,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:30,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:30,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 253 transitions, 4058 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:30,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:30,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:30,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:31,075 INFO L124 PetriNetUnfolderBase]: 2479/4326 cut-off events. [2024-05-12 12:23:31,075 INFO L125 PetriNetUnfolderBase]: For 66173/66175 co-relation queries the response was YES. [2024-05-12 12:23:31,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25314 conditions, 4326 events. 2479/4326 cut-off events. For 66173/66175 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 29616 event pairs, 516 based on Foata normal form. 5/4331 useless extension candidates. Maximal degree in co-relation 25228. Up to 2702 conditions per place. [2024-05-12 12:23:31,109 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 162 selfloop transitions, 128 changer transitions 0/296 dead transitions. [2024-05-12 12:23:31,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 296 transitions, 4995 flow [2024-05-12 12:23:31,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-05-12 12:23:31,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2024-05-12 12:23:31,110 INFO L175 Difference]: Start difference. First operand has 176 places, 253 transitions, 4058 flow. Second operand 9 states and 160 transitions. [2024-05-12 12:23:31,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 296 transitions, 4995 flow [2024-05-12 12:23:31,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 296 transitions, 4794 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-05-12 12:23:31,316 INFO L231 Difference]: Finished difference. Result has 180 places, 258 transitions, 4295 flow [2024-05-12 12:23:31,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3857, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4295, PETRI_PLACES=180, PETRI_TRANSITIONS=258} [2024-05-12 12:23:31,317 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 140 predicate places. [2024-05-12 12:23:31,317 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 258 transitions, 4295 flow [2024-05-12 12:23:31,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:31,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:31,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:31,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 12:23:31,317 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-05-12 12:23:31,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:31,318 INFO L85 PathProgramCache]: Analyzing trace with hash -775989701, now seen corresponding path program 3 times [2024-05-12 12:23:31,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:31,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522310894] [2024-05-12 12:23:31,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:31,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:34,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:34,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:34,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522310894] [2024-05-12 12:23:34,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522310894] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:34,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:34,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:34,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951762238] [2024-05-12 12:23:34,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:34,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:34,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:34,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:34,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:34,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:34,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 258 transitions, 4295 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:34,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:34,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:34,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:35,760 INFO L124 PetriNetUnfolderBase]: 2503/4367 cut-off events. [2024-05-12 12:23:35,760 INFO L125 PetriNetUnfolderBase]: For 68129/68131 co-relation queries the response was YES. [2024-05-12 12:23:35,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26039 conditions, 4367 events. 2503/4367 cut-off events. For 68129/68131 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 29949 event pairs, 1154 based on Foata normal form. 3/4370 useless extension candidates. Maximal degree in co-relation 25951. Up to 4108 conditions per place. [2024-05-12 12:23:35,803 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 249 selfloop transitions, 34 changer transitions 0/289 dead transitions. [2024-05-12 12:23:35,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 289 transitions, 5056 flow [2024-05-12 12:23:35,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-05-12 12:23:35,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44753086419753085 [2024-05-12 12:23:35,805 INFO L175 Difference]: Start difference. First operand has 180 places, 258 transitions, 4295 flow. Second operand 9 states and 145 transitions. [2024-05-12 12:23:35,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 289 transitions, 5056 flow [2024-05-12 12:23:36,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 289 transitions, 4776 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-05-12 12:23:36,056 INFO L231 Difference]: Finished difference. Result has 183 places, 261 transitions, 4181 flow [2024-05-12 12:23:36,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4015, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4181, PETRI_PLACES=183, PETRI_TRANSITIONS=261} [2024-05-12 12:23:36,059 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 143 predicate places. [2024-05-12 12:23:36,059 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 261 transitions, 4181 flow [2024-05-12 12:23:36,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:36,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:36,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:36,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 12:23:36,060 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-05-12 12:23:36,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:36,060 INFO L85 PathProgramCache]: Analyzing trace with hash -775982261, now seen corresponding path program 4 times [2024-05-12 12:23:36,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:36,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312815853] [2024-05-12 12:23:36,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:36,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:39,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:39,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312815853] [2024-05-12 12:23:39,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312815853] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:39,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:39,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:39,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915556721] [2024-05-12 12:23:39,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:39,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:39,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:39,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:39,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:39,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:39,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 261 transitions, 4181 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:39,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:39,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:39,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:40,685 INFO L124 PetriNetUnfolderBase]: 2529/4409 cut-off events. [2024-05-12 12:23:40,685 INFO L125 PetriNetUnfolderBase]: For 69699/69701 co-relation queries the response was YES. [2024-05-12 12:23:40,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25922 conditions, 4409 events. 2529/4409 cut-off events. For 69699/69701 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 30253 event pairs, 1170 based on Foata normal form. 3/4412 useless extension candidates. Maximal degree in co-relation 25833. Up to 4086 conditions per place. [2024-05-12 12:23:40,722 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 247 selfloop transitions, 39 changer transitions 0/292 dead transitions. [2024-05-12 12:23:40,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 292 transitions, 4941 flow [2024-05-12 12:23:40,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:40,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-05-12 12:23:40,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4506172839506173 [2024-05-12 12:23:40,724 INFO L175 Difference]: Start difference. First operand has 183 places, 261 transitions, 4181 flow. Second operand 9 states and 146 transitions. [2024-05-12 12:23:40,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 292 transitions, 4941 flow [2024-05-12 12:23:40,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 292 transitions, 4822 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-05-12 12:23:40,955 INFO L231 Difference]: Finished difference. Result has 186 places, 264 transitions, 4233 flow [2024-05-12 12:23:40,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4062, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4233, PETRI_PLACES=186, PETRI_TRANSITIONS=264} [2024-05-12 12:23:40,956 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 146 predicate places. [2024-05-12 12:23:40,957 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 264 transitions, 4233 flow [2024-05-12 12:23:40,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:40,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:40,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:40,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 12:23:40,957 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-05-12 12:23:40,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:40,958 INFO L85 PathProgramCache]: Analyzing trace with hash -481685621, now seen corresponding path program 5 times [2024-05-12 12:23:40,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:40,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074795296] [2024-05-12 12:23:40,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:40,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:43,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:43,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074795296] [2024-05-12 12:23:43,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074795296] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:43,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:43,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:43,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132134575] [2024-05-12 12:23:43,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:43,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:43,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:43,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:43,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:44,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:44,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 264 transitions, 4233 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:44,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:44,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:44,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:45,218 INFO L124 PetriNetUnfolderBase]: 2527/4407 cut-off events. [2024-05-12 12:23:45,219 INFO L125 PetriNetUnfolderBase]: For 70741/70743 co-relation queries the response was YES. [2024-05-12 12:23:45,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25881 conditions, 4407 events. 2527/4407 cut-off events. For 70741/70743 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 30134 event pairs, 1157 based on Foata normal form. 3/4410 useless extension candidates. Maximal degree in co-relation 25791. Up to 4175 conditions per place. [2024-05-12 12:23:45,256 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 258 selfloop transitions, 26 changer transitions 0/290 dead transitions. [2024-05-12 12:23:45,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 290 transitions, 4927 flow [2024-05-12 12:23:45,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:23:45,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:23:45,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-05-12 12:23:45,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4548611111111111 [2024-05-12 12:23:45,262 INFO L175 Difference]: Start difference. First operand has 186 places, 264 transitions, 4233 flow. Second operand 8 states and 131 transitions. [2024-05-12 12:23:45,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 290 transitions, 4927 flow [2024-05-12 12:23:45,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 290 transitions, 4789 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-05-12 12:23:45,503 INFO L231 Difference]: Finished difference. Result has 187 places, 266 transitions, 4198 flow [2024-05-12 12:23:45,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4095, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4198, PETRI_PLACES=187, PETRI_TRANSITIONS=266} [2024-05-12 12:23:45,503 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 147 predicate places. [2024-05-12 12:23:45,503 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 266 transitions, 4198 flow [2024-05-12 12:23:45,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:45,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:45,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:45,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 12:23:45,504 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-05-12 12:23:45,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:45,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1859645155, now seen corresponding path program 6 times [2024-05-12 12:23:45,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:45,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889319098] [2024-05-12 12:23:45,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:45,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:48,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:48,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889319098] [2024-05-12 12:23:48,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889319098] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:48,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:48,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:48,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328875053] [2024-05-12 12:23:48,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:48,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:48,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:48,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:48,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:48,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:48,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 266 transitions, 4198 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:48,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:48,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:48,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:49,666 INFO L124 PetriNetUnfolderBase]: 2532/4414 cut-off events. [2024-05-12 12:23:49,666 INFO L125 PetriNetUnfolderBase]: For 71302/71304 co-relation queries the response was YES. [2024-05-12 12:23:49,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25828 conditions, 4414 events. 2532/4414 cut-off events. For 71302/71304 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 30312 event pairs, 1142 based on Foata normal form. 3/4417 useless extension candidates. Maximal degree in co-relation 25737. Up to 3971 conditions per place. [2024-05-12 12:23:49,705 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 238 selfloop transitions, 57 changer transitions 0/301 dead transitions. [2024-05-12 12:23:49,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 301 transitions, 5153 flow [2024-05-12 12:23:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-05-12 12:23:49,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4567901234567901 [2024-05-12 12:23:49,707 INFO L175 Difference]: Start difference. First operand has 187 places, 266 transitions, 4198 flow. Second operand 9 states and 148 transitions. [2024-05-12 12:23:49,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 301 transitions, 5153 flow [2024-05-12 12:23:49,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 301 transitions, 5066 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-05-12 12:23:49,942 INFO L231 Difference]: Finished difference. Result has 191 places, 272 transitions, 4449 flow [2024-05-12 12:23:49,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4111, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4449, PETRI_PLACES=191, PETRI_TRANSITIONS=272} [2024-05-12 12:23:49,943 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 151 predicate places. [2024-05-12 12:23:49,943 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 272 transitions, 4449 flow [2024-05-12 12:23:49,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:49,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:49,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:49,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 12:23:49,944 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-05-12 12:23:49,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:49,944 INFO L85 PathProgramCache]: Analyzing trace with hash 573424491, now seen corresponding path program 7 times [2024-05-12 12:23:49,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:49,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476328854] [2024-05-12 12:23:49,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:49,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:52,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:52,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476328854] [2024-05-12 12:23:52,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476328854] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:52,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:52,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:52,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192536964] [2024-05-12 12:23:52,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:52,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:52,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:52,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:52,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:53,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:53,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 272 transitions, 4449 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:53,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:53,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:53,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:54,294 INFO L124 PetriNetUnfolderBase]: 2529/4407 cut-off events. [2024-05-12 12:23:54,294 INFO L125 PetriNetUnfolderBase]: For 73213/73215 co-relation queries the response was YES. [2024-05-12 12:23:54,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26000 conditions, 4407 events. 2529/4407 cut-off events. For 73213/73215 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 30253 event pairs, 1155 based on Foata normal form. 3/4410 useless extension candidates. Maximal degree in co-relation 25907. Up to 4097 conditions per place. [2024-05-12 12:23:54,328 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 247 selfloop transitions, 47 changer transitions 0/300 dead transitions. [2024-05-12 12:23:54,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 300 transitions, 5147 flow [2024-05-12 12:23:54,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:54,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-05-12 12:23:54,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4506172839506173 [2024-05-12 12:23:54,330 INFO L175 Difference]: Start difference. First operand has 191 places, 272 transitions, 4449 flow. Second operand 9 states and 146 transitions. [2024-05-12 12:23:54,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 300 transitions, 5147 flow [2024-05-12 12:23:54,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 300 transitions, 4971 flow, removed 64 selfloop flow, removed 5 redundant places. [2024-05-12 12:23:54,596 INFO L231 Difference]: Finished difference. Result has 195 places, 272 transitions, 4379 flow [2024-05-12 12:23:54,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4273, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4379, PETRI_PLACES=195, PETRI_TRANSITIONS=272} [2024-05-12 12:23:54,597 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 155 predicate places. [2024-05-12 12:23:54,597 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 272 transitions, 4379 flow [2024-05-12 12:23:54,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:54,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:54,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:54,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 12:23:54,599 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-05-12 12:23:54,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:54,599 INFO L85 PathProgramCache]: Analyzing trace with hash -67054831, now seen corresponding path program 1 times [2024-05-12 12:23:54,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:54,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424005753] [2024-05-12 12:23:54,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:54,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:58,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:58,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424005753] [2024-05-12 12:23:58,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424005753] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:58,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:58,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:23:58,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660820649] [2024-05-12 12:23:58,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:58,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:23:58,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:58,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:23:58,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:23:58,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:23:58,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 272 transitions, 4379 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:58,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:58,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:23:58,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:59,299 INFO L124 PetriNetUnfolderBase]: 2513/4380 cut-off events. [2024-05-12 12:23:59,299 INFO L125 PetriNetUnfolderBase]: For 70273/70281 co-relation queries the response was YES. [2024-05-12 12:23:59,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25321 conditions, 4380 events. 2513/4380 cut-off events. For 70273/70281 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 30045 event pairs, 525 based on Foata normal form. 19/4398 useless extension candidates. Maximal degree in co-relation 25226. Up to 3583 conditions per place. [2024-05-12 12:23:59,339 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 226 selfloop transitions, 77 changer transitions 0/309 dead transitions. [2024-05-12 12:23:59,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 309 transitions, 5193 flow [2024-05-12 12:23:59,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:23:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:23:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-05-12 12:23:59,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2024-05-12 12:23:59,341 INFO L175 Difference]: Start difference. First operand has 195 places, 272 transitions, 4379 flow. Second operand 8 states and 142 transitions. [2024-05-12 12:23:59,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 309 transitions, 5193 flow [2024-05-12 12:23:59,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 309 transitions, 5085 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 12:23:59,594 INFO L231 Difference]: Finished difference. Result has 196 places, 275 transitions, 4503 flow [2024-05-12 12:23:59,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4271, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4503, PETRI_PLACES=196, PETRI_TRANSITIONS=275} [2024-05-12 12:23:59,595 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 156 predicate places. [2024-05-12 12:23:59,595 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 275 transitions, 4503 flow [2024-05-12 12:23:59,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:59,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:59,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:59,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 12:23:59,596 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-05-12 12:23:59,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:59,596 INFO L85 PathProgramCache]: Analyzing trace with hash -768900267, now seen corresponding path program 2 times [2024-05-12 12:23:59,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:59,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290756230] [2024-05-12 12:23:59,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:59,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:03,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:03,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290756230] [2024-05-12 12:24:03,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290756230] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:03,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:03,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:24:03,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065955854] [2024-05-12 12:24:03,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:03,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:24:03,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:03,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:24:03,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:24:03,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:24:03,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 275 transitions, 4503 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:03,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:03,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:24:03,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:04,464 INFO L124 PetriNetUnfolderBase]: 2585/4511 cut-off events. [2024-05-12 12:24:04,464 INFO L125 PetriNetUnfolderBase]: For 76699/76701 co-relation queries the response was YES. [2024-05-12 12:24:04,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26311 conditions, 4511 events. 2585/4511 cut-off events. For 76699/76701 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 31228 event pairs, 552 based on Foata normal form. 13/4523 useless extension candidates. Maximal degree in co-relation 26214. Up to 3444 conditions per place. [2024-05-12 12:24:04,504 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 194 selfloop transitions, 115 changer transitions 0/315 dead transitions. [2024-05-12 12:24:04,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 315 transitions, 5364 flow [2024-05-12 12:24:04,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:24:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:24:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-05-12 12:24:04,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2024-05-12 12:24:04,506 INFO L175 Difference]: Start difference. First operand has 196 places, 275 transitions, 4503 flow. Second operand 9 states and 158 transitions. [2024-05-12 12:24:04,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 315 transitions, 5364 flow [2024-05-12 12:24:04,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 315 transitions, 5187 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-05-12 12:24:04,776 INFO L231 Difference]: Finished difference. Result has 200 places, 277 transitions, 4642 flow [2024-05-12 12:24:04,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4326, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4642, PETRI_PLACES=200, PETRI_TRANSITIONS=277} [2024-05-12 12:24:04,777 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 160 predicate places. [2024-05-12 12:24:04,777 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 277 transitions, 4642 flow [2024-05-12 12:24:04,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:04,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:04,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:04,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 12:24:04,778 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-05-12 12:24:04,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:04,778 INFO L85 PathProgramCache]: Analyzing trace with hash -768669627, now seen corresponding path program 3 times [2024-05-12 12:24:04,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:04,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014993853] [2024-05-12 12:24:04,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:04,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:08,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:08,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:08,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014993853] [2024-05-12 12:24:08,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014993853] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:08,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:08,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:24:08,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936302764] [2024-05-12 12:24:08,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:08,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:24:08,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:08,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:24:08,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:24:08,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:24:08,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 277 transitions, 4642 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:08,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:08,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:24:08,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:10,002 INFO L124 PetriNetUnfolderBase]: 2632/4602 cut-off events. [2024-05-12 12:24:10,003 INFO L125 PetriNetUnfolderBase]: For 76156/76158 co-relation queries the response was YES. [2024-05-12 12:24:10,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26737 conditions, 4602 events. 2632/4602 cut-off events. For 76156/76158 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 32074 event pairs, 533 based on Foata normal form. 13/4614 useless extension candidates. Maximal degree in co-relation 26639. Up to 2839 conditions per place. [2024-05-12 12:24:10,046 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 185 selfloop transitions, 130 changer transitions 0/321 dead transitions. [2024-05-12 12:24:10,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 321 transitions, 5608 flow [2024-05-12 12:24:10,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:24:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:24:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-05-12 12:24:10,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030864197530864 [2024-05-12 12:24:10,047 INFO L175 Difference]: Start difference. First operand has 200 places, 277 transitions, 4642 flow. Second operand 9 states and 163 transitions. [2024-05-12 12:24:10,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 321 transitions, 5608 flow [2024-05-12 12:24:10,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 321 transitions, 5337 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-05-12 12:24:10,350 INFO L231 Difference]: Finished difference. Result has 202 places, 279 transitions, 4711 flow [2024-05-12 12:24:10,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4371, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4711, PETRI_PLACES=202, PETRI_TRANSITIONS=279} [2024-05-12 12:24:10,351 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 162 predicate places. [2024-05-12 12:24:10,351 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 279 transitions, 4711 flow [2024-05-12 12:24:10,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:10,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:10,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:10,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 12:24:10,351 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-05-12 12:24:10,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1287408211, now seen corresponding path program 4 times [2024-05-12 12:24:10,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:10,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16133617] [2024-05-12 12:24:10,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:10,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:13,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:13,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16133617] [2024-05-12 12:24:13,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16133617] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:13,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:13,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:24:13,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249360076] [2024-05-12 12:24:13,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:13,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:24:13,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:13,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:24:13,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:24:14,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:24:14,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 279 transitions, 4711 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:14,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:14,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:24:14,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:15,285 INFO L124 PetriNetUnfolderBase]: 2620/4571 cut-off events. [2024-05-12 12:24:15,285 INFO L125 PetriNetUnfolderBase]: For 64579/64587 co-relation queries the response was YES. [2024-05-12 12:24:15,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26265 conditions, 4571 events. 2620/4571 cut-off events. For 64579/64587 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 31753 event pairs, 512 based on Foata normal form. 19/4590 useless extension candidates. Maximal degree in co-relation 26166. Up to 3550 conditions per place. [2024-05-12 12:24:15,322 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 221 selfloop transitions, 96 changer transitions 0/323 dead transitions. [2024-05-12 12:24:15,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 323 transitions, 5620 flow [2024-05-12 12:24:15,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:24:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:24:15,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-05-12 12:24:15,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845679012345679 [2024-05-12 12:24:15,323 INFO L175 Difference]: Start difference. First operand has 202 places, 279 transitions, 4711 flow. Second operand 9 states and 157 transitions. [2024-05-12 12:24:15,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 323 transitions, 5620 flow [2024-05-12 12:24:15,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 323 transitions, 5291 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-05-12 12:24:15,610 INFO L231 Difference]: Finished difference. Result has 205 places, 283 transitions, 4723 flow [2024-05-12 12:24:15,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4394, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4723, PETRI_PLACES=205, PETRI_TRANSITIONS=283} [2024-05-12 12:24:15,611 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 165 predicate places. [2024-05-12 12:24:15,611 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 283 transitions, 4723 flow [2024-05-12 12:24:15,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:15,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:15,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:15,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 12:24:15,612 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-05-12 12:24:15,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:15,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1714354165, now seen corresponding path program 5 times [2024-05-12 12:24:15,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:15,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249187781] [2024-05-12 12:24:15,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:15,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:19,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:19,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:19,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249187781] [2024-05-12 12:24:19,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249187781] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:19,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:19,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:24:19,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45225438] [2024-05-12 12:24:19,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:19,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:24:19,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:19,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:24:19,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:24:19,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:24:19,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 283 transitions, 4723 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:19,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:19,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:24:19,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:20,624 INFO L124 PetriNetUnfolderBase]: 2613/4560 cut-off events. [2024-05-12 12:24:20,624 INFO L125 PetriNetUnfolderBase]: For 55039/55047 co-relation queries the response was YES. [2024-05-12 12:24:20,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25817 conditions, 4560 events. 2613/4560 cut-off events. For 55039/55047 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 31600 event pairs, 514 based on Foata normal form. 13/4573 useless extension candidates. Maximal degree in co-relation 25716. Up to 3288 conditions per place. [2024-05-12 12:24:20,670 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 207 selfloop transitions, 110 changer transitions 0/323 dead transitions. [2024-05-12 12:24:20,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 323 transitions, 5631 flow [2024-05-12 12:24:20,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:24:20,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:24:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-05-12 12:24:20,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2024-05-12 12:24:20,686 INFO L175 Difference]: Start difference. First operand has 205 places, 283 transitions, 4723 flow. Second operand 9 states and 152 transitions. [2024-05-12 12:24:20,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 323 transitions, 5631 flow [2024-05-12 12:24:20,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 323 transitions, 5358 flow, removed 35 selfloop flow, removed 7 redundant places. [2024-05-12 12:24:20,993 INFO L231 Difference]: Finished difference. Result has 209 places, 287 transitions, 4873 flow [2024-05-12 12:24:20,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4450, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4873, PETRI_PLACES=209, PETRI_TRANSITIONS=287} [2024-05-12 12:24:20,994 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 169 predicate places. [2024-05-12 12:24:20,994 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 287 transitions, 4873 flow [2024-05-12 12:24:20,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:20,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:20,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:20,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 12:24:20,995 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-05-12 12:24:20,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:20,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2047351883, now seen corresponding path program 6 times [2024-05-12 12:24:20,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:20,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982045142] [2024-05-12 12:24:20,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:20,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:24,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:24,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:24,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982045142] [2024-05-12 12:24:24,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982045142] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:24,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:24,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:24:24,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879905676] [2024-05-12 12:24:24,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:24,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:24:24,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:24,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:24:24,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:24:24,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:24:24,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 287 transitions, 4873 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:24,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:24,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:24:24,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:25,785 INFO L124 PetriNetUnfolderBase]: 2613/4563 cut-off events. [2024-05-12 12:24:25,786 INFO L125 PetriNetUnfolderBase]: For 53192/53194 co-relation queries the response was YES. [2024-05-12 12:24:25,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25889 conditions, 4563 events. 2613/4563 cut-off events. For 53192/53194 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 31497 event pairs, 1205 based on Foata normal form. 7/4570 useless extension candidates. Maximal degree in co-relation 25785. Up to 4264 conditions per place. [2024-05-12 12:24:25,828 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 286 selfloop transitions, 27 changer transitions 0/319 dead transitions. [2024-05-12 12:24:25,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 319 transitions, 5641 flow [2024-05-12 12:24:25,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:24:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:24:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-05-12 12:24:25,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2024-05-12 12:24:25,833 INFO L175 Difference]: Start difference. First operand has 209 places, 287 transitions, 4873 flow. Second operand 9 states and 147 transitions. [2024-05-12 12:24:25,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 319 transitions, 5641 flow [2024-05-12 12:24:26,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 319 transitions, 5266 flow, removed 63 selfloop flow, removed 6 redundant places. [2024-05-12 12:24:26,106 INFO L231 Difference]: Finished difference. Result has 212 places, 288 transitions, 4582 flow [2024-05-12 12:24:26,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4498, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4582, PETRI_PLACES=212, PETRI_TRANSITIONS=288} [2024-05-12 12:24:26,107 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 172 predicate places. [2024-05-12 12:24:26,107 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 288 transitions, 4582 flow [2024-05-12 12:24:26,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:26,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:26,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:26,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 12:24:26,107 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:26,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:26,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1652900731, now seen corresponding path program 1 times [2024-05-12 12:24:26,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:26,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004259038] [2024-05-12 12:24:26,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:26,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:26,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:26,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004259038] [2024-05-12 12:24:26,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004259038] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:26,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:26,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:24:26,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834333013] [2024-05-12 12:24:26,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:26,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:24:26,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:26,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:24:26,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:24:26,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-05-12 12:24:26,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 288 transitions, 4582 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:26,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:26,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-05-12 12:24:26,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:27,557 INFO L124 PetriNetUnfolderBase]: 1914/3676 cut-off events. [2024-05-12 12:24:27,557 INFO L125 PetriNetUnfolderBase]: For 42809/43118 co-relation queries the response was YES. [2024-05-12 12:24:27,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21424 conditions, 3676 events. 1914/3676 cut-off events. For 42809/43118 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 28317 event pairs, 564 based on Foata normal form. 208/3699 useless extension candidates. Maximal degree in co-relation 21319. Up to 2674 conditions per place. [2024-05-12 12:24:27,594 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 224 selfloop transitions, 22 changer transitions 48/369 dead transitions. [2024-05-12 12:24:27,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 369 transitions, 6119 flow [2024-05-12 12:24:27,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 12:24:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 12:24:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 231 transitions. [2024-05-12 12:24:27,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2024-05-12 12:24:27,595 INFO L175 Difference]: Start difference. First operand has 212 places, 288 transitions, 4582 flow. Second operand 12 states and 231 transitions. [2024-05-12 12:24:27,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 369 transitions, 6119 flow [2024-05-12 12:24:27,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 369 transitions, 6049 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-05-12 12:24:27,807 INFO L231 Difference]: Finished difference. Result has 223 places, 293 transitions, 4710 flow [2024-05-12 12:24:27,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4512, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4710, PETRI_PLACES=223, PETRI_TRANSITIONS=293} [2024-05-12 12:24:27,807 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 183 predicate places. [2024-05-12 12:24:27,807 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 293 transitions, 4710 flow [2024-05-12 12:24:27,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:27,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:27,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:27,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 12:24:27,808 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-05-12 12:24:27,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:27,808 INFO L85 PathProgramCache]: Analyzing trace with hash 365575190, now seen corresponding path program 1 times [2024-05-12 12:24:27,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:27,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373467250] [2024-05-12 12:24:27,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:27,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:31,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:31,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373467250] [2024-05-12 12:24:31,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373467250] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:31,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:31,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:24:31,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753285186] [2024-05-12 12:24:31,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:31,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:24:31,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:31,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:24:31,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:24:31,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:24:31,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 293 transitions, 4710 flow. Second operand has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:31,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:31,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:24:31,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:32,589 INFO L124 PetriNetUnfolderBase]: 2645/4610 cut-off events. [2024-05-12 12:24:32,589 INFO L125 PetriNetUnfolderBase]: For 48205/48208 co-relation queries the response was YES. [2024-05-12 12:24:32,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26713 conditions, 4610 events. 2645/4610 cut-off events. For 48205/48208 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 32093 event pairs, 528 based on Foata normal form. 9/4618 useless extension candidates. Maximal degree in co-relation 26601. Up to 3336 conditions per place. [2024-05-12 12:24:32,638 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 206 selfloop transitions, 119 changer transitions 0/331 dead transitions. [2024-05-12 12:24:32,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 331 transitions, 5476 flow [2024-05-12 12:24:32,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:24:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:24:32,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-05-12 12:24:32,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2024-05-12 12:24:32,640 INFO L175 Difference]: Start difference. First operand has 223 places, 293 transitions, 4710 flow. Second operand 9 states and 164 transitions. [2024-05-12 12:24:32,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 331 transitions, 5476 flow [2024-05-12 12:24:32,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 331 transitions, 5206 flow, removed 30 selfloop flow, removed 26 redundant places. [2024-05-12 12:24:32,828 INFO L231 Difference]: Finished difference. Result has 198 places, 292 transitions, 4592 flow [2024-05-12 12:24:32,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4354, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4592, PETRI_PLACES=198, PETRI_TRANSITIONS=292} [2024-05-12 12:24:32,829 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 158 predicate places. [2024-05-12 12:24:32,829 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 292 transitions, 4592 flow [2024-05-12 12:24:32,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:32,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:32,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:32,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 12:24:32,830 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:32,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:32,830 INFO L85 PathProgramCache]: Analyzing trace with hash 595669263, now seen corresponding path program 1 times [2024-05-12 12:24:32,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:32,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685385018] [2024-05-12 12:24:32,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:32,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:33,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:33,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:33,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685385018] [2024-05-12 12:24:33,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685385018] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:33,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:33,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:24:33,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586208138] [2024-05-12 12:24:33,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:33,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:24:33,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:33,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:24:33,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:24:33,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-05-12 12:24:33,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 292 transitions, 4592 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:33,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:33,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-05-12 12:24:33,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:33,944 INFO L124 PetriNetUnfolderBase]: 1996/3903 cut-off events. [2024-05-12 12:24:33,945 INFO L125 PetriNetUnfolderBase]: For 35862/36056 co-relation queries the response was YES. [2024-05-12 12:24:33,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22698 conditions, 3903 events. 1996/3903 cut-off events. For 35862/36056 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 30432 event pairs, 451 based on Foata normal form. 139/3880 useless extension candidates. Maximal degree in co-relation 22608. Up to 1395 conditions per place. [2024-05-12 12:24:33,980 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 130 selfloop transitions, 23 changer transitions 138/355 dead transitions. [2024-05-12 12:24:33,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 355 transitions, 5672 flow [2024-05-12 12:24:33,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:24:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:24:33,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions. [2024-05-12 12:24:33,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-05-12 12:24:33,981 INFO L175 Difference]: Start difference. First operand has 198 places, 292 transitions, 4592 flow. Second operand 10 states and 198 transitions. [2024-05-12 12:24:33,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 355 transitions, 5672 flow [2024-05-12 12:24:34,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 355 transitions, 5383 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-05-12 12:24:34,121 INFO L231 Difference]: Finished difference. Result has 204 places, 189 transitions, 2733 flow [2024-05-12 12:24:34,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4307, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2733, PETRI_PLACES=204, PETRI_TRANSITIONS=189} [2024-05-12 12:24:34,122 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 164 predicate places. [2024-05-12 12:24:34,122 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 189 transitions, 2733 flow [2024-05-12 12:24:34,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:34,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:34,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:34,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-12 12:24:34,123 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:34,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:34,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1112269416, now seen corresponding path program 1 times [2024-05-12 12:24:34,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:34,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993114945] [2024-05-12 12:24:34,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:34,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:34,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-05-12 12:24:34,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:34,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993114945] [2024-05-12 12:24:34,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993114945] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:34,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:34,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:24:34,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562029289] [2024-05-12 12:24:34,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:34,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:24:34,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:34,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:24:34,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:24:34,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-05-12 12:24:34,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 189 transitions, 2733 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:34,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:34,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-05-12 12:24:34,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:35,288 INFO L124 PetriNetUnfolderBase]: 1165/2344 cut-off events. [2024-05-12 12:24:35,289 INFO L125 PetriNetUnfolderBase]: For 23386/23535 co-relation queries the response was YES. [2024-05-12 12:24:35,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13399 conditions, 2344 events. 1165/2344 cut-off events. For 23386/23535 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16736 event pairs, 475 based on Foata normal form. 92/2321 useless extension candidates. Maximal degree in co-relation 13319. Up to 1666 conditions per place. [2024-05-12 12:24:35,308 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 137 selfloop transitions, 21 changer transitions 27/244 dead transitions. [2024-05-12 12:24:35,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 244 transitions, 3556 flow [2024-05-12 12:24:35,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-12 12:24:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-05-12 12:24:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 229 transitions. [2024-05-12 12:24:35,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4893162393162393 [2024-05-12 12:24:35,309 INFO L175 Difference]: Start difference. First operand has 204 places, 189 transitions, 2733 flow. Second operand 13 states and 229 transitions. [2024-05-12 12:24:35,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 244 transitions, 3556 flow [2024-05-12 12:24:35,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 244 transitions, 3188 flow, removed 52 selfloop flow, removed 22 redundant places. [2024-05-12 12:24:35,378 INFO L231 Difference]: Finished difference. Result has 181 places, 192 transitions, 2525 flow [2024-05-12 12:24:35,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2418, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2525, PETRI_PLACES=181, PETRI_TRANSITIONS=192} [2024-05-12 12:24:35,378 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 141 predicate places. [2024-05-12 12:24:35,378 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 192 transitions, 2525 flow [2024-05-12 12:24:35,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:35,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:35,379 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] [2024-05-12 12:24:35,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-12 12:24:35,379 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:35,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:35,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1402043331, now seen corresponding path program 1 times [2024-05-12 12:24:35,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:35,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515363153] [2024-05-12 12:24:35,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:35,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:35,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:35,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515363153] [2024-05-12 12:24:35,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515363153] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:35,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:35,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:24:35,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010286341] [2024-05-12 12:24:35,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:35,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:24:35,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:35,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:24:35,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:24:35,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-05-12 12:24:35,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 192 transitions, 2525 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:35,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:35,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-05-12 12:24:35,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:36,311 INFO L124 PetriNetUnfolderBase]: 1111/2288 cut-off events. [2024-05-12 12:24:36,311 INFO L125 PetriNetUnfolderBase]: For 21582/21643 co-relation queries the response was YES. [2024-05-12 12:24:36,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13238 conditions, 2288 events. 1111/2288 cut-off events. For 21582/21643 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 16164 event pairs, 305 based on Foata normal form. 56/2279 useless extension candidates. Maximal degree in co-relation 13167. Up to 1485 conditions per place. [2024-05-12 12:24:36,329 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 121 selfloop transitions, 20 changer transitions 48/242 dead transitions. [2024-05-12 12:24:36,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 242 transitions, 3368 flow [2024-05-12 12:24:36,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:24:36,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:24:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-05-12 12:24:36,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2024-05-12 12:24:36,331 INFO L175 Difference]: Start difference. First operand has 181 places, 192 transitions, 2525 flow. Second operand 10 states and 186 transitions. [2024-05-12 12:24:36,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 242 transitions, 3368 flow [2024-05-12 12:24:36,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 242 transitions, 3306 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-05-12 12:24:36,391 INFO L231 Difference]: Finished difference. Result has 179 places, 174 transitions, 2377 flow [2024-05-12 12:24:36,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2377, PETRI_PLACES=179, PETRI_TRANSITIONS=174} [2024-05-12 12:24:36,391 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 139 predicate places. [2024-05-12 12:24:36,391 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 174 transitions, 2377 flow [2024-05-12 12:24:36,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:36,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:36,392 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] [2024-05-12 12:24:36,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-12 12:24:36,392 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:36,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:36,392 INFO L85 PathProgramCache]: Analyzing trace with hash -863938172, now seen corresponding path program 1 times [2024-05-12 12:24:36,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:36,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151803304] [2024-05-12 12:24:36,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:36,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:36,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:36,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151803304] [2024-05-12 12:24:36,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151803304] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:36,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:36,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:24:36,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727589150] [2024-05-12 12:24:36,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:36,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:24:36,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:36,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:24:36,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:24:37,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-05-12 12:24:37,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 174 transitions, 2377 flow. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:37,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:37,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-05-12 12:24:37,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:37,617 INFO L124 PetriNetUnfolderBase]: 970/2008 cut-off events. [2024-05-12 12:24:37,617 INFO L125 PetriNetUnfolderBase]: For 17154/17255 co-relation queries the response was YES. [2024-05-12 12:24:37,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11157 conditions, 2008 events. 970/2008 cut-off events. For 17154/17255 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 13988 event pairs, 406 based on Foata normal form. 62/1991 useless extension candidates. Maximal degree in co-relation 11086. Up to 1466 conditions per place. [2024-05-12 12:24:37,633 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 113 selfloop transitions, 16 changer transitions 20/202 dead transitions. [2024-05-12 12:24:37,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 202 transitions, 2874 flow [2024-05-12 12:24:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:24:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:24:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-05-12 12:24:37,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2024-05-12 12:24:37,635 INFO L175 Difference]: Start difference. First operand has 179 places, 174 transitions, 2377 flow. Second operand 10 states and 178 transitions. [2024-05-12 12:24:37,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 202 transitions, 2874 flow [2024-05-12 12:24:37,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 202 transitions, 2746 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-05-12 12:24:37,687 INFO L231 Difference]: Finished difference. Result has 180 places, 167 transitions, 2235 flow [2024-05-12 12:24:37,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2261, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2235, PETRI_PLACES=180, PETRI_TRANSITIONS=167} [2024-05-12 12:24:37,688 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 140 predicate places. [2024-05-12 12:24:37,688 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 167 transitions, 2235 flow [2024-05-12 12:24:37,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:37,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:37,688 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-05-12 12:24:37,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-05-12 12:24:37,688 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:37,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:37,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1403417386, now seen corresponding path program 1 times [2024-05-12 12:24:37,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:37,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968822173] [2024-05-12 12:24:37,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:37,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:38,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:38,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968822173] [2024-05-12 12:24:38,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968822173] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:38,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:38,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:24:38,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432267789] [2024-05-12 12:24:38,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:38,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:24:38,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:38,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:24:38,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:24:38,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 12:24:38,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 167 transitions, 2235 flow. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:38,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:38,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 12:24:38,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:38,838 INFO L124 PetriNetUnfolderBase]: 927/1988 cut-off events. [2024-05-12 12:24:38,839 INFO L125 PetriNetUnfolderBase]: For 17854/17913 co-relation queries the response was YES. [2024-05-12 12:24:38,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11340 conditions, 1988 events. 927/1988 cut-off events. For 17854/17913 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14202 event pairs, 198 based on Foata normal form. 47/1953 useless extension candidates. Maximal degree in co-relation 11270. Up to 958 conditions per place. [2024-05-12 12:24:38,857 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 88 selfloop transitions, 39 changer transitions 66/244 dead transitions. [2024-05-12 12:24:38,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 244 transitions, 3388 flow [2024-05-12 12:24:38,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-12 12:24:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-05-12 12:24:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 295 transitions. [2024-05-12 12:24:38,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121527777777778 [2024-05-12 12:24:38,858 INFO L175 Difference]: Start difference. First operand has 180 places, 167 transitions, 2235 flow. Second operand 16 states and 295 transitions. [2024-05-12 12:24:38,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 244 transitions, 3388 flow [2024-05-12 12:24:38,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 244 transitions, 3243 flow, removed 17 selfloop flow, removed 12 redundant places. [2024-05-12 12:24:38,911 INFO L231 Difference]: Finished difference. Result has 187 places, 154 transitions, 2148 flow [2024-05-12 12:24:38,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2133, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2148, PETRI_PLACES=187, PETRI_TRANSITIONS=154} [2024-05-12 12:24:38,911 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 147 predicate places. [2024-05-12 12:24:38,911 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 154 transitions, 2148 flow [2024-05-12 12:24:38,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:38,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:38,912 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] [2024-05-12 12:24:38,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-05-12 12:24:38,912 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:38,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:38,912 INFO L85 PathProgramCache]: Analyzing trace with hash -67773404, now seen corresponding path program 1 times [2024-05-12 12:24:38,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:38,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338885610] [2024-05-12 12:24:38,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:38,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:39,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:39,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338885610] [2024-05-12 12:24:39,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338885610] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:39,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:39,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:24:39,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599427006] [2024-05-12 12:24:39,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:39,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:24:39,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:39,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:24:39,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:24:39,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 12:24:39,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 154 transitions, 2148 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:39,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:39,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 12:24:39,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:39,331 INFO L124 PetriNetUnfolderBase]: 859/1829 cut-off events. [2024-05-12 12:24:39,331 INFO L125 PetriNetUnfolderBase]: For 14558/14664 co-relation queries the response was YES. [2024-05-12 12:24:39,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9170 conditions, 1829 events. 859/1829 cut-off events. For 14558/14664 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 12539 event pairs, 166 based on Foata normal form. 210/1994 useless extension candidates. Maximal degree in co-relation 9098. Up to 874 conditions per place. [2024-05-12 12:24:39,344 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 70 selfloop transitions, 22 changer transitions 0/122 dead transitions. [2024-05-12 12:24:39,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 122 transitions, 1727 flow [2024-05-12 12:24:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:24:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:24:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2024-05-12 12:24:39,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6180555555555556 [2024-05-12 12:24:39,345 INFO L175 Difference]: Start difference. First operand has 187 places, 154 transitions, 2148 flow. Second operand 4 states and 89 transitions. [2024-05-12 12:24:39,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 122 transitions, 1727 flow [2024-05-12 12:24:39,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 122 transitions, 1319 flow, removed 51 selfloop flow, removed 56 redundant places. [2024-05-12 12:24:39,378 INFO L231 Difference]: Finished difference. Result has 127 places, 107 transitions, 1133 flow [2024-05-12 12:24:39,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1133, PETRI_PLACES=127, PETRI_TRANSITIONS=107} [2024-05-12 12:24:39,378 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 87 predicate places. [2024-05-12 12:24:39,379 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 107 transitions, 1133 flow [2024-05-12 12:24:39,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:39,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:39,379 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] [2024-05-12 12:24:39,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-12 12:24:39,379 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:39,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:39,379 INFO L85 PathProgramCache]: Analyzing trace with hash 128719443, now seen corresponding path program 1 times [2024-05-12 12:24:39,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:39,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128743799] [2024-05-12 12:24:39,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:39,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:39,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:39,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:39,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128743799] [2024-05-12 12:24:39,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128743799] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:39,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:39,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:24:39,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131738250] [2024-05-12 12:24:39,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:39,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:24:39,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:39,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:24:39,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:24:39,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 12:24:39,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 107 transitions, 1133 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:39,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:39,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 12:24:39,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:39,747 INFO L124 PetriNetUnfolderBase]: 582/1366 cut-off events. [2024-05-12 12:24:39,747 INFO L125 PetriNetUnfolderBase]: For 5366/5394 co-relation queries the response was YES. [2024-05-12 12:24:39,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5700 conditions, 1366 events. 582/1366 cut-off events. For 5366/5394 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9530 event pairs, 124 based on Foata normal form. 121/1441 useless extension candidates. Maximal degree in co-relation 5656. Up to 470 conditions per place. [2024-05-12 12:24:39,754 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 44 selfloop transitions, 22 changer transitions 11/97 dead transitions. [2024-05-12 12:24:39,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 97 transitions, 1097 flow [2024-05-12 12:24:39,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:24:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:24:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2024-05-12 12:24:39,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-05-12 12:24:39,755 INFO L175 Difference]: Start difference. First operand has 127 places, 107 transitions, 1133 flow. Second operand 5 states and 102 transitions. [2024-05-12 12:24:39,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 97 transitions, 1097 flow [2024-05-12 12:24:39,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 97 transitions, 784 flow, removed 45 selfloop flow, removed 29 redundant places. [2024-05-12 12:24:39,767 INFO L231 Difference]: Finished difference. Result has 102 places, 75 transitions, 594 flow [2024-05-12 12:24:39,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=594, PETRI_PLACES=102, PETRI_TRANSITIONS=75} [2024-05-12 12:24:39,768 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 62 predicate places. [2024-05-12 12:24:39,768 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 75 transitions, 594 flow [2024-05-12 12:24:39,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:39,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:39,769 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-05-12 12:24:39,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-05-12 12:24:39,769 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:39,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:39,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2074130445, now seen corresponding path program 1 times [2024-05-12 12:24:39,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:39,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539480193] [2024-05-12 12:24:39,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:39,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:40,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:40,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539480193] [2024-05-12 12:24:40,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539480193] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:40,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:40,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-12 12:24:40,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466289592] [2024-05-12 12:24:40,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:40,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:24:40,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:40,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:24:40,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:24:40,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:24:40,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 75 transitions, 594 flow. Second operand has 12 states, 12 states have (on average 11.5) internal successors, (138), 12 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:40,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:40,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:24:40,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:40,958 INFO L124 PetriNetUnfolderBase]: 575/1478 cut-off events. [2024-05-12 12:24:40,958 INFO L125 PetriNetUnfolderBase]: For 3177/3180 co-relation queries the response was YES. [2024-05-12 12:24:40,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5099 conditions, 1478 events. 575/1478 cut-off events. For 3177/3180 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 11243 event pairs, 116 based on Foata normal form. 2/1380 useless extension candidates. Maximal degree in co-relation 5075. Up to 451 conditions per place. [2024-05-12 12:24:40,965 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 40 selfloop transitions, 19 changer transitions 18/109 dead transitions. [2024-05-12 12:24:40,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 109 transitions, 890 flow [2024-05-12 12:24:40,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:24:40,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:24:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2024-05-12 12:24:40,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-05-12 12:24:40,966 INFO L175 Difference]: Start difference. First operand has 102 places, 75 transitions, 594 flow. Second operand 10 states and 150 transitions. [2024-05-12 12:24:40,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 109 transitions, 890 flow [2024-05-12 12:24:40,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 109 transitions, 832 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-05-12 12:24:40,973 INFO L231 Difference]: Finished difference. Result has 100 places, 80 transitions, 640 flow [2024-05-12 12:24:40,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=640, PETRI_PLACES=100, PETRI_TRANSITIONS=80} [2024-05-12 12:24:40,974 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 60 predicate places. [2024-05-12 12:24:40,974 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 80 transitions, 640 flow [2024-05-12 12:24:40,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.5) internal successors, (138), 12 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:40,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:40,974 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-05-12 12:24:40,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-05-12 12:24:40,975 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-05-12 12:24:40,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:40,975 INFO L85 PathProgramCache]: Analyzing trace with hash 524034975, now seen corresponding path program 2 times [2024-05-12 12:24:40,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:40,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738733607] [2024-05-12 12:24:40,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:40,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:41,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:41,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:41,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738733607] [2024-05-12 12:24:41,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738733607] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:41,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:41,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:24:41,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521209019] [2024-05-12 12:24:41,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:41,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:24:41,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:41,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:24:41,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:24:41,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-05-12 12:24:41,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 80 transitions, 640 flow. Second operand has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:41,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:41,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-05-12 12:24:41,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:41,936 INFO L124 PetriNetUnfolderBase]: 543/1422 cut-off events. [2024-05-12 12:24:41,936 INFO L125 PetriNetUnfolderBase]: For 2991/2995 co-relation queries the response was YES. [2024-05-12 12:24:41,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5017 conditions, 1422 events. 543/1422 cut-off events. For 2991/2995 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 10884 event pairs, 109 based on Foata normal form. 4/1321 useless extension candidates. Maximal degree in co-relation 4991. Up to 544 conditions per place. [2024-05-12 12:24:41,942 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 33 selfloop transitions, 11 changer transitions 43/104 dead transitions. [2024-05-12 12:24:41,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 104 transitions, 879 flow [2024-05-12 12:24:41,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:24:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:24:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-05-12 12:24:41,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783950617283951 [2024-05-12 12:24:41,943 INFO L175 Difference]: Start difference. First operand has 100 places, 80 transitions, 640 flow. Second operand 9 states and 155 transitions. [2024-05-12 12:24:41,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 104 transitions, 879 flow [2024-05-12 12:24:41,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 104 transitions, 853 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-05-12 12:24:41,950 INFO L231 Difference]: Finished difference. Result has 93 places, 50 transitions, 345 flow [2024-05-12 12:24:41,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=345, PETRI_PLACES=93, PETRI_TRANSITIONS=50} [2024-05-12 12:24:41,950 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 53 predicate places. [2024-05-12 12:24:41,950 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 50 transitions, 345 flow [2024-05-12 12:24:41,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:41,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:41,951 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-05-12 12:24:41,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-05-12 12:24:41,951 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-05-12 12:24:41,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:41,951 INFO L85 PathProgramCache]: Analyzing trace with hash -918782147, now seen corresponding path program 3 times [2024-05-12 12:24:41,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:41,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222796046] [2024-05-12 12:24:41,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:41,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 12:24:41,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-12 12:24:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 12:24:42,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-12 12:24:42,012 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-12 12:24:42,012 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-05-12 12:24:42,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-12 12:24:42,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-05-12 12:24:42,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-05-12 12:24:42,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-12 12:24:42,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-12 12:24:42,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-12 12:24:42,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-05-12 12:24:42,019 INFO L445 BasicCegarLoop]: Path program histogram: [7, 7, 6, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:42,023 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 12:24:42,024 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 12:24:42,093 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-05-12 12:24:42,093 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-05-12 12:24:42,093 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 12:24:42 BasicIcfg [2024-05-12 12:24:42,094 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 12:24:42,094 INFO L158 Benchmark]: Toolchain (without parser) took 208358.27ms. Allocated memory was 201.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 161.3MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 287.0MB. Max. memory is 16.1GB. [2024-05-12 12:24:42,094 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory was 88.4MB in the beginning and 88.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 12:24:42,095 INFO L158 Benchmark]: Witness Parser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 168.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 12:24:42,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 716.68ms. Allocated memory is still 201.3MB. Free memory was 161.3MB in the beginning and 115.6MB in the end (delta: 45.7MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-05-12 12:24:42,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 140.14ms. Allocated memory is still 201.3MB. Free memory was 115.6MB in the beginning and 159.9MB in the end (delta: -44.3MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2024-05-12 12:24:42,098 INFO L158 Benchmark]: Boogie Preprocessor took 125.51ms. Allocated memory is still 201.3MB. Free memory was 159.9MB in the beginning and 153.7MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-05-12 12:24:42,098 INFO L158 Benchmark]: RCFGBuilder took 958.27ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 95.1MB in the end (delta: 57.6MB). Peak memory consumption was 95.3MB. Max. memory is 16.1GB. [2024-05-12 12:24:42,099 INFO L158 Benchmark]: TraceAbstraction took 206408.75ms. Allocated memory was 201.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 94.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 218.7MB. Max. memory is 16.1GB. [2024-05-12 12:24:42,100 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.13ms. Allocated memory is still 125.8MB. Free memory was 88.4MB in the beginning and 88.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 168.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 716.68ms. Allocated memory is still 201.3MB. Free memory was 161.3MB in the beginning and 115.6MB in the end (delta: 45.7MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 140.14ms. Allocated memory is still 201.3MB. Free memory was 115.6MB in the beginning and 159.9MB in the end (delta: -44.3MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.51ms. Allocated memory is still 201.3MB. Free memory was 159.9MB in the beginning and 153.7MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 958.27ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 95.1MB in the end (delta: 57.6MB). Peak memory consumption was 95.3MB. Max. memory is 16.1GB. * TraceAbstraction took 206408.75ms. Allocated memory was 201.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 94.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 218.7MB. Max. memory is 16.1GB. * 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; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L791] 0 //@ ghost multithreaded = 1; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 0 pthread_t t2474; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L793] 0 //@ assert ((((((((((((((!multithreaded || (((((0 <= y$w_buff1) && (y$w_buff1 <= 2)) && (y$w_buff1 <= 127)) && ((y$w_buff1 % 2) == 0)) && ((y$w_buff1 == 0) || (y$w_buff1 == 2)))) && (!multithreaded || (((0 <= y$mem_tmp) && (y$mem_tmp <= 127)) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff0_thd2) >= 0LL) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff1_thd0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$r_buff1_thd0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$w_buff0) + (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) main$tmp_guard1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) x) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$flush_delayed) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$read_delayed) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) weak$$choice2) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) x) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$flush_delayed) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$mem_tmp) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$read_delayed) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff1) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) weak$$choice0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) weak$$choice2) >= 0LL)) && (((long long) x + (long long) y) >= 0LL)) && (((long long) x + (long long) y$flush_delayed) >= 0LL)) && (((long long) x + (long long) y$mem_tmp) >= 0LL)) && (((long long) x + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) x + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) x + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) x + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) x + (long long) y$read_delayed) >= 0LL)) && (((long long) x + (long long) y$w_buff0) >= 0LL)) && (((long long) x + (long long) y$w_buff1) >= 0LL)) && (((long long) y + (long long) y$flush_delayed) >= 0LL)) && (((long long) y + (long long) y$mem_tmp) >= 0LL)) && (((long long) y + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y + (long long) y$read_delayed) >= 0LL)) && (((long long) y + (long long) y$w_buff0) >= 0LL)) && (((long long) y + (long long) y$w_buff1) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$mem_tmp) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$read_delayed) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff1) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$read_delayed) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff1) >= 0LL)) && (((long long) weak$$choice0 + (long long) x) >= 0LL)) && (((long long) weak$$choice0 + (long long) y) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$flush_delayed) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$mem_tmp) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$read_delayed) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff1) >= 0LL)) && (((long long) weak$$choice0 + (long long) weak$$choice2) >= 0LL)) && (((long long) weak$$choice2 + (long long) x) >= 0LL)) && (((long long) weak$$choice2 + (long long) y) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$flush_delayed) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$mem_tmp) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$read_delayed) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) __unbuffered_cnt) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) __unbuffered_cnt) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) main$tmp_guard1) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) main$tmp_guard1) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) x) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) x) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) y) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) y) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) y$flush_delayed) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) y$flush_delayed) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) y$mem_tmp) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) y$mem_tmp) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) y$r_buff0_thd0) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) y$r_buff0_thd0) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) y$r_buff0_thd2) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) y$r_buff0_thd2) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) y$r_buff1_thd0) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) y$r_buff1_thd0) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) y$r_buff1_thd2) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) y$r_buff1_thd2) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) y$read_delayed) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) y$read_delayed) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) weak$$choice0) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) weak$$choice0) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) weak$$choice2) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) weak$$choice2) - (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff1_thd0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$r_buff1_thd0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) - (long long) y$read_delayed) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$read_delayed) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$read_delayed) - (long long) y$w_buff1) >= 0LL)) && (((4LL - (long long) y$w_buff0) - (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$read_delayed) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$read_delayed) >= 0LL)) && (((long long) x - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) x - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) x - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) x - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) x - (long long) y$read_delayed) >= 0LL)) && (((long long) y - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y - (long long) y$read_delayed) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$read_delayed) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$read_delayed) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$flush_delayed) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$read_delayed) >= 0LL)))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && (0 <= y$mem_tmp)) && (0 <= y$w_buff0)) && (0 <= y$w_buff1)) && (y <= 127)) && (y$mem_tmp <= 127)) && (y$w_buff0 <= 2)) && (y$w_buff0 <= 127)) && (y$w_buff1 <= 2)) && (y$w_buff1 <= 127)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((y$w_buff0 % 2) == 0)) && ((y$w_buff1 % 2) == 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))))) && (!multithreaded || (((((0 <= y$w_buff0) && (y$w_buff0 <= 2)) && (y$w_buff0 <= 127)) && ((y$w_buff0 % 2) == 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L794] 0 //@ assert ((((((((((((((!multithreaded || (((((0 <= y$w_buff1) && (y$w_buff1 <= 2)) && (y$w_buff1 <= 127)) && ((y$w_buff1 % 2) == 0)) && ((y$w_buff1 == 0) || (y$w_buff1 == 2)))) && (!multithreaded || (((0 <= y$mem_tmp) && (y$mem_tmp <= 127)) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff0_thd2) >= 0LL) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff1_thd0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$r_buff1_thd0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$w_buff0) + (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) main$tmp_guard1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) x) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$flush_delayed) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$read_delayed) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) weak$$choice2) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) x) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$flush_delayed) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$mem_tmp) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$read_delayed) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff1) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) weak$$choice0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) weak$$choice2) >= 0LL)) && (((long long) x + (long long) y) >= 0LL)) && (((long long) x + (long long) y$flush_delayed) >= 0LL)) && (((long long) x + (long long) y$mem_tmp) >= 0LL)) && (((long long) x + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) x + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) x + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) x + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) x + (long long) y$read_delayed) >= 0LL)) && (((long long) x + (long long) y$w_buff0) >= 0LL)) && (((long long) x + (long long) y$w_buff1) >= 0LL)) && (((long long) y + (long long) y$flush_delayed) >= 0LL)) && (((long long) y + (long long) y$mem_tmp) >= 0LL)) && (((long long) y + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y + (long long) y$read_delayed) >= 0LL)) && (((long long) y + (long long) y$w_buff0) >= 0LL)) && (((long long) y + (long long) y$w_buff1) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$mem_tmp) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$read_delayed) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff1) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$read_delayed) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff1) >= 0LL)) && (((long long) weak$$choice0 + (long long) x) >= 0LL)) && (((long long) weak$$choice0 + (long long) y) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$flush_delayed) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$mem_tmp) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$read_delayed) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff1) >= 0LL)) && (((long long) weak$$choice0 + (long long) weak$$choice2) >= 0LL)) && (((long long) weak$$choice2 + (long long) x) >= 0LL)) && (((long long) weak$$choice2 + (long long) y) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$flush_delayed) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$mem_tmp) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$read_delayed) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) __unbuffered_cnt) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) __unbuffered_cnt) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) main$tmp_guard1) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) main$tmp_guard1) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) x) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) x) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) y) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) y) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) y$flush_delayed) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) y$flush_delayed) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) y$mem_tmp) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) y$mem_tmp) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) y$r_buff0_thd0) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) y$r_buff0_thd0) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) y$r_buff0_thd2) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) y$r_buff0_thd2) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) y$r_buff1_thd0) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) y$r_buff1_thd0) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) y$r_buff1_thd2) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) y$r_buff1_thd2) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) y$read_delayed) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) y$read_delayed) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) weak$$choice0) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) weak$$choice0) - (long long) y$w_buff1) >= 0LL)) && (((2LL + (long long) weak$$choice2) - (long long) y$w_buff0) >= 0LL)) && (((2LL + (long long) weak$$choice2) - (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff1_thd0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$r_buff1_thd0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$r_buff1_thd2) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) - (long long) y$read_delayed) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$read_delayed) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$read_delayed) - (long long) y$w_buff1) >= 0LL)) && (((4LL - (long long) y$w_buff0) - (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$read_delayed) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$read_delayed) >= 0LL)) && (((long long) x - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) x - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) x - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) x - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) x - (long long) y$read_delayed) >= 0LL)) && (((long long) y - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y - (long long) y$read_delayed) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$read_delayed) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$read_delayed) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$flush_delayed) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$read_delayed) >= 0LL)))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (0 <= x)) && (0 <= y)) && (0 <= y$mem_tmp)) && (0 <= y$w_buff0)) && (0 <= y$w_buff1)) && (y <= 127)) && (y$mem_tmp <= 127)) && (y$w_buff0 <= 2)) && (y$w_buff0 <= 127)) && (y$w_buff1 <= 2)) && (y$w_buff1 <= 127)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((y$w_buff0 % 2) == 0)) && ((y$w_buff1 % 2) == 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))))) && (!multithreaded || (((((0 <= y$w_buff0) && (y$w_buff0 <= 2)) && (y$w_buff0 <= 127)) && ((y$w_buff0 % 2) == 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L745] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L762] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 793]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 791]: 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: 206.2s, OverallIterations: 62, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 51.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3459 SdHoareTripleChecker+Valid, 17.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3020 mSDsluCounter, 1684 SdHoareTripleChecker+Invalid, 14.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1413 mSDsCounter, 835 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18841 IncrementalHoareTripleChecker+Invalid, 19676 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 835 mSolverCounterUnsat, 271 mSDtfsCounter, 18841 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 551 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 528 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4873occurred in iteration=49, InterpolantAutomatonStates: 493, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 152.1s InterpolantComputationTime, 1010 NumberOfCodeBlocks, 1010 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 923 ConstructedInterpolants, 0 QuantifiedInterpolants, 33480 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 61 InterpolantComputations, 61 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-05-12 12:24:42,191 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