./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:38:22,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:38:22,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:38:22,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:38:22,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:38:22,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:38:22,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:38:22,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:38:22,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:38:22,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:38:22,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:38:22,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:38:22,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:38:22,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:38:22,533 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:38:22,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:38:22,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:38:22,534 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:38:22,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:38:22,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:38:22,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:38:22,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:38:22,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:38:22,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:38:22,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:38:22,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:38:22,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:38:22,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:38:22,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:38:22,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:38:22,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:38:22,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:38:22,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:38:22,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:38:22,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:38:22,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:38:22,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:38:22,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:38:22,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:38:22,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:38:22,539 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:38:22,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:38:22,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:38:22,540 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 22:38:22,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:38:22,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:38:22,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:38:22,771 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:38:22,771 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:38:22,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 22:38:23,781 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:38:23,989 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:38:23,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 22:38:24,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f408bb0b/28d6663f6b3347c2a782f9f2a3ee15b4/FLAGb8d0423a7 [2024-06-27 22:38:24,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f408bb0b/28d6663f6b3347c2a782f9f2a3ee15b4 [2024-06-27 22:38:24,013 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:38:24,015 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:38:24,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-27 22:38:24,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:38:24,088 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:38:24,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:38:24,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:38:24,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:38:24,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:38:24" (1/2) ... [2024-06-27 22:38:24,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13190c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:38:24, skipping insertion in model container [2024-06-27 22:38:24,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:38:24" (1/2) ... [2024-06-27 22:38:24,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4174429e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:38:24, skipping insertion in model container [2024-06-27 22:38:24,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:38:24" (2/2) ... [2024-06-27 22:38:24,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13190c6e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:24, skipping insertion in model container [2024-06-27 22:38:24,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:38:24" (2/2) ... [2024-06-27 22:38:24,100 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:38:24,124 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:38:24,125 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] ! multithreaded || (((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:38:24,125 INFO L97 edCorrectnessWitness]: Location invariant before [L836-L836] ! multithreaded || (((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:38:24,125 INFO L97 edCorrectnessWitness]: Location invariant before [L837-L837] ! multithreaded || (((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:38:24,125 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:38:24,126 INFO L106 edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1; [2024-06-27 22:38:24,165 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:38:24,313 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-06-27 22:38:24,443 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:38:24,458 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:38:24,484 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:38:24,553 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:38:24,587 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:38:24,587 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:24 WrapperNode [2024-06-27 22:38:24,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:38:24,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:38:24,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:38:24,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:38:24,593 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 27.06 10:38:24" (1/1) ... [2024-06-27 22:38:24,608 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 27.06 10:38:24" (1/1) ... [2024-06-27 22:38:24,634 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 121 [2024-06-27 22:38:24,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:38:24,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:38:24,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:38:24,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:38:24,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:24" (1/1) ... [2024-06-27 22:38:24,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:24" (1/1) ... [2024-06-27 22:38:24,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:24" (1/1) ... [2024-06-27 22:38:24,663 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 22:38:24,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:24" (1/1) ... [2024-06-27 22:38:24,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:24" (1/1) ... [2024-06-27 22:38:24,674 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:24" (1/1) ... [2024-06-27 22:38:24,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:24" (1/1) ... [2024-06-27 22:38:24,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:24" (1/1) ... [2024-06-27 22:38:24,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:24" (1/1) ... [2024-06-27 22:38:24,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:38:24,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:38:24,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:38:24,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:38:24,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:24" (1/1) ... [2024-06-27 22:38:24,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:38:24,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:38:24,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 22:38:24,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 22:38:24,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:38:24,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:38:24,799 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:38:24,800 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:38:24,800 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:38:24,800 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:38:24,800 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:38:24,800 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:38:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:38:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:38:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:38:24,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:38:24,803 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:38:24,929 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:38:24,933 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:38:25,242 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:38:25,242 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:38:25,376 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:38:25,376 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:38:25,376 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:38:25 BoogieIcfgContainer [2024-06-27 22:38:25,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:38:25,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:38:25,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:38:25,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:38:25,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:38:24" (1/4) ... [2024-06-27 22:38:25,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1b548a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:38:25, skipping insertion in model container [2024-06-27 22:38:25,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:38:24" (2/4) ... [2024-06-27 22:38:25,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1b548a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:38:25, skipping insertion in model container [2024-06-27 22:38:25,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:24" (3/4) ... [2024-06-27 22:38:25,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1b548a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:38:25, skipping insertion in model container [2024-06-27 22:38:25,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:38:25" (4/4) ... [2024-06-27 22:38:25,385 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 22:38:25,399 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:38:25,400 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:38:25,400 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:38:25,435 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:38:25,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 106 flow [2024-06-27 22:38:25,489 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-06-27 22:38:25,490 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:38:25,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-06-27 22:38:25,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 47 transitions, 106 flow [2024-06-27 22:38:25,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 44 transitions, 97 flow [2024-06-27 22:38:25,507 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:38:25,513 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;@320a2a26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:38:25,513 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:38:25,519 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:38:25,520 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-27 22:38:25,520 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:38:25,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:25,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:38:25,521 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:25,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:25,524 INFO L85 PathProgramCache]: Analyzing trace with hash 345514193, now seen corresponding path program 1 times [2024-06-27 22:38:25,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:25,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338876678] [2024-06-27 22:38:25,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:25,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:26,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:26,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338876678] [2024-06-27 22:38:26,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338876678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:26,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:26,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:38:26,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156201999] [2024-06-27 22:38:26,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:26,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:38:26,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:26,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:38:26,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:38:26,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:38:26,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:26,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:26,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:38:26,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:26,446 INFO L124 PetriNetUnfolderBase]: 538/1073 cut-off events. [2024-06-27 22:38:26,447 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-06-27 22:38:26,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1946 conditions, 1073 events. 538/1073 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6757 event pairs, 286 based on Foata normal form. 45/1053 useless extension candidates. Maximal degree in co-relation 1934. Up to 688 conditions per place. [2024-06-27 22:38:26,458 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 30 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-06-27 22:38:26,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 186 flow [2024-06-27 22:38:26,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:38:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:38:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-06-27 22:38:26,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75177304964539 [2024-06-27 22:38:26,470 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 97 flow. Second operand 3 states and 106 transitions. [2024-06-27 22:38:26,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 186 flow [2024-06-27 22:38:26,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:38:26,478 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 96 flow [2024-06-27 22:38:26,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2024-06-27 22:38:26,483 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2024-06-27 22:38:26,484 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 96 flow [2024-06-27 22:38:26,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:26,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:26,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:26,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:38:26,485 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:26,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:26,486 INFO L85 PathProgramCache]: Analyzing trace with hash 544364297, now seen corresponding path program 1 times [2024-06-27 22:38:26,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:26,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616082839] [2024-06-27 22:38:26,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:26,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:26,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:26,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616082839] [2024-06-27 22:38:26,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616082839] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:26,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:26,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:38:26,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055584954] [2024-06-27 22:38:26,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:26,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:38:26,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:26,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:38:26,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:38:26,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:38:26,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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-06-27 22:38:26,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:26,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:38:26,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:27,120 INFO L124 PetriNetUnfolderBase]: 482/1006 cut-off events. [2024-06-27 22:38:27,121 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2024-06-27 22:38:27,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1943 conditions, 1006 events. 482/1006 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6264 event pairs, 117 based on Foata normal form. 6/963 useless extension candidates. Maximal degree in co-relation 1931. Up to 672 conditions per place. [2024-06-27 22:38:27,127 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 33 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2024-06-27 22:38:27,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 225 flow [2024-06-27 22:38:27,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:38:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:38:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2024-06-27 22:38:27,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6968085106382979 [2024-06-27 22:38:27,132 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 96 flow. Second operand 4 states and 131 transitions. [2024-06-27 22:38:27,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 225 flow [2024-06-27 22:38:27,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 219 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:38:27,135 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 146 flow [2024-06-27 22:38:27,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2024-06-27 22:38:27,136 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2024-06-27 22:38:27,136 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 146 flow [2024-06-27 22:38:27,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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-06-27 22:38:27,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:27,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:27,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:38:27,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:27,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:27,138 INFO L85 PathProgramCache]: Analyzing trace with hash -2015508548, now seen corresponding path program 1 times [2024-06-27 22:38:27,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:27,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578302785] [2024-06-27 22:38:27,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:27,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:27,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:27,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578302785] [2024-06-27 22:38:27,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578302785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:27,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:27,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:38:27,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838846809] [2024-06-27 22:38:27,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:27,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:38:27,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:27,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:38:27,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:38:27,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:38:27,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:27,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:27,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:38:27,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:27,904 INFO L124 PetriNetUnfolderBase]: 555/1140 cut-off events. [2024-06-27 22:38:27,904 INFO L125 PetriNetUnfolderBase]: For 389/397 co-relation queries the response was YES. [2024-06-27 22:38:27,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2621 conditions, 1140 events. 555/1140 cut-off events. For 389/397 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7261 event pairs, 183 based on Foata normal form. 10/1106 useless extension candidates. Maximal degree in co-relation 2607. Up to 706 conditions per place. [2024-06-27 22:38:27,911 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 58 selfloop transitions, 13 changer transitions 0/90 dead transitions. [2024-06-27 22:38:27,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 90 transitions, 429 flow [2024-06-27 22:38:27,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:38:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:38:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2024-06-27 22:38:27,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.723404255319149 [2024-06-27 22:38:27,913 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 146 flow. Second operand 5 states and 170 transitions. [2024-06-27 22:38:27,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 90 transitions, 429 flow [2024-06-27 22:38:27,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 90 transitions, 429 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 22:38:27,915 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 262 flow [2024-06-27 22:38:27,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2024-06-27 22:38:27,916 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2024-06-27 22:38:27,916 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 262 flow [2024-06-27 22:38:27,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:27,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:27,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:27,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:38:27,917 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:27,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1680184519, now seen corresponding path program 1 times [2024-06-27 22:38:27,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:27,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935591589] [2024-06-27 22:38:27,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:27,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:28,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:28,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:28,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935591589] [2024-06-27 22:38:28,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935591589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:28,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:28,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:38:28,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614192460] [2024-06-27 22:38:28,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:28,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:38:28,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:28,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:38:28,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:38:28,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:38:28,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 262 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:28,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:28,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:38:28,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:28,646 INFO L124 PetriNetUnfolderBase]: 547/1131 cut-off events. [2024-06-27 22:38:28,646 INFO L125 PetriNetUnfolderBase]: For 1079/1111 co-relation queries the response was YES. [2024-06-27 22:38:28,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3117 conditions, 1131 events. 547/1131 cut-off events. For 1079/1111 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7199 event pairs, 144 based on Foata normal form. 12/1096 useless extension candidates. Maximal degree in co-relation 3098. Up to 749 conditions per place. [2024-06-27 22:38:28,655 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 46 selfloop transitions, 15 changer transitions 0/80 dead transitions. [2024-06-27 22:38:28,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 80 transitions, 451 flow [2024-06-27 22:38:28,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:38:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:38:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-06-27 22:38:28,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6893617021276596 [2024-06-27 22:38:28,658 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 262 flow. Second operand 5 states and 162 transitions. [2024-06-27 22:38:28,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 80 transitions, 451 flow [2024-06-27 22:38:28,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 80 transitions, 445 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-06-27 22:38:28,665 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 320 flow [2024-06-27 22:38:28,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2024-06-27 22:38:28,666 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2024-06-27 22:38:28,666 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 320 flow [2024-06-27 22:38:28,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:28,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:28,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:28,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:38:28,667 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:28,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:28,668 INFO L85 PathProgramCache]: Analyzing trace with hash 395336698, now seen corresponding path program 1 times [2024-06-27 22:38:28,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:28,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806628003] [2024-06-27 22:38:28,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:28,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:29,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-06-27 22:38:29,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:29,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806628003] [2024-06-27 22:38:29,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806628003] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:29,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:29,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:38:29,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193317356] [2024-06-27 22:38:29,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:29,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:38:29,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:29,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:38:29,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:38:29,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:38:29,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:29,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:29,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:38:29,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:29,782 INFO L124 PetriNetUnfolderBase]: 928/1889 cut-off events. [2024-06-27 22:38:29,782 INFO L125 PetriNetUnfolderBase]: For 2267/2313 co-relation queries the response was YES. [2024-06-27 22:38:29,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5293 conditions, 1889 events. 928/1889 cut-off events. For 2267/2313 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 13260 event pairs, 95 based on Foata normal form. 24/1860 useless extension candidates. Maximal degree in co-relation 5270. Up to 850 conditions per place. [2024-06-27 22:38:29,796 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 62 selfloop transitions, 28 changer transitions 0/107 dead transitions. [2024-06-27 22:38:29,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 107 transitions, 662 flow [2024-06-27 22:38:29,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:38:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:38:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 216 transitions. [2024-06-27 22:38:29,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6565349544072948 [2024-06-27 22:38:29,798 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 320 flow. Second operand 7 states and 216 transitions. [2024-06-27 22:38:29,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 107 transitions, 662 flow [2024-06-27 22:38:29,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 107 transitions, 624 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 22:38:29,804 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 457 flow [2024-06-27 22:38:29,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=457, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2024-06-27 22:38:29,805 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2024-06-27 22:38:29,805 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 457 flow [2024-06-27 22:38:29,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:29,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:29,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:29,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:38:29,806 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:29,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:29,806 INFO L85 PathProgramCache]: Analyzing trace with hash 714849044, now seen corresponding path program 2 times [2024-06-27 22:38:29,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:29,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436827018] [2024-06-27 22:38:29,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:29,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:30,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-06-27 22:38:30,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:30,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436827018] [2024-06-27 22:38:30,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436827018] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:30,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:30,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:38:30,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394537747] [2024-06-27 22:38:30,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:30,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:38:30,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:30,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:38:30,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:38:30,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:38:30,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 457 flow. Second operand has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:30,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:30,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:38:30,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:30,907 INFO L124 PetriNetUnfolderBase]: 891/1894 cut-off events. [2024-06-27 22:38:30,907 INFO L125 PetriNetUnfolderBase]: For 4153/4195 co-relation queries the response was YES. [2024-06-27 22:38:30,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5919 conditions, 1894 events. 891/1894 cut-off events. For 4153/4195 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 13804 event pairs, 272 based on Foata normal form. 24/1849 useless extension candidates. Maximal degree in co-relation 5891. Up to 1137 conditions per place. [2024-06-27 22:38:30,920 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 66 selfloop transitions, 16 changer transitions 0/100 dead transitions. [2024-06-27 22:38:30,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 100 transitions, 707 flow [2024-06-27 22:38:30,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:38:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:38:30,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2024-06-27 22:38:30,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6413373860182371 [2024-06-27 22:38:30,922 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 457 flow. Second operand 7 states and 211 transitions. [2024-06-27 22:38:30,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 100 transitions, 707 flow [2024-06-27 22:38:30,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 100 transitions, 671 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-27 22:38:30,931 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 458 flow [2024-06-27 22:38:30,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=458, PETRI_PLACES=77, PETRI_TRANSITIONS=71} [2024-06-27 22:38:30,934 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2024-06-27 22:38:30,934 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 458 flow [2024-06-27 22:38:30,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:30,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:30,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:30,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:38:30,935 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:30,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:30,935 INFO L85 PathProgramCache]: Analyzing trace with hash 319147238, now seen corresponding path program 3 times [2024-06-27 22:38:30,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:30,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770826000] [2024-06-27 22:38:30,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:30,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:31,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:31,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770826000] [2024-06-27 22:38:31,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770826000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:31,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:31,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:38:31,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662148441] [2024-06-27 22:38:31,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:31,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:38:31,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:31,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:38:31,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:38:31,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:38:31,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 458 flow. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:31,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:31,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:38:31,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:31,884 INFO L124 PetriNetUnfolderBase]: 1075/2372 cut-off events. [2024-06-27 22:38:31,884 INFO L125 PetriNetUnfolderBase]: For 4895/4943 co-relation queries the response was YES. [2024-06-27 22:38:31,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6824 conditions, 2372 events. 1075/2372 cut-off events. For 4895/4943 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 18915 event pairs, 301 based on Foata normal form. 24/2300 useless extension candidates. Maximal degree in co-relation 6795. Up to 704 conditions per place. [2024-06-27 22:38:31,903 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 67 selfloop transitions, 26 changer transitions 0/112 dead transitions. [2024-06-27 22:38:31,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 112 transitions, 832 flow [2024-06-27 22:38:31,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:38:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:38:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2024-06-27 22:38:31,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7056737588652482 [2024-06-27 22:38:31,905 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 458 flow. Second operand 6 states and 199 transitions. [2024-06-27 22:38:31,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 112 transitions, 832 flow [2024-06-27 22:38:31,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 112 transitions, 782 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-27 22:38:31,913 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 525 flow [2024-06-27 22:38:31,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=525, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2024-06-27 22:38:31,914 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2024-06-27 22:38:31,914 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 525 flow [2024-06-27 22:38:31,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:31,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:31,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:31,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:38:31,915 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:31,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:31,915 INFO L85 PathProgramCache]: Analyzing trace with hash 132156972, now seen corresponding path program 1 times [2024-06-27 22:38:31,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:31,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470263946] [2024-06-27 22:38:31,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:31,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:32,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:32,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:32,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470263946] [2024-06-27 22:38:32,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470263946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:32,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:32,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:38:32,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678626840] [2024-06-27 22:38:32,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:32,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:38:32,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:32,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:38:32,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:38:32,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:38:32,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 525 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:32,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:32,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:38:32,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:32,534 INFO L124 PetriNetUnfolderBase]: 1094/2351 cut-off events. [2024-06-27 22:38:32,534 INFO L125 PetriNetUnfolderBase]: For 6377/6425 co-relation queries the response was YES. [2024-06-27 22:38:32,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7224 conditions, 2351 events. 1094/2351 cut-off events. For 6377/6425 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 18323 event pairs, 433 based on Foata normal form. 14/2285 useless extension candidates. Maximal degree in co-relation 7193. Up to 1652 conditions per place. [2024-06-27 22:38:32,551 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 57 selfloop transitions, 13 changer transitions 0/89 dead transitions. [2024-06-27 22:38:32,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 89 transitions, 723 flow [2024-06-27 22:38:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:38:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:38:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2024-06-27 22:38:32,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6914893617021277 [2024-06-27 22:38:32,552 INFO L175 Difference]: Start difference. First operand has 79 places, 73 transitions, 525 flow. Second operand 4 states and 130 transitions. [2024-06-27 22:38:32,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 89 transitions, 723 flow [2024-06-27 22:38:32,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 89 transitions, 686 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 22:38:32,561 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 560 flow [2024-06-27 22:38:32,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=560, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2024-06-27 22:38:32,562 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2024-06-27 22:38:32,562 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 560 flow [2024-06-27 22:38:32,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:32,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:32,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:32,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:38:32,562 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:32,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:32,563 INFO L85 PathProgramCache]: Analyzing trace with hash 943091818, now seen corresponding path program 2 times [2024-06-27 22:38:32,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:32,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410826561] [2024-06-27 22:38:32,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:32,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:32,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:32,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410826561] [2024-06-27 22:38:32,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410826561] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:32,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:32,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:38:32,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948014084] [2024-06-27 22:38:32,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:32,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:38:32,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:32,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:38:32,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:38:32,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:38:32,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 560 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:32,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:32,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:38:32,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:33,104 INFO L124 PetriNetUnfolderBase]: 1005/2175 cut-off events. [2024-06-27 22:38:33,104 INFO L125 PetriNetUnfolderBase]: For 5591/5615 co-relation queries the response was YES. [2024-06-27 22:38:33,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6670 conditions, 2175 events. 1005/2175 cut-off events. For 5591/5615 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 16624 event pairs, 445 based on Foata normal form. 6/2099 useless extension candidates. Maximal degree in co-relation 6638. Up to 1568 conditions per place. [2024-06-27 22:38:33,122 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 63 selfloop transitions, 15 changer transitions 0/97 dead transitions. [2024-06-27 22:38:33,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 97 transitions, 825 flow [2024-06-27 22:38:33,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:38:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:38:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-06-27 22:38:33,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7021276595744681 [2024-06-27 22:38:33,124 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 560 flow. Second operand 4 states and 132 transitions. [2024-06-27 22:38:33,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 97 transitions, 825 flow [2024-06-27 22:38:33,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 97 transitions, 799 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 22:38:33,134 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 662 flow [2024-06-27 22:38:33,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=662, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2024-06-27 22:38:33,135 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 30 predicate places. [2024-06-27 22:38:33,135 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 662 flow [2024-06-27 22:38:33,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:33,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:33,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:33,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:38:33,137 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:33,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:33,137 INFO L85 PathProgramCache]: Analyzing trace with hash -600833493, now seen corresponding path program 1 times [2024-06-27 22:38:33,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:33,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446661209] [2024-06-27 22:38:33,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:33,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:33,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:33,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446661209] [2024-06-27 22:38:33,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446661209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:33,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:33,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:38:33,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579904007] [2024-06-27 22:38:33,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:33,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:38:33,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:33,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:38:33,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:38:33,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-06-27 22:38:33,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 662 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 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-06-27 22:38:33,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:33,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-06-27 22:38:33,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:34,748 INFO L124 PetriNetUnfolderBase]: 8498/14414 cut-off events. [2024-06-27 22:38:34,749 INFO L125 PetriNetUnfolderBase]: For 36374/36416 co-relation queries the response was YES. [2024-06-27 22:38:34,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43755 conditions, 14414 events. 8498/14414 cut-off events. For 36374/36416 co-relation queries the response was YES. Maximal size of possible extension queue 1001. Compared 121574 event pairs, 1703 based on Foata normal form. 2/13909 useless extension candidates. Maximal degree in co-relation 43721. Up to 4374 conditions per place. [2024-06-27 22:38:34,824 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 107 selfloop transitions, 15 changer transitions 146/281 dead transitions. [2024-06-27 22:38:34,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 281 transitions, 2838 flow [2024-06-27 22:38:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:38:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:38:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 279 transitions. [2024-06-27 22:38:34,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-06-27 22:38:34,826 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 662 flow. Second operand 9 states and 279 transitions. [2024-06-27 22:38:34,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 281 transitions, 2838 flow [2024-06-27 22:38:34,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 281 transitions, 2798 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-27 22:38:34,880 INFO L231 Difference]: Finished difference. Result has 98 places, 94 transitions, 888 flow [2024-06-27 22:38:34,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=888, PETRI_PLACES=98, PETRI_TRANSITIONS=94} [2024-06-27 22:38:34,880 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 45 predicate places. [2024-06-27 22:38:34,880 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 94 transitions, 888 flow [2024-06-27 22:38:34,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 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-06-27 22:38:34,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:34,881 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-06-27 22:38:34,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:38:34,881 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:34,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:34,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1359207269, now seen corresponding path program 1 times [2024-06-27 22:38:34,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:34,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713745720] [2024-06-27 22:38:34,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:34,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:35,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:35,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:35,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713745720] [2024-06-27 22:38:35,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713745720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:35,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:35,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:38:35,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100862818] [2024-06-27 22:38:35,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:35,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:38:35,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:35,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:38:35,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:38:35,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:38:35,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 888 flow. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:35,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:35,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:38:35,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:36,292 INFO L124 PetriNetUnfolderBase]: 3104/6251 cut-off events. [2024-06-27 22:38:36,293 INFO L125 PetriNetUnfolderBase]: For 34434/36625 co-relation queries the response was YES. [2024-06-27 22:38:36,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24277 conditions, 6251 events. 3104/6251 cut-off events. For 34434/36625 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 55841 event pairs, 1179 based on Foata normal form. 507/6411 useless extension candidates. Maximal degree in co-relation 24233. Up to 3750 conditions per place. [2024-06-27 22:38:36,339 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 75 selfloop transitions, 36 changer transitions 0/131 dead transitions. [2024-06-27 22:38:36,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 131 transitions, 1310 flow [2024-06-27 22:38:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:38:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:38:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2024-06-27 22:38:36,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6524822695035462 [2024-06-27 22:38:36,341 INFO L175 Difference]: Start difference. First operand has 98 places, 94 transitions, 888 flow. Second operand 6 states and 184 transitions. [2024-06-27 22:38:36,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 131 transitions, 1310 flow [2024-06-27 22:38:36,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 131 transitions, 1256 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-27 22:38:36,469 INFO L231 Difference]: Finished difference. Result has 94 places, 101 transitions, 1032 flow [2024-06-27 22:38:36,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1032, PETRI_PLACES=94, PETRI_TRANSITIONS=101} [2024-06-27 22:38:36,469 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 41 predicate places. [2024-06-27 22:38:36,469 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 101 transitions, 1032 flow [2024-06-27 22:38:36,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:36,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:36,470 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-06-27 22:38:36,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:38:36,470 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:36,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:36,470 INFO L85 PathProgramCache]: Analyzing trace with hash -743901332, now seen corresponding path program 1 times [2024-06-27 22:38:36,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:36,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901237248] [2024-06-27 22:38:36,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:36,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:36,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:36,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901237248] [2024-06-27 22:38:36,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901237248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:36,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:36,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:38:36,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449882719] [2024-06-27 22:38:36,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:36,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:38:36,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:36,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:38:36,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:38:36,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:38:36,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 101 transitions, 1032 flow. Second operand has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:36,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:36,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:38:36,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:38,027 INFO L124 PetriNetUnfolderBase]: 5882/10368 cut-off events. [2024-06-27 22:38:38,027 INFO L125 PetriNetUnfolderBase]: For 47963/47963 co-relation queries the response was YES. [2024-06-27 22:38:38,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40954 conditions, 10368 events. 5882/10368 cut-off events. For 47963/47963 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 86042 event pairs, 1367 based on Foata normal form. 309/10579 useless extension candidates. Maximal degree in co-relation 40909. Up to 3717 conditions per place. [2024-06-27 22:38:38,092 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 128 selfloop transitions, 19 changer transitions 139/297 dead transitions. [2024-06-27 22:38:38,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 297 transitions, 3788 flow [2024-06-27 22:38:38,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:38:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:38:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 261 transitions. [2024-06-27 22:38:38,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504835589941973 [2024-06-27 22:38:38,095 INFO L175 Difference]: Start difference. First operand has 94 places, 101 transitions, 1032 flow. Second operand 11 states and 261 transitions. [2024-06-27 22:38:38,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 297 transitions, 3788 flow [2024-06-27 22:38:38,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 297 transitions, 3690 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-27 22:38:38,215 INFO L231 Difference]: Finished difference. Result has 110 places, 104 transitions, 1127 flow [2024-06-27 22:38:38,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1127, PETRI_PLACES=110, PETRI_TRANSITIONS=104} [2024-06-27 22:38:38,217 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 57 predicate places. [2024-06-27 22:38:38,217 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 104 transitions, 1127 flow [2024-06-27 22:38:38,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:38,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:38,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:38,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:38:38,218 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:38,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:38,219 INFO L85 PathProgramCache]: Analyzing trace with hash -415837684, now seen corresponding path program 1 times [2024-06-27 22:38:38,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:38,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187425378] [2024-06-27 22:38:38,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:38,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:38,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:38,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187425378] [2024-06-27 22:38:38,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187425378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:38,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:38,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:38:38,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131995170] [2024-06-27 22:38:38,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:38,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:38:38,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:38,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:38:38,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:38:38,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:38:38,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 104 transitions, 1127 flow. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:38,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:38,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:38:38,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:39,780 INFO L124 PetriNetUnfolderBase]: 3234/6471 cut-off events. [2024-06-27 22:38:39,780 INFO L125 PetriNetUnfolderBase]: For 43802/46864 co-relation queries the response was YES. [2024-06-27 22:38:39,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27249 conditions, 6471 events. 3234/6471 cut-off events. For 43802/46864 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 57168 event pairs, 957 based on Foata normal form. 823/7008 useless extension candidates. Maximal degree in co-relation 27195. Up to 3811 conditions per place. [2024-06-27 22:38:39,828 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 76 selfloop transitions, 30 changer transitions 0/127 dead transitions. [2024-06-27 22:38:39,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 127 transitions, 1457 flow [2024-06-27 22:38:39,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:38:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:38:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2024-06-27 22:38:39,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6808510638297872 [2024-06-27 22:38:39,829 INFO L175 Difference]: Start difference. First operand has 110 places, 104 transitions, 1127 flow. Second operand 4 states and 128 transitions. [2024-06-27 22:38:39,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 127 transitions, 1457 flow [2024-06-27 22:38:39,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 127 transitions, 1422 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-27 22:38:39,925 INFO L231 Difference]: Finished difference. Result has 102 places, 107 transitions, 1235 flow [2024-06-27 22:38:39,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1235, PETRI_PLACES=102, PETRI_TRANSITIONS=107} [2024-06-27 22:38:39,926 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 49 predicate places. [2024-06-27 22:38:39,926 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 107 transitions, 1235 flow [2024-06-27 22:38:39,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:39,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:39,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:39,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:38:39,927 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:39,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:39,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1193865082, now seen corresponding path program 2 times [2024-06-27 22:38:39,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:39,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169688320] [2024-06-27 22:38:39,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:39,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38: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-06-27 22:38:40,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:40,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169688320] [2024-06-27 22:38:40,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169688320] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:40,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:40,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:38:40,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830072333] [2024-06-27 22:38:40,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:40,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:38:40,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:40,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:38:40,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:38:40,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:38:40,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 107 transitions, 1235 flow. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:40,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:40,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:38:40,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:41,406 INFO L124 PetriNetUnfolderBase]: 2754/5565 cut-off events. [2024-06-27 22:38:41,406 INFO L125 PetriNetUnfolderBase]: For 38876/41074 co-relation queries the response was YES. [2024-06-27 22:38:41,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23425 conditions, 5565 events. 2754/5565 cut-off events. For 38876/41074 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 48236 event pairs, 981 based on Foata normal form. 516/5822 useless extension candidates. Maximal degree in co-relation 23374. Up to 3481 conditions per place. [2024-06-27 22:38:41,441 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 83 selfloop transitions, 24 changer transitions 0/129 dead transitions. [2024-06-27 22:38:41,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 129 transitions, 1521 flow [2024-06-27 22:38:41,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:38:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:38:41,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2024-06-27 22:38:41,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6347517730496454 [2024-06-27 22:38:41,442 INFO L175 Difference]: Start difference. First operand has 102 places, 107 transitions, 1235 flow. Second operand 6 states and 179 transitions. [2024-06-27 22:38:41,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 129 transitions, 1521 flow [2024-06-27 22:38:41,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 129 transitions, 1468 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-27 22:38:41,502 INFO L231 Difference]: Finished difference. Result has 104 places, 109 transitions, 1271 flow [2024-06-27 22:38:41,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1271, PETRI_PLACES=104, PETRI_TRANSITIONS=109} [2024-06-27 22:38:41,503 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 51 predicate places. [2024-06-27 22:38:41,503 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 109 transitions, 1271 flow [2024-06-27 22:38:41,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:41,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:41,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:41,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:38:41,504 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:41,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:41,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1009726162, now seen corresponding path program 3 times [2024-06-27 22:38:41,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:41,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803859062] [2024-06-27 22:38:41,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:41,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:42,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:42,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803859062] [2024-06-27 22:38:42,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803859062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:42,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:42,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:38:42,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238897615] [2024-06-27 22:38:42,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:42,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:38:42,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:42,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:38:42,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:38:42,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:38:42,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 109 transitions, 1271 flow. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:42,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:42,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:38:42,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:42,767 INFO L124 PetriNetUnfolderBase]: 2765/5598 cut-off events. [2024-06-27 22:38:42,767 INFO L125 PetriNetUnfolderBase]: For 39863/42238 co-relation queries the response was YES. [2024-06-27 22:38:42,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23422 conditions, 5598 events. 2765/5598 cut-off events. For 39863/42238 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 48756 event pairs, 934 based on Foata normal form. 472/5791 useless extension candidates. Maximal degree in co-relation 23371. Up to 3463 conditions per place. [2024-06-27 22:38:42,811 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 82 selfloop transitions, 31 changer transitions 1/136 dead transitions. [2024-06-27 22:38:42,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 136 transitions, 1623 flow [2024-06-27 22:38:42,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:38:42,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:38:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2024-06-27 22:38:42,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.676595744680851 [2024-06-27 22:38:42,813 INFO L175 Difference]: Start difference. First operand has 104 places, 109 transitions, 1271 flow. Second operand 5 states and 159 transitions. [2024-06-27 22:38:42,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 136 transitions, 1623 flow [2024-06-27 22:38:42,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 136 transitions, 1566 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-27 22:38:42,870 INFO L231 Difference]: Finished difference. Result has 107 places, 114 transitions, 1393 flow [2024-06-27 22:38:42,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1393, PETRI_PLACES=107, PETRI_TRANSITIONS=114} [2024-06-27 22:38:42,871 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 54 predicate places. [2024-06-27 22:38:42,871 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 114 transitions, 1393 flow [2024-06-27 22:38:42,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:42,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:42,872 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-06-27 22:38:42,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:38:42,872 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:42,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:42,873 INFO L85 PathProgramCache]: Analyzing trace with hash 481842921, now seen corresponding path program 1 times [2024-06-27 22:38:42,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:42,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123815894] [2024-06-27 22:38:42,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:42,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:42,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:42,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123815894] [2024-06-27 22:38:42,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123815894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:42,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:42,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:38:42,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689601119] [2024-06-27 22:38:42,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:42,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:38:42,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:42,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:38:42,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:38:43,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:38:43,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 114 transitions, 1393 flow. Second operand has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:43,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:43,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:38:43,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:44,636 INFO L124 PetriNetUnfolderBase]: 7396/13177 cut-off events. [2024-06-27 22:38:44,637 INFO L125 PetriNetUnfolderBase]: For 80751/80757 co-relation queries the response was YES. [2024-06-27 22:38:44,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56107 conditions, 13177 events. 7396/13177 cut-off events. For 80751/80757 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 117420 event pairs, 1341 based on Foata normal form. 461/13505 useless extension candidates. Maximal degree in co-relation 56054. Up to 2552 conditions per place. [2024-06-27 22:38:44,730 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 162 selfloop transitions, 25 changer transitions 220/418 dead transitions. [2024-06-27 22:38:44,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 418 transitions, 6008 flow [2024-06-27 22:38:44,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:38:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:38:44,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 320 transitions. [2024-06-27 22:38:44,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5237315875613748 [2024-06-27 22:38:44,732 INFO L175 Difference]: Start difference. First operand has 107 places, 114 transitions, 1393 flow. Second operand 13 states and 320 transitions. [2024-06-27 22:38:44,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 418 transitions, 6008 flow [2024-06-27 22:38:44,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 418 transitions, 5904 flow, removed 21 selfloop flow, removed 1 redundant places. [2024-06-27 22:38:44,936 INFO L231 Difference]: Finished difference. Result has 127 places, 106 transitions, 1338 flow [2024-06-27 22:38:44,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1338, PETRI_PLACES=127, PETRI_TRANSITIONS=106} [2024-06-27 22:38:44,936 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 74 predicate places. [2024-06-27 22:38:44,936 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 106 transitions, 1338 flow [2024-06-27 22:38:44,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:44,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:44,937 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-06-27 22:38:44,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:38:44,937 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:44,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:44,937 INFO L85 PathProgramCache]: Analyzing trace with hash 499886101, now seen corresponding path program 1 times [2024-06-27 22:38:44,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:44,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559620764] [2024-06-27 22:38:44,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:44,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:45,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:45,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559620764] [2024-06-27 22:38:45,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559620764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:45,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:45,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:38:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766270232] [2024-06-27 22:38:45,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:45,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:38:45,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:45,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:38:45,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:38:45,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:38:45,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 106 transitions, 1338 flow. Second operand has 8 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:45,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:45,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:38:45,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:46,886 INFO L124 PetriNetUnfolderBase]: 3351/6934 cut-off events. [2024-06-27 22:38:46,886 INFO L125 PetriNetUnfolderBase]: For 55588/58759 co-relation queries the response was YES. [2024-06-27 22:38:46,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28190 conditions, 6934 events. 3351/6934 cut-off events. For 55588/58759 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 65507 event pairs, 1086 based on Foata normal form. 772/7469 useless extension candidates. Maximal degree in co-relation 28126. Up to 3151 conditions per place. [2024-06-27 22:38:46,945 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 78 selfloop transitions, 20 changer transitions 9/137 dead transitions. [2024-06-27 22:38:46,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 137 transitions, 1654 flow [2024-06-27 22:38:46,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:38:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:38:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2024-06-27 22:38:46,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6413373860182371 [2024-06-27 22:38:46,947 INFO L175 Difference]: Start difference. First operand has 127 places, 106 transitions, 1338 flow. Second operand 7 states and 211 transitions. [2024-06-27 22:38:46,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 137 transitions, 1654 flow [2024-06-27 22:38:47,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 137 transitions, 1541 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-27 22:38:47,057 INFO L231 Difference]: Finished difference. Result has 121 places, 103 transitions, 1192 flow [2024-06-27 22:38:47,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1192, PETRI_PLACES=121, PETRI_TRANSITIONS=103} [2024-06-27 22:38:47,058 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 68 predicate places. [2024-06-27 22:38:47,058 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 103 transitions, 1192 flow [2024-06-27 22:38:47,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:47,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:47,058 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-06-27 22:38:47,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:38:47,058 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:47,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:47,059 INFO L85 PathProgramCache]: Analyzing trace with hash 716234125, now seen corresponding path program 2 times [2024-06-27 22:38:47,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:47,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965283434] [2024-06-27 22:38:47,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:47,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:47,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:47,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:47,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965283434] [2024-06-27 22:38:47,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965283434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:47,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:47,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:38:47,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811415317] [2024-06-27 22:38:47,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:47,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:38:47,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:47,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:38:47,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:38:47,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:38:47,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 103 transitions, 1192 flow. Second operand has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:47,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:47,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:38:47,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:49,041 INFO L124 PetriNetUnfolderBase]: 3884/8026 cut-off events. [2024-06-27 22:38:49,041 INFO L125 PetriNetUnfolderBase]: For 51525/55087 co-relation queries the response was YES. [2024-06-27 22:38:49,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30114 conditions, 8026 events. 3884/8026 cut-off events. For 51525/55087 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 76493 event pairs, 1703 based on Foata normal form. 465/8190 useless extension candidates. Maximal degree in co-relation 30053. Up to 5377 conditions per place. [2024-06-27 22:38:49,093 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 67 selfloop transitions, 5 changer transitions 44/145 dead transitions. [2024-06-27 22:38:49,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 145 transitions, 1554 flow [2024-06-27 22:38:49,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:38:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:38:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2024-06-27 22:38:49,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6413373860182371 [2024-06-27 22:38:49,094 INFO L175 Difference]: Start difference. First operand has 121 places, 103 transitions, 1192 flow. Second operand 7 states and 211 transitions. [2024-06-27 22:38:49,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 145 transitions, 1554 flow [2024-06-27 22:38:49,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 145 transitions, 1501 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-27 22:38:49,178 INFO L231 Difference]: Finished difference. Result has 121 places, 95 transitions, 1052 flow [2024-06-27 22:38:49,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1052, PETRI_PLACES=121, PETRI_TRANSITIONS=95} [2024-06-27 22:38:49,178 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 68 predicate places. [2024-06-27 22:38:49,179 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 95 transitions, 1052 flow [2024-06-27 22:38:49,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:49,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:49,179 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-06-27 22:38:49,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:38:49,179 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:49,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1486081805, now seen corresponding path program 3 times [2024-06-27 22:38:49,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:49,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131454550] [2024-06-27 22:38:49,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:49,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:49,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:49,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131454550] [2024-06-27 22:38:49,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131454550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:49,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:49,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:38:49,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968827339] [2024-06-27 22:38:49,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:49,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:38:49,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:49,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:38:49,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:38:49,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:38:49,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 95 transitions, 1052 flow. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:49,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:49,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:38:49,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:50,683 INFO L124 PetriNetUnfolderBase]: 2945/6275 cut-off events. [2024-06-27 22:38:50,683 INFO L125 PetriNetUnfolderBase]: For 40254/42412 co-relation queries the response was YES. [2024-06-27 22:38:50,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23604 conditions, 6275 events. 2945/6275 cut-off events. For 40254/42412 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 59157 event pairs, 956 based on Foata normal form. 627/6716 useless extension candidates. Maximal degree in co-relation 23545. Up to 2395 conditions per place. [2024-06-27 22:38:50,721 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 70 selfloop transitions, 25 changer transitions 2/128 dead transitions. [2024-06-27 22:38:50,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 128 transitions, 1376 flow [2024-06-27 22:38:50,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:38:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:38:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2024-06-27 22:38:50,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6808510638297872 [2024-06-27 22:38:50,723 INFO L175 Difference]: Start difference. First operand has 121 places, 95 transitions, 1052 flow. Second operand 6 states and 192 transitions. [2024-06-27 22:38:50,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 128 transitions, 1376 flow [2024-06-27 22:38:50,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 128 transitions, 1326 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-27 22:38:50,772 INFO L231 Difference]: Finished difference. Result has 115 places, 95 transitions, 1078 flow [2024-06-27 22:38:50,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1078, PETRI_PLACES=115, PETRI_TRANSITIONS=95} [2024-06-27 22:38:50,773 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 62 predicate places. [2024-06-27 22:38:50,773 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 95 transitions, 1078 flow [2024-06-27 22:38:50,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:50,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:50,773 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-06-27 22:38:50,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:38:50,774 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:50,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:50,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1551748191, now seen corresponding path program 4 times [2024-06-27 22:38:50,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:50,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308271401] [2024-06-27 22:38:50,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:50,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:51,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:51,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308271401] [2024-06-27 22:38:51,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308271401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:51,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:51,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:38:51,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407378587] [2024-06-27 22:38:51,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:51,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:38:51,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:51,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:38:51,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:38:51,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:38:51,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 95 transitions, 1078 flow. Second operand has 9 states, 9 states have (on average 22.666666666666668) internal successors, (204), 9 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:51,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:51,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:38:51,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:52,462 INFO L124 PetriNetUnfolderBase]: 2951/6317 cut-off events. [2024-06-27 22:38:52,462 INFO L125 PetriNetUnfolderBase]: For 46977/49744 co-relation queries the response was YES. [2024-06-27 22:38:52,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24266 conditions, 6317 events. 2951/6317 cut-off events. For 46977/49744 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 60611 event pairs, 1340 based on Foata normal form. 612/6713 useless extension candidates. Maximal degree in co-relation 24212. Up to 3413 conditions per place. [2024-06-27 22:38:52,502 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 72 selfloop transitions, 14 changer transitions 11/127 dead transitions. [2024-06-27 22:38:52,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 127 transitions, 1370 flow [2024-06-27 22:38:52,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:38:52,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:38:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2024-06-27 22:38:52,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6443768996960486 [2024-06-27 22:38:52,503 INFO L175 Difference]: Start difference. First operand has 115 places, 95 transitions, 1078 flow. Second operand 7 states and 212 transitions. [2024-06-27 22:38:52,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 127 transitions, 1370 flow [2024-06-27 22:38:52,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 127 transitions, 1322 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-27 22:38:52,578 INFO L231 Difference]: Finished difference. Result has 117 places, 91 transitions, 991 flow [2024-06-27 22:38:52,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=991, PETRI_PLACES=117, PETRI_TRANSITIONS=91} [2024-06-27 22:38:52,578 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 64 predicate places. [2024-06-27 22:38:52,578 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 91 transitions, 991 flow [2024-06-27 22:38:52,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.666666666666668) internal successors, (204), 9 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:52,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:52,579 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-06-27 22:38:52,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:38:52,579 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:52,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:52,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1736112175, now seen corresponding path program 5 times [2024-06-27 22:38:52,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:52,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555153846] [2024-06-27 22:38:52,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:52,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:53,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:53,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555153846] [2024-06-27 22:38:53,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555153846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:53,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:53,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:38:53,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697329747] [2024-06-27 22:38:53,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:53,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:38:53,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:53,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:38:53,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:38:53,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:38:53,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 91 transitions, 991 flow. Second operand has 8 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:53,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:53,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:38:53,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:53,959 INFO L124 PetriNetUnfolderBase]: 2632/5642 cut-off events. [2024-06-27 22:38:53,959 INFO L125 PetriNetUnfolderBase]: For 38014/40477 co-relation queries the response was YES. [2024-06-27 22:38:53,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21613 conditions, 5642 events. 2632/5642 cut-off events. For 38014/40477 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 53087 event pairs, 1344 based on Foata normal form. 242/5653 useless extension candidates. Maximal degree in co-relation 21559. Up to 4094 conditions per place. [2024-06-27 22:38:53,995 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 56 selfloop transitions, 4 changer transitions 21/111 dead transitions. [2024-06-27 22:38:53,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 111 transitions, 1195 flow [2024-06-27 22:38:53,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:38:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:38:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2024-06-27 22:38:53,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6099290780141844 [2024-06-27 22:38:53,996 INFO L175 Difference]: Start difference. First operand has 117 places, 91 transitions, 991 flow. Second operand 6 states and 172 transitions. [2024-06-27 22:38:53,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 111 transitions, 1195 flow [2024-06-27 22:38:54,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 111 transitions, 1093 flow, removed 13 selfloop flow, removed 15 redundant places. [2024-06-27 22:38:54,053 INFO L231 Difference]: Finished difference. Result has 106 places, 85 transitions, 821 flow [2024-06-27 22:38:54,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=821, PETRI_PLACES=106, PETRI_TRANSITIONS=85} [2024-06-27 22:38:54,054 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 53 predicate places. [2024-06-27 22:38:54,054 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 85 transitions, 821 flow [2024-06-27 22:38:54,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:54,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:54,055 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] [2024-06-27 22:38:54,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:38:54,055 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:54,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:54,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1012008455, now seen corresponding path program 1 times [2024-06-27 22:38:54,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:54,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079148554] [2024-06-27 22:38:54,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:54,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:54,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:54,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079148554] [2024-06-27 22:38:54,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079148554] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:54,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:54,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:38:54,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709096834] [2024-06-27 22:38:54,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:54,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:38:54,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:54,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:38:54,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:38:54,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:38:54,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 85 transitions, 821 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 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-06-27 22:38:54,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:54,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:38:54,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:54,967 INFO L124 PetriNetUnfolderBase]: 4091/7895 cut-off events. [2024-06-27 22:38:54,968 INFO L125 PetriNetUnfolderBase]: For 34563/34563 co-relation queries the response was YES. [2024-06-27 22:38:54,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29535 conditions, 7895 events. 4091/7895 cut-off events. For 34563/34563 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 69952 event pairs, 1047 based on Foata normal form. 140/7929 useless extension candidates. Maximal degree in co-relation 29489. Up to 2424 conditions per place. [2024-06-27 22:38:55,009 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 79 selfloop transitions, 13 changer transitions 119/222 dead transitions. [2024-06-27 22:38:55,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 222 transitions, 2778 flow [2024-06-27 22:38:55,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:38:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:38:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 240 transitions. [2024-06-27 22:38:55,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46421663442940037 [2024-06-27 22:38:55,011 INFO L175 Difference]: Start difference. First operand has 106 places, 85 transitions, 821 flow. Second operand 11 states and 240 transitions. [2024-06-27 22:38:55,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 222 transitions, 2778 flow [2024-06-27 22:38:55,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 222 transitions, 2670 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-27 22:38:55,066 INFO L231 Difference]: Finished difference. Result has 113 places, 78 transitions, 776 flow [2024-06-27 22:38:55,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=776, PETRI_PLACES=113, PETRI_TRANSITIONS=78} [2024-06-27 22:38:55,066 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 60 predicate places. [2024-06-27 22:38:55,066 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 78 transitions, 776 flow [2024-06-27 22:38:55,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 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-06-27 22:38:55,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:55,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:55,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:38:55,067 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:55,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:55,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1648788079, now seen corresponding path program 1 times [2024-06-27 22:38:55,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:55,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694470124] [2024-06-27 22:38:55,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:55,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:55,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:55,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694470124] [2024-06-27 22:38:55,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694470124] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:55,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:55,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:38:55,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497227952] [2024-06-27 22:38:55,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:55,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:38:55,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:55,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:38:55,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:38:55,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:38:55,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 78 transitions, 776 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 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-06-27 22:38:55,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:55,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:38:55,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:55,652 INFO L124 PetriNetUnfolderBase]: 4022/6948 cut-off events. [2024-06-27 22:38:55,652 INFO L125 PetriNetUnfolderBase]: For 26596/26945 co-relation queries the response was YES. [2024-06-27 22:38:55,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23152 conditions, 6948 events. 4022/6948 cut-off events. For 26596/26945 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 50326 event pairs, 777 based on Foata normal form. 480/7327 useless extension candidates. Maximal degree in co-relation 23104. Up to 3589 conditions per place. [2024-06-27 22:38:55,694 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 82 selfloop transitions, 5 changer transitions 0/107 dead transitions. [2024-06-27 22:38:55,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 107 transitions, 1196 flow [2024-06-27 22:38:55,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:38:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:38:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2024-06-27 22:38:55,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6861702127659575 [2024-06-27 22:38:55,695 INFO L175 Difference]: Start difference. First operand has 113 places, 78 transitions, 776 flow. Second operand 4 states and 129 transitions. [2024-06-27 22:38:55,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 107 transitions, 1196 flow [2024-06-27 22:38:55,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 107 transitions, 1035 flow, removed 18 selfloop flow, removed 23 redundant places. [2024-06-27 22:38:55,759 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 517 flow [2024-06-27 22:38:55,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=517, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2024-06-27 22:38:55,759 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2024-06-27 22:38:55,759 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 517 flow [2024-06-27 22:38:55,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 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-06-27 22:38:55,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:55,759 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, 1, 1] [2024-06-27 22:38:55,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:38:55,760 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:55,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:55,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1002571896, now seen corresponding path program 1 times [2024-06-27 22:38:55,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:55,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152529348] [2024-06-27 22:38:55,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:55,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:55,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:55,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:55,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152529348] [2024-06-27 22:38:55,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152529348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:55,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:55,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:38:55,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379096767] [2024-06-27 22:38:55,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:55,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:38:55,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:55,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:38:55,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:38:55,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:38:55,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 517 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:55,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:55,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:38:55,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:56,280 INFO L124 PetriNetUnfolderBase]: 3329/5885 cut-off events. [2024-06-27 22:38:56,280 INFO L125 PetriNetUnfolderBase]: For 14756/14991 co-relation queries the response was YES. [2024-06-27 22:38:56,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19741 conditions, 5885 events. 3329/5885 cut-off events. For 14756/14991 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 41977 event pairs, 334 based on Foata normal form. 427/6237 useless extension candidates. Maximal degree in co-relation 19708. Up to 2220 conditions per place. [2024-06-27 22:38:56,309 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 80 selfloop transitions, 8 changer transitions 3/111 dead transitions. [2024-06-27 22:38:56,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 111 transitions, 1056 flow [2024-06-27 22:38:56,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:38:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:38:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2024-06-27 22:38:56,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6978723404255319 [2024-06-27 22:38:56,311 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 517 flow. Second operand 5 states and 164 transitions. [2024-06-27 22:38:56,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 111 transitions, 1056 flow [2024-06-27 22:38:56,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 111 transitions, 1026 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:38:56,320 INFO L231 Difference]: Finished difference. Result has 89 places, 68 transitions, 510 flow [2024-06-27 22:38:56,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=510, PETRI_PLACES=89, PETRI_TRANSITIONS=68} [2024-06-27 22:38:56,320 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 36 predicate places. [2024-06-27 22:38:56,320 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 68 transitions, 510 flow [2024-06-27 22:38:56,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:56,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:56,320 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, 1, 1, 1, 1] [2024-06-27 22:38:56,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:38:56,321 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:56,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:56,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1939242257, now seen corresponding path program 1 times [2024-06-27 22:38:56,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:56,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695131294] [2024-06-27 22:38:56,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:56,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:56,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:56,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695131294] [2024-06-27 22:38:56,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695131294] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:56,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:56,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:38:56,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520850222] [2024-06-27 22:38:56,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:56,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:38:56,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:56,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:38:56,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:38:56,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:38:56,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 68 transitions, 510 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:56,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:56,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:38:56,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:56,772 INFO L124 PetriNetUnfolderBase]: 2645/4637 cut-off events. [2024-06-27 22:38:56,772 INFO L125 PetriNetUnfolderBase]: For 15593/15843 co-relation queries the response was YES. [2024-06-27 22:38:56,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17166 conditions, 4637 events. 2645/4637 cut-off events. For 15593/15843 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 31891 event pairs, 205 based on Foata normal form. 341/4906 useless extension candidates. Maximal degree in co-relation 17131. Up to 1804 conditions per place. [2024-06-27 22:38:56,792 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 70 selfloop transitions, 11 changer transitions 4/105 dead transitions. [2024-06-27 22:38:56,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 105 transitions, 958 flow [2024-06-27 22:38:56,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:38:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:38:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2024-06-27 22:38:56,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6524822695035462 [2024-06-27 22:38:56,793 INFO L175 Difference]: Start difference. First operand has 89 places, 68 transitions, 510 flow. Second operand 6 states and 184 transitions. [2024-06-27 22:38:56,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 105 transitions, 958 flow [2024-06-27 22:38:56,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 105 transitions, 860 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-27 22:38:56,803 INFO L231 Difference]: Finished difference. Result has 88 places, 66 transitions, 468 flow [2024-06-27 22:38:56,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=468, PETRI_PLACES=88, PETRI_TRANSITIONS=66} [2024-06-27 22:38:56,803 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2024-06-27 22:38:56,803 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 66 transitions, 468 flow [2024-06-27 22:38:56,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:56,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:56,803 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:56,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:38:56,804 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:56,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:56,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2068493801, now seen corresponding path program 1 times [2024-06-27 22:38:56,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:56,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887249747] [2024-06-27 22:38:56,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:56,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:56,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:56,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:56,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887249747] [2024-06-27 22:38:56,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887249747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:56,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:56,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:38:56,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242328636] [2024-06-27 22:38:56,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:56,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:38:56,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:56,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:38:56,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:38:56,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-06-27 22:38:56,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 66 transitions, 468 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:56,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:56,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-06-27 22:38:56,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:57,347 INFO L124 PetriNetUnfolderBase]: 2636/5293 cut-off events. [2024-06-27 22:38:57,347 INFO L125 PetriNetUnfolderBase]: For 12056/12392 co-relation queries the response was YES. [2024-06-27 22:38:57,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17107 conditions, 5293 events. 2636/5293 cut-off events. For 12056/12392 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 43230 event pairs, 1099 based on Foata normal form. 85/4844 useless extension candidates. Maximal degree in co-relation 17076. Up to 1483 conditions per place. [2024-06-27 22:38:57,373 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 53 selfloop transitions, 12 changer transitions 33/118 dead transitions. [2024-06-27 22:38:57,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 118 transitions, 964 flow [2024-06-27 22:38:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:38:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:38:57,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2024-06-27 22:38:57,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6205673758865248 [2024-06-27 22:38:57,375 INFO L175 Difference]: Start difference. First operand has 88 places, 66 transitions, 468 flow. Second operand 6 states and 175 transitions. [2024-06-27 22:38:57,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 118 transitions, 964 flow [2024-06-27 22:38:57,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 118 transitions, 914 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-27 22:38:57,424 INFO L231 Difference]: Finished difference. Result has 90 places, 64 transitions, 447 flow [2024-06-27 22:38:57,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=447, PETRI_PLACES=90, PETRI_TRANSITIONS=64} [2024-06-27 22:38:57,425 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 37 predicate places. [2024-06-27 22:38:57,425 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 64 transitions, 447 flow [2024-06-27 22:38:57,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:57,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:57,426 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:57,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:38:57,426 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:57,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:57,426 INFO L85 PathProgramCache]: Analyzing trace with hash -885346575, now seen corresponding path program 2 times [2024-06-27 22:38:57,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:57,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879469624] [2024-06-27 22:38:57,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:57,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:57,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:57,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879469624] [2024-06-27 22:38:57,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879469624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:57,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:57,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:38:57,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963273835] [2024-06-27 22:38:57,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:57,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:38:57,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:57,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:38:57,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:38:57,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-06-27 22:38:57,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 64 transitions, 447 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:57,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:57,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-06-27 22:38:57,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:57,937 INFO L124 PetriNetUnfolderBase]: 2447/5026 cut-off events. [2024-06-27 22:38:57,937 INFO L125 PetriNetUnfolderBase]: For 7523/7819 co-relation queries the response was YES. [2024-06-27 22:38:57,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14293 conditions, 5026 events. 2447/5026 cut-off events. For 7523/7819 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 41673 event pairs, 921 based on Foata normal form. 80/4598 useless extension candidates. Maximal degree in co-relation 14261. Up to 1917 conditions per place. [2024-06-27 22:38:57,961 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 45 selfloop transitions, 2 changer transitions 32/101 dead transitions. [2024-06-27 22:38:57,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 101 transitions, 843 flow [2024-06-27 22:38:57,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:38:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:38:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-06-27 22:38:57,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5851063829787234 [2024-06-27 22:38:57,962 INFO L175 Difference]: Start difference. First operand has 90 places, 64 transitions, 447 flow. Second operand 6 states and 165 transitions. [2024-06-27 22:38:57,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 101 transitions, 843 flow [2024-06-27 22:38:57,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 101 transitions, 779 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-27 22:38:57,971 INFO L231 Difference]: Finished difference. Result has 88 places, 62 transitions, 398 flow [2024-06-27 22:38:57,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=398, PETRI_PLACES=88, PETRI_TRANSITIONS=62} [2024-06-27 22:38:57,972 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2024-06-27 22:38:57,972 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 62 transitions, 398 flow [2024-06-27 22:38:57,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:57,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:57,972 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:57,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:38:57,972 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:57,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:57,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2061884133, now seen corresponding path program 3 times [2024-06-27 22:38:57,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:57,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569935517] [2024-06-27 22:38:57,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:57,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:58,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:58,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569935517] [2024-06-27 22:38:58,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569935517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:58,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:58,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:38:58,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085173442] [2024-06-27 22:38:58,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:58,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:38:58,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:58,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:38:58,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:38:58,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:38:58,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 62 transitions, 398 flow. Second operand has 10 states, 10 states have (on average 22.0) internal successors, (220), 10 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:58,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:58,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:38:58,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:58,737 INFO L124 PetriNetUnfolderBase]: 1866/3706 cut-off events. [2024-06-27 22:38:58,737 INFO L125 PetriNetUnfolderBase]: For 4243/4491 co-relation queries the response was YES. [2024-06-27 22:38:58,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9961 conditions, 3706 events. 1866/3706 cut-off events. For 4243/4491 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 28793 event pairs, 1018 based on Foata normal form. 91/3364 useless extension candidates. Maximal degree in co-relation 9930. Up to 1819 conditions per place. [2024-06-27 22:38:58,753 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 49 selfloop transitions, 9 changer transitions 16/98 dead transitions. [2024-06-27 22:38:58,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 98 transitions, 664 flow [2024-06-27 22:38:58,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:38:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:38:58,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 245 transitions. [2024-06-27 22:38:58,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5791962174940898 [2024-06-27 22:38:58,754 INFO L175 Difference]: Start difference. First operand has 88 places, 62 transitions, 398 flow. Second operand 9 states and 245 transitions. [2024-06-27 22:38:58,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 98 transitions, 664 flow [2024-06-27 22:38:58,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 98 transitions, 626 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-27 22:38:58,760 INFO L231 Difference]: Finished difference. Result has 91 places, 62 transitions, 398 flow [2024-06-27 22:38:58,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=398, PETRI_PLACES=91, PETRI_TRANSITIONS=62} [2024-06-27 22:38:58,760 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 38 predicate places. [2024-06-27 22:38:58,760 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 62 transitions, 398 flow [2024-06-27 22:38:58,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.0) internal successors, (220), 10 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:58,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:58,761 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:58,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:38:58,761 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:58,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:58,761 INFO L85 PathProgramCache]: Analyzing trace with hash -241496201, now seen corresponding path program 4 times [2024-06-27 22:38:58,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:58,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655081045] [2024-06-27 22:38:58,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:58,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:59,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:59,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655081045] [2024-06-27 22:38:59,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655081045] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:59,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:59,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:59,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051113591] [2024-06-27 22:38:59,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:59,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:38:59,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:59,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:38:59,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:38:59,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:38:59,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 62 transitions, 398 flow. Second operand has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:59,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:59,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:38:59,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:59,509 INFO L124 PetriNetUnfolderBase]: 1333/2686 cut-off events. [2024-06-27 22:38:59,509 INFO L125 PetriNetUnfolderBase]: For 3672/3955 co-relation queries the response was YES. [2024-06-27 22:38:59,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7273 conditions, 2686 events. 1333/2686 cut-off events. For 3672/3955 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 19787 event pairs, 300 based on Foata normal form. 82/2426 useless extension candidates. Maximal degree in co-relation 7243. Up to 717 conditions per place. [2024-06-27 22:38:59,520 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 32 selfloop transitions, 5 changer transitions 30/93 dead transitions. [2024-06-27 22:38:59,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 93 transitions, 618 flow [2024-06-27 22:38:59,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:38:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:38:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 253 transitions. [2024-06-27 22:38:59,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5981087470449172 [2024-06-27 22:38:59,522 INFO L175 Difference]: Start difference. First operand has 91 places, 62 transitions, 398 flow. Second operand 9 states and 253 transitions. [2024-06-27 22:38:59,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 93 transitions, 618 flow [2024-06-27 22:38:59,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 93 transitions, 592 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-27 22:38:59,527 INFO L231 Difference]: Finished difference. Result has 92 places, 53 transitions, 293 flow [2024-06-27 22:38:59,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=293, PETRI_PLACES=92, PETRI_TRANSITIONS=53} [2024-06-27 22:38:59,527 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 39 predicate places. [2024-06-27 22:38:59,528 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 53 transitions, 293 flow [2024-06-27 22:38:59,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:59,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:59,528 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:59,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:38:59,528 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:38:59,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:59,529 INFO L85 PathProgramCache]: Analyzing trace with hash -934121871, now seen corresponding path program 5 times [2024-06-27 22:38:59,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:59,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708382209] [2024-06-27 22:38:59,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:59,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:38:59,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:38:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:38:59,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:38:59,591 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:38:59,592 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2024-06-27 22:38:59,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2024-06-27 22:38:59,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 9 remaining) [2024-06-27 22:38:59,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 9 remaining) [2024-06-27 22:38:59,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 9 remaining) [2024-06-27 22:38:59,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-06-27 22:38:59,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2024-06-27 22:38:59,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2024-06-27 22:38:59,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-06-27 22:38:59,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:38:59,595 INFO L445 BasicCegarLoop]: Path program histogram: [5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:59,600 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:38:59,600 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:38:59,662 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-27 22:38:59,666 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-27 22:38:59,667 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:38:59 BasicIcfg [2024-06-27 22:38:59,667 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:38:59,668 INFO L158 Benchmark]: Toolchain (without parser) took 35579.57ms. Allocated memory was 184.5MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 111.0MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 525.3MB. Max. memory is 16.1GB. [2024-06-27 22:38:59,668 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 148.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:38:59,668 INFO L158 Benchmark]: Witness Parser took 0.58ms. Allocated memory is still 184.5MB. Free memory is still 114.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:38:59,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.49ms. Allocated memory is still 184.5MB. Free memory was 111.0MB in the beginning and 80.9MB in the end (delta: 30.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-06-27 22:38:59,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.73ms. Allocated memory is still 184.5MB. Free memory was 80.6MB in the beginning and 77.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:38:59,669 INFO L158 Benchmark]: Boogie Preprocessor took 61.15ms. Allocated memory is still 184.5MB. Free memory was 77.2MB in the beginning and 73.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 22:38:59,669 INFO L158 Benchmark]: RCFGBuilder took 679.66ms. Allocated memory is still 184.5MB. Free memory was 73.6MB in the beginning and 98.9MB in the end (delta: -25.3MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-06-27 22:38:59,669 INFO L158 Benchmark]: TraceAbstraction took 34289.07ms. Allocated memory was 184.5MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 97.9MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 511.9MB. Max. memory is 16.1GB. [2024-06-27 22:38:59,670 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 148.6MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.58ms. Allocated memory is still 184.5MB. Free memory is still 114.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.49ms. Allocated memory is still 184.5MB. Free memory was 111.0MB in the beginning and 80.9MB in the end (delta: 30.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.73ms. Allocated memory is still 184.5MB. Free memory was 80.6MB in the beginning and 77.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.15ms. Allocated memory is still 184.5MB. Free memory was 77.2MB in the beginning and 73.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 679.66ms. Allocated memory is still 184.5MB. Free memory was 73.6MB in the beginning and 98.9MB in the end (delta: -25.3MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * TraceAbstraction took 34289.07ms. Allocated memory was 184.5MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 97.9MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 511.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1898; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L834] 0 //@ assert (!multithreaded || (((((((((((((((((((((((((((0LL - (long long) __unbuffered_p0_EAX) + (long long) x) >= 0LL) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$mem_tmp) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$mem_tmp) + (long long) x$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) x$mem_tmp) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((long long) __unbuffered_p0_EAX - (long long) x$mem_tmp) >= 0LL)) && (((long long) x - (long long) x$mem_tmp) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL))); [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-3, t1898=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L835] 0 pthread_t t1899; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-3, t1898=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L836] 0 //@ assert (!multithreaded || (((((((((((((((((((((((((((0LL - (long long) __unbuffered_p0_EAX) + (long long) x) >= 0LL) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$mem_tmp) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$mem_tmp) + (long long) x$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) x$mem_tmp) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((long long) __unbuffered_p0_EAX - (long long) x$mem_tmp) >= 0LL)) && (((long long) x - (long long) x$mem_tmp) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL))); [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-3, t1898=-2, t1899=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L786] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L744] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L837] 0 //@ assert (!multithreaded || (((((((((((((((((((((((((((0LL - (long long) __unbuffered_p0_EAX) + (long long) x) >= 0LL) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$mem_tmp) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$mem_tmp) + (long long) x$r_buff0_thd2) >= 0LL)) && (((0LL - (long long) x$mem_tmp) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((long long) __unbuffered_p0_EAX - (long long) x$mem_tmp) >= 0LL)) && (((long long) x - (long long) x$mem_tmp) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-3, t1898=-2, t1899=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-3, t1898=-2, t1899=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-3, t1898=-2, t1899=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-3, t1898=-2, t1899=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: 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: 834]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 832]: 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: 834]: 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 7 procedures, 73 locations, 9 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: 34.1s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1769 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1581 mSDsluCounter, 553 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 470 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5994 IncrementalHoareTripleChecker+Invalid, 6226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 83 mSDtfsCounter, 5994 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1393occurred in iteration=15, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 659 NumberOfCodeBlocks, 659 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 596 ConstructedInterpolants, 0 QuantifiedInterpolants, 9959 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 22:38:59,698 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