./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe031_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe031_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:54:09,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:54:09,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:54:09,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:54:09,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:54:09,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:54:09,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:54:09,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:54:09,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:54:09,777 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:54:09,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:54:09,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:54:09,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:54:09,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:54:09,779 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:54:09,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:54:09,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:54:09,780 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:54:09,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:54:09,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:54:09,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:54:09,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:54:09,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:54:09,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:54:09,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:54:09,782 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:54:09,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:54:09,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:54:09,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:54:09,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:54:09,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:54:09,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:54:09,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:54:09,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:54:09,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:54:09,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:54:09,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:54:09,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:54:09,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:54:09,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:54:09,785 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:54:09,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:54:09,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:54:09,786 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:54:09,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:54:10,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:54:10,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:54:10,007 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:54:10,007 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:54:10,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 22:54:10,979 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:54:11,155 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:54:11,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 22:54:11,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6f9ff8a2/571dd8cdd4c54666a1b93061cd447259/FLAGbf0059416 [2024-06-27 22:54:11,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6f9ff8a2/571dd8cdd4c54666a1b93061cd447259 [2024-06-27 22:54:11,186 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:54:11,187 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:54:11,189 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/safe031_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-27 22:54:11,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:54:11,263 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:54:11,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:54:11,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:54:11,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:54:11,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:54:11" (1/2) ... [2024-06-27 22:54:11,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@311dce9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:11, skipping insertion in model container [2024-06-27 22:54:11,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:54:11" (1/2) ... [2024-06-27 22:54:11,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@106e8399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:11, skipping insertion in model container [2024-06-27 22:54:11,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:54:11" (2/2) ... [2024-06-27 22:54:11,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@311dce9c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:11, skipping insertion in model container [2024-06-27 22:54:11,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:54:11" (2/2) ... [2024-06-27 22:54:11,273 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:54:11,296 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:54:11,297 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:54:11,297 INFO L97 edCorrectnessWitness]: Location invariant before [L835-L835] ! 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:54:11,297 INFO L97 edCorrectnessWitness]: Location invariant before [L832-L832] ! 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:54:11,298 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:54:11,298 INFO L106 edCorrectnessWitness]: ghost_update [L830-L830] multithreaded = 1; [2024-06-27 22:54:11,333 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:54:11,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/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] [2024-06-27 22:54:11,620 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:54:11,637 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:54:11,669 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/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:54:11,749 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:54:11,785 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:54:11,786 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:11 WrapperNode [2024-06-27 22:54:11,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:54:11,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:54:11,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:54:11,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:54:11,792 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:54:11" (1/1) ... [2024-06-27 22:54:11,818 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:54:11" (1/1) ... [2024-06-27 22:54:11,841 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2024-06-27 22:54:11,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:54:11,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:54:11,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:54:11,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:54:11,852 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:54:11" (1/1) ... [2024-06-27 22:54:11,853 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:54:11" (1/1) ... [2024-06-27 22:54:11,864 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:54:11" (1/1) ... [2024-06-27 22:54:11,878 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:54:11,879 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:54:11" (1/1) ... [2024-06-27 22:54:11,879 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:54:11" (1/1) ... [2024-06-27 22:54:11,897 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:54:11" (1/1) ... [2024-06-27 22:54:11,899 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:54:11" (1/1) ... [2024-06-27 22:54:11,900 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:54:11" (1/1) ... [2024-06-27 22:54:11,902 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:54:11" (1/1) ... [2024-06-27 22:54:11,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:54:11,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:54:11,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:54:11,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:54:11,913 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:54:11" (1/1) ... [2024-06-27 22:54:11,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:54:11,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:54:11,944 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:54:11,964 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:54:11,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:54:11,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:54:11,976 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:54:11,976 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:54:11,976 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:54:11,976 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:54:11,977 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:54:11,977 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:54:11,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:54:11,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:54:11,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:54:11,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:54:11,979 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:54:12,081 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:54:12,083 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:54:12,465 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:54:12,465 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:54:12,575 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:54:12,575 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:54:12,579 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:54:12 BoogieIcfgContainer [2024-06-27 22:54:12,580 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:54:12,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:54:12,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:54:12,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:54:12,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:54:11" (1/4) ... [2024-06-27 22:54:12,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e55ca76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:54:12, skipping insertion in model container [2024-06-27 22:54:12,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:54:11" (2/4) ... [2024-06-27 22:54:12,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e55ca76 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:54:12, skipping insertion in model container [2024-06-27 22:54:12,586 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:54:11" (3/4) ... [2024-06-27 22:54:12,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e55ca76 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:54:12, skipping insertion in model container [2024-06-27 22:54:12,589 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:54:12" (4/4) ... [2024-06-27 22:54:12,590 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 22:54:12,603 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:54:12,603 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:54:12,603 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:54:12,636 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:54:12,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 106 flow [2024-06-27 22:54:12,697 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-06-27 22:54:12,698 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:54:12,701 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 80 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:54:12,701 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 47 transitions, 106 flow [2024-06-27 22:54:12,706 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 44 transitions, 97 flow [2024-06-27 22:54:12,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:54:12,727 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;@41e0e128, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:54:12,727 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:54:12,752 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:54:12,753 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-27 22:54:12,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:54:12,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:12,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:54:12,754 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:54:12,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:12,758 INFO L85 PathProgramCache]: Analyzing trace with hash 345005311, now seen corresponding path program 1 times [2024-06-27 22:54:12,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:12,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701187574] [2024-06-27 22:54:12,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:12,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:13,351 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:54:13,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:13,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701187574] [2024-06-27 22:54:13,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701187574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:13,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:13,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:54:13,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53098903] [2024-06-27 22:54:13,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:13,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:54:13,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:13,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:54:13,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:54:13,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:54:13,402 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:54:13,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:13,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:54:13,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:13,674 INFO L124 PetriNetUnfolderBase]: 538/1082 cut-off events. [2024-06-27 22:54:13,675 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-06-27 22:54:13,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1955 conditions, 1082 events. 538/1082 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6875 event pairs, 286 based on Foata normal form. 45/1059 useless extension candidates. Maximal degree in co-relation 1943. Up to 688 conditions per place. [2024-06-27 22:54:13,685 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 30 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-06-27 22:54:13,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 186 flow [2024-06-27 22:54:13,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:54:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:54:13,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-06-27 22:54:13,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75177304964539 [2024-06-27 22:54:13,697 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:54:13,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 186 flow [2024-06-27 22:54:13,699 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:54:13,704 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 96 flow [2024-06-27 22:54:13,705 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:54:13,708 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2024-06-27 22:54:13,708 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 96 flow [2024-06-27 22:54:13,709 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:54:13,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:13,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:13,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:54:13,709 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:54:13,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:13,710 INFO L85 PathProgramCache]: Analyzing trace with hash 211646992, now seen corresponding path program 1 times [2024-06-27 22:54:13,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:13,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434742210] [2024-06-27 22:54:13,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:13,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:14,126 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:54:14,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:14,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434742210] [2024-06-27 22:54:14,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434742210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:14,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:14,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:54:14,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82953660] [2024-06-27 22:54:14,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:14,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:54:14,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:14,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:54:14,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:54:14,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:54:14,148 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:54:14,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:14,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:54:14,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:14,308 INFO L124 PetriNetUnfolderBase]: 482/1006 cut-off events. [2024-06-27 22:54:14,308 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2024-06-27 22:54:14,311 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 6236 event pairs, 117 based on Foata normal form. 6/960 useless extension candidates. Maximal degree in co-relation 1931. Up to 672 conditions per place. [2024-06-27 22:54:14,314 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 33 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2024-06-27 22:54:14,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 225 flow [2024-06-27 22:54:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:54:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:54:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2024-06-27 22:54:14,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6968085106382979 [2024-06-27 22:54:14,319 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:54:14,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 225 flow [2024-06-27 22:54:14,321 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:54:14,322 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 146 flow [2024-06-27 22:54:14,323 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:54:14,323 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2024-06-27 22:54:14,324 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 146 flow [2024-06-27 22:54:14,324 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:54:14,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:14,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:14,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:54:14,327 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:54:14,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:14,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1529342063, now seen corresponding path program 1 times [2024-06-27 22:54:14,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:14,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354518322] [2024-06-27 22:54:14,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:14,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:14,955 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:54:14,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:14,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354518322] [2024-06-27 22:54:14,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354518322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:14,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:14,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:54:14,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18496833] [2024-06-27 22:54:14,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:14,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:14,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:14,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:14,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:14,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:54:14,998 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:54:14,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:14,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:54:14,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:15,185 INFO L124 PetriNetUnfolderBase]: 555/1140 cut-off events. [2024-06-27 22:54:15,186 INFO L125 PetriNetUnfolderBase]: For 389/397 co-relation queries the response was YES. [2024-06-27 22:54:15,188 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 7229 event pairs, 183 based on Foata normal form. 10/1105 useless extension candidates. Maximal degree in co-relation 2607. Up to 706 conditions per place. [2024-06-27 22:54:15,192 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 58 selfloop transitions, 13 changer transitions 0/90 dead transitions. [2024-06-27 22:54:15,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 90 transitions, 429 flow [2024-06-27 22:54:15,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2024-06-27 22:54:15,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.723404255319149 [2024-06-27 22:54:15,194 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:54:15,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 90 transitions, 429 flow [2024-06-27 22:54:15,195 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:54:15,196 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 262 flow [2024-06-27 22:54:15,196 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:54:15,196 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2024-06-27 22:54:15,197 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 262 flow [2024-06-27 22:54:15,197 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:54:15,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:15,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:15,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:54:15,197 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:54:15,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:15,198 INFO L85 PathProgramCache]: Analyzing trace with hash 809411918, now seen corresponding path program 1 times [2024-06-27 22:54:15,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:15,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16887350] [2024-06-27 22:54:15,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:15,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:15,626 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:54:15,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:15,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16887350] [2024-06-27 22:54:15,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16887350] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:15,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:15,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:54:15,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711854791] [2024-06-27 22:54:15,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:15,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:15,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:15,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:15,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:15,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:54:15,659 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:54:15,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:15,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:54:15,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:15,924 INFO L124 PetriNetUnfolderBase]: 547/1131 cut-off events. [2024-06-27 22:54:15,925 INFO L125 PetriNetUnfolderBase]: For 1079/1111 co-relation queries the response was YES. [2024-06-27 22:54:15,928 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 7216 event pairs, 144 based on Foata normal form. 12/1093 useless extension candidates. Maximal degree in co-relation 3098. Up to 749 conditions per place. [2024-06-27 22:54:15,933 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 46 selfloop transitions, 15 changer transitions 0/80 dead transitions. [2024-06-27 22:54:15,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 80 transitions, 451 flow [2024-06-27 22:54:15,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-06-27 22:54:15,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6893617021276596 [2024-06-27 22:54:15,935 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:54:15,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 80 transitions, 451 flow [2024-06-27 22:54:15,941 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:54:15,942 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 320 flow [2024-06-27 22:54:15,942 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:54:15,944 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2024-06-27 22:54:15,944 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 320 flow [2024-06-27 22:54:15,944 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:54:15,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:15,944 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:54:15,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:54:15,945 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:54:15,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:15,945 INFO L85 PathProgramCache]: Analyzing trace with hash -58065747, now seen corresponding path program 1 times [2024-06-27 22:54:15,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:15,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794483165] [2024-06-27 22:54:15,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:15,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:16,515 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:54:16,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:16,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794483165] [2024-06-27 22:54:16,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794483165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:16,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:16,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:16,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084968521] [2024-06-27 22:54:16,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:16,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:16,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:16,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:16,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:16,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:16,550 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:54:16,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:16,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:16,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:16,884 INFO L124 PetriNetUnfolderBase]: 928/1889 cut-off events. [2024-06-27 22:54:16,884 INFO L125 PetriNetUnfolderBase]: For 2267/2313 co-relation queries the response was YES. [2024-06-27 22:54:16,887 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 13252 event pairs, 95 based on Foata normal form. 24/1857 useless extension candidates. Maximal degree in co-relation 5270. Up to 850 conditions per place. [2024-06-27 22:54:16,894 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 62 selfloop transitions, 28 changer transitions 0/107 dead transitions. [2024-06-27 22:54:16,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 107 transitions, 662 flow [2024-06-27 22:54:16,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 216 transitions. [2024-06-27 22:54:16,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6565349544072948 [2024-06-27 22:54:16,895 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:54:16,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 107 transitions, 662 flow [2024-06-27 22:54:16,899 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:54:16,900 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 457 flow [2024-06-27 22:54:16,901 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:54:16,901 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2024-06-27 22:54:16,901 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 457 flow [2024-06-27 22:54:16,901 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:54:16,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:16,902 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:54:16,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:54:16,902 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:54:16,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:16,902 INFO L85 PathProgramCache]: Analyzing trace with hash 711331313, now seen corresponding path program 2 times [2024-06-27 22:54:16,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:16,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152039040] [2024-06-27 22:54:16,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:16,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:17,515 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:54:17,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:17,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152039040] [2024-06-27 22:54:17,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152039040] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:17,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:17,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:17,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731712582] [2024-06-27 22:54:17,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:17,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:17,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:17,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:17,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:17,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:54:17,548 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:54:17,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:17,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:54:17,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:17,871 INFO L124 PetriNetUnfolderBase]: 891/1894 cut-off events. [2024-06-27 22:54:17,871 INFO L125 PetriNetUnfolderBase]: For 4153/4195 co-relation queries the response was YES. [2024-06-27 22:54:17,876 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 13762 event pairs, 272 based on Foata normal form. 24/1846 useless extension candidates. Maximal degree in co-relation 5891. Up to 1137 conditions per place. [2024-06-27 22:54:17,884 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 66 selfloop transitions, 16 changer transitions 0/100 dead transitions. [2024-06-27 22:54:17,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 100 transitions, 707 flow [2024-06-27 22:54:17,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2024-06-27 22:54:17,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6413373860182371 [2024-06-27 22:54:17,885 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:54:17,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 100 transitions, 707 flow [2024-06-27 22:54:17,892 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:54:17,893 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 458 flow [2024-06-27 22:54:17,893 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:54:17,894 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2024-06-27 22:54:17,894 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 458 flow [2024-06-27 22:54:17,894 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:54:17,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:17,894 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:54:17,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:54:17,895 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:54:17,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:17,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1025297453, now seen corresponding path program 3 times [2024-06-27 22:54:17,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:17,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185150397] [2024-06-27 22:54:17,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:17,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:18,540 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:54:18,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:18,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185150397] [2024-06-27 22:54:18,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185150397] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:18,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:18,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:18,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753657038] [2024-06-27 22:54:18,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:18,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:18,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:18,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:18,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:18,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:54:18,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 458 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:54:18,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:18,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:54:18,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:18,954 INFO L124 PetriNetUnfolderBase]: 1031/2229 cut-off events. [2024-06-27 22:54:18,954 INFO L125 PetriNetUnfolderBase]: For 4632/4680 co-relation queries the response was YES. [2024-06-27 22:54:18,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6458 conditions, 2229 events. 1031/2229 cut-off events. For 4632/4680 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 17241 event pairs, 312 based on Foata normal form. 24/2181 useless extension candidates. Maximal degree in co-relation 6428. Up to 895 conditions per place. [2024-06-27 22:54:18,967 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 69 selfloop transitions, 19 changer transitions 0/106 dead transitions. [2024-06-27 22:54:18,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 106 transitions, 764 flow [2024-06-27 22:54:18,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2024-06-27 22:54:18,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6413373860182371 [2024-06-27 22:54:18,969 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 458 flow. Second operand 7 states and 211 transitions. [2024-06-27 22:54:18,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 106 transitions, 764 flow [2024-06-27 22:54:18,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 106 transitions, 724 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 22:54:18,977 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 505 flow [2024-06-27 22:54:18,977 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=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=505, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2024-06-27 22:54:18,978 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2024-06-27 22:54:18,978 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 505 flow [2024-06-27 22:54:18,978 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:54:18,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:18,979 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:54:18,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:54:18,979 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:54:18,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:18,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1524167555, now seen corresponding path program 1 times [2024-06-27 22:54:18,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:18,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056737419] [2024-06-27 22:54:18,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:18,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:19,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:19,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:19,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056737419] [2024-06-27 22:54:19,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056737419] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:19,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:19,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:54:19,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451281327] [2024-06-27 22:54:19,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:19,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:19,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:19,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:19,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:19,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:54:19,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 505 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:54:19,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:19,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:54:19,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:19,604 INFO L124 PetriNetUnfolderBase]: 1050/2248 cut-off events. [2024-06-27 22:54:19,604 INFO L125 PetriNetUnfolderBase]: For 5506/5554 co-relation queries the response was YES. [2024-06-27 22:54:19,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6676 conditions, 2248 events. 1050/2248 cut-off events. For 5506/5554 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 17270 event pairs, 409 based on Foata normal form. 14/2191 useless extension candidates. Maximal degree in co-relation 6644. Up to 1580 conditions per place. [2024-06-27 22:54:19,620 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 58 selfloop transitions, 13 changer transitions 0/90 dead transitions. [2024-06-27 22:54:19,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 90 transitions, 703 flow [2024-06-27 22:54:19,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:54:19,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:54:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2024-06-27 22:54:19,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6914893617021277 [2024-06-27 22:54:19,622 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 505 flow. Second operand 4 states and 130 transitions. [2024-06-27 22:54:19,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 90 transitions, 703 flow [2024-06-27 22:54:19,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 90 transitions, 660 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 22:54:19,635 INFO L231 Difference]: Finished difference. Result has 80 places, 77 transitions, 532 flow [2024-06-27 22:54:19,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=532, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2024-06-27 22:54:19,636 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2024-06-27 22:54:19,636 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 77 transitions, 532 flow [2024-06-27 22:54:19,636 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:54:19,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:19,636 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:54:19,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:54:19,636 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:54:19,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:19,637 INFO L85 PathProgramCache]: Analyzing trace with hash -679568637, now seen corresponding path program 2 times [2024-06-27 22:54:19,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:19,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137392686] [2024-06-27 22:54:19,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:19,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:19,926 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:54:19,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:19,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137392686] [2024-06-27 22:54:19,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137392686] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:19,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:19,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:54:19,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710383468] [2024-06-27 22:54:19,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:19,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:19,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:19,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:19,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:19,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:54:19,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 532 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:54:19,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:19,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:54:19,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:20,236 INFO L124 PetriNetUnfolderBase]: 1041/2248 cut-off events. [2024-06-27 22:54:20,236 INFO L125 PetriNetUnfolderBase]: For 5448/5470 co-relation queries the response was YES. [2024-06-27 22:54:20,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6725 conditions, 2248 events. 1041/2248 cut-off events. For 5448/5470 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 17317 event pairs, 505 based on Foata normal form. 6/2183 useless extension candidates. Maximal degree in co-relation 6693. Up to 1640 conditions per place. [2024-06-27 22:54:20,248 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 64 selfloop transitions, 15 changer transitions 0/98 dead transitions. [2024-06-27 22:54:20,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 98 transitions, 797 flow [2024-06-27 22:54:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:54:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:54:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-06-27 22:54:20,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7021276595744681 [2024-06-27 22:54:20,249 INFO L175 Difference]: Start difference. First operand has 80 places, 77 transitions, 532 flow. Second operand 4 states and 132 transitions. [2024-06-27 22:54:20,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 98 transitions, 797 flow [2024-06-27 22:54:20,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 98 transitions, 769 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 22:54:20,261 INFO L231 Difference]: Finished difference. Result has 83 places, 83 transitions, 630 flow [2024-06-27 22:54:20,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=630, PETRI_PLACES=83, PETRI_TRANSITIONS=83} [2024-06-27 22:54:20,262 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 30 predicate places. [2024-06-27 22:54:20,262 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 83 transitions, 630 flow [2024-06-27 22:54:20,262 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:54:20,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:20,262 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:54:20,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:54:20,263 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:54:20,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:20,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1158271506, now seen corresponding path program 1 times [2024-06-27 22:54:20,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:20,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643338303] [2024-06-27 22:54:20,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:20,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:20,331 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:54:20,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:20,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643338303] [2024-06-27 22:54:20,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643338303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:20,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:20,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:54:20,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715706312] [2024-06-27 22:54:20,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:20,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:54:20,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:20,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:54:20,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:54:20,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:54:20,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 83 transitions, 630 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:54:20,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:20,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:54:20,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:20,844 INFO L124 PetriNetUnfolderBase]: 3429/6048 cut-off events. [2024-06-27 22:54:20,844 INFO L125 PetriNetUnfolderBase]: For 11644/11716 co-relation queries the response was YES. [2024-06-27 22:54:20,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16729 conditions, 6048 events. 3429/6048 cut-off events. For 11644/11716 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 44440 event pairs, 555 based on Foata normal form. 257/6098 useless extension candidates. Maximal degree in co-relation 16695. Up to 2897 conditions per place. [2024-06-27 22:54:20,874 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 121 selfloop transitions, 5 changer transitions 1/143 dead transitions. [2024-06-27 22:54:20,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 143 transitions, 1343 flow [2024-06-27 22:54:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:54:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:54:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-06-27 22:54:20,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7127659574468085 [2024-06-27 22:54:20,876 INFO L175 Difference]: Start difference. First operand has 83 places, 83 transitions, 630 flow. Second operand 4 states and 134 transitions. [2024-06-27 22:54:20,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 143 transitions, 1343 flow [2024-06-27 22:54:20,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 143 transitions, 1316 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-27 22:54:20,889 INFO L231 Difference]: Finished difference. Result has 87 places, 83 transitions, 608 flow [2024-06-27 22:54:20,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=608, PETRI_PLACES=87, PETRI_TRANSITIONS=83} [2024-06-27 22:54:20,890 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 34 predicate places. [2024-06-27 22:54:20,890 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 608 flow [2024-06-27 22:54:20,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:54:20,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:20,890 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:54:20,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:54:20,890 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:54:20,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:20,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1488617190, now seen corresponding path program 1 times [2024-06-27 22:54:20,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:20,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681656063] [2024-06-27 22:54:20,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:20,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:21,498 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:54:21,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:21,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681656063] [2024-06-27 22:54:21,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681656063] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:21,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:21,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:21,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962881914] [2024-06-27 22:54:21,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:21,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:21,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:21,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:21,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:21,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:54:21,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 83 transitions, 608 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:54:21,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:21,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:54:21,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:21,929 INFO L124 PetriNetUnfolderBase]: 1696/3569 cut-off events. [2024-06-27 22:54:21,930 INFO L125 PetriNetUnfolderBase]: For 8635/8733 co-relation queries the response was YES. [2024-06-27 22:54:21,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10538 conditions, 3569 events. 1696/3569 cut-off events. For 8635/8733 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 28716 event pairs, 920 based on Foata normal form. 9/3234 useless extension candidates. Maximal degree in co-relation 10500. Up to 2289 conditions per place. [2024-06-27 22:54:21,955 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 69 selfloop transitions, 24 changer transitions 0/114 dead transitions. [2024-06-27 22:54:21,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 114 transitions, 918 flow [2024-06-27 22:54:21,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2024-06-27 22:54:21,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6936170212765957 [2024-06-27 22:54:21,956 INFO L175 Difference]: Start difference. First operand has 87 places, 83 transitions, 608 flow. Second operand 5 states and 163 transitions. [2024-06-27 22:54:21,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 114 transitions, 918 flow [2024-06-27 22:54:21,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 114 transitions, 904 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 22:54:21,968 INFO L231 Difference]: Finished difference. Result has 91 places, 89 transitions, 733 flow [2024-06-27 22:54:21,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=733, PETRI_PLACES=91, PETRI_TRANSITIONS=89} [2024-06-27 22:54:21,969 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 38 predicate places. [2024-06-27 22:54:21,969 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 89 transitions, 733 flow [2024-06-27 22:54:21,969 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:54:21,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:21,970 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:54:21,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:54:21,970 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:21,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:21,970 INFO L85 PathProgramCache]: Analyzing trace with hash 708977417, now seen corresponding path program 1 times [2024-06-27 22:54:21,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:21,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871181857] [2024-06-27 22:54:21,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:21,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:22,428 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:54:22,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:22,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871181857] [2024-06-27 22:54:22,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871181857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:22,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:22,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:22,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013545960] [2024-06-27 22:54:22,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:22,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:22,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:22,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:22,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:22,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:22,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 89 transitions, 733 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:54:22,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:22,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:22,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:22,993 INFO L124 PetriNetUnfolderBase]: 2205/4460 cut-off events. [2024-06-27 22:54:22,993 INFO L125 PetriNetUnfolderBase]: For 13546/13588 co-relation queries the response was YES. [2024-06-27 22:54:23,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13705 conditions, 4460 events. 2205/4460 cut-off events. For 13546/13588 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 35746 event pairs, 1100 based on Foata normal form. 16/4084 useless extension candidates. Maximal degree in co-relation 13665. Up to 2873 conditions per place. [2024-06-27 22:54:23,018 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 88 selfloop transitions, 21 changer transitions 0/129 dead transitions. [2024-06-27 22:54:23,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 129 transitions, 1180 flow [2024-06-27 22:54:23,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 201 transitions. [2024-06-27 22:54:23,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6109422492401215 [2024-06-27 22:54:23,020 INFO L175 Difference]: Start difference. First operand has 91 places, 89 transitions, 733 flow. Second operand 7 states and 201 transitions. [2024-06-27 22:54:23,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 129 transitions, 1180 flow [2024-06-27 22:54:23,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 129 transitions, 1139 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-27 22:54:23,046 INFO L231 Difference]: Finished difference. Result has 97 places, 101 transitions, 920 flow [2024-06-27 22:54:23,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=920, PETRI_PLACES=97, PETRI_TRANSITIONS=101} [2024-06-27 22:54:23,047 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 44 predicate places. [2024-06-27 22:54:23,047 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 101 transitions, 920 flow [2024-06-27 22:54:23,048 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:54:23,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:23,048 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:54:23,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:54:23,049 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:54:23,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:23,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2061195653, now seen corresponding path program 2 times [2024-06-27 22:54:23,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:23,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014257149] [2024-06-27 22:54:23,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:23,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:23,627 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:54:23,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:23,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014257149] [2024-06-27 22:54:23,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014257149] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:23,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:23,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:23,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899501284] [2024-06-27 22:54:23,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:23,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:23,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:23,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:23,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:23,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:54:23,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 101 transitions, 920 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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:54:23,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:23,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:54:23,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:24,146 INFO L124 PetriNetUnfolderBase]: 1913/3999 cut-off events. [2024-06-27 22:54:24,146 INFO L125 PetriNetUnfolderBase]: For 15777/15888 co-relation queries the response was YES. [2024-06-27 22:54:24,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12912 conditions, 3999 events. 1913/3999 cut-off events. For 15777/15888 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 32371 event pairs, 890 based on Foata normal form. 21/3660 useless extension candidates. Maximal degree in co-relation 12870. Up to 2557 conditions per place. [2024-06-27 22:54:24,168 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 79 selfloop transitions, 22 changer transitions 0/123 dead transitions. [2024-06-27 22:54:24,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 123 transitions, 1206 flow [2024-06-27 22:54:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:24,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-06-27 22:54:24,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6893617021276596 [2024-06-27 22:54:24,170 INFO L175 Difference]: Start difference. First operand has 97 places, 101 transitions, 920 flow. Second operand 5 states and 162 transitions. [2024-06-27 22:54:24,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 123 transitions, 1206 flow [2024-06-27 22:54:24,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 123 transitions, 1146 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-27 22:54:24,201 INFO L231 Difference]: Finished difference. Result has 99 places, 103 transitions, 948 flow [2024-06-27 22:54:24,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=948, PETRI_PLACES=99, PETRI_TRANSITIONS=103} [2024-06-27 22:54:24,202 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 46 predicate places. [2024-06-27 22:54:24,202 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 103 transitions, 948 flow [2024-06-27 22:54:24,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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:54:24,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:24,203 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:54:24,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:54:24,203 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:54:24,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1918177857, now seen corresponding path program 3 times [2024-06-27 22:54:24,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:24,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54378480] [2024-06-27 22:54:24,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:24,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:24,770 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:54:24,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:24,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54378480] [2024-06-27 22:54:24,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54378480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:24,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:24,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:24,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686879701] [2024-06-27 22:54:24,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:24,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:24,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:24,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:24,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:24,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:54:24,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 103 transitions, 948 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:54:24,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:24,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:54:24,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:25,382 INFO L124 PetriNetUnfolderBase]: 1919/4125 cut-off events. [2024-06-27 22:54:25,383 INFO L125 PetriNetUnfolderBase]: For 16053/16160 co-relation queries the response was YES. [2024-06-27 22:54:25,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13065 conditions, 4125 events. 1919/4125 cut-off events. For 16053/16160 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 34304 event pairs, 765 based on Foata normal form. 21/3754 useless extension candidates. Maximal degree in co-relation 13022. Up to 2176 conditions per place. [2024-06-27 22:54:25,410 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 75 selfloop transitions, 37 changer transitions 0/133 dead transitions. [2024-06-27 22:54:25,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 133 transitions, 1342 flow [2024-06-27 22:54:25,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:25,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-06-27 22:54:25,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6893617021276596 [2024-06-27 22:54:25,412 INFO L175 Difference]: Start difference. First operand has 99 places, 103 transitions, 948 flow. Second operand 5 states and 162 transitions. [2024-06-27 22:54:25,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 133 transitions, 1342 flow [2024-06-27 22:54:25,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 133 transitions, 1280 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-27 22:54:25,444 INFO L231 Difference]: Finished difference. Result has 101 places, 106 transitions, 1024 flow [2024-06-27 22:54:25,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1024, PETRI_PLACES=101, PETRI_TRANSITIONS=106} [2024-06-27 22:54:25,445 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 48 predicate places. [2024-06-27 22:54:25,445 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 106 transitions, 1024 flow [2024-06-27 22:54:25,445 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:54:25,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:25,446 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:54:25,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:54:25,446 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:54:25,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:25,446 INFO L85 PathProgramCache]: Analyzing trace with hash -18881591, now seen corresponding path program 4 times [2024-06-27 22:54:25,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:25,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730119555] [2024-06-27 22:54:25,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:25,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:25,846 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:54:25,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:25,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730119555] [2024-06-27 22:54:25,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730119555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:25,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:25,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:25,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637717719] [2024-06-27 22:54:25,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:25,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:25,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:25,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:25,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:25,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:25,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 106 transitions, 1024 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:54:25,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:25,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:25,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:26,426 INFO L124 PetriNetUnfolderBase]: 2240/4630 cut-off events. [2024-06-27 22:54:26,426 INFO L125 PetriNetUnfolderBase]: For 18922/18966 co-relation queries the response was YES. [2024-06-27 22:54:26,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14882 conditions, 4630 events. 2240/4630 cut-off events. For 18922/18966 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 37789 event pairs, 847 based on Foata normal form. 11/4232 useless extension candidates. Maximal degree in co-relation 14838. Up to 2653 conditions per place. [2024-06-27 22:54:26,458 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 79 selfloop transitions, 41 changer transitions 0/140 dead transitions. [2024-06-27 22:54:26,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 140 transitions, 1420 flow [2024-06-27 22:54:26,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:54:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:54:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 227 transitions. [2024-06-27 22:54:26,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6037234042553191 [2024-06-27 22:54:26,460 INFO L175 Difference]: Start difference. First operand has 101 places, 106 transitions, 1024 flow. Second operand 8 states and 227 transitions. [2024-06-27 22:54:26,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 140 transitions, 1420 flow [2024-06-27 22:54:26,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 140 transitions, 1372 flow, removed 18 selfloop flow, removed 1 redundant places. [2024-06-27 22:54:26,498 INFO L231 Difference]: Finished difference. Result has 110 places, 110 transitions, 1180 flow [2024-06-27 22:54:26,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1180, PETRI_PLACES=110, PETRI_TRANSITIONS=110} [2024-06-27 22:54:26,500 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 57 predicate places. [2024-06-27 22:54:26,500 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 110 transitions, 1180 flow [2024-06-27 22:54:26,500 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:54:26,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:26,501 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:54:26,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:54:26,501 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:26,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:26,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1555046176, now seen corresponding path program 1 times [2024-06-27 22:54:26,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:26,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022399213] [2024-06-27 22:54:26,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:26,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:27,252 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:54:27,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:27,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022399213] [2024-06-27 22:54:27,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022399213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:27,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:27,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:54:27,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612882548] [2024-06-27 22:54:27,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:27,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:54:27,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:27,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:54:27,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:54:27,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:54:27,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 110 transitions, 1180 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:54:27,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:27,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:54:27,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:27,883 INFO L124 PetriNetUnfolderBase]: 2094/4467 cut-off events. [2024-06-27 22:54:27,884 INFO L125 PetriNetUnfolderBase]: For 20983/21064 co-relation queries the response was YES. [2024-06-27 22:54:27,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14707 conditions, 4467 events. 2094/4467 cut-off events. For 20983/21064 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 37902 event pairs, 924 based on Foata normal form. 20/4098 useless extension candidates. Maximal degree in co-relation 14658. Up to 2054 conditions per place. [2024-06-27 22:54:27,913 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 102 selfloop transitions, 26 changer transitions 0/149 dead transitions. [2024-06-27 22:54:27,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 149 transitions, 1591 flow [2024-06-27 22:54:27,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:54:27,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:54:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 239 transitions. [2024-06-27 22:54:27,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6356382978723404 [2024-06-27 22:54:27,915 INFO L175 Difference]: Start difference. First operand has 110 places, 110 transitions, 1180 flow. Second operand 8 states and 239 transitions. [2024-06-27 22:54:27,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 149 transitions, 1591 flow [2024-06-27 22:54:27,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 149 transitions, 1520 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 22:54:27,954 INFO L231 Difference]: Finished difference. Result has 113 places, 111 transitions, 1176 flow [2024-06-27 22:54:27,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1176, PETRI_PLACES=113, PETRI_TRANSITIONS=111} [2024-06-27 22:54:27,955 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 60 predicate places. [2024-06-27 22:54:27,955 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 111 transitions, 1176 flow [2024-06-27 22:54:27,955 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:54:27,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:27,955 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:54:27,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:54:27,956 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:54:27,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:27,956 INFO L85 PathProgramCache]: Analyzing trace with hash 926510880, now seen corresponding path program 2 times [2024-06-27 22:54:27,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:27,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284685762] [2024-06-27 22:54:27,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:27,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:28,715 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:54:28,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:28,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284685762] [2024-06-27 22:54:28,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284685762] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:28,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:28,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:54:28,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942995172] [2024-06-27 22:54:28,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:28,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:54:28,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:28,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:54:28,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:54:28,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-06-27 22:54:28,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 111 transitions, 1176 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:54:28,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:28,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-06-27 22:54:28,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:29,606 INFO L124 PetriNetUnfolderBase]: 2660/5493 cut-off events. [2024-06-27 22:54:29,606 INFO L125 PetriNetUnfolderBase]: For 26047/26125 co-relation queries the response was YES. [2024-06-27 22:54:29,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17663 conditions, 5493 events. 2660/5493 cut-off events. For 26047/26125 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 46876 event pairs, 1006 based on Foata normal form. 20/5054 useless extension candidates. Maximal degree in co-relation 17614. Up to 2062 conditions per place. [2024-06-27 22:54:29,637 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 100 selfloop transitions, 34 changer transitions 0/154 dead transitions. [2024-06-27 22:54:29,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 154 transitions, 1606 flow [2024-06-27 22:54:29,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:54:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:54:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 255 transitions. [2024-06-27 22:54:29,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6028368794326241 [2024-06-27 22:54:29,639 INFO L175 Difference]: Start difference. First operand has 113 places, 111 transitions, 1176 flow. Second operand 9 states and 255 transitions. [2024-06-27 22:54:29,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 154 transitions, 1606 flow [2024-06-27 22:54:29,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 154 transitions, 1520 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 22:54:29,686 INFO L231 Difference]: Finished difference. Result has 117 places, 112 transitions, 1212 flow [2024-06-27 22:54:29,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1212, PETRI_PLACES=117, PETRI_TRANSITIONS=112} [2024-06-27 22:54:29,687 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 64 predicate places. [2024-06-27 22:54:29,687 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 112 transitions, 1212 flow [2024-06-27 22:54:29,687 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:54:29,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:29,687 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:54:29,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:54:29,688 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:54:29,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:29,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1822275680, now seen corresponding path program 3 times [2024-06-27 22:54:29,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:29,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143176006] [2024-06-27 22:54:29,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:29,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:30,331 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:54:30,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:30,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143176006] [2024-06-27 22:54:30,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143176006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:30,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:30,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:30,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279888827] [2024-06-27 22:54:30,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:30,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:30,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:30,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:30,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:30,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:54:30,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 112 transitions, 1212 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:54:30,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:30,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:54:30,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:31,013 INFO L124 PetriNetUnfolderBase]: 2405/5236 cut-off events. [2024-06-27 22:54:31,013 INFO L125 PetriNetUnfolderBase]: For 28872/29009 co-relation queries the response was YES. [2024-06-27 22:54:31,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16957 conditions, 5236 events. 2405/5236 cut-off events. For 28872/29009 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 46283 event pairs, 1155 based on Foata normal form. 26/4767 useless extension candidates. Maximal degree in co-relation 16909. Up to 2776 conditions per place. [2024-06-27 22:54:31,053 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 98 selfloop transitions, 23 changer transitions 0/143 dead transitions. [2024-06-27 22:54:31,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 143 transitions, 1564 flow [2024-06-27 22:54:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2024-06-27 22:54:31,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6914893617021277 [2024-06-27 22:54:31,054 INFO L175 Difference]: Start difference. First operand has 117 places, 112 transitions, 1212 flow. Second operand 6 states and 195 transitions. [2024-06-27 22:54:31,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 143 transitions, 1564 flow [2024-06-27 22:54:31,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 143 transitions, 1501 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-27 22:54:31,113 INFO L231 Difference]: Finished difference. Result has 116 places, 112 transitions, 1199 flow [2024-06-27 22:54:31,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1199, PETRI_PLACES=116, PETRI_TRANSITIONS=112} [2024-06-27 22:54:31,114 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 63 predicate places. [2024-06-27 22:54:31,114 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 112 transitions, 1199 flow [2024-06-27 22:54:31,114 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:54:31,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:31,115 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:54:31,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:54:31,115 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:54:31,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:31,115 INFO L85 PathProgramCache]: Analyzing trace with hash 787493474, now seen corresponding path program 4 times [2024-06-27 22:54:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:31,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337480267] [2024-06-27 22:54:31,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:31,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:31,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:31,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:31,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337480267] [2024-06-27 22:54:31,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337480267] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:31,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:31,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:31,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233148719] [2024-06-27 22:54:31,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:31,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:31,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:31,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:31,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:31,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:54:31,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 112 transitions, 1199 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:54:31,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:31,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:54:31,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:32,547 INFO L124 PetriNetUnfolderBase]: 2819/6342 cut-off events. [2024-06-27 22:54:32,547 INFO L125 PetriNetUnfolderBase]: For 33302/33440 co-relation queries the response was YES. [2024-06-27 22:54:32,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19396 conditions, 6342 events. 2819/6342 cut-off events. For 33302/33440 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 59585 event pairs, 1113 based on Foata normal form. 43/5741 useless extension candidates. Maximal degree in co-relation 19352. Up to 1633 conditions per place. [2024-06-27 22:54:32,591 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 86 selfloop transitions, 41 changer transitions 0/149 dead transitions. [2024-06-27 22:54:32,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 149 transitions, 1647 flow [2024-06-27 22:54:32,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 197 transitions. [2024-06-27 22:54:32,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6985815602836879 [2024-06-27 22:54:32,593 INFO L175 Difference]: Start difference. First operand has 116 places, 112 transitions, 1199 flow. Second operand 6 states and 197 transitions. [2024-06-27 22:54:32,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 149 transitions, 1647 flow [2024-06-27 22:54:32,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 149 transitions, 1598 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-27 22:54:32,652 INFO L231 Difference]: Finished difference. Result has 117 places, 112 transitions, 1240 flow [2024-06-27 22:54:32,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1240, PETRI_PLACES=117, PETRI_TRANSITIONS=112} [2024-06-27 22:54:32,652 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 64 predicate places. [2024-06-27 22:54:32,652 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 112 transitions, 1240 flow [2024-06-27 22:54:32,653 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:54:32,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:32,653 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:54:32,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:54:32,653 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:54:32,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:32,653 INFO L85 PathProgramCache]: Analyzing trace with hash 44144544, now seen corresponding path program 5 times [2024-06-27 22:54:32,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:32,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074776444] [2024-06-27 22:54:32,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:32,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:33,283 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:54:33,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:33,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074776444] [2024-06-27 22:54:33,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074776444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:33,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:33,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:33,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936551093] [2024-06-27 22:54:33,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:33,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:54:33,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:33,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:54:33,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:54:33,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-06-27 22:54:33,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 112 transitions, 1240 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:54:33,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:33,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-06-27 22:54:33,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:34,023 INFO L124 PetriNetUnfolderBase]: 2823/6445 cut-off events. [2024-06-27 22:54:34,023 INFO L125 PetriNetUnfolderBase]: For 32351/32501 co-relation queries the response was YES. [2024-06-27 22:54:34,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19582 conditions, 6445 events. 2823/6445 cut-off events. For 32351/32501 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 61074 event pairs, 1063 based on Foata normal form. 29/5810 useless extension candidates. Maximal degree in co-relation 19538. Up to 2122 conditions per place. [2024-06-27 22:54:34,056 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 79 selfloop transitions, 45 changer transitions 0/146 dead transitions. [2024-06-27 22:54:34,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 146 transitions, 1628 flow [2024-06-27 22:54:34,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2024-06-27 22:54:34,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6843971631205674 [2024-06-27 22:54:34,057 INFO L175 Difference]: Start difference. First operand has 117 places, 112 transitions, 1240 flow. Second operand 6 states and 193 transitions. [2024-06-27 22:54:34,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 146 transitions, 1628 flow [2024-06-27 22:54:34,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 146 transitions, 1550 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 22:54:34,103 INFO L231 Difference]: Finished difference. Result has 120 places, 113 transitions, 1294 flow [2024-06-27 22:54:34,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1294, PETRI_PLACES=120, PETRI_TRANSITIONS=113} [2024-06-27 22:54:34,104 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 67 predicate places. [2024-06-27 22:54:34,104 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 113 transitions, 1294 flow [2024-06-27 22:54:34,104 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:54:34,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:34,105 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:54:34,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:54:34,105 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:54:34,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:34,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1801957988, now seen corresponding path program 6 times [2024-06-27 22:54:34,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:34,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227257163] [2024-06-27 22:54:34,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:34,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:34,714 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:54:34,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:34,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227257163] [2024-06-27 22:54:34,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227257163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:34,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:34,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:54:34,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385632643] [2024-06-27 22:54:34,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:34,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:54:34,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:34,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:54:34,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:54:34,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:54:34,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 113 transitions, 1294 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:54:34,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:34,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:54:34,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:35,440 INFO L124 PetriNetUnfolderBase]: 2676/6040 cut-off events. [2024-06-27 22:54:35,440 INFO L125 PetriNetUnfolderBase]: For 31874/32005 co-relation queries the response was YES. [2024-06-27 22:54:35,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18756 conditions, 6040 events. 2676/6040 cut-off events. For 31874/32005 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 56430 event pairs, 1348 based on Foata normal form. 26/5435 useless extension candidates. Maximal degree in co-relation 18709. Up to 2978 conditions per place. [2024-06-27 22:54:35,479 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 87 selfloop transitions, 37 changer transitions 0/145 dead transitions. [2024-06-27 22:54:35,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 145 transitions, 1630 flow [2024-06-27 22:54:35,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2024-06-27 22:54:35,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6413373860182371 [2024-06-27 22:54:35,480 INFO L175 Difference]: Start difference. First operand has 120 places, 113 transitions, 1294 flow. Second operand 7 states and 211 transitions. [2024-06-27 22:54:35,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 145 transitions, 1630 flow [2024-06-27 22:54:35,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 145 transitions, 1521 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-27 22:54:35,526 INFO L231 Difference]: Finished difference. Result has 117 places, 113 transitions, 1244 flow [2024-06-27 22:54:35,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1244, PETRI_PLACES=117, PETRI_TRANSITIONS=113} [2024-06-27 22:54:35,527 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 64 predicate places. [2024-06-27 22:54:35,527 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 113 transitions, 1244 flow [2024-06-27 22:54:35,528 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:54:35,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:35,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] [2024-06-27 22:54:35,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:54:35,528 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:54:35,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:35,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1813866953, now seen corresponding path program 1 times [2024-06-27 22:54:35,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:35,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994457877] [2024-06-27 22:54:35,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:35,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:35,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:54:35,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:35,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994457877] [2024-06-27 22:54:35,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994457877] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:35,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:35,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:54:35,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656057900] [2024-06-27 22:54:35,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:35,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:35,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:35,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:35,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:35,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:54:35,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 113 transitions, 1244 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:54:35,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:35,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:54:35,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:36,221 INFO L124 PetriNetUnfolderBase]: 4123/7554 cut-off events. [2024-06-27 22:54:36,221 INFO L125 PetriNetUnfolderBase]: For 33463/33467 co-relation queries the response was YES. [2024-06-27 22:54:36,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24529 conditions, 7554 events. 4123/7554 cut-off events. For 33463/33467 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 58358 event pairs, 296 based on Foata normal form. 398/7701 useless extension candidates. Maximal degree in co-relation 24487. Up to 2945 conditions per place. [2024-06-27 22:54:36,253 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 158 selfloop transitions, 8 changer transitions 1/182 dead transitions. [2024-06-27 22:54:36,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 182 transitions, 2375 flow [2024-06-27 22:54:36,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-06-27 22:54:36,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7191489361702128 [2024-06-27 22:54:36,254 INFO L175 Difference]: Start difference. First operand has 117 places, 113 transitions, 1244 flow. Second operand 5 states and 169 transitions. [2024-06-27 22:54:36,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 182 transitions, 2375 flow [2024-06-27 22:54:36,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 182 transitions, 2158 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-06-27 22:54:36,277 INFO L231 Difference]: Finished difference. Result has 112 places, 99 transitions, 949 flow [2024-06-27 22:54:36,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=949, PETRI_PLACES=112, PETRI_TRANSITIONS=99} [2024-06-27 22:54:36,278 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 59 predicate places. [2024-06-27 22:54:36,278 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 99 transitions, 949 flow [2024-06-27 22:54:36,278 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:54:36,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:36,278 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:54:36,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:54:36,278 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:54:36,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:36,279 INFO L85 PathProgramCache]: Analyzing trace with hash 207362233, now seen corresponding path program 1 times [2024-06-27 22:54:36,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:36,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059630171] [2024-06-27 22:54:36,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:36,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:36,359 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:54:36,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:36,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059630171] [2024-06-27 22:54:36,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059630171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:36,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:36,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:36,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509952383] [2024-06-27 22:54:36,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:36,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:54:36,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:36,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:54:36,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:54:36,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:54:36,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 99 transitions, 949 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:54:36,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:36,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:54:36,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:36,760 INFO L124 PetriNetUnfolderBase]: 2518/4487 cut-off events. [2024-06-27 22:54:36,760 INFO L125 PetriNetUnfolderBase]: For 18792/18796 co-relation queries the response was YES. [2024-06-27 22:54:36,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16240 conditions, 4487 events. 2518/4487 cut-off events. For 18792/18796 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 29656 event pairs, 175 based on Foata normal form. 260/4640 useless extension candidates. Maximal degree in co-relation 16201. Up to 1548 conditions per place. [2024-06-27 22:54:36,783 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 124 selfloop transitions, 11 changer transitions 1/151 dead transitions. [2024-06-27 22:54:36,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 151 transitions, 1733 flow [2024-06-27 22:54:36,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2024-06-27 22:54:36,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6631205673758865 [2024-06-27 22:54:36,784 INFO L175 Difference]: Start difference. First operand has 112 places, 99 transitions, 949 flow. Second operand 6 states and 187 transitions. [2024-06-27 22:54:36,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 151 transitions, 1733 flow [2024-06-27 22:54:36,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 151 transitions, 1406 flow, removed 14 selfloop flow, removed 15 redundant places. [2024-06-27 22:54:36,810 INFO L231 Difference]: Finished difference. Result has 104 places, 82 transitions, 617 flow [2024-06-27 22:54:36,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=617, PETRI_PLACES=104, PETRI_TRANSITIONS=82} [2024-06-27 22:54:36,810 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 51 predicate places. [2024-06-27 22:54:36,810 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 82 transitions, 617 flow [2024-06-27 22:54:36,810 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:54:36,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:36,810 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:54:36,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:54:36,811 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:54:36,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:36,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1128104916, now seen corresponding path program 1 times [2024-06-27 22:54:36,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:36,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639439126] [2024-06-27 22:54:36,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:36,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:36,909 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:54:36,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:36,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639439126] [2024-06-27 22:54:36,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639439126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:36,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:36,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:36,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686437563] [2024-06-27 22:54:36,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:36,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:36,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:36,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:36,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:36,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-06-27 22:54:36,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 82 transitions, 617 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:54:36,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:36,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-06-27 22:54:36,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:37,377 INFO L124 PetriNetUnfolderBase]: 2847/5462 cut-off events. [2024-06-27 22:54:37,378 INFO L125 PetriNetUnfolderBase]: For 10842/10934 co-relation queries the response was YES. [2024-06-27 22:54:37,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16347 conditions, 5462 events. 2847/5462 cut-off events. For 10842/10934 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 40465 event pairs, 1297 based on Foata normal form. 56/5265 useless extension candidates. Maximal degree in co-relation 16313. Up to 2143 conditions per place. [2024-06-27 22:54:37,400 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 59 selfloop transitions, 12 changer transitions 46/136 dead transitions. [2024-06-27 22:54:37,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 136 transitions, 1251 flow [2024-06-27 22:54:37,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-06-27 22:54:37,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6340425531914894 [2024-06-27 22:54:37,402 INFO L175 Difference]: Start difference. First operand has 104 places, 82 transitions, 617 flow. Second operand 5 states and 149 transitions. [2024-06-27 22:54:37,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 136 transitions, 1251 flow [2024-06-27 22:54:37,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 136 transitions, 1187 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-27 22:54:37,429 INFO L231 Difference]: Finished difference. Result has 104 places, 73 transitions, 505 flow [2024-06-27 22:54:37,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=505, PETRI_PLACES=104, PETRI_TRANSITIONS=73} [2024-06-27 22:54:37,429 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 51 predicate places. [2024-06-27 22:54:37,429 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 73 transitions, 505 flow [2024-06-27 22:54:37,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:54:37,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:37,430 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:54:37,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:54:37,430 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:54:37,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:37,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1388638554, now seen corresponding path program 2 times [2024-06-27 22:54:37,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:37,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965036206] [2024-06-27 22:54:37,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:37,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:37,522 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:54:37,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:37,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965036206] [2024-06-27 22:54:37,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965036206] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:37,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:37,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:54:37,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928015420] [2024-06-27 22:54:37,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:37,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:54:37,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:37,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:54:37,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:54:37,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-06-27 22:54:37,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 73 transitions, 505 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:54:37,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:37,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-06-27 22:54:37,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:37,955 INFO L124 PetriNetUnfolderBase]: 2536/4976 cut-off events. [2024-06-27 22:54:37,955 INFO L125 PetriNetUnfolderBase]: For 6966/7172 co-relation queries the response was YES. [2024-06-27 22:54:37,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13239 conditions, 4976 events. 2536/4976 cut-off events. For 6966/7172 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 38213 event pairs, 1242 based on Foata normal form. 133/4716 useless extension candidates. Maximal degree in co-relation 13218. Up to 1933 conditions per place. [2024-06-27 22:54:37,975 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 44 selfloop transitions, 4 changer transitions 44/114 dead transitions. [2024-06-27 22:54:37,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 114 transitions, 1005 flow [2024-06-27 22:54:37,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:54:37,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:54:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-06-27 22:54:37,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6382978723404256 [2024-06-27 22:54:37,978 INFO L175 Difference]: Start difference. First operand has 104 places, 73 transitions, 505 flow. Second operand 5 states and 150 transitions. [2024-06-27 22:54:37,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 114 transitions, 1005 flow [2024-06-27 22:54:37,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 114 transitions, 898 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-27 22:54:37,988 INFO L231 Difference]: Finished difference. Result has 88 places, 64 transitions, 376 flow [2024-06-27 22:54:37,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=376, PETRI_PLACES=88, PETRI_TRANSITIONS=64} [2024-06-27 22:54:37,988 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2024-06-27 22:54:37,989 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 64 transitions, 376 flow [2024-06-27 22:54:37,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:54:37,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:37,989 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:54:37,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:54:37,989 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:54:37,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:37,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1768519486, now seen corresponding path program 3 times [2024-06-27 22:54:37,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:37,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681969633] [2024-06-27 22:54:37,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:37,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:54:38,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:54:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:54:38,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:54:38,048 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:54:38,048 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2024-06-27 22:54:38,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2024-06-27 22:54:38,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 9 remaining) [2024-06-27 22:54:38,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 9 remaining) [2024-06-27 22:54:38,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 9 remaining) [2024-06-27 22:54:38,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-06-27 22:54:38,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2024-06-27 22:54:38,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2024-06-27 22:54:38,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-06-27 22:54:38,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:54:38,051 INFO L445 BasicCegarLoop]: Path program histogram: [6, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:38,056 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:54:38,056 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:54:38,102 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-27 22:54:38,102 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-27 22:54:38,103 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:54:38 BasicIcfg [2024-06-27 22:54:38,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:54:38,103 INFO L158 Benchmark]: Toolchain (without parser) took 26840.76ms. Allocated memory was 125.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 66.7MB in the beginning and 569.7MB in the end (delta: -503.1MB). Peak memory consumption was 547.8MB. Max. memory is 16.1GB. [2024-06-27 22:54:38,104 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:54:38,104 INFO L158 Benchmark]: Witness Parser took 0.43ms. Allocated memory is still 125.8MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:54:38,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.09ms. Allocated memory was 125.8MB in the beginning and 172.0MB in the end (delta: 46.1MB). Free memory was 66.4MB in the beginning and 125.8MB in the end (delta: -59.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-06-27 22:54:38,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.46ms. Allocated memory is still 172.0MB. Free memory was 125.8MB in the beginning and 122.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 22:54:38,104 INFO L158 Benchmark]: Boogie Preprocessor took 62.87ms. Allocated memory is still 172.0MB. Free memory was 122.6MB in the beginning and 119.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:54:38,105 INFO L158 Benchmark]: RCFGBuilder took 674.36ms. Allocated memory is still 172.0MB. Free memory was 119.5MB in the beginning and 61.8MB in the end (delta: 57.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-06-27 22:54:38,105 INFO L158 Benchmark]: TraceAbstraction took 25521.62ms. Allocated memory was 172.0MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 61.8MB in the beginning and 569.7MB in the end (delta: -507.9MB). Peak memory consumption was 495.5MB. Max. memory is 16.1GB. [2024-06-27 22:54:38,106 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.43ms. Allocated memory is still 125.8MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.09ms. Allocated memory was 125.8MB in the beginning and 172.0MB in the end (delta: 46.1MB). Free memory was 66.4MB in the beginning and 125.8MB in the end (delta: -59.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.46ms. Allocated memory is still 172.0MB. Free memory was 125.8MB in the beginning and 122.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.87ms. Allocated memory is still 172.0MB. Free memory was 122.6MB in the beginning and 119.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 674.36ms. Allocated memory is still 172.0MB. Free memory was 119.5MB in the beginning and 61.8MB in the end (delta: 57.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 25521.62ms. Allocated memory was 172.0MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 61.8MB in the beginning and 569.7MB in the end (delta: -507.9MB). Peak memory consumption was 495.5MB. 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; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff0_thd3; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$read_delayed; [L728] 0 int *x$read_delayed_var; [L729] 0 int x$w_buff0; [L730] 0 _Bool x$w_buff0_used; [L731] 0 int x$w_buff1; [L732] 0 _Bool x$w_buff1_used; [L734] 0 int y = 0; [L736] 0 int z = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L829] 0 pthread_t t2513; [L830] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2513=-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, z=0] [L830] FCALL, FORK 0 pthread_create(&t2513, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2513=-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, z=0] [L831] 0 pthread_t t2514; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2513=-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, z=0] [L832] 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))); [L832] FCALL, FORK 0 pthread_create(&t2514, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2513=-2, t2514=-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, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L833] 0 pthread_t t2515; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2513=-2, t2514=-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=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, z=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(&t2515, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2513=-2, t2514=-1, t2515=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, z=0] [L784] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L801] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0] [L804] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=1] [L742] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, z=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 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) [L752] 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)) [L753] 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)) [L754] 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)) [L755] 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)) [L756] 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)) [L757] 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)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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, z=2] [L835] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513=-2, t2514=-1, t2515=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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, z=2] [L787] 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) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 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 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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, z=2] [L807] 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) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 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 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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, z=2] [L794] 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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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, z=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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, z=2] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513=-2, t2514=-1, t2515=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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, z=2] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 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 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513=-2, t2514=-1, t2515=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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, z=2] [L847] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513=-2, t2514=-1, t2515=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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, z=2] [L849] 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, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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, z=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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, z=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: 832]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds 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: 835]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds 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. - UnprovableResult [Line: 830]: 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: 25.4s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1229 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1082 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4866 IncrementalHoareTripleChecker+Invalid, 5055 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 43 mSDtfsCounter, 4866 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1294occurred in iteration=20, InterpolantAutomatonStates: 143, 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.4s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 535 NumberOfCodeBlocks, 535 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 476 ConstructedInterpolants, 0 QuantifiedInterpolants, 9075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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:54:38,137 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