./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:36:59,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:36:59,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:36:59,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:36:59,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:36:59,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:36:59,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:36:59,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:36:59,782 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:36:59,782 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:36:59,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:36:59,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:36:59,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:36:59,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:36:59,784 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:36:59,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:36:59,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:36:59,784 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:36:59,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:36:59,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:36:59,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:36:59,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:36:59,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:36:59,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:36:59,786 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:36:59,786 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:36:59,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:36:59,786 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:36:59,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:36:59,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:36:59,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:36:59,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:36:59,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:36:59,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:36:59,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:36:59,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:36:59,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:36:59,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:36:59,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:36:59,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:36:59,789 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:36:59,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:36:59,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:36:59,790 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:37:00,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:37:00,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:37:00,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:37:00,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:37:00,042 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:37:00,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2024-06-27 22:37:01,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:37:01,340 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:37:01,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2024-06-27 22:37:01,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced4191e0/e16985386ca44a408a8b6e424dd400ef/FLAGcda63247f [2024-06-27 22:37:01,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced4191e0/e16985386ca44a408a8b6e424dd400ef [2024-06-27 22:37:01,369 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:37:01,370 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:37:01,370 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/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.yml/witness.yml [2024-06-27 22:37:01,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:37:01,428 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:37:01,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:37:01,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:37:01,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:37:01,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:37:01" (1/2) ... [2024-06-27 22:37:01,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a5ec74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:37:01, skipping insertion in model container [2024-06-27 22:37:01,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:37:01" (1/2) ... [2024-06-27 22:37:01,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@29b4176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:37:01, skipping insertion in model container [2024-06-27 22:37:01,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:37:01" (2/2) ... [2024-06-27 22:37:01,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a5ec74 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:37:01, skipping insertion in model container [2024-06-27 22:37:01,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:37:01" (2/2) ... [2024-06-27 22:37:01,438 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:37:01,462 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:37:01,463 INFO L97 edCorrectnessWitness]: Location invariant before [L821-L821] ! multithreaded || ((((((((((((((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) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 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_used >= 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_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:37:01,463 INFO L97 edCorrectnessWitness]: Location invariant before [L823-L823] ! multithreaded || ((((((((((((((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) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 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_used >= 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_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:37:01,463 INFO L97 edCorrectnessWitness]: Location invariant before [L824-L824] ! multithreaded || ((((((((((((((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) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 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_used >= 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_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:37:01,463 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:37:01,463 INFO L106 edCorrectnessWitness]: ghost_update [L819-L819] multithreaded = 1; [2024-06-27 22:37:01,502 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:37:01,610 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/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2024-06-27 22:37:01,769 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:37:01,782 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:37:01,826 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/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:37:01,896 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:37:01,923 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:37:01,924 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:37:01 WrapperNode [2024-06-27 22:37:01,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:37:01,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:37:01,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:37:01,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:37:01,931 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:37:01" (1/1) ... [2024-06-27 22:37:01,957 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:37:01" (1/1) ... [2024-06-27 22:37:01,995 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2024-06-27 22:37:01,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:37:02,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:37:02,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:37:02,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:37:02,008 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:37:01" (1/1) ... [2024-06-27 22:37:02,009 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:37:01" (1/1) ... [2024-06-27 22:37:02,022 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:37:01" (1/1) ... [2024-06-27 22:37:02,038 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:37:02,040 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:37:01" (1/1) ... [2024-06-27 22:37:02,041 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:37:01" (1/1) ... [2024-06-27 22:37:02,052 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:37:01" (1/1) ... [2024-06-27 22:37:02,057 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:37:01" (1/1) ... [2024-06-27 22:37:02,059 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:37:01" (1/1) ... [2024-06-27 22:37:02,065 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:37:01" (1/1) ... [2024-06-27 22:37:02,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:37:02,072 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:37:02,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:37:02,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:37:02,073 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:37:01" (1/1) ... [2024-06-27 22:37:02,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:37:02,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:37:02,096 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:37:02,112 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:37:02,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:37:02,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:37:02,122 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:37:02,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:37:02,123 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:37:02,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:37:02,123 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:37:02,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:37:02,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:37:02,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:37:02,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:37:02,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:37:02,125 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:37:02,216 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:37:02,218 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:37:02,494 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:37:02,494 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:37:02,622 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:37:02,623 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:37:02,623 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:37:02 BoogieIcfgContainer [2024-06-27 22:37:02,623 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:37:02,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:37:02,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:37:02,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:37:02,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:37:01" (1/4) ... [2024-06-27 22:37:02,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da20d01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:37:02, skipping insertion in model container [2024-06-27 22:37:02,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:37:01" (2/4) ... [2024-06-27 22:37:02,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da20d01 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:37:02, skipping insertion in model container [2024-06-27 22:37:02,630 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:37:01" (3/4) ... [2024-06-27 22:37:02,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da20d01 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:37:02, skipping insertion in model container [2024-06-27 22:37:02,632 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:37:02" (4/4) ... [2024-06-27 22:37:02,633 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2024-06-27 22:37:02,647 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:37:02,647 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:37:02,647 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:37:02,693 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:37:02,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 46 transitions, 104 flow [2024-06-27 22:37:02,750 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2024-06-27 22:37:02,750 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:37:02,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 1/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-06-27 22:37:02,753 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 46 transitions, 104 flow [2024-06-27 22:37:02,757 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 43 transitions, 95 flow [2024-06-27 22:37:02,763 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:37:02,771 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;@255601aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:37:02,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:37:02,775 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:37:02,776 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:37:02,776 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:37:02,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:02,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:37:02,777 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:37:02,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:02,829 INFO L85 PathProgramCache]: Analyzing trace with hash 351296548, now seen corresponding path program 1 times [2024-06-27 22:37:02,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:02,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881650966] [2024-06-27 22:37:02,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:02,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:03,286 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:37:03,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:03,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881650966] [2024-06-27 22:37:03,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881650966] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:03,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:03,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:37:03,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709133040] [2024-06-27 22:37:03,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:03,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:37:03,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:03,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:37:03,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:37:03,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:03,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:03,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:03,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:03,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:03,683 INFO L124 PetriNetUnfolderBase]: 1061/1847 cut-off events. [2024-06-27 22:37:03,683 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-27 22:37:03,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3505 conditions, 1847 events. 1061/1847 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11691 event pairs, 302 based on Foata normal form. 60/1788 useless extension candidates. Maximal degree in co-relation 3493. Up to 1566 conditions per place. [2024-06-27 22:37:03,697 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 39 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-06-27 22:37:03,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 215 flow [2024-06-27 22:37:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:37:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:37:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-06-27 22:37:03,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7608695652173914 [2024-06-27 22:37:03,709 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 95 flow. Second operand 3 states and 105 transitions. [2024-06-27 22:37:03,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 215 flow [2024-06-27 22:37:03,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 210 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:37:03,716 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 115 flow [2024-06-27 22:37:03,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2024-06-27 22:37:03,721 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-06-27 22:37:03,722 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 115 flow [2024-06-27 22:37:03,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:03,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:03,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:03,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:37:03,723 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:03,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:03,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1359200355, now seen corresponding path program 1 times [2024-06-27 22:37:03,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:03,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046856474] [2024-06-27 22:37:03,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:03,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:03,866 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:37:03,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:03,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046856474] [2024-06-27 22:37:03,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046856474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:03,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:03,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:37:03,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202901343] [2024-06-27 22:37:03,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:03,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:37:03,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:03,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:37:03,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:37:03,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:03,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:03,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:03,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:03,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:04,099 INFO L124 PetriNetUnfolderBase]: 854/1527 cut-off events. [2024-06-27 22:37:04,099 INFO L125 PetriNetUnfolderBase]: For 233/233 co-relation queries the response was YES. [2024-06-27 22:37:04,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3179 conditions, 1527 events. 854/1527 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8966 event pairs, 302 based on Foata normal form. 15/1491 useless extension candidates. Maximal degree in co-relation 3167. Up to 1065 conditions per place. [2024-06-27 22:37:04,106 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 46 selfloop transitions, 4 changer transitions 3/69 dead transitions. [2024-06-27 22:37:04,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 69 transitions, 273 flow [2024-06-27 22:37:04,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:37:04,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:37:04,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-06-27 22:37:04,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7228260869565217 [2024-06-27 22:37:04,108 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 115 flow. Second operand 4 states and 133 transitions. [2024-06-27 22:37:04,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 69 transitions, 273 flow [2024-06-27 22:37:04,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:37:04,109 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 116 flow [2024-06-27 22:37:04,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2024-06-27 22:37:04,110 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2024-06-27 22:37:04,110 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 116 flow [2024-06-27 22:37:04,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:04,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:04,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:04,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:37:04,111 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:37:04,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:04,111 INFO L85 PathProgramCache]: Analyzing trace with hash -759188824, now seen corresponding path program 1 times [2024-06-27 22:37:04,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:04,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472875201] [2024-06-27 22:37:04,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:04,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:04,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:04,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472875201] [2024-06-27 22:37:04,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472875201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:04,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:04,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:37:04,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095641147] [2024-06-27 22:37:04,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:04,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:37:04,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:04,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:37:04,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:37:04,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:04,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:04,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:04,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:04,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:04,459 INFO L124 PetriNetUnfolderBase]: 745/1405 cut-off events. [2024-06-27 22:37:04,460 INFO L125 PetriNetUnfolderBase]: For 539/539 co-relation queries the response was YES. [2024-06-27 22:37:04,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3038 conditions, 1405 events. 745/1405 cut-off events. For 539/539 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8608 event pairs, 472 based on Foata normal form. 2/1353 useless extension candidates. Maximal degree in co-relation 3024. Up to 1120 conditions per place. [2024-06-27 22:37:04,467 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 37 selfloop transitions, 9 changer transitions 0/62 dead transitions. [2024-06-27 22:37:04,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 267 flow [2024-06-27 22:37:04,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:37:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:37:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2024-06-27 22:37:04,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6630434782608695 [2024-06-27 22:37:04,472 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 116 flow. Second operand 4 states and 122 transitions. [2024-06-27 22:37:04,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 267 flow [2024-06-27 22:37:04,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 62 transitions, 256 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 22:37:04,474 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 176 flow [2024-06-27 22:37:04,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2024-06-27 22:37:04,476 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2024-06-27 22:37:04,476 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 176 flow [2024-06-27 22:37:04,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:04,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:04,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:04,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:37:04,477 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:37:04,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash 564039719, now seen corresponding path program 1 times [2024-06-27 22:37:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:04,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486674920] [2024-06-27 22:37:04,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:04,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:04,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:04,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486674920] [2024-06-27 22:37:04,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486674920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:04,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:04,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:37:04,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628253196] [2024-06-27 22:37:04,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:04,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:37:04,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:04,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:37:04,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:37:04,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:04,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:04,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:04,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:04,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:05,173 INFO L124 PetriNetUnfolderBase]: 794/1504 cut-off events. [2024-06-27 22:37:05,173 INFO L125 PetriNetUnfolderBase]: For 903/918 co-relation queries the response was YES. [2024-06-27 22:37:05,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3567 conditions, 1504 events. 794/1504 cut-off events. For 903/918 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9431 event pairs, 497 based on Foata normal form. 14/1458 useless extension candidates. Maximal degree in co-relation 3551. Up to 1108 conditions per place. [2024-06-27 22:37:05,181 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 48 selfloop transitions, 10 changer transitions 0/74 dead transitions. [2024-06-27 22:37:05,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 358 flow [2024-06-27 22:37:05,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:37:05,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:37:05,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-06-27 22:37:05,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6652173913043479 [2024-06-27 22:37:05,183 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 176 flow. Second operand 5 states and 153 transitions. [2024-06-27 22:37:05,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 358 flow [2024-06-27 22:37:05,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 356 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-27 22:37:05,186 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 208 flow [2024-06-27 22:37:05,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-06-27 22:37:05,187 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2024-06-27 22:37:05,187 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 208 flow [2024-06-27 22:37:05,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:05,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:05,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:05,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:37:05,188 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:37:05,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:05,188 INFO L85 PathProgramCache]: Analyzing trace with hash 126911991, now seen corresponding path program 1 times [2024-06-27 22:37:05,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:05,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858882252] [2024-06-27 22:37:05,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:05,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:05,353 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:37:05,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:05,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858882252] [2024-06-27 22:37:05,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858882252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:05,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:05,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:37:05,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75329359] [2024-06-27 22:37:05,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:05,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:37:05,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:05,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:37:05,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:37:05,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:05,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:05,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:05,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:05,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:05,623 INFO L124 PetriNetUnfolderBase]: 881/1639 cut-off events. [2024-06-27 22:37:05,623 INFO L125 PetriNetUnfolderBase]: For 1431/1448 co-relation queries the response was YES. [2024-06-27 22:37:05,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4086 conditions, 1639 events. 881/1639 cut-off events. For 1431/1448 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10140 event pairs, 329 based on Foata normal form. 10/1580 useless extension candidates. Maximal degree in co-relation 4067. Up to 1058 conditions per place. [2024-06-27 22:37:05,631 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 57 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2024-06-27 22:37:05,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 89 transitions, 456 flow [2024-06-27 22:37:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:37:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:37:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-06-27 22:37:05,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6956521739130435 [2024-06-27 22:37:05,633 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 208 flow. Second operand 5 states and 160 transitions. [2024-06-27 22:37:05,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 89 transitions, 456 flow [2024-06-27 22:37:05,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 89 transitions, 434 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 22:37:05,637 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 285 flow [2024-06-27 22:37:05,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2024-06-27 22:37:05,652 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2024-06-27 22:37:05,653 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 285 flow [2024-06-27 22:37:05,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:05,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:05,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:05,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:37:05,653 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:37:05,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:05,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1890099451, now seen corresponding path program 2 times [2024-06-27 22:37:05,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:05,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469273980] [2024-06-27 22:37:05,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:05,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:05,817 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:37:05,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:05,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469273980] [2024-06-27 22:37:05,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469273980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:05,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:05,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:37:05,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551579121] [2024-06-27 22:37:05,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:05,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:37:05,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:05,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:37:05,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:37:05,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:05,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 285 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:05,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:05,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:05,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:06,106 INFO L124 PetriNetUnfolderBase]: 1094/2070 cut-off events. [2024-06-27 22:37:06,107 INFO L125 PetriNetUnfolderBase]: For 3235/3269 co-relation queries the response was YES. [2024-06-27 22:37:06,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6223 conditions, 2070 events. 1094/2070 cut-off events. For 3235/3269 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13496 event pairs, 245 based on Foata normal form. 12/2009 useless extension candidates. Maximal degree in co-relation 6202. Up to 1142 conditions per place. [2024-06-27 22:37:06,119 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 59 selfloop transitions, 25 changer transitions 0/100 dead transitions. [2024-06-27 22:37:06,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 100 transitions, 633 flow [2024-06-27 22:37:06,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:37:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:37:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2024-06-27 22:37:06,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-27 22:37:06,121 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 285 flow. Second operand 5 states and 161 transitions. [2024-06-27 22:37:06,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 100 transitions, 633 flow [2024-06-27 22:37:06,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 100 transitions, 614 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-27 22:37:06,127 INFO L231 Difference]: Finished difference. Result has 68 places, 71 transitions, 442 flow [2024-06-27 22:37:06,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=442, PETRI_PLACES=68, PETRI_TRANSITIONS=71} [2024-06-27 22:37:06,127 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 16 predicate places. [2024-06-27 22:37:06,128 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 71 transitions, 442 flow [2024-06-27 22:37:06,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:06,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:06,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:06,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:37:06,128 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:37:06,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:06,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1974094842, now seen corresponding path program 1 times [2024-06-27 22:37:06,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:06,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446982230] [2024-06-27 22:37:06,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:06,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:06,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:06,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446982230] [2024-06-27 22:37:06,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446982230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:06,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:06,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:37:06,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629557719] [2024-06-27 22:37:06,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:06,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:37:06,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:06,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:37:06,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:37:06,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:06,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 71 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:37:06,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:06,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:06,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:06,715 INFO L124 PetriNetUnfolderBase]: 1226/2263 cut-off events. [2024-06-27 22:37:06,715 INFO L125 PetriNetUnfolderBase]: For 6527/6559 co-relation queries the response was YES. [2024-06-27 22:37:06,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8256 conditions, 2263 events. 1226/2263 cut-off events. For 6527/6559 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 14786 event pairs, 248 based on Foata normal form. 20/2218 useless extension candidates. Maximal degree in co-relation 8232. Up to 1390 conditions per place. [2024-06-27 22:37:06,730 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 74 selfloop transitions, 22 changer transitions 0/112 dead transitions. [2024-06-27 22:37:06,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 112 transitions, 841 flow [2024-06-27 22:37:06,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:37:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:37:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-06-27 22:37:06,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7043478260869566 [2024-06-27 22:37:06,732 INFO L175 Difference]: Start difference. First operand has 68 places, 71 transitions, 442 flow. Second operand 5 states and 162 transitions. [2024-06-27 22:37:06,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 112 transitions, 841 flow [2024-06-27 22:37:06,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 112 transitions, 795 flow, removed 20 selfloop flow, removed 1 redundant places. [2024-06-27 22:37:06,741 INFO L231 Difference]: Finished difference. Result has 73 places, 79 transitions, 559 flow [2024-06-27 22:37:06,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=559, PETRI_PLACES=73, PETRI_TRANSITIONS=79} [2024-06-27 22:37:06,742 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2024-06-27 22:37:06,742 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 559 flow [2024-06-27 22:37:06,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:37:06,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:06,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:06,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:37:06,743 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:06,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:06,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1540205398, now seen corresponding path program 2 times [2024-06-27 22:37:06,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:06,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769698721] [2024-06-27 22:37:06,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:06,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:07,004 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:37:07,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:07,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769698721] [2024-06-27 22:37:07,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769698721] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:07,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:07,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:37:07,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818959480] [2024-06-27 22:37:07,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:07,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:37:07,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:07,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:37:07,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:37:07,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:07,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 559 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:37:07,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:07,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:07,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:07,376 INFO L124 PetriNetUnfolderBase]: 1307/2436 cut-off events. [2024-06-27 22:37:07,376 INFO L125 PetriNetUnfolderBase]: For 9079/9164 co-relation queries the response was YES. [2024-06-27 22:37:07,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9468 conditions, 2436 events. 1307/2436 cut-off events. For 9079/9164 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16152 event pairs, 324 based on Foata normal form. 35/2393 useless extension candidates. Maximal degree in co-relation 9441. Up to 1528 conditions per place. [2024-06-27 22:37:07,394 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 78 selfloop transitions, 24 changer transitions 0/118 dead transitions. [2024-06-27 22:37:07,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 118 transitions, 977 flow [2024-06-27 22:37:07,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:37:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:37:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2024-06-27 22:37:07,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-27 22:37:07,396 INFO L175 Difference]: Start difference. First operand has 73 places, 79 transitions, 559 flow. Second operand 5 states and 161 transitions. [2024-06-27 22:37:07,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 118 transitions, 977 flow [2024-06-27 22:37:07,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 945 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-27 22:37:07,410 INFO L231 Difference]: Finished difference. Result has 78 places, 88 transitions, 722 flow [2024-06-27 22:37:07,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=722, PETRI_PLACES=78, PETRI_TRANSITIONS=88} [2024-06-27 22:37:07,410 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2024-06-27 22:37:07,411 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 88 transitions, 722 flow [2024-06-27 22:37:07,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:37:07,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:07,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:07,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:37:07,411 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:07,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash 867763174, now seen corresponding path program 3 times [2024-06-27 22:37:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:07,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388715015] [2024-06-27 22:37:07,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:07,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:07,672 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:37:07,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:07,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388715015] [2024-06-27 22:37:07,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388715015] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:07,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:07,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:37:07,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603540333] [2024-06-27 22:37:07,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:07,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:37:07,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:07,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:37:07,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:37:07,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:07,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 88 transitions, 722 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:37:07,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:07,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:07,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:08,038 INFO L124 PetriNetUnfolderBase]: 1425/2683 cut-off events. [2024-06-27 22:37:08,038 INFO L125 PetriNetUnfolderBase]: For 13022/13190 co-relation queries the response was YES. [2024-06-27 22:37:08,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11014 conditions, 2683 events. 1425/2683 cut-off events. For 13022/13190 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 18376 event pairs, 306 based on Foata normal form. 38/2639 useless extension candidates. Maximal degree in co-relation 10984. Up to 1267 conditions per place. [2024-06-27 22:37:08,056 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 67 selfloop transitions, 42 changer transitions 0/125 dead transitions. [2024-06-27 22:37:08,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 125 transitions, 1176 flow [2024-06-27 22:37:08,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:37:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:37:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2024-06-27 22:37:08,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-27 22:37:08,058 INFO L175 Difference]: Start difference. First operand has 78 places, 88 transitions, 722 flow. Second operand 5 states and 161 transitions. [2024-06-27 22:37:08,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 125 transitions, 1176 flow [2024-06-27 22:37:08,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 125 transitions, 1127 flow, removed 17 selfloop flow, removed 1 redundant places. [2024-06-27 22:37:08,072 INFO L231 Difference]: Finished difference. Result has 83 places, 96 transitions, 926 flow [2024-06-27 22:37:08,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=926, PETRI_PLACES=83, PETRI_TRANSITIONS=96} [2024-06-27 22:37:08,073 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 31 predicate places. [2024-06-27 22:37:08,073 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 96 transitions, 926 flow [2024-06-27 22:37:08,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:37:08,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:08,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:08,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:37:08,074 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:08,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash -176522404, now seen corresponding path program 1 times [2024-06-27 22:37:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:08,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547661201] [2024-06-27 22:37:08,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:08,364 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:37:08,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:08,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547661201] [2024-06-27 22:37:08,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547661201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:08,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:08,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:37:08,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284137172] [2024-06-27 22:37:08,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:08,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:37:08,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:08,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:37:08,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:37:08,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:08,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 96 transitions, 926 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:08,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:08,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:08,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:08,835 INFO L124 PetriNetUnfolderBase]: 1695/3215 cut-off events. [2024-06-27 22:37:08,835 INFO L125 PetriNetUnfolderBase]: For 21539/21730 co-relation queries the response was YES. [2024-06-27 22:37:08,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14297 conditions, 3215 events. 1695/3215 cut-off events. For 21539/21730 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 23008 event pairs, 408 based on Foata normal form. 74/3185 useless extension candidates. Maximal degree in co-relation 14264. Up to 1288 conditions per place. [2024-06-27 22:37:08,856 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 81 selfloop transitions, 34 changer transitions 0/131 dead transitions. [2024-06-27 22:37:08,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 131 transitions, 1378 flow [2024-06-27 22:37:08,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:37:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:37:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-06-27 22:37:08,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7043478260869566 [2024-06-27 22:37:08,858 INFO L175 Difference]: Start difference. First operand has 83 places, 96 transitions, 926 flow. Second operand 5 states and 162 transitions. [2024-06-27 22:37:08,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 131 transitions, 1378 flow [2024-06-27 22:37:08,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 131 transitions, 1321 flow, removed 25 selfloop flow, removed 1 redundant places. [2024-06-27 22:37:08,878 INFO L231 Difference]: Finished difference. Result has 87 places, 97 transitions, 961 flow [2024-06-27 22:37:08,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=961, PETRI_PLACES=87, PETRI_TRANSITIONS=97} [2024-06-27 22:37:08,878 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 35 predicate places. [2024-06-27 22:37:08,878 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 97 transitions, 961 flow [2024-06-27 22:37:08,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:08,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:08,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:08,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:37:08,879 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:08,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:08,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1512216964, now seen corresponding path program 2 times [2024-06-27 22:37:08,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:08,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080619844] [2024-06-27 22:37:08,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:08,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:09,177 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:37:09,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:09,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080619844] [2024-06-27 22:37:09,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080619844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:09,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:09,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:37:09,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647641841] [2024-06-27 22:37:09,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:09,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:37:09,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:09,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:37:09,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:37:09,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:09,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 97 transitions, 961 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:37:09,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:09,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:09,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:09,701 INFO L124 PetriNetUnfolderBase]: 1872/3560 cut-off events. [2024-06-27 22:37:09,701 INFO L125 PetriNetUnfolderBase]: For 24996/25197 co-relation queries the response was YES. [2024-06-27 22:37:09,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15924 conditions, 3560 events. 1872/3560 cut-off events. For 24996/25197 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 26364 event pairs, 408 based on Foata normal form. 70/3526 useless extension candidates. Maximal degree in co-relation 15889. Up to 1164 conditions per place. [2024-06-27 22:37:09,724 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 94 selfloop transitions, 34 changer transitions 0/144 dead transitions. [2024-06-27 22:37:09,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 144 transitions, 1519 flow [2024-06-27 22:37:09,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:37:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:37:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-06-27 22:37:09,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7028985507246377 [2024-06-27 22:37:09,725 INFO L175 Difference]: Start difference. First operand has 87 places, 97 transitions, 961 flow. Second operand 6 states and 194 transitions. [2024-06-27 22:37:09,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 144 transitions, 1519 flow [2024-06-27 22:37:09,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 144 transitions, 1455 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 22:37:09,749 INFO L231 Difference]: Finished difference. Result has 90 places, 97 transitions, 971 flow [2024-06-27 22:37:09,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=971, PETRI_PLACES=90, PETRI_TRANSITIONS=97} [2024-06-27 22:37:09,750 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 38 predicate places. [2024-06-27 22:37:09,750 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 97 transitions, 971 flow [2024-06-27 22:37:09,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:37:09,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:09,750 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:37:09,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:37:09,750 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:09,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:09,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1177405053, now seen corresponding path program 1 times [2024-06-27 22:37:09,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:09,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39560799] [2024-06-27 22:37:09,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:09,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:10,092 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:37:10,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:10,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39560799] [2024-06-27 22:37:10,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39560799] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:10,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:10,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:37:10,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969732281] [2024-06-27 22:37:10,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:10,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:37:10,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:10,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:37:10,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:37:10,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:10,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 97 transitions, 971 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 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:37:10,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:10,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:10,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:10,641 INFO L124 PetriNetUnfolderBase]: 1948/3794 cut-off events. [2024-06-27 22:37:10,641 INFO L125 PetriNetUnfolderBase]: For 25064/25275 co-relation queries the response was YES. [2024-06-27 22:37:10,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16577 conditions, 3794 events. 1948/3794 cut-off events. For 25064/25275 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 29011 event pairs, 489 based on Foata normal form. 52/3716 useless extension candidates. Maximal degree in co-relation 16541. Up to 1151 conditions per place. [2024-06-27 22:37:10,668 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 72 selfloop transitions, 42 changer transitions 0/130 dead transitions. [2024-06-27 22:37:10,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 130 transitions, 1391 flow [2024-06-27 22:37:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:37:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:37:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2024-06-27 22:37:10,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-27 22:37:10,670 INFO L175 Difference]: Start difference. First operand has 90 places, 97 transitions, 971 flow. Second operand 5 states and 161 transitions. [2024-06-27 22:37:10,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 130 transitions, 1391 flow [2024-06-27 22:37:10,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 130 transitions, 1325 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 22:37:10,705 INFO L231 Difference]: Finished difference. Result has 90 places, 96 transitions, 978 flow [2024-06-27 22:37:10,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=978, PETRI_PLACES=90, PETRI_TRANSITIONS=96} [2024-06-27 22:37:10,706 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 38 predicate places. [2024-06-27 22:37:10,706 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 96 transitions, 978 flow [2024-06-27 22:37:10,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 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:37:10,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:10,707 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:37:10,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:37:10,707 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:37:10,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1246385729, now seen corresponding path program 1 times [2024-06-27 22:37:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:10,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207179698] [2024-06-27 22:37:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:10,975 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:37:10,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:10,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207179698] [2024-06-27 22:37:10,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207179698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:10,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:10,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:37:10,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2671527] [2024-06-27 22:37:10,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:10,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:37:10,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:10,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:37:10,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:37:10,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:10,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 96 transitions, 978 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:37:10,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:10,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:10,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:11,354 INFO L124 PetriNetUnfolderBase]: 1943/3814 cut-off events. [2024-06-27 22:37:11,354 INFO L125 PetriNetUnfolderBase]: For 26020/26076 co-relation queries the response was YES. [2024-06-27 22:37:11,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16856 conditions, 3814 events. 1943/3814 cut-off events. For 26020/26076 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 29483 event pairs, 938 based on Foata normal form. 23/3706 useless extension candidates. Maximal degree in co-relation 16819. Up to 2995 conditions per place. [2024-06-27 22:37:11,380 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 86 selfloop transitions, 11 changer transitions 0/113 dead transitions. [2024-06-27 22:37:11,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 113 transitions, 1248 flow [2024-06-27 22:37:11,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:37:11,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:37:11,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-06-27 22:37:11,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.657608695652174 [2024-06-27 22:37:11,382 INFO L175 Difference]: Start difference. First operand has 90 places, 96 transitions, 978 flow. Second operand 4 states and 121 transitions. [2024-06-27 22:37:11,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 113 transitions, 1248 flow [2024-06-27 22:37:11,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 113 transitions, 1164 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 22:37:11,421 INFO L231 Difference]: Finished difference. Result has 90 places, 99 transitions, 973 flow [2024-06-27 22:37:11,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=973, PETRI_PLACES=90, PETRI_TRANSITIONS=99} [2024-06-27 22:37:11,422 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 38 predicate places. [2024-06-27 22:37:11,422 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 99 transitions, 973 flow [2024-06-27 22:37:11,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:37:11,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:11,423 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:37:11,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:37:11,424 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:37:11,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:11,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1212239131, now seen corresponding path program 2 times [2024-06-27 22:37:11,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:11,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789309163] [2024-06-27 22:37:11,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:11,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:11,688 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:37:11,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:11,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789309163] [2024-06-27 22:37:11,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789309163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:11,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:11,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:37:11,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722263472] [2024-06-27 22:37:11,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:11,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:37:11,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:11,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:37:11,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:37:11,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:37:11,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 99 transitions, 973 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:37:11,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:11,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:37:11,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:12,132 INFO L124 PetriNetUnfolderBase]: 2198/4209 cut-off events. [2024-06-27 22:37:12,132 INFO L125 PetriNetUnfolderBase]: For 25760/25819 co-relation queries the response was YES. [2024-06-27 22:37:12,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18006 conditions, 4209 events. 2198/4209 cut-off events. For 25760/25819 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 32100 event pairs, 851 based on Foata normal form. 23/4113 useless extension candidates. Maximal degree in co-relation 17967. Up to 3308 conditions per place. [2024-06-27 22:37:12,163 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 96 selfloop transitions, 19 changer transitions 0/129 dead transitions. [2024-06-27 22:37:12,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 129 transitions, 1388 flow [2024-06-27 22:37:12,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:37:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:37:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2024-06-27 22:37:12,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5942028985507246 [2024-06-27 22:37:12,164 INFO L175 Difference]: Start difference. First operand has 90 places, 99 transitions, 973 flow. Second operand 6 states and 164 transitions. [2024-06-27 22:37:12,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 129 transitions, 1388 flow [2024-06-27 22:37:12,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 129 transitions, 1349 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-27 22:37:12,214 INFO L231 Difference]: Finished difference. Result has 95 places, 105 transitions, 1077 flow [2024-06-27 22:37:12,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1077, PETRI_PLACES=95, PETRI_TRANSITIONS=105} [2024-06-27 22:37:12,215 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 43 predicate places. [2024-06-27 22:37:12,215 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 105 transitions, 1077 flow [2024-06-27 22:37:12,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:37:12,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:12,216 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:37:12,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:37:12,216 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:12,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:12,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1652215049, now seen corresponding path program 1 times [2024-06-27 22:37:12,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:12,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888830089] [2024-06-27 22:37:12,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:12,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:12,442 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:37:12,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:12,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888830089] [2024-06-27 22:37:12,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888830089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:12,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:12,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:37:12,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176219986] [2024-06-27 22:37:12,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:12,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:37:12,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:12,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:37:12,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:37:12,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 22:37:12,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 105 transitions, 1077 flow. Second operand has 8 states, 8 states have (on average 15.0) internal successors, (120), 8 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:37:12,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:12,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 22:37:12,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:14,149 INFO L124 PetriNetUnfolderBase]: 10046/15957 cut-off events. [2024-06-27 22:37:14,150 INFO L125 PetriNetUnfolderBase]: For 101407/102289 co-relation queries the response was YES. [2024-06-27 22:37:14,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64095 conditions, 15957 events. 10046/15957 cut-off events. For 101407/102289 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 120959 event pairs, 1216 based on Foata normal form. 754/16262 useless extension candidates. Maximal degree in co-relation 64053. Up to 6519 conditions per place. [2024-06-27 22:37:14,376 INFO L140 encePairwiseOnDemand]: 31/46 looper letters, 136 selfloop transitions, 62 changer transitions 293/509 dead transitions. [2024-06-27 22:37:14,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 509 transitions, 6590 flow [2024-06-27 22:37:14,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:37:14,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:37:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 308 transitions. [2024-06-27 22:37:14,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5150501672240803 [2024-06-27 22:37:14,378 INFO L175 Difference]: Start difference. First operand has 95 places, 105 transitions, 1077 flow. Second operand 13 states and 308 transitions. [2024-06-27 22:37:14,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 509 transitions, 6590 flow [2024-06-27 22:37:14,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 509 transitions, 6393 flow, removed 61 selfloop flow, removed 4 redundant places. [2024-06-27 22:37:14,598 INFO L231 Difference]: Finished difference. Result has 114 places, 163 transitions, 2288 flow [2024-06-27 22:37:14,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2288, PETRI_PLACES=114, PETRI_TRANSITIONS=163} [2024-06-27 22:37:14,600 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 62 predicate places. [2024-06-27 22:37:14,600 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 163 transitions, 2288 flow [2024-06-27 22:37:14,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.0) internal successors, (120), 8 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:37:14,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:14,600 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:37:14,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:37:14,600 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:37:14,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:14,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1630761794, now seen corresponding path program 1 times [2024-06-27 22:37:14,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:14,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702657152] [2024-06-27 22:37:14,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:14,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:15,232 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:37:15,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:15,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702657152] [2024-06-27 22:37:15,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702657152] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:15,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:15,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:37:15,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064694299] [2024-06-27 22:37:15,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:15,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:37:15,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:15,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:37:15,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:37:15,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-06-27 22:37:15,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 163 transitions, 2288 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 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:37:15,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:15,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-06-27 22:37:15,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:15,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_30 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_35 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_69 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_68 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_69)) (= v_~x$r_buff0_thd2~0_34 (ite .cse1 0 v_~x$r_buff0_thd2~0_35)) (= v_~x$r_buff1_thd2~0_29 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_34 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_68 256) 0)))) 0 v_~x$r_buff1_thd2~0_30)) (= v_~x~0_31 (ite .cse4 v_~x$w_buff0~0_33 (ite .cse0 v_~x$w_buff1~0_26 v_~x~0_32))) (= (ite .cse4 0 v_~x$w_buff0_used~0_84) v_~x$w_buff0_used~0_83)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_30, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_35, ~x~0=v_~x~0_32, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_29, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_68, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_34, ~x~0=v_~x~0_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][65], [Black: 128#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (<= 0 (div ~x$r_buff0_thd2~0 256)) (= 2 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0) (<= ~x$r_buff0_thd2~0 1)), Black: 65#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 24#L781true, Black: 70#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0)), 86#true, 109#true, 153#true, Black: 140#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd3~0)), Black: 83#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))), Black: 82#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x~0 1)), Black: 145#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0)), Black: 148#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (or (and (= ~x~0 0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= |#ghost~multithreaded| 0))), 67#true, 22#L742true, 46#L828true, Black: 90#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))), Black: 89#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))), 121#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= 2 ~x~0) (= 2 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)), Black: 96#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), Black: 98#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1)), 77#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= 2 ~x~0) (= 2 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)), 191#(and (= 0 ~x$w_buff1~0) (or (= |#ghost~multithreaded| 0) (and (or (and (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)) (not (= 2 ~x~0))) (= 2 ~x$w_buff0~0) (or (and (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)) (= 2 ~x~0))))), Black: 104#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 105#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1)), 10#L791true, Black: 170#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p0_EAX~0 2))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p0_EAX~0 2)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p0_EAX~0 2)))))), Black: 172#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 162#(and (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 113#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1)), Black: 160#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 112#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0)), P0Thread1of1ForFork0InUse, Black: 166#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p0_EAX~0 2))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p0_EAX~0 2)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p0_EAX~0 2)))))), Black: 168#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), P2Thread1of1ForFork1InUse, Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 174#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p0_EAX~0 2))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p0_EAX~0 2)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p0_EAX~0 2)))))), P1Thread1of1ForFork2InUse, Black: 158#(or (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p0_EAX~0 2))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p0_EAX~0 2)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p0_EAX~0 2))))), Black: 60#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff0_used~0 0))]) [2024-06-27 22:37:15,622 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-06-27 22:37:15,622 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:37:15,622 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:37:15,622 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:37:15,623 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([329] L828-->L834: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_143 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_68 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd0~0_56 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_135 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_144 256) 0)) .cse5))) (and (= v_~x~0_85 (ite .cse0 v_~x$w_buff0~0_69 (ite .cse1 v_~x$w_buff1~0_56 v_~x~0_86))) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_135) v_~x$w_buff1_used~0_134) (= v_~x$r_buff0_thd0~0_67 (ite .cse2 0 v_~x$r_buff0_thd0~0_68)) (= v_~x$r_buff1_thd0~0_55 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_134 256) 0))) (and (not (= (mod v_~x$r_buff0_thd0~0_67 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_56)) (= (ite .cse0 0 v_~x$w_buff0_used~0_144) v_~x$w_buff0_used~0_143)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_69, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_56, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_135, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_56, ~x~0=v_~x~0_86, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_144} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_69, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, ~x$w_buff1~0=v_~x$w_buff1~0_56, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_134, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_55, ~x~0=v_~x~0_85, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_143} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0][79], [Black: 128#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (<= 0 (div ~x$r_buff0_thd2~0 256)) (= 2 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0) (<= ~x$r_buff0_thd2~0 1)), Black: 65#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 135#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= 2 ~x~0) (= 2 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)), Black: 70#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0)), 86#true, 109#true, 153#true, Black: 77#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= 2 ~x~0) (= 2 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)), Black: 140#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd3~0)), Black: 83#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))), Black: 82#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x~0 1)), Black: 145#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0)), Black: 148#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (or (and (= ~x~0 0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= |#ghost~multithreaded| 0))), 67#true, 22#L742true, Black: 90#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))), Black: 89#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))), 8#L774true, Black: 96#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), Black: 98#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1)), 191#(and (= 0 ~x$w_buff1~0) (or (= |#ghost~multithreaded| 0) (and (or (and (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)) (not (= 2 ~x~0))) (= 2 ~x$w_buff0~0) (or (and (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)) (= 2 ~x~0))))), Black: 104#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 105#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1)), 10#L791true, Black: 170#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p0_EAX~0 2))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p0_EAX~0 2)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p0_EAX~0 2)))))), Black: 172#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 162#(and (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 164#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 113#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1)), Black: 160#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 112#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0)), P0Thread1of1ForFork0InUse, Black: 166#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p0_EAX~0 2))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p0_EAX~0 2)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p0_EAX~0 2)))))), Black: 168#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), P2Thread1of1ForFork1InUse, Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 35#L834true, Black: 174#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p0_EAX~0 2))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p0_EAX~0 2)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p0_EAX~0 2)))))), P1Thread1of1ForFork2InUse, Black: 158#(or (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p0_EAX~0 2))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p0_EAX~0 2)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p0_EAX~0 2))))), Black: 121#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= 2 ~x~0) (= 2 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)), Black: 60#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff0_used~0 0))]) [2024-06-27 22:37:15,624 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-06-27 22:37:15,624 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:37:15,624 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:37:15,624 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:37:16,531 INFO L124 PetriNetUnfolderBase]: 4987/8929 cut-off events. [2024-06-27 22:37:16,531 INFO L125 PetriNetUnfolderBase]: For 128138/129337 co-relation queries the response was YES. [2024-06-27 22:37:16,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53144 conditions, 8929 events. 4987/8929 cut-off events. For 128138/129337 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 71327 event pairs, 1615 based on Foata normal form. 759/9427 useless extension candidates. Maximal degree in co-relation 53092. Up to 5394 conditions per place. [2024-06-27 22:37:16,604 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 151 selfloop transitions, 21 changer transitions 0/194 dead transitions. [2024-06-27 22:37:16,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 194 transitions, 2900 flow [2024-06-27 22:37:16,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:37:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:37:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2024-06-27 22:37:16,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.605072463768116 [2024-06-27 22:37:16,606 INFO L175 Difference]: Start difference. First operand has 114 places, 163 transitions, 2288 flow. Second operand 6 states and 167 transitions. [2024-06-27 22:37:16,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 194 transitions, 2900 flow [2024-06-27 22:37:16,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 194 transitions, 2864 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-27 22:37:16,836 INFO L231 Difference]: Finished difference. Result has 110 places, 164 transitions, 2332 flow [2024-06-27 22:37:16,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2264, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2332, PETRI_PLACES=110, PETRI_TRANSITIONS=164} [2024-06-27 22:37:16,836 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 58 predicate places. [2024-06-27 22:37:16,837 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 164 transitions, 2332 flow [2024-06-27 22:37:16,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 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:37:16,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:16,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:16,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:37:16,837 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:37:16,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:16,838 INFO L85 PathProgramCache]: Analyzing trace with hash -420231826, now seen corresponding path program 1 times [2024-06-27 22:37:16,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:16,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844761130] [2024-06-27 22:37:16,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:16,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:17,105 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:37:17,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:17,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844761130] [2024-06-27 22:37:17,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844761130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:17,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:17,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:37:17,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594547028] [2024-06-27 22:37:17,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:17,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:37:17,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:17,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:37:17,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:37:17,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:17,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 164 transitions, 2332 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:37:17,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:17,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:17,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:17,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([352] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_30 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_35 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_69 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_84 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_68 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_69)) (= v_~x$r_buff0_thd2~0_34 (ite .cse1 0 v_~x$r_buff0_thd2~0_35)) (= v_~x$r_buff1_thd2~0_29 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_34 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_68 256) 0)))) 0 v_~x$r_buff1_thd2~0_30)) (= v_~x~0_31 (ite .cse4 v_~x$w_buff0~0_33 (ite .cse0 v_~x$w_buff1~0_26 v_~x~0_32))) (= (ite .cse4 0 v_~x$w_buff0_used~0_84) v_~x$w_buff0_used~0_83)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_30, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_35, ~x~0=v_~x~0_32, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_84} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_29, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_68, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_34, ~x~0=v_~x~0_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][65], [Black: 128#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (<= 0 (div ~x$r_buff0_thd2~0 256)) (= 2 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0) (<= ~x$r_buff0_thd2~0 1)), Black: 65#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), 24#L781true, Black: 70#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0)), 86#true, 109#true, 153#true, Black: 140#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd3~0)), Black: 83#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))), Black: 82#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x~0 1)), Black: 145#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0)), Black: 148#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (or (and (= ~x~0 0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= |#ghost~multithreaded| 0))), 67#true, 22#L742true, 46#L828true, Black: 90#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))), Black: 89#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))), 121#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= 2 ~x~0) (= 2 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)), Black: 96#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), Black: 98#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1)), 77#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= 2 ~x~0) (= 2 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)), 191#(and (= 0 ~x$w_buff1~0) (or (= |#ghost~multithreaded| 0) (and (or (and (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)) (not (= 2 ~x~0))) (= 2 ~x$w_buff0~0) (or (and (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)) (= 2 ~x~0))))), Black: 104#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 105#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1)), Black: 170#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p0_EAX~0 2))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p0_EAX~0 2)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p0_EAX~0 2)))))), 10#L791true, Black: 172#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 162#(and (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 113#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1)), Black: 160#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 112#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0)), P0Thread1of1ForFork0InUse, Black: 166#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p0_EAX~0 2))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p0_EAX~0 2)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p0_EAX~0 2)))))), 195#true, P2Thread1of1ForFork1InUse, Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 174#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p0_EAX~0 2))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p0_EAX~0 2)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p0_EAX~0 2)))))), P1Thread1of1ForFork2InUse, Black: 158#(or (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p0_EAX~0 2))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p0_EAX~0 2)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p0_EAX~0 2))))), Black: 60#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff0_used~0 0))]) [2024-06-27 22:37:17,396 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-27 22:37:17,396 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 22:37:17,396 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 22:37:17,396 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-27 22:37:17,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([329] L828-->L834: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_143 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_68 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd0~0_56 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_135 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_144 256) 0)) .cse5))) (and (= v_~x~0_85 (ite .cse0 v_~x$w_buff0~0_69 (ite .cse1 v_~x$w_buff1~0_56 v_~x~0_86))) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_135) v_~x$w_buff1_used~0_134) (= v_~x$r_buff0_thd0~0_67 (ite .cse2 0 v_~x$r_buff0_thd0~0_68)) (= v_~x$r_buff1_thd0~0_55 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_134 256) 0))) (and (not (= (mod v_~x$r_buff0_thd0~0_67 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_56)) (= (ite .cse0 0 v_~x$w_buff0_used~0_144) v_~x$w_buff0_used~0_143)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_69, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_56, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_135, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_56, ~x~0=v_~x~0_86, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_144} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_69, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, ~x$w_buff1~0=v_~x$w_buff1~0_56, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_134, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_55, ~x~0=v_~x~0_85, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_143} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0][81], [Black: 128#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (<= 0 (div ~x$r_buff0_thd2~0 256)) (= 2 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0) (<= ~x$r_buff0_thd2~0 1)), Black: 65#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 135#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= 2 ~x~0) (= 2 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)), Black: 70#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0)), 86#true, 109#true, 153#true, Black: 77#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= 2 ~x~0) (= 2 ~x$w_buff0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)), Black: 140#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd3~0 0) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd3~0)), Black: 83#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))), Black: 82#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x~0 1)), Black: 145#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0)), Black: 148#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (or (and (= ~x~0 0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= |#ghost~multithreaded| 0))), 67#true, 22#L742true, Black: 90#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))), Black: 89#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))), 8#L774true, Black: 96#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), Black: 98#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1)), 191#(and (= 0 ~x$w_buff1~0) (or (= |#ghost~multithreaded| 0) (and (or (and (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)) (not (= 2 ~x~0))) (= 2 ~x$w_buff0~0) (or (and (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)) (= 2 ~x~0))))), Black: 104#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1)), Black: 105#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1)), Black: 170#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p0_EAX~0 2))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p0_EAX~0 2)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p0_EAX~0 2)))))), 10#L791true, Black: 172#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 162#(and (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0)), Black: 113#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1)), Black: 160#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), P0Thread1of1ForFork0InUse, Black: 166#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p0_EAX~0 2))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p0_EAX~0 2)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p0_EAX~0 2)))))), Black: 112#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0_used~0 1) (= 2 ~x$w_buff0~0) (= 1 ~x$r_buff0_thd2~0)), 195#true, P2Thread1of1ForFork1InUse, Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 174#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p0_EAX~0 2))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p0_EAX~0 2)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p0_EAX~0 2)))))), 35#L834true, P1Thread1of1ForFork2InUse, Black: 158#(or (not (= ~__unbuffered_p2_EAX~0 1)) (and (or (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p0_EAX~0 2))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p0_EAX~0 2)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p0_EAX~0 2))))), Black: 121#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= 2 ~x~0) (= 2 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0)), Black: 60#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$w_buff0_used~0 0))]) [2024-06-27 22:37:17,439 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-06-27 22:37:17,440 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:37:17,440 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:37:17,440 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-06-27 22:37:18,120 INFO L124 PetriNetUnfolderBase]: 5005/8827 cut-off events. [2024-06-27 22:37:18,120 INFO L125 PetriNetUnfolderBase]: For 132164/133374 co-relation queries the response was YES. [2024-06-27 22:37:18,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52651 conditions, 8827 events. 5005/8827 cut-off events. For 132164/133374 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 68854 event pairs, 1562 based on Foata normal form. 547/9060 useless extension candidates. Maximal degree in co-relation 52600. Up to 5553 conditions per place. [2024-06-27 22:37:18,200 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 138 selfloop transitions, 41 changer transitions 0/202 dead transitions. [2024-06-27 22:37:18,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 202 transitions, 3022 flow [2024-06-27 22:37:18,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:37:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:37:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-06-27 22:37:18,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6869565217391305 [2024-06-27 22:37:18,201 INFO L175 Difference]: Start difference. First operand has 110 places, 164 transitions, 2332 flow. Second operand 5 states and 158 transitions. [2024-06-27 22:37:18,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 202 transitions, 3022 flow [2024-06-27 22:37:18,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 202 transitions, 2992 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 22:37:18,440 INFO L231 Difference]: Finished difference. Result has 110 places, 172 transitions, 2582 flow [2024-06-27 22:37:18,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2302, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2582, PETRI_PLACES=110, PETRI_TRANSITIONS=172} [2024-06-27 22:37:18,441 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 58 predicate places. [2024-06-27 22:37:18,441 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 172 transitions, 2582 flow [2024-06-27 22:37:18,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:37:18,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:18,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:18,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:37:18,441 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:37:18,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:18,442 INFO L85 PathProgramCache]: Analyzing trace with hash -520976458, now seen corresponding path program 2 times [2024-06-27 22:37:18,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:18,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135645357] [2024-06-27 22:37:18,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:18,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:18,694 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:37:18,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:18,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135645357] [2024-06-27 22:37:18,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135645357] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:18,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:18,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:37:18,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648942779] [2024-06-27 22:37:18,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:18,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:37:18,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:18,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:37:18,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:37:18,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:37:18,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 172 transitions, 2582 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states 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:37:18,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:18,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:37:18,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:19,969 INFO L124 PetriNetUnfolderBase]: 5644/9956 cut-off events. [2024-06-27 22:37:19,969 INFO L125 PetriNetUnfolderBase]: For 152633/153794 co-relation queries the response was YES. [2024-06-27 22:37:20,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59703 conditions, 9956 events. 5644/9956 cut-off events. For 152633/153794 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 78800 event pairs, 1542 based on Foata normal form. 595/10223 useless extension candidates. Maximal degree in co-relation 59652. Up to 6251 conditions per place. [2024-06-27 22:37:20,039 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 155 selfloop transitions, 57 changer transitions 0/233 dead transitions. [2024-06-27 22:37:20,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 233 transitions, 3565 flow [2024-06-27 22:37:20,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:37:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:37:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 221 transitions. [2024-06-27 22:37:20,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6005434782608695 [2024-06-27 22:37:20,041 INFO L175 Difference]: Start difference. First operand has 110 places, 172 transitions, 2582 flow. Second operand 8 states and 221 transitions. [2024-06-27 22:37:20,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 233 transitions, 3565 flow [2024-06-27 22:37:20,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 233 transitions, 3435 flow, removed 27 selfloop flow, removed 3 redundant places. [2024-06-27 22:37:20,343 INFO L231 Difference]: Finished difference. Result has 117 places, 190 transitions, 2966 flow [2024-06-27 22:37:20,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2468, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2966, PETRI_PLACES=117, PETRI_TRANSITIONS=190} [2024-06-27 22:37:20,343 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 65 predicate places. [2024-06-27 22:37:20,343 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 190 transitions, 2966 flow [2024-06-27 22:37:20,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states 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:37:20,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:20,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:20,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:37:20,344 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:37:20,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:20,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1293440914, now seen corresponding path program 3 times [2024-06-27 22:37:20,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:20,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724574778] [2024-06-27 22:37:20,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:20,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:20,611 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:37:20,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:20,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724574778] [2024-06-27 22:37:20,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724574778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:20,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:20,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:37:20,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662369931] [2024-06-27 22:37:20,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:20,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:37:20,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:20,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:37:20,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:37:20,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:20,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 190 transitions, 2966 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:37:20,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:20,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:20,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:21,846 INFO L124 PetriNetUnfolderBase]: 5342/9533 cut-off events. [2024-06-27 22:37:21,846 INFO L125 PetriNetUnfolderBase]: For 156437/157399 co-relation queries the response was YES. [2024-06-27 22:37:21,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58982 conditions, 9533 events. 5342/9533 cut-off events. For 156437/157399 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 76542 event pairs, 1379 based on Foata normal form. 757/9996 useless extension candidates. Maximal degree in co-relation 58927. Up to 5056 conditions per place. [2024-06-27 22:37:21,943 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 121 selfloop transitions, 92 changer transitions 0/236 dead transitions. [2024-06-27 22:37:21,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 236 transitions, 3974 flow [2024-06-27 22:37:21,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:37:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:37:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-06-27 22:37:21,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6869565217391305 [2024-06-27 22:37:21,945 INFO L175 Difference]: Start difference. First operand has 117 places, 190 transitions, 2966 flow. Second operand 5 states and 158 transitions. [2024-06-27 22:37:21,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 236 transitions, 3974 flow [2024-06-27 22:37:22,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 236 transitions, 3894 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-27 22:37:22,216 INFO L231 Difference]: Finished difference. Result has 121 places, 207 transitions, 3563 flow [2024-06-27 22:37:22,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2886, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3563, PETRI_PLACES=121, PETRI_TRANSITIONS=207} [2024-06-27 22:37:22,217 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 69 predicate places. [2024-06-27 22:37:22,217 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 207 transitions, 3563 flow [2024-06-27 22:37:22,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:37:22,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:22,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:22,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:37:22,218 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:22,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:22,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1357374968, now seen corresponding path program 1 times [2024-06-27 22:37:22,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:22,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136828308] [2024-06-27 22:37:22,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:22,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:22,441 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:37:22,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:22,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136828308] [2024-06-27 22:37:22,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136828308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:22,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:22,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:37:22,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878145030] [2024-06-27 22:37:22,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:22,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:37:22,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:22,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:37:22,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:37:22,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 22:37:22,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 207 transitions, 3563 flow. Second operand has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:37:22,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:22,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 22:37:22,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:24,844 INFO L124 PetriNetUnfolderBase]: 10768/17534 cut-off events. [2024-06-27 22:37:24,844 INFO L125 PetriNetUnfolderBase]: For 293366/294253 co-relation queries the response was YES. [2024-06-27 22:37:24,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112762 conditions, 17534 events. 10768/17534 cut-off events. For 293366/294253 co-relation queries the response was YES. Maximal size of possible extension queue 1167. Compared 141461 event pairs, 978 based on Foata normal form. 1434/18890 useless extension candidates. Maximal degree in co-relation 112704. Up to 7597 conditions per place. [2024-06-27 22:37:25,002 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 219 selfloop transitions, 34 changer transitions 390/663 dead transitions. [2024-06-27 22:37:25,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 663 transitions, 13295 flow [2024-06-27 22:37:25,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:37:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:37:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 321 transitions. [2024-06-27 22:37:25,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984472049689441 [2024-06-27 22:37:25,004 INFO L175 Difference]: Start difference. First operand has 121 places, 207 transitions, 3563 flow. Second operand 14 states and 321 transitions. [2024-06-27 22:37:25,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 663 transitions, 13295 flow [2024-06-27 22:37:25,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 663 transitions, 12833 flow, removed 210 selfloop flow, removed 1 redundant places. [2024-06-27 22:37:25,586 INFO L231 Difference]: Finished difference. Result has 143 places, 173 transitions, 2957 flow [2024-06-27 22:37:25,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3424, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2957, PETRI_PLACES=143, PETRI_TRANSITIONS=173} [2024-06-27 22:37:25,586 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 91 predicate places. [2024-06-27 22:37:25,587 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 173 transitions, 2957 flow [2024-06-27 22:37:25,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:37:25,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:25,587 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:37:25,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:37:25,587 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:37:25,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:25,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1405911133, now seen corresponding path program 1 times [2024-06-27 22:37:25,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:25,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961156418] [2024-06-27 22:37:25,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:25,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:26,077 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:37:26,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:26,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961156418] [2024-06-27 22:37:26,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961156418] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:26,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:26,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:37:26,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642383776] [2024-06-27 22:37:26,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:26,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:37:26,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:26,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:37:26,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:37:26,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:37:26,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 173 transitions, 2957 flow. Second operand has 9 states, 9 states have (on average 18.666666666666668) internal successors, (168), 9 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:37:26,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:26,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:37:26,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:27,869 INFO L124 PetriNetUnfolderBase]: 6671/12108 cut-off events. [2024-06-27 22:37:27,869 INFO L125 PetriNetUnfolderBase]: For 237530/238259 co-relation queries the response was YES. [2024-06-27 22:37:27,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80211 conditions, 12108 events. 6671/12108 cut-off events. For 237530/238259 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 103603 event pairs, 2131 based on Foata normal form. 401/12285 useless extension candidates. Maximal degree in co-relation 80141. Up to 8047 conditions per place. [2024-06-27 22:37:28,008 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 151 selfloop transitions, 76 changer transitions 7/258 dead transitions. [2024-06-27 22:37:28,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 258 transitions, 4741 flow [2024-06-27 22:37:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:37:28,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:37:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2024-06-27 22:37:28,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5579710144927537 [2024-06-27 22:37:28,009 INFO L175 Difference]: Start difference. First operand has 143 places, 173 transitions, 2957 flow. Second operand 9 states and 231 transitions. [2024-06-27 22:37:28,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 258 transitions, 4741 flow [2024-06-27 22:37:28,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 258 transitions, 4460 flow, removed 95 selfloop flow, removed 13 redundant places. [2024-06-27 22:37:28,667 INFO L231 Difference]: Finished difference. Result has 133 places, 209 transitions, 3767 flow [2024-06-27 22:37:28,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2737, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3767, PETRI_PLACES=133, PETRI_TRANSITIONS=209} [2024-06-27 22:37:28,667 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 81 predicate places. [2024-06-27 22:37:28,667 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 209 transitions, 3767 flow [2024-06-27 22:37:28,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.666666666666668) internal successors, (168), 9 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:37:28,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:28,668 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:37:28,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:37:28,668 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:28,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:28,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1968936065, now seen corresponding path program 2 times [2024-06-27 22:37:28,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:28,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777065850] [2024-06-27 22:37:28,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:28,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:29,035 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:37:29,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:29,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777065850] [2024-06-27 22:37:29,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777065850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:29,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:29,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:37:29,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249416565] [2024-06-27 22:37:29,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:29,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:37:29,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:29,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:37:29,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:37:29,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-06-27 22:37:29,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 209 transitions, 3767 flow. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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:37:29,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:29,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-06-27 22:37:29,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:30,523 INFO L124 PetriNetUnfolderBase]: 5828/10781 cut-off events. [2024-06-27 22:37:30,523 INFO L125 PetriNetUnfolderBase]: For 201331/201964 co-relation queries the response was YES. [2024-06-27 22:37:30,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69071 conditions, 10781 events. 5828/10781 cut-off events. For 201331/201964 co-relation queries the response was YES. Maximal size of possible extension queue 836. Compared 93400 event pairs, 2032 based on Foata normal form. 372/10920 useless extension candidates. Maximal degree in co-relation 69008. Up to 6992 conditions per place. [2024-06-27 22:37:30,611 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 135 selfloop transitions, 74 changer transitions 5/240 dead transitions. [2024-06-27 22:37:30,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 240 transitions, 4465 flow [2024-06-27 22:37:30,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:37:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:37:30,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2024-06-27 22:37:30,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6123188405797102 [2024-06-27 22:37:30,612 INFO L175 Difference]: Start difference. First operand has 133 places, 209 transitions, 3767 flow. Second operand 6 states and 169 transitions. [2024-06-27 22:37:30,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 240 transitions, 4465 flow [2024-06-27 22:37:30,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 240 transitions, 4439 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-27 22:37:30,908 INFO L231 Difference]: Finished difference. Result has 136 places, 212 transitions, 4035 flow [2024-06-27 22:37:30,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3741, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4035, PETRI_PLACES=136, PETRI_TRANSITIONS=212} [2024-06-27 22:37:30,909 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 84 predicate places. [2024-06-27 22:37:30,909 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 212 transitions, 4035 flow [2024-06-27 22:37:30,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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:37:30,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:30,911 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:37:30,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:37:30,911 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:30,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:30,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1730814273, now seen corresponding path program 3 times [2024-06-27 22:37:30,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:30,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817222076] [2024-06-27 22:37:30,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:30,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:31,312 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:37:31,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:31,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817222076] [2024-06-27 22:37:31,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817222076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:31,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:31,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:37:31,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690049976] [2024-06-27 22:37:31,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:31,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:37:31,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:31,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:37:31,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:37:31,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:37:31,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 212 transitions, 4035 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 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:37:31,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:31,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:37:31,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:33,036 INFO L124 PetriNetUnfolderBase]: 6571/11990 cut-off events. [2024-06-27 22:37:33,036 INFO L125 PetriNetUnfolderBase]: For 217392/218135 co-relation queries the response was YES. [2024-06-27 22:37:33,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76727 conditions, 11990 events. 6571/11990 cut-off events. For 217392/218135 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 103022 event pairs, 2186 based on Foata normal form. 353/12108 useless extension candidates. Maximal degree in co-relation 76662. Up to 8270 conditions per place. [2024-06-27 22:37:33,140 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 146 selfloop transitions, 65 changer transitions 8/243 dead transitions. [2024-06-27 22:37:33,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 243 transitions, 4659 flow [2024-06-27 22:37:33,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:37:33,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:37:33,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2024-06-27 22:37:33,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5745341614906833 [2024-06-27 22:37:33,142 INFO L175 Difference]: Start difference. First operand has 136 places, 212 transitions, 4035 flow. Second operand 7 states and 185 transitions. [2024-06-27 22:37:33,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 243 transitions, 4659 flow [2024-06-27 22:37:33,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 243 transitions, 4506 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-06-27 22:37:33,771 INFO L231 Difference]: Finished difference. Result has 139 places, 208 transitions, 3987 flow [2024-06-27 22:37:33,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3882, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3987, PETRI_PLACES=139, PETRI_TRANSITIONS=208} [2024-06-27 22:37:33,771 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 87 predicate places. [2024-06-27 22:37:33,771 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 208 transitions, 3987 flow [2024-06-27 22:37:33,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 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:37:33,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:33,772 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:37:33,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:37:33,772 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:33,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:33,773 INFO L85 PathProgramCache]: Analyzing trace with hash -77051647, now seen corresponding path program 4 times [2024-06-27 22:37:33,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:33,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138670232] [2024-06-27 22:37:33,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:33,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:34,176 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:37:34,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:34,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138670232] [2024-06-27 22:37:34,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138670232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:34,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:34,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:37:34,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354890102] [2024-06-27 22:37:34,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:34,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:37:34,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:34,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:37:34,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:37:34,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:34,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 208 transitions, 3987 flow. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:37:34,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:34,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:34,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:35,796 INFO L124 PetriNetUnfolderBase]: 5736/10661 cut-off events. [2024-06-27 22:37:35,796 INFO L125 PetriNetUnfolderBase]: For 207632/208208 co-relation queries the response was YES. [2024-06-27 22:37:35,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69403 conditions, 10661 events. 5736/10661 cut-off events. For 207632/208208 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 92910 event pairs, 2115 based on Foata normal form. 309/10755 useless extension candidates. Maximal degree in co-relation 69338. Up to 7067 conditions per place. [2024-06-27 22:37:35,874 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 156 selfloop transitions, 52 changer transitions 2/237 dead transitions. [2024-06-27 22:37:35,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 237 transitions, 4629 flow [2024-06-27 22:37:35,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:37:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:37:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-06-27 22:37:35,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6695652173913044 [2024-06-27 22:37:35,876 INFO L175 Difference]: Start difference. First operand has 139 places, 208 transitions, 3987 flow. Second operand 5 states and 154 transitions. [2024-06-27 22:37:35,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 237 transitions, 4629 flow [2024-06-27 22:37:36,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 237 transitions, 4480 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-27 22:37:36,167 INFO L231 Difference]: Finished difference. Result has 140 places, 212 transitions, 4089 flow [2024-06-27 22:37:36,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3838, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4089, PETRI_PLACES=140, PETRI_TRANSITIONS=212} [2024-06-27 22:37:36,168 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 88 predicate places. [2024-06-27 22:37:36,168 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 212 transitions, 4089 flow [2024-06-27 22:37:36,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:37:36,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:36,168 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:37:36,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:37:36,169 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:36,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:36,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2056223133, now seen corresponding path program 5 times [2024-06-27 22:37:36,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:36,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469443782] [2024-06-27 22:37:36,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:36,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:36,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:36,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469443782] [2024-06-27 22:37:36,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469443782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:36,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:36,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:37:36,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854283437] [2024-06-27 22:37:36,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:36,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:37:36,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:36,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:37:36,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:37:36,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-06-27 22:37:36,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 212 transitions, 4089 flow. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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:37:36,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:36,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-06-27 22:37:36,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:37,823 INFO L124 PetriNetUnfolderBase]: 5685/10565 cut-off events. [2024-06-27 22:37:37,824 INFO L125 PetriNetUnfolderBase]: For 208813/209376 co-relation queries the response was YES. [2024-06-27 22:37:37,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69688 conditions, 10565 events. 5685/10565 cut-off events. For 208813/209376 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 91859 event pairs, 2056 based on Foata normal form. 300/10647 useless extension candidates. Maximal degree in co-relation 69622. Up to 7251 conditions per place. [2024-06-27 22:37:38,062 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 158 selfloop transitions, 43 changer transitions 12/239 dead transitions. [2024-06-27 22:37:38,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 239 transitions, 4669 flow [2024-06-27 22:37:38,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:37:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:37:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-06-27 22:37:38,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2024-06-27 22:37:38,064 INFO L175 Difference]: Start difference. First operand has 140 places, 212 transitions, 4089 flow. Second operand 6 states and 168 transitions. [2024-06-27 22:37:38,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 239 transitions, 4669 flow [2024-06-27 22:37:38,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 239 transitions, 4558 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-27 22:37:38,366 INFO L231 Difference]: Finished difference. Result has 143 places, 206 transitions, 3982 flow [2024-06-27 22:37:38,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3978, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3982, PETRI_PLACES=143, PETRI_TRANSITIONS=206} [2024-06-27 22:37:38,366 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 91 predicate places. [2024-06-27 22:37:38,367 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 206 transitions, 3982 flow [2024-06-27 22:37:38,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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:37:38,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:38,367 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:37:38,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:37:38,367 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:38,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:38,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1729207555, now seen corresponding path program 6 times [2024-06-27 22:37:38,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:38,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320528018] [2024-06-27 22:37:38,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:38,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:38,736 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:37:38,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:38,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320528018] [2024-06-27 22:37:38,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320528018] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:38,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:38,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:37:38,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798745099] [2024-06-27 22:37:38,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:38,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:37:38,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:38,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:37:38,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:37:38,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:38,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 206 transitions, 3982 flow. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:37:38,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:38,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:38,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:40,109 INFO L124 PetriNetUnfolderBase]: 5598/10387 cut-off events. [2024-06-27 22:37:40,109 INFO L125 PetriNetUnfolderBase]: For 211473/212113 co-relation queries the response was YES. [2024-06-27 22:37:40,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68510 conditions, 10387 events. 5598/10387 cut-off events. For 211473/212113 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 89842 event pairs, 1919 based on Foata normal form. 389/10510 useless extension candidates. Maximal degree in co-relation 68443. Up to 5630 conditions per place. [2024-06-27 22:37:40,181 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 95 selfloop transitions, 110 changer transitions 4/236 dead transitions. [2024-06-27 22:37:40,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 236 transitions, 4702 flow [2024-06-27 22:37:40,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:37:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:37:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-06-27 22:37:40,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6695652173913044 [2024-06-27 22:37:40,183 INFO L175 Difference]: Start difference. First operand has 143 places, 206 transitions, 3982 flow. Second operand 5 states and 154 transitions. [2024-06-27 22:37:40,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 236 transitions, 4702 flow [2024-06-27 22:37:40,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 236 transitions, 4527 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-27 22:37:40,433 INFO L231 Difference]: Finished difference. Result has 139 places, 211 transitions, 4207 flow [2024-06-27 22:37:40,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3807, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4207, PETRI_PLACES=139, PETRI_TRANSITIONS=211} [2024-06-27 22:37:40,434 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 87 predicate places. [2024-06-27 22:37:40,434 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 211 transitions, 4207 flow [2024-06-27 22:37:40,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:37:40,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:40,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:40,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:37:40,435 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:40,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:40,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2111215099, now seen corresponding path program 1 times [2024-06-27 22:37:40,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:40,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935906713] [2024-06-27 22:37:40,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:40,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:40,805 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:37:40,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:40,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935906713] [2024-06-27 22:37:40,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935906713] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:40,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:40,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:37:40,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419917134] [2024-06-27 22:37:40,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:40,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:37:40,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:40,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:37:40,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:37:40,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:40,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 211 transitions, 4207 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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:37:40,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:40,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:40,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:42,178 INFO L124 PetriNetUnfolderBase]: 5946/11134 cut-off events. [2024-06-27 22:37:42,178 INFO L125 PetriNetUnfolderBase]: For 237265/237888 co-relation queries the response was YES. [2024-06-27 22:37:42,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72808 conditions, 11134 events. 5946/11134 cut-off events. For 237265/237888 co-relation queries the response was YES. Maximal size of possible extension queue 843. Compared 98782 event pairs, 1691 based on Foata normal form. 288/11150 useless extension candidates. Maximal degree in co-relation 72745. Up to 4450 conditions per place. [2024-06-27 22:37:42,278 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 110 selfloop transitions, 99 changer transitions 8/244 dead transitions. [2024-06-27 22:37:42,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 244 transitions, 4949 flow [2024-06-27 22:37:42,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:37:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:37:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-06-27 22:37:42,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6782608695652174 [2024-06-27 22:37:42,279 INFO L175 Difference]: Start difference. First operand has 139 places, 211 transitions, 4207 flow. Second operand 5 states and 156 transitions. [2024-06-27 22:37:42,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 244 transitions, 4949 flow [2024-06-27 22:37:42,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 244 transitions, 4863 flow, removed 36 selfloop flow, removed 1 redundant places. [2024-06-27 22:37:42,710 INFO L231 Difference]: Finished difference. Result has 143 places, 207 transitions, 4252 flow [2024-06-27 22:37:42,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4121, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4252, PETRI_PLACES=143, PETRI_TRANSITIONS=207} [2024-06-27 22:37:42,711 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 91 predicate places. [2024-06-27 22:37:42,711 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 207 transitions, 4252 flow [2024-06-27 22:37:42,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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:37:42,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:42,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:42,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:37:42,712 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:42,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:42,712 INFO L85 PathProgramCache]: Analyzing trace with hash 798146511, now seen corresponding path program 2 times [2024-06-27 22:37:42,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:42,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800786340] [2024-06-27 22:37:42,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:42,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:43,083 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:37:43,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:43,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800786340] [2024-06-27 22:37:43,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800786340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:43,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:43,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:37:43,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121753465] [2024-06-27 22:37:43,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:43,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:37:43,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:43,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:37:43,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:37:43,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:43,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 207 transitions, 4252 flow. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:37:43,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:43,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:43,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:44,636 INFO L124 PetriNetUnfolderBase]: 6018/11438 cut-off events. [2024-06-27 22:37:44,636 INFO L125 PetriNetUnfolderBase]: For 244282/244800 co-relation queries the response was YES. [2024-06-27 22:37:44,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73893 conditions, 11438 events. 6018/11438 cut-off events. For 244282/244800 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 103966 event pairs, 1596 based on Foata normal form. 307/11544 useless extension candidates. Maximal degree in co-relation 73828. Up to 4421 conditions per place. [2024-06-27 22:37:44,741 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 125 selfloop transitions, 98 changer transitions 3/253 dead transitions. [2024-06-27 22:37:44,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 253 transitions, 5178 flow [2024-06-27 22:37:44,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:37:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:37:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions. [2024-06-27 22:37:44,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6811594202898551 [2024-06-27 22:37:44,742 INFO L175 Difference]: Start difference. First operand has 143 places, 207 transitions, 4252 flow. Second operand 6 states and 188 transitions. [2024-06-27 22:37:44,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 253 transitions, 5178 flow [2024-06-27 22:37:45,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 253 transitions, 5002 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 22:37:45,169 INFO L231 Difference]: Finished difference. Result has 146 places, 206 transitions, 4257 flow [2024-06-27 22:37:45,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4076, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4257, PETRI_PLACES=146, PETRI_TRANSITIONS=206} [2024-06-27 22:37:45,175 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 94 predicate places. [2024-06-27 22:37:45,175 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 206 transitions, 4257 flow [2024-06-27 22:37:45,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:37:45,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:45,175 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:37:45,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:37:45,175 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:45,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash 965975114, now seen corresponding path program 1 times [2024-06-27 22:37:45,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:45,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614078188] [2024-06-27 22:37:45,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:45,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:45,784 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:37:45,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:45,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614078188] [2024-06-27 22:37:45,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614078188] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:45,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:45,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:37:45,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910791857] [2024-06-27 22:37:45,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:45,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:37:45,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:45,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:37:45,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:37:45,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:45,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 206 transitions, 4257 flow. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 0 states have call successors, (0), 0 states 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:37:45,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:45,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:45,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:47,220 INFO L124 PetriNetUnfolderBase]: 6007/11426 cut-off events. [2024-06-27 22:37:47,221 INFO L125 PetriNetUnfolderBase]: For 245961/246664 co-relation queries the response was YES. [2024-06-27 22:37:47,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74048 conditions, 11426 events. 6007/11426 cut-off events. For 245961/246664 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 103348 event pairs, 1564 based on Foata normal form. 284/11458 useless extension candidates. Maximal degree in co-relation 73982. Up to 4410 conditions per place. [2024-06-27 22:37:47,322 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 97 selfloop transitions, 101 changer transitions 11/236 dead transitions. [2024-06-27 22:37:47,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 236 transitions, 4913 flow [2024-06-27 22:37:47,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:37:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:37:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-06-27 22:37:47,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6739130434782609 [2024-06-27 22:37:47,323 INFO L175 Difference]: Start difference. First operand has 146 places, 206 transitions, 4257 flow. Second operand 5 states and 155 transitions. [2024-06-27 22:37:47,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 236 transitions, 4913 flow [2024-06-27 22:37:47,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 236 transitions, 4607 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:37:47,709 INFO L231 Difference]: Finished difference. Result has 139 places, 196 transitions, 3971 flow [2024-06-27 22:37:47,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3909, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3971, PETRI_PLACES=139, PETRI_TRANSITIONS=196} [2024-06-27 22:37:47,710 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 87 predicate places. [2024-06-27 22:37:47,710 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 196 transitions, 3971 flow [2024-06-27 22:37:47,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 0 states have call successors, (0), 0 states 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:37:47,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:47,711 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:37:47,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:37:47,711 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:47,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:47,711 INFO L85 PathProgramCache]: Analyzing trace with hash -322843371, now seen corresponding path program 1 times [2024-06-27 22:37:47,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:47,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423490808] [2024-06-27 22:37:47,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:47,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:47,797 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:37:47,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:47,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423490808] [2024-06-27 22:37:47,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423490808] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:47,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:47,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:37:47,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747585939] [2024-06-27 22:37:47,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:47,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:37:47,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:47,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:37:47,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:37:47,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 46 [2024-06-27 22:37:47,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 196 transitions, 3971 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:37:47,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:47,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 46 [2024-06-27 22:37:47,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:49,168 INFO L124 PetriNetUnfolderBase]: 6547/11924 cut-off events. [2024-06-27 22:37:49,168 INFO L125 PetriNetUnfolderBase]: For 251060/252011 co-relation queries the response was YES. [2024-06-27 22:37:49,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77866 conditions, 11924 events. 6547/11924 cut-off events. For 251060/252011 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 104256 event pairs, 2403 based on Foata normal form. 625/12205 useless extension candidates. Maximal degree in co-relation 77806. Up to 7602 conditions per place. [2024-06-27 22:37:49,271 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 193 selfloop transitions, 5 changer transitions 29/262 dead transitions. [2024-06-27 22:37:49,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 262 transitions, 5465 flow [2024-06-27 22:37:49,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:37:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:37:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 232 transitions. [2024-06-27 22:37:49,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6304347826086957 [2024-06-27 22:37:49,273 INFO L175 Difference]: Start difference. First operand has 139 places, 196 transitions, 3971 flow. Second operand 8 states and 232 transitions. [2024-06-27 22:37:49,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 262 transitions, 5465 flow [2024-06-27 22:37:49,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 262 transitions, 5233 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 22:37:49,550 INFO L231 Difference]: Finished difference. Result has 147 places, 196 transitions, 3797 flow [2024-06-27 22:37:49,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3769, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3797, PETRI_PLACES=147, PETRI_TRANSITIONS=196} [2024-06-27 22:37:49,550 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 95 predicate places. [2024-06-27 22:37:49,550 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 196 transitions, 3797 flow [2024-06-27 22:37:49,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:37:49,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:49,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:49,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:37:49,551 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:49,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1224012260, now seen corresponding path program 1 times [2024-06-27 22:37:49,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:49,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31321227] [2024-06-27 22:37:49,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:49,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:49,730 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:37:49,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:49,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31321227] [2024-06-27 22:37:49,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31321227] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:49,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:49,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:37:49,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5310994] [2024-06-27 22:37:49,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:49,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:37:49,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:49,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:37:49,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:37:49,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:37:49,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 196 transitions, 3797 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:37:49,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:49,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:37:49,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:51,406 INFO L124 PetriNetUnfolderBase]: 6981/12389 cut-off events. [2024-06-27 22:37:51,406 INFO L125 PetriNetUnfolderBase]: For 212034/212547 co-relation queries the response was YES. [2024-06-27 22:37:51,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78152 conditions, 12389 events. 6981/12389 cut-off events. For 212034/212547 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 105426 event pairs, 2147 based on Foata normal form. 559/12875 useless extension candidates. Maximal degree in co-relation 78087. Up to 5912 conditions per place. [2024-06-27 22:37:51,486 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 198 selfloop transitions, 16 changer transitions 82/320 dead transitions. [2024-06-27 22:37:51,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 320 transitions, 6508 flow [2024-06-27 22:37:51,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:37:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:37:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 245 transitions. [2024-06-27 22:37:51,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5917874396135265 [2024-06-27 22:37:51,488 INFO L175 Difference]: Start difference. First operand has 147 places, 196 transitions, 3797 flow. Second operand 9 states and 245 transitions. [2024-06-27 22:37:51,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 320 transitions, 6508 flow [2024-06-27 22:37:51,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 320 transitions, 6475 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 22:37:51,869 INFO L231 Difference]: Finished difference. Result has 152 places, 187 transitions, 3647 flow [2024-06-27 22:37:51,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3780, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3647, PETRI_PLACES=152, PETRI_TRANSITIONS=187} [2024-06-27 22:37:51,869 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 100 predicate places. [2024-06-27 22:37:51,869 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 187 transitions, 3647 flow [2024-06-27 22:37:51,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:37:51,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:51,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:51,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:37:51,870 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:51,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:51,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1124169887, now seen corresponding path program 1 times [2024-06-27 22:37:51,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:51,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472418606] [2024-06-27 22:37:51,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:51,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:51,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:51,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472418606] [2024-06-27 22:37:51,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472418606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:51,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:51,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:37:51,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808178695] [2024-06-27 22:37:51,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:51,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:37:51,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:51,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:37:51,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:37:51,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-06-27 22:37:51,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 187 transitions, 3647 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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:37:51,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:51,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-06-27 22:37:51,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:53,521 INFO L124 PetriNetUnfolderBase]: 7175/13133 cut-off events. [2024-06-27 22:37:53,522 INFO L125 PetriNetUnfolderBase]: For 242395/243007 co-relation queries the response was YES. [2024-06-27 22:37:53,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86387 conditions, 13133 events. 7175/13133 cut-off events. For 242395/243007 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 117120 event pairs, 1785 based on Foata normal form. 643/13645 useless extension candidates. Maximal degree in co-relation 86319. Up to 5222 conditions per place. [2024-06-27 22:37:53,626 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 96 selfloop transitions, 5 changer transitions 203/325 dead transitions. [2024-06-27 22:37:53,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 325 transitions, 6718 flow [2024-06-27 22:37:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:37:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:37:53,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2024-06-27 22:37:53,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6149068322981367 [2024-06-27 22:37:53,628 INFO L175 Difference]: Start difference. First operand has 152 places, 187 transitions, 3647 flow. Second operand 7 states and 198 transitions. [2024-06-27 22:37:53,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 325 transitions, 6718 flow [2024-06-27 22:37:54,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 325 transitions, 6536 flow, removed 69 selfloop flow, removed 5 redundant places. [2024-06-27 22:37:54,082 INFO L231 Difference]: Finished difference. Result has 152 places, 87 transitions, 1300 flow [2024-06-27 22:37:54,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3535, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1300, PETRI_PLACES=152, PETRI_TRANSITIONS=87} [2024-06-27 22:37:54,082 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 100 predicate places. [2024-06-27 22:37:54,083 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 87 transitions, 1300 flow [2024-06-27 22:37:54,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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:37:54,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:54,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:54,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:37:54,083 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:54,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1973653109, now seen corresponding path program 2 times [2024-06-27 22:37:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:54,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928489628] [2024-06-27 22:37:54,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:54,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:54,141 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:37:54,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:54,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928489628] [2024-06-27 22:37:54,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928489628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:54,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:54,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:37:54,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256598579] [2024-06-27 22:37:54,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:54,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:37:54,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:54,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:37:54,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:37:54,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:54,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 87 transitions, 1300 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:37:54,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:54,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:54,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:54,845 INFO L124 PetriNetUnfolderBase]: 4368/7565 cut-off events. [2024-06-27 22:37:54,845 INFO L125 PetriNetUnfolderBase]: For 119051/119562 co-relation queries the response was YES. [2024-06-27 22:37:54,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40596 conditions, 7565 events. 4368/7565 cut-off events. For 119051/119562 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 52347 event pairs, 702 based on Foata normal form. 436/7841 useless extension candidates. Maximal degree in co-relation 40548. Up to 4010 conditions per place. [2024-06-27 22:37:54,907 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 76 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2024-06-27 22:37:54,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 100 transitions, 1404 flow [2024-06-27 22:37:54,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:37:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:37:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2024-06-27 22:37:54,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6630434782608695 [2024-06-27 22:37:54,908 INFO L175 Difference]: Start difference. First operand has 152 places, 87 transitions, 1300 flow. Second operand 4 states and 122 transitions. [2024-06-27 22:37:54,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 100 transitions, 1404 flow [2024-06-27 22:37:55,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 100 transitions, 1125 flow, removed 71 selfloop flow, removed 42 redundant places. [2024-06-27 22:37:55,014 INFO L231 Difference]: Finished difference. Result has 94 places, 70 transitions, 669 flow [2024-06-27 22:37:55,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=669, PETRI_PLACES=94, PETRI_TRANSITIONS=70} [2024-06-27 22:37:55,014 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 42 predicate places. [2024-06-27 22:37:55,015 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 70 transitions, 669 flow [2024-06-27 22:37:55,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:37:55,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:55,015 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:37:55,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:37:55,015 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:55,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:55,016 INFO L85 PathProgramCache]: Analyzing trace with hash -536421166, now seen corresponding path program 1 times [2024-06-27 22:37:55,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:55,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077110708] [2024-06-27 22:37:55,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:55,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:55,101 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:37:55,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:55,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077110708] [2024-06-27 22:37:55,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077110708] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:55,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:55,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:37:55,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005519354] [2024-06-27 22:37:55,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:55,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:37:55,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:55,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:37:55,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:37:55,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-06-27 22:37:55,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 70 transitions, 669 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:37:55,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:55,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-06-27 22:37:55,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:55,907 INFO L124 PetriNetUnfolderBase]: 5088/9083 cut-off events. [2024-06-27 22:37:55,908 INFO L125 PetriNetUnfolderBase]: For 55207/55652 co-relation queries the response was YES. [2024-06-27 22:37:55,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40967 conditions, 9083 events. 5088/9083 cut-off events. For 55207/55652 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 74104 event pairs, 2222 based on Foata normal form. 358/8948 useless extension candidates. Maximal degree in co-relation 40938. Up to 3238 conditions per place. [2024-06-27 22:37:55,979 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 53 selfloop transitions, 4 changer transitions 66/143 dead transitions. [2024-06-27 22:37:55,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 143 transitions, 1716 flow [2024-06-27 22:37:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:37:55,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:37:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 220 transitions. [2024-06-27 22:37:55,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5978260869565217 [2024-06-27 22:37:55,981 INFO L175 Difference]: Start difference. First operand has 94 places, 70 transitions, 669 flow. Second operand 8 states and 220 transitions. [2024-06-27 22:37:55,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 143 transitions, 1716 flow [2024-06-27 22:37:56,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 143 transitions, 1690 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:37:56,006 INFO L231 Difference]: Finished difference. Result has 102 places, 63 transitions, 589 flow [2024-06-27 22:37:56,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=589, PETRI_PLACES=102, PETRI_TRANSITIONS=63} [2024-06-27 22:37:56,007 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 50 predicate places. [2024-06-27 22:37:56,007 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 63 transitions, 589 flow [2024-06-27 22:37:56,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:37:56,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:56,007 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:37:56,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:37:56,008 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:56,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:56,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1353045502, now seen corresponding path program 2 times [2024-06-27 22:37:56,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:56,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830925563] [2024-06-27 22:37:56,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:56,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:56,077 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:37:56,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:56,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830925563] [2024-06-27 22:37:56,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830925563] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:56,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:56,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:37:56,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322475128] [2024-06-27 22:37:56,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:56,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:37:56,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:56,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:37:56,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:37:56,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:56,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 63 transitions, 589 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:37:56,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:56,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:56,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:56,477 INFO L124 PetriNetUnfolderBase]: 2760/4896 cut-off events. [2024-06-27 22:37:56,477 INFO L125 PetriNetUnfolderBase]: For 26723/26917 co-relation queries the response was YES. [2024-06-27 22:37:56,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20750 conditions, 4896 events. 2760/4896 cut-off events. For 26723/26917 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 32172 event pairs, 344 based on Foata normal form. 254/5090 useless extension candidates. Maximal degree in co-relation 20717. Up to 1981 conditions per place. [2024-06-27 22:37:56,506 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 65 selfloop transitions, 8 changer transitions 0/90 dead transitions. [2024-06-27 22:37:56,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 90 transitions, 945 flow [2024-06-27 22:37:56,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:37:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:37:56,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-06-27 22:37:56,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6608695652173913 [2024-06-27 22:37:56,507 INFO L175 Difference]: Start difference. First operand has 102 places, 63 transitions, 589 flow. Second operand 5 states and 152 transitions. [2024-06-27 22:37:56,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 90 transitions, 945 flow [2024-06-27 22:37:56,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 90 transitions, 879 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-27 22:37:56,581 INFO L231 Difference]: Finished difference. Result has 95 places, 62 transitions, 516 flow [2024-06-27 22:37:56,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=516, PETRI_PLACES=95, PETRI_TRANSITIONS=62} [2024-06-27 22:37:56,582 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 43 predicate places. [2024-06-27 22:37:56,582 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 62 transitions, 516 flow [2024-06-27 22:37:56,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:37:56,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:56,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:56,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:37:56,582 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:56,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:56,582 INFO L85 PathProgramCache]: Analyzing trace with hash 2098561579, now seen corresponding path program 1 times [2024-06-27 22:37:56,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:56,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742475435] [2024-06-27 22:37:56,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:56,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:56,662 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:37:56,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:56,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742475435] [2024-06-27 22:37:56,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742475435] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:56,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:56,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:37:56,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726800916] [2024-06-27 22:37:56,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:56,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:37:56,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:56,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:37:56,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:37:56,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:37:56,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 62 transitions, 516 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states 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:37:56,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:56,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:37:56,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:56,930 INFO L124 PetriNetUnfolderBase]: 1739/3038 cut-off events. [2024-06-27 22:37:56,930 INFO L125 PetriNetUnfolderBase]: For 19062/19224 co-relation queries the response was YES. [2024-06-27 22:37:56,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13317 conditions, 3038 events. 1739/3038 cut-off events. For 19062/19224 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 18227 event pairs, 176 based on Foata normal form. 128/3112 useless extension candidates. Maximal degree in co-relation 13288. Up to 1128 conditions per place. [2024-06-27 22:37:56,946 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 59 selfloop transitions, 11 changer transitions 0/87 dead transitions. [2024-06-27 22:37:56,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 87 transitions, 840 flow [2024-06-27 22:37:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:37:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:37:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-06-27 22:37:56,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6159420289855072 [2024-06-27 22:37:56,947 INFO L175 Difference]: Start difference. First operand has 95 places, 62 transitions, 516 flow. Second operand 6 states and 170 transitions. [2024-06-27 22:37:56,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 87 transitions, 840 flow [2024-06-27 22:37:56,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 87 transitions, 684 flow, removed 54 selfloop flow, removed 8 redundant places. [2024-06-27 22:37:56,957 INFO L231 Difference]: Finished difference. Result has 94 places, 61 transitions, 423 flow [2024-06-27 22:37:56,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=423, PETRI_PLACES=94, PETRI_TRANSITIONS=61} [2024-06-27 22:37:56,958 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 42 predicate places. [2024-06-27 22:37:56,958 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 61 transitions, 423 flow [2024-06-27 22:37:56,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states 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:37:56,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:56,959 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] [2024-06-27 22:37:56,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:37:56,959 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:56,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:56,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1579951916, now seen corresponding path program 1 times [2024-06-27 22:37:56,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:56,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213500849] [2024-06-27 22:37:56,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:56,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:57,606 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:37:57,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:57,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213500849] [2024-06-27 22:37:57,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213500849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:57,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:57,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-06-27 22:37:57,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266246242] [2024-06-27 22:37:57,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:57,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 22:37:57,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:57,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 22:37:57,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-06-27 22:37:57,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-06-27 22:37:57,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 61 transitions, 423 flow. Second operand has 14 states, 14 states have (on average 16.5) internal successors, (231), 14 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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:37:57,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:57,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-06-27 22:37:57,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:58,547 INFO L124 PetriNetUnfolderBase]: 2267/4670 cut-off events. [2024-06-27 22:37:58,547 INFO L125 PetriNetUnfolderBase]: For 13835/14375 co-relation queries the response was YES. [2024-06-27 22:37:58,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16183 conditions, 4670 events. 2267/4670 cut-off events. For 13835/14375 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 38052 event pairs, 409 based on Foata normal form. 33/4352 useless extension candidates. Maximal degree in co-relation 16158. Up to 882 conditions per place. [2024-06-27 22:37:58,571 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 44 selfloop transitions, 8 changer transitions 78/151 dead transitions. [2024-06-27 22:37:58,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 151 transitions, 1056 flow [2024-06-27 22:37:58,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-06-27 22:37:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-06-27 22:37:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 405 transitions. [2024-06-27 22:37:58,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4633867276887872 [2024-06-27 22:37:58,573 INFO L175 Difference]: Start difference. First operand has 94 places, 61 transitions, 423 flow. Second operand 19 states and 405 transitions. [2024-06-27 22:37:58,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 151 transitions, 1056 flow [2024-06-27 22:37:58,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 151 transitions, 982 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-27 22:37:58,597 INFO L231 Difference]: Finished difference. Result has 118 places, 55 transitions, 363 flow [2024-06-27 22:37:58,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=363, PETRI_PLACES=118, PETRI_TRANSITIONS=55} [2024-06-27 22:37:58,598 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 66 predicate places. [2024-06-27 22:37:58,598 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 55 transitions, 363 flow [2024-06-27 22:37:58,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.5) internal successors, (231), 14 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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:37:58,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:58,598 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] [2024-06-27 22:37:58,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:37:58,598 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:37:58,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:58,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1221096802, now seen corresponding path program 2 times [2024-06-27 22:37:58,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:58,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607980254] [2024-06-27 22:37:58,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:58,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:37:58,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:37:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:37:58,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:37:58,671 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:37:58,672 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2024-06-27 22:37:58,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2024-06-27 22:37:58,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 9 remaining) [2024-06-27 22:37:58,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 9 remaining) [2024-06-27 22:37:58,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 9 remaining) [2024-06-27 22:37:58,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-06-27 22:37:58,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2024-06-27 22:37:58,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2024-06-27 22:37:58,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-06-27 22:37:58,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:37:58,674 INFO L445 BasicCegarLoop]: Path program histogram: [6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:58,678 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:37:58,678 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:37:58,758 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-27 22:37:58,758 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-27 22:37:58,759 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:37:58 BasicIcfg [2024-06-27 22:37:58,759 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:37:58,759 INFO L158 Benchmark]: Toolchain (without parser) took 57331.25ms. Allocated memory was 197.1MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 122.5MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-06-27 22:37:58,759 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 197.1MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:37:58,760 INFO L158 Benchmark]: Witness Parser took 0.28ms. Allocated memory is still 197.1MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:37:58,760 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.79ms. Allocated memory is still 197.1MB. Free memory was 122.3MB in the beginning and 153.9MB in the end (delta: -31.6MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2024-06-27 22:37:58,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.13ms. Allocated memory is still 197.1MB. Free memory was 153.9MB in the beginning and 150.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:37:58,760 INFO L158 Benchmark]: Boogie Preprocessor took 71.08ms. Allocated memory is still 197.1MB. Free memory was 150.8MB in the beginning and 146.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:37:58,760 INFO L158 Benchmark]: RCFGBuilder took 551.64ms. Allocated memory is still 197.1MB. Free memory was 146.6MB in the beginning and 91.1MB in the end (delta: 55.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-06-27 22:37:58,761 INFO L158 Benchmark]: TraceAbstraction took 56133.53ms. Allocated memory was 197.1MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 90.0MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-06-27 22:37:58,762 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 197.1MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.28ms. Allocated memory is still 197.1MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.79ms. Allocated memory is still 197.1MB. Free memory was 122.3MB in the beginning and 153.9MB in the end (delta: -31.6MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.13ms. Allocated memory is still 197.1MB. Free memory was 153.9MB in the beginning and 150.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.08ms. Allocated memory is still 197.1MB. Free memory was 150.8MB in the beginning and 146.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 551.64ms. Allocated memory is still 197.1MB. Free memory was 146.6MB in the beginning and 91.1MB in the end (delta: 55.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 56133.53ms. Allocated memory was 197.1MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 90.0MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1804; [L819] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-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] [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-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] [L820] 0 pthread_t t1805; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-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] [L821] 0 //@ assert (!multithreaded || ((((((((((((((((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)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 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_used) >= 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_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))); [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-1, t1805=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=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] [L822] 0 pthread_t t1806; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-1, t1805=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=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] [L823] 0 //@ assert (!multithreaded || ((((((((((((((((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)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 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_used) >= 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_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))); [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-1, t1805=0, t1806=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] [L824] 0 //@ assert (!multithreaded || ((((((((((((((((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)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 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_used) >= 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_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-1, t1805=0, t1806=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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L741] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L796] 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) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 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 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 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=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 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) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 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 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 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=2, __unbuffered_p2_EAX=1, arg={0: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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L783] 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=2, __unbuffered_p2_EAX=1, arg={0: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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-1, t1805=0, t1806=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 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) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 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 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 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=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-1, t1805=0, t1806=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-1, t1805=0, t1806=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 823]: 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: 821]: 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, 71 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: 56.0s, OverallIterations: 38, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 44.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1912 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1720 mSDsluCounter, 694 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 502 mSDsCounter, 375 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7202 IncrementalHoareTripleChecker+Invalid, 7577 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 375 mSolverCounterUnsat, 192 mSDtfsCounter, 7202 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4257occurred in iteration=28, InterpolantAutomatonStates: 238, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 675 ConstructedInterpolants, 0 QuantifiedInterpolants, 9804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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:37:58,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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