./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/protection/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 18:51:36,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 18:51:36,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 18:51:36,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 18:51:36,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 18:51:37,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 18:51:37,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 18:51:37,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 18:51:37,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 18:51:37,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 18:51:37,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 18:51:37,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 18:51:37,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 18:51:37,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 18:51:37,027 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 18:51:37,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 18:51:37,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 18:51:37,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 18:51:37,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 18:51:37,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 18:51:37,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 18:51:37,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 18:51:37,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 18:51:37,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 18:51:37,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 18:51:37,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 18:51:37,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 18:51:37,036 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 18:51:37,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 18:51:37,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 18:51:37,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 18:51:37,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 18:51:37,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:51:37,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 18:51:37,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 18:51:37,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 18:51:37,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 18:51:37,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 18:51:37,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 18:51:37,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 18:51:37,040 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 18:51:37,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 18:51:37,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 18:51:37,040 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 18:51:37,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 18:51:37,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 18:51:37,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 18:51:37,387 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 18:51:37,388 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 18:51:37,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2024-06-27 18:51:38,507 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 18:51:38,708 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 18:51:38,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2024-06-27 18:51:38,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ee303f7c/c33ed2e906e747fabbd4875942cab7c5/FLAG4e0093217 [2024-06-27 18:51:38,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ee303f7c/c33ed2e906e747fabbd4875942cab7c5 [2024-06-27 18:51:38,728 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 18:51:38,729 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 18:51:38,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-27 18:51:38,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 18:51:38,866 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 18:51:38,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 18:51:38,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 18:51:38,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 18:51:38,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:51:38" (1/2) ... [2024-06-27 18:51:38,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c95279b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:51:38, skipping insertion in model container [2024-06-27 18:51:38,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:51:38" (1/2) ... [2024-06-27 18:51:38,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1aa7b2e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:51:38, skipping insertion in model container [2024-06-27 18:51:38,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:51:38" (2/2) ... [2024-06-27 18:51:38,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c95279b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:51:38, skipping insertion in model container [2024-06-27 18:51:38,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:51:38" (2/2) ... [2024-06-27 18:51:38,874 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 18:51:38,938 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 18:51:38,939 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] (((((((((((((((((((((((((((((((! multithreaded || y$r_buff1_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$w_buff1_used == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1))))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0) [2024-06-27 18:51:38,940 INFO L97 edCorrectnessWitness]: Location invariant before [L815-L815] (((((((((((((((((((((((((((((((! multithreaded || y$r_buff1_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$w_buff1_used == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1))))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0) [2024-06-27 18:51:38,940 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 18:51:38,940 INFO L106 edCorrectnessWitness]: ghost_update [L813-L813] multithreaded = 1; [2024-06-27 18:51:38,978 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:51:39,213 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] [2024-06-27 18:51:39,417 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:51:39,429 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 18:51:39,457 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 18:51:39,504 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:51:39,542 INFO L206 MainTranslator]: Completed translation [2024-06-27 18:51:39,542 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:51:39 WrapperNode [2024-06-27 18:51:39,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 18:51:39,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 18:51:39,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 18:51:39,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 18:51:39,548 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 06:51:39" (1/1) ... [2024-06-27 18:51:39,560 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 06:51:39" (1/1) ... [2024-06-27 18:51:39,581 INFO L138 Inliner]: procedures = 174, calls = 54, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 144 [2024-06-27 18:51:39,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 18:51:39,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 18:51:39,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 18:51:39,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 18:51:39,590 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 06:51:39" (1/1) ... [2024-06-27 18:51:39,590 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 06:51:39" (1/1) ... [2024-06-27 18:51:39,593 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 06:51:39" (1/1) ... [2024-06-27 18:51:39,605 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-06-27 18:51:39,605 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 06:51:39" (1/1) ... [2024-06-27 18:51:39,605 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 06:51:39" (1/1) ... [2024-06-27 18:51:39,611 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 06:51:39" (1/1) ... [2024-06-27 18:51:39,613 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 06:51:39" (1/1) ... [2024-06-27 18:51:39,614 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 06:51:39" (1/1) ... [2024-06-27 18:51:39,615 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 06:51:39" (1/1) ... [2024-06-27 18:51:39,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 18:51:39,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 18:51:39,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 18:51:39,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 18:51:39,619 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 06:51:39" (1/1) ... [2024-06-27 18:51:39,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:51:39,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:51:39,660 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 18:51:39,662 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 18:51:39,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 18:51:39,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 18:51:39,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 18:51:39,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 18:51:39,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 18:51:39,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 18:51:39,688 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 18:51:39,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 18:51:39,688 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 18:51:39,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 18:51:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 18:51:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 18:51:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 18:51:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 18:51:39,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 18:51:39,690 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 18:51:39,797 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 18:51:39,798 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 18:51:40,196 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 18:51:40,196 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 18:51:40,476 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 18:51:40,476 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 18:51:40,478 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:51:40 BoogieIcfgContainer [2024-06-27 18:51:40,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 18:51:40,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 18:51:40,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 18:51:40,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 18:51:40,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 06:51:38" (1/4) ... [2024-06-27 18:51:40,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3013d210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:51:40, skipping insertion in model container [2024-06-27 18:51:40,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:51:38" (2/4) ... [2024-06-27 18:51:40,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3013d210 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:51:40, skipping insertion in model container [2024-06-27 18:51:40,486 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 06:51:39" (3/4) ... [2024-06-27 18:51:40,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3013d210 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:51:40, skipping insertion in model container [2024-06-27 18:51:40,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:51:40" (4/4) ... [2024-06-27 18:51:40,489 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2024-06-27 18:51:40,504 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 18:51:40,504 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 18:51:40,504 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 18:51:40,549 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 18:51:40,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 18:51:40,616 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-06-27 18:51:40,616 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:51:40,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 1/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-06-27 18:51:40,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 18:51:40,625 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 66 flow [2024-06-27 18:51:40,638 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 18:51:40,646 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;@24bc4dfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 18:51:40,646 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 18:51:40,650 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 18:51:40,650 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 18:51:40,651 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:51:40,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:40,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:51:40,652 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:40,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:40,657 INFO L85 PathProgramCache]: Analyzing trace with hash 500131623, now seen corresponding path program 1 times [2024-06-27 18:51:40,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:40,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865538146] [2024-06-27 18:51:40,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:40,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:42,185 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 18:51:42,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:42,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865538146] [2024-06-27 18:51:42,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865538146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:42,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:42,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:51:42,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396920012] [2024-06-27 18:51:42,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:42,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:51:42,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:42,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:51:42,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:51:42,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 18:51:42,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 18:51:42,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:42,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 18:51:42,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:42,455 INFO L124 PetriNetUnfolderBase]: 353/667 cut-off events. [2024-06-27 18:51:42,456 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-27 18:51:42,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 667 events. 353/667 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3127 event pairs, 175 based on Foata normal form. 0/636 useless extension candidates. Maximal degree in co-relation 1274. Up to 592 conditions per place. [2024-06-27 18:51:42,464 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 31 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-27 18:51:42,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 163 flow [2024-06-27 18:51:42,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:51:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:51:42,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-06-27 18:51:42,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2024-06-27 18:51:42,476 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 66 flow. Second operand 3 states and 67 transitions. [2024-06-27 18:51:42,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 163 flow [2024-06-27 18:51:42,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:51:42,480 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2024-06-27 18:51:42,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2024-06-27 18:51:42,484 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2024-06-27 18:51:42,484 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2024-06-27 18:51:42,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 18:51:42,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:42,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:42,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 18:51:42,485 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:42,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:42,486 INFO L85 PathProgramCache]: Analyzing trace with hash -409806586, now seen corresponding path program 1 times [2024-06-27 18:51:42,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:42,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542155718] [2024-06-27 18:51:42,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:42,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:43,964 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 18:51:43,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:43,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542155718] [2024-06-27 18:51:43,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542155718] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:43,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:43,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:51:43,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544935682] [2024-06-27 18:51:43,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:43,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:51:43,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:43,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:51:43,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:51:43,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 18:51:43,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 18:51:43,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:43,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 18:51:43,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:44,273 INFO L124 PetriNetUnfolderBase]: 350/625 cut-off events. [2024-06-27 18:51:44,273 INFO L125 PetriNetUnfolderBase]: For 107/110 co-relation queries the response was YES. [2024-06-27 18:51:44,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 625 events. 350/625 cut-off events. For 107/110 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2874 event pairs, 100 based on Foata normal form. 4/627 useless extension candidates. Maximal degree in co-relation 1386. Up to 562 conditions per place. [2024-06-27 18:51:44,276 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 44 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2024-06-27 18:51:44,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 58 transitions, 256 flow [2024-06-27 18:51:44,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:51:44,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:51:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2024-06-27 18:51:44,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-06-27 18:51:44,278 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 91 transitions. [2024-06-27 18:51:44,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 58 transitions, 256 flow [2024-06-27 18:51:44,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:51:44,280 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 135 flow [2024-06-27 18:51:44,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-06-27 18:51:44,280 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2024-06-27 18:51:44,281 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 135 flow [2024-06-27 18:51:44,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 18:51:44,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:44,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:44,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 18:51:44,281 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:44,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:44,282 INFO L85 PathProgramCache]: Analyzing trace with hash 180899060, now seen corresponding path program 1 times [2024-06-27 18:51:44,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:44,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296244127] [2024-06-27 18:51:44,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:44,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:45,993 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 18:51:45,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:45,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296244127] [2024-06-27 18:51:45,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296244127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:45,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:45,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:51:45,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665843364] [2024-06-27 18:51:45,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:45,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:51:45,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:45,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:51:45,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:51:46,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:51:46,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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 18:51:46,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:46,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:51:46,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:46,484 INFO L124 PetriNetUnfolderBase]: 419/734 cut-off events. [2024-06-27 18:51:46,484 INFO L125 PetriNetUnfolderBase]: For 369/369 co-relation queries the response was YES. [2024-06-27 18:51:46,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1855 conditions, 734 events. 419/734 cut-off events. For 369/369 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3357 event pairs, 73 based on Foata normal form. 2/735 useless extension candidates. Maximal degree in co-relation 1840. Up to 649 conditions per place. [2024-06-27 18:51:46,488 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 63 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2024-06-27 18:51:46,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 77 transitions, 384 flow [2024-06-27 18:51:46,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:51:46,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:51:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2024-06-27 18:51:46,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-06-27 18:51:46,490 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 135 flow. Second operand 5 states and 110 transitions. [2024-06-27 18:51:46,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 77 transitions, 384 flow [2024-06-27 18:51:46,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 18:51:46,492 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 205 flow [2024-06-27 18:51:46,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2024-06-27 18:51:46,493 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2024-06-27 18:51:46,493 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 205 flow [2024-06-27 18:51:46,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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 18:51:46,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:46,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:46,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 18:51:46,494 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:46,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:46,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2045348659, now seen corresponding path program 1 times [2024-06-27 18:51:46,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:46,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055322284] [2024-06-27 18:51:46,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:46,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:48,631 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 18:51:48,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:48,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055322284] [2024-06-27 18:51:48,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055322284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:48,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:48,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:51:48,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226186696] [2024-06-27 18:51:48,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:48,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:51:48,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:48,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:51:48,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:51:48,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 18:51:48,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 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 18:51:48,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:48,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 18:51:48,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:49,238 INFO L124 PetriNetUnfolderBase]: 415/726 cut-off events. [2024-06-27 18:51:49,238 INFO L125 PetriNetUnfolderBase]: For 615/615 co-relation queries the response was YES. [2024-06-27 18:51:49,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 726 events. 415/726 cut-off events. For 615/615 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3314 event pairs, 24 based on Foata normal form. 4/729 useless extension candidates. Maximal degree in co-relation 2036. Up to 595 conditions per place. [2024-06-27 18:51:49,242 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 69 selfloop transitions, 9 changer transitions 0/84 dead transitions. [2024-06-27 18:51:49,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 84 transitions, 449 flow [2024-06-27 18:51:49,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:51:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:51:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-27 18:51:49,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-27 18:51:49,246 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 205 flow. Second operand 6 states and 126 transitions. [2024-06-27 18:51:49,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 84 transitions, 449 flow [2024-06-27 18:51:49,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 84 transitions, 449 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 18:51:49,252 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 219 flow [2024-06-27 18:51:49,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2024-06-27 18:51:49,253 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2024-06-27 18:51:49,253 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 219 flow [2024-06-27 18:51:49,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 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 18:51:49,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:49,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:49,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 18:51:49,254 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:49,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:49,255 INFO L85 PathProgramCache]: Analyzing trace with hash 709474820, now seen corresponding path program 1 times [2024-06-27 18:51:49,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:49,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799837817] [2024-06-27 18:51:49,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:49,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:51:50,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:50,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799837817] [2024-06-27 18:51:50,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799837817] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:50,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:50,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:51:50,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245824680] [2024-06-27 18:51:50,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:50,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:51:50,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:50,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:51:50,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:51:50,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:50,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 219 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:50,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:50,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:50,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:51,100 INFO L124 PetriNetUnfolderBase]: 411/766 cut-off events. [2024-06-27 18:51:51,101 INFO L125 PetriNetUnfolderBase]: For 904/904 co-relation queries the response was YES. [2024-06-27 18:51:51,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2197 conditions, 766 events. 411/766 cut-off events. For 904/904 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3610 event pairs, 114 based on Foata normal form. 2/767 useless extension candidates. Maximal degree in co-relation 2173. Up to 650 conditions per place. [2024-06-27 18:51:51,105 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 48 selfloop transitions, 9 changer transitions 0/62 dead transitions. [2024-06-27 18:51:51,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 384 flow [2024-06-27 18:51:51,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:51:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:51:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-06-27 18:51:51,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2024-06-27 18:51:51,107 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 219 flow. Second operand 5 states and 87 transitions. [2024-06-27 18:51:51,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 384 flow [2024-06-27 18:51:51,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 62 transitions, 358 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-27 18:51:51,109 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 238 flow [2024-06-27 18:51:51,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-06-27 18:51:51,110 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2024-06-27 18:51:51,110 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 238 flow [2024-06-27 18:51:51,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:51,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:51,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:51,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 18:51:51,111 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:51,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:51,111 INFO L85 PathProgramCache]: Analyzing trace with hash 128302977, now seen corresponding path program 1 times [2024-06-27 18:51:51,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:51,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069874056] [2024-06-27 18:51:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:51,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:53,282 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 18:51:53,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:53,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069874056] [2024-06-27 18:51:53,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069874056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:53,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:53,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:51:53,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976517123] [2024-06-27 18:51:53,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:53,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:51:53,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:53,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:51:53,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:51:53,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:53,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 238 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:53,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:53,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:53,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:54,115 INFO L124 PetriNetUnfolderBase]: 426/755 cut-off events. [2024-06-27 18:51:54,115 INFO L125 PetriNetUnfolderBase]: For 1035/1035 co-relation queries the response was YES. [2024-06-27 18:51:54,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2291 conditions, 755 events. 426/755 cut-off events. For 1035/1035 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3535 event pairs, 73 based on Foata normal form. 1/755 useless extension candidates. Maximal degree in co-relation 2266. Up to 589 conditions per place. [2024-06-27 18:51:54,120 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 68 selfloop transitions, 17 changer transitions 0/90 dead transitions. [2024-06-27 18:51:54,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 90 transitions, 536 flow [2024-06-27 18:51:54,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:51:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:51:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-27 18:51:54,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-27 18:51:54,122 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 238 flow. Second operand 7 states and 133 transitions. [2024-06-27 18:51:54,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 90 transitions, 536 flow [2024-06-27 18:51:54,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 90 transitions, 516 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-27 18:51:54,127 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 281 flow [2024-06-27 18:51:54,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=281, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2024-06-27 18:51:54,129 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2024-06-27 18:51:54,130 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 281 flow [2024-06-27 18:51:54,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:54,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:54,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:54,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 18:51:54,131 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:54,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:54,131 INFO L85 PathProgramCache]: Analyzing trace with hash 128423133, now seen corresponding path program 1 times [2024-06-27 18:51:54,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:54,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211051531] [2024-06-27 18:51:54,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:54,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:56,348 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 18:51:56,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:56,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211051531] [2024-06-27 18:51:56,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211051531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:56,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:56,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:51:56,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079718900] [2024-06-27 18:51:56,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:56,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:51:56,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:56,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:51:56,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:51:56,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:56,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 281 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:56,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:56,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:56,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:57,095 INFO L124 PetriNetUnfolderBase]: 505/884 cut-off events. [2024-06-27 18:51:57,095 INFO L125 PetriNetUnfolderBase]: For 1429/1429 co-relation queries the response was YES. [2024-06-27 18:51:57,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2816 conditions, 884 events. 505/884 cut-off events. For 1429/1429 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4170 event pairs, 80 based on Foata normal form. 2/885 useless extension candidates. Maximal degree in co-relation 2790. Up to 698 conditions per place. [2024-06-27 18:51:57,100 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 76 selfloop transitions, 20 changer transitions 0/101 dead transitions. [2024-06-27 18:51:57,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 101 transitions, 629 flow [2024-06-27 18:51:57,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:51:57,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:51:57,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-27 18:51:57,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-27 18:51:57,102 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 281 flow. Second operand 8 states and 147 transitions. [2024-06-27 18:51:57,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 101 transitions, 629 flow [2024-06-27 18:51:57,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 101 transitions, 595 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 18:51:57,106 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 351 flow [2024-06-27 18:51:57,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=351, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2024-06-27 18:51:57,107 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2024-06-27 18:51:57,107 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 351 flow [2024-06-27 18:51:57,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:57,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:57,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:57,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 18:51:57,107 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:57,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:57,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1271823157, now seen corresponding path program 2 times [2024-06-27 18:51:57,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:57,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678033607] [2024-06-27 18:51:57,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:57,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:51:58,985 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 18:51:58,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:51:58,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678033607] [2024-06-27 18:51:58,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678033607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:51:58,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:51:58,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:51:58,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530874452] [2024-06-27 18:51:58,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:51:58,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:51:58,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:51:58,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:51:58,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:51:58,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:51:58,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 351 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:58,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:51:58,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:51:58,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:51:59,667 INFO L124 PetriNetUnfolderBase]: 520/911 cut-off events. [2024-06-27 18:51:59,668 INFO L125 PetriNetUnfolderBase]: For 1862/1862 co-relation queries the response was YES. [2024-06-27 18:51:59,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3132 conditions, 911 events. 520/911 cut-off events. For 1862/1862 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4370 event pairs, 79 based on Foata normal form. 1/911 useless extension candidates. Maximal degree in co-relation 3104. Up to 765 conditions per place. [2024-06-27 18:51:59,676 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 74 selfloop transitions, 16 changer transitions 0/95 dead transitions. [2024-06-27 18:51:59,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 641 flow [2024-06-27 18:51:59,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:51:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:51:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-27 18:51:59,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2024-06-27 18:51:59,680 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 351 flow. Second operand 7 states and 127 transitions. [2024-06-27 18:51:59,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 641 flow [2024-06-27 18:51:59,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 95 transitions, 613 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 18:51:59,684 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 376 flow [2024-06-27 18:51:59,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=376, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2024-06-27 18:51:59,686 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 30 predicate places. [2024-06-27 18:51:59,686 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 376 flow [2024-06-27 18:51:59,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:51:59,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:51:59,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:51:59,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 18:51:59,687 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:51:59,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:51:59,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1395842019, now seen corresponding path program 2 times [2024-06-27 18:51:59,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:51:59,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136388137] [2024-06-27 18:51:59,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:51:59,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:51:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:01,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:01,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136388137] [2024-06-27 18:52:01,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136388137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:01,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:01,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:52:01,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738222439] [2024-06-27 18:52:01,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:01,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:52:01,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:01,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:52:01,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:52:01,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:01,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 376 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:01,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:01,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:01,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:02,047 INFO L124 PetriNetUnfolderBase]: 516/911 cut-off events. [2024-06-27 18:52:02,048 INFO L125 PetriNetUnfolderBase]: For 2066/2066 co-relation queries the response was YES. [2024-06-27 18:52:02,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3200 conditions, 911 events. 516/911 cut-off events. For 2066/2066 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4397 event pairs, 81 based on Foata normal form. 2/912 useless extension candidates. Maximal degree in co-relation 3170. Up to 718 conditions per place. [2024-06-27 18:52:02,052 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 64 selfloop transitions, 19 changer transitions 0/88 dead transitions. [2024-06-27 18:52:02,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 88 transitions, 610 flow [2024-06-27 18:52:02,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:52:02,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:52:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2024-06-27 18:52:02,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-27 18:52:02,054 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 376 flow. Second operand 6 states and 111 transitions. [2024-06-27 18:52:02,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 88 transitions, 610 flow [2024-06-27 18:52:02,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 88 transitions, 571 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 18:52:02,057 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 385 flow [2024-06-27 18:52:02,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2024-06-27 18:52:02,058 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 31 predicate places. [2024-06-27 18:52:02,058 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 385 flow [2024-06-27 18:52:02,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:02,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:02,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:02,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 18:52:02,062 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:02,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:02,063 INFO L85 PathProgramCache]: Analyzing trace with hash 906141027, now seen corresponding path program 3 times [2024-06-27 18:52:02,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:02,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60344484] [2024-06-27 18:52:02,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:02,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:03,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:03,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60344484] [2024-06-27 18:52:03,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60344484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:03,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:03,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:52:03,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695851953] [2024-06-27 18:52:03,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:03,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:52:03,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:03,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:52:03,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:52:03,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:03,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 385 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:03,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:03,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:03,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:04,520 INFO L124 PetriNetUnfolderBase]: 514/904 cut-off events. [2024-06-27 18:52:04,520 INFO L125 PetriNetUnfolderBase]: For 2233/2233 co-relation queries the response was YES. [2024-06-27 18:52:04,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3249 conditions, 904 events. 514/904 cut-off events. For 2233/2233 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4354 event pairs, 80 based on Foata normal form. 1/904 useless extension candidates. Maximal degree in co-relation 3218. Up to 718 conditions per place. [2024-06-27 18:52:04,525 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 68 selfloop transitions, 19 changer transitions 0/92 dead transitions. [2024-06-27 18:52:04,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 92 transitions, 645 flow [2024-06-27 18:52:04,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:52:04,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:52:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-27 18:52:04,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-06-27 18:52:04,527 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 385 flow. Second operand 6 states and 115 transitions. [2024-06-27 18:52:04,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 92 transitions, 645 flow [2024-06-27 18:52:04,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 92 transitions, 607 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-27 18:52:04,530 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 396 flow [2024-06-27 18:52:04,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=396, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2024-06-27 18:52:04,531 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 32 predicate places. [2024-06-27 18:52:04,531 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 396 flow [2024-06-27 18:52:04,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:04,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:04,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:04,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 18:52:04,532 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:04,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:04,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1396079169, now seen corresponding path program 3 times [2024-06-27 18:52:04,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:04,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235669738] [2024-06-27 18:52:04,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:04,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:06,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 18:52:06,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:06,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235669738] [2024-06-27 18:52:06,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235669738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:06,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:06,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:52:06,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72217624] [2024-06-27 18:52:06,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:06,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:52:06,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:06,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:52:06,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:52:06,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:06,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 396 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:06,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:06,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:06,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:06,925 INFO L124 PetriNetUnfolderBase]: 516/913 cut-off events. [2024-06-27 18:52:06,925 INFO L125 PetriNetUnfolderBase]: For 2760/2762 co-relation queries the response was YES. [2024-06-27 18:52:06,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3321 conditions, 913 events. 516/913 cut-off events. For 2760/2762 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4438 event pairs, 92 based on Foata normal form. 4/916 useless extension candidates. Maximal degree in co-relation 3289. Up to 643 conditions per place. [2024-06-27 18:52:06,930 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 66 selfloop transitions, 20 changer transitions 0/91 dead transitions. [2024-06-27 18:52:06,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 670 flow [2024-06-27 18:52:06,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:52:06,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:52:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-06-27 18:52:06,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190476190476191 [2024-06-27 18:52:06,932 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 396 flow. Second operand 6 states and 109 transitions. [2024-06-27 18:52:06,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 670 flow [2024-06-27 18:52:06,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 91 transitions, 630 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-27 18:52:06,937 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 453 flow [2024-06-27 18:52:06,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=453, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2024-06-27 18:52:06,938 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2024-06-27 18:52:06,938 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 453 flow [2024-06-27 18:52:06,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:06,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:06,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:06,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 18:52:06,938 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:06,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:06,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1396088097, now seen corresponding path program 1 times [2024-06-27 18:52:06,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:06,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144730882] [2024-06-27 18:52:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:08,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:08,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144730882] [2024-06-27 18:52:08,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144730882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:08,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:08,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:52:08,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507832917] [2024-06-27 18:52:08,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:08,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:52:08,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:08,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:52:08,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:52:08,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:08,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 453 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:08,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:08,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:08,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:09,414 INFO L124 PetriNetUnfolderBase]: 513/953 cut-off events. [2024-06-27 18:52:09,415 INFO L125 PetriNetUnfolderBase]: For 2677/2677 co-relation queries the response was YES. [2024-06-27 18:52:09,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3525 conditions, 953 events. 513/953 cut-off events. For 2677/2677 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4717 event pairs, 114 based on Foata normal form. 2/954 useless extension candidates. Maximal degree in co-relation 3491. Up to 785 conditions per place. [2024-06-27 18:52:09,420 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 73 selfloop transitions, 11 changer transitions 0/89 dead transitions. [2024-06-27 18:52:09,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 89 transitions, 689 flow [2024-06-27 18:52:09,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:52:09,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:52:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-27 18:52:09,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49047619047619045 [2024-06-27 18:52:09,422 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 453 flow. Second operand 6 states and 103 transitions. [2024-06-27 18:52:09,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 89 transitions, 689 flow [2024-06-27 18:52:09,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 89 transitions, 663 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-27 18:52:09,428 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 478 flow [2024-06-27 18:52:09,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=478, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2024-06-27 18:52:09,429 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2024-06-27 18:52:09,429 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 478 flow [2024-06-27 18:52:09,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:09,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:09,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:09,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 18:52:09,430 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:09,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash -775529659, now seen corresponding path program 1 times [2024-06-27 18:52:09,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:09,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395455343] [2024-06-27 18:52:09,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:09,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:11,612 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 18:52:11,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:11,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395455343] [2024-06-27 18:52:11,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395455343] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:11,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:11,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:52:11,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715944823] [2024-06-27 18:52:11,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:11,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:52:11,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:11,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:52:11,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:52:11,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:11,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 478 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:11,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:11,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:11,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:12,558 INFO L124 PetriNetUnfolderBase]: 577/1025 cut-off events. [2024-06-27 18:52:12,558 INFO L125 PetriNetUnfolderBase]: For 3047/3047 co-relation queries the response was YES. [2024-06-27 18:52:12,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3863 conditions, 1025 events. 577/1025 cut-off events. For 3047/3047 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5034 event pairs, 90 based on Foata normal form. 2/1026 useless extension candidates. Maximal degree in co-relation 3827. Up to 645 conditions per place. [2024-06-27 18:52:12,565 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 96 selfloop transitions, 33 changer transitions 0/134 dead transitions. [2024-06-27 18:52:12,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 134 transitions, 964 flow [2024-06-27 18:52:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:52:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:52:12,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-27 18:52:12,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5342857142857143 [2024-06-27 18:52:12,567 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 478 flow. Second operand 10 states and 187 transitions. [2024-06-27 18:52:12,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 134 transitions, 964 flow [2024-06-27 18:52:12,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 134 transitions, 929 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 18:52:12,573 INFO L231 Difference]: Finished difference. Result has 82 places, 73 transitions, 578 flow [2024-06-27 18:52:12,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=578, PETRI_PLACES=82, PETRI_TRANSITIONS=73} [2024-06-27 18:52:12,574 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 45 predicate places. [2024-06-27 18:52:12,574 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 73 transitions, 578 flow [2024-06-27 18:52:12,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:12,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:12,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:12,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 18:52:12,575 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:12,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:12,575 INFO L85 PathProgramCache]: Analyzing trace with hash -313854325, now seen corresponding path program 2 times [2024-06-27 18:52:12,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:12,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451141828] [2024-06-27 18:52:12,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:12,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:14,952 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 18:52:14,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:14,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451141828] [2024-06-27 18:52:14,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451141828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:14,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:14,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:52:14,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991843116] [2024-06-27 18:52:14,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:14,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:52:14,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:14,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:52:14,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:52:14,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:14,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 73 transitions, 578 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:14,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:14,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:14,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:15,942 INFO L124 PetriNetUnfolderBase]: 644/1140 cut-off events. [2024-06-27 18:52:15,942 INFO L125 PetriNetUnfolderBase]: For 4475/4475 co-relation queries the response was YES. [2024-06-27 18:52:15,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4686 conditions, 1140 events. 644/1140 cut-off events. For 4475/4475 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5791 event pairs, 89 based on Foata normal form. 2/1141 useless extension candidates. Maximal degree in co-relation 4648. Up to 834 conditions per place. [2024-06-27 18:52:15,952 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 105 selfloop transitions, 29 changer transitions 0/139 dead transitions. [2024-06-27 18:52:15,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 139 transitions, 1119 flow [2024-06-27 18:52:15,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:52:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:52:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-27 18:52:15,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257142857142857 [2024-06-27 18:52:15,954 INFO L175 Difference]: Start difference. First operand has 82 places, 73 transitions, 578 flow. Second operand 10 states and 184 transitions. [2024-06-27 18:52:15,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 139 transitions, 1119 flow [2024-06-27 18:52:15,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 139 transitions, 1043 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-27 18:52:15,967 INFO L231 Difference]: Finished difference. Result has 87 places, 82 transitions, 689 flow [2024-06-27 18:52:15,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=689, PETRI_PLACES=87, PETRI_TRANSITIONS=82} [2024-06-27 18:52:15,968 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 50 predicate places. [2024-06-27 18:52:15,969 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 82 transitions, 689 flow [2024-06-27 18:52:15,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:15,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:15,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:15,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 18:52:15,969 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:15,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:15,970 INFO L85 PathProgramCache]: Analyzing trace with hash -771805009, now seen corresponding path program 3 times [2024-06-27 18:52:15,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:15,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411505430] [2024-06-27 18:52:15,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:15,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:18,517 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 18:52:18,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:18,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411505430] [2024-06-27 18:52:18,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411505430] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:18,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:18,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:52:18,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486144147] [2024-06-27 18:52:18,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:18,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:52:18,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:18,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:52:18,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:52:18,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:18,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 82 transitions, 689 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:18,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:18,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:18,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:19,528 INFO L124 PetriNetUnfolderBase]: 640/1140 cut-off events. [2024-06-27 18:52:19,529 INFO L125 PetriNetUnfolderBase]: For 4694/4694 co-relation queries the response was YES. [2024-06-27 18:52:19,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4783 conditions, 1140 events. 640/1140 cut-off events. For 4694/4694 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5817 event pairs, 89 based on Foata normal form. 2/1141 useless extension candidates. Maximal degree in co-relation 4742. Up to 831 conditions per place. [2024-06-27 18:52:19,538 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 110 selfloop transitions, 29 changer transitions 0/144 dead transitions. [2024-06-27 18:52:19,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 144 transitions, 1127 flow [2024-06-27 18:52:19,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:52:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:52:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2024-06-27 18:52:19,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168831168831168 [2024-06-27 18:52:19,540 INFO L175 Difference]: Start difference. First operand has 87 places, 82 transitions, 689 flow. Second operand 11 states and 199 transitions. [2024-06-27 18:52:19,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 144 transitions, 1127 flow [2024-06-27 18:52:19,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 144 transitions, 1061 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-27 18:52:19,553 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 687 flow [2024-06-27 18:52:19,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=687, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2024-06-27 18:52:19,554 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 55 predicate places. [2024-06-27 18:52:19,554 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 687 flow [2024-06-27 18:52:19,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:19,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:19,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:19,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 18:52:19,556 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:19,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash 321431057, now seen corresponding path program 4 times [2024-06-27 18:52:19,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:19,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608952154] [2024-06-27 18:52:19,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:19,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:21,610 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 18:52:21,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:21,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608952154] [2024-06-27 18:52:21,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608952154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:21,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:21,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:52:21,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082752853] [2024-06-27 18:52:21,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:21,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:52:21,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:21,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:52:21,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:52:21,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:21,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 687 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:21,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:21,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:21,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:22,547 INFO L124 PetriNetUnfolderBase]: 670/1198 cut-off events. [2024-06-27 18:52:22,548 INFO L125 PetriNetUnfolderBase]: For 5116/5116 co-relation queries the response was YES. [2024-06-27 18:52:22,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5122 conditions, 1198 events. 670/1198 cut-off events. For 5116/5116 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6204 event pairs, 89 based on Foata normal form. 2/1199 useless extension candidates. Maximal degree in co-relation 5079. Up to 768 conditions per place. [2024-06-27 18:52:22,560 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 88 selfloop transitions, 39 changer transitions 0/132 dead transitions. [2024-06-27 18:52:22,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 132 transitions, 1134 flow [2024-06-27 18:52:22,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:52:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:52:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-27 18:52:22,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5464285714285714 [2024-06-27 18:52:22,564 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 687 flow. Second operand 8 states and 153 transitions. [2024-06-27 18:52:22,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 132 transitions, 1134 flow [2024-06-27 18:52:22,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 132 transitions, 1072 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-27 18:52:22,603 INFO L231 Difference]: Finished difference. Result has 91 places, 85 transitions, 746 flow [2024-06-27 18:52:22,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=746, PETRI_PLACES=91, PETRI_TRANSITIONS=85} [2024-06-27 18:52:22,604 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 54 predicate places. [2024-06-27 18:52:22,604 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 85 transitions, 746 flow [2024-06-27 18:52:22,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:22,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:22,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:22,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 18:52:22,620 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:22,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash 328782707, now seen corresponding path program 5 times [2024-06-27 18:52:22,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:22,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350379612] [2024-06-27 18:52:22,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:22,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:24,327 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 18:52:24,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:24,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350379612] [2024-06-27 18:52:24,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350379612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:24,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:24,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:52:24,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923425012] [2024-06-27 18:52:24,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:24,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:52:24,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:24,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:52:24,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:52:24,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:24,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 85 transitions, 746 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:24,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:24,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:24,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:25,367 INFO L124 PetriNetUnfolderBase]: 678/1221 cut-off events. [2024-06-27 18:52:25,367 INFO L125 PetriNetUnfolderBase]: For 5926/5928 co-relation queries the response was YES. [2024-06-27 18:52:25,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5310 conditions, 1221 events. 678/1221 cut-off events. For 5926/5928 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6362 event pairs, 92 based on Foata normal form. 4/1224 useless extension candidates. Maximal degree in co-relation 5266. Up to 652 conditions per place. [2024-06-27 18:52:25,374 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 97 selfloop transitions, 40 changer transitions 0/142 dead transitions. [2024-06-27 18:52:25,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 142 transitions, 1256 flow [2024-06-27 18:52:25,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:52:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:52:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-27 18:52:25,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-27 18:52:25,376 INFO L175 Difference]: Start difference. First operand has 91 places, 85 transitions, 746 flow. Second operand 9 states and 168 transitions. [2024-06-27 18:52:25,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 142 transitions, 1256 flow [2024-06-27 18:52:25,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 142 transitions, 1183 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 18:52:25,387 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 796 flow [2024-06-27 18:52:25,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=796, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2024-06-27 18:52:25,387 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 57 predicate places. [2024-06-27 18:52:25,388 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 796 flow [2024-06-27 18:52:25,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:25,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:25,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:25,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 18:52:25,388 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:25,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:25,389 INFO L85 PathProgramCache]: Analyzing trace with hash 321425477, now seen corresponding path program 6 times [2024-06-27 18:52:25,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:25,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774030252] [2024-06-27 18:52:25,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:25,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:27,383 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 18:52:27,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:27,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774030252] [2024-06-27 18:52:27,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774030252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:27,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:27,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:52:27,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583188533] [2024-06-27 18:52:27,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:27,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:52:27,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:27,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:52:27,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:52:27,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:27,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 796 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:27,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:27,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:27,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:28,223 INFO L124 PetriNetUnfolderBase]: 674/1214 cut-off events. [2024-06-27 18:52:28,224 INFO L125 PetriNetUnfolderBase]: For 5982/5982 co-relation queries the response was YES. [2024-06-27 18:52:28,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5378 conditions, 1214 events. 674/1214 cut-off events. For 5982/5982 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6320 event pairs, 94 based on Foata normal form. 2/1215 useless extension candidates. Maximal degree in co-relation 5334. Up to 779 conditions per place. [2024-06-27 18:52:28,231 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 98 selfloop transitions, 39 changer transitions 0/142 dead transitions. [2024-06-27 18:52:28,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 142 transitions, 1214 flow [2024-06-27 18:52:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:52:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:52:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-27 18:52:28,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5365079365079365 [2024-06-27 18:52:28,237 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 796 flow. Second operand 9 states and 169 transitions. [2024-06-27 18:52:28,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 142 transitions, 1214 flow [2024-06-27 18:52:28,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 142 transitions, 1148 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-27 18:52:28,250 INFO L231 Difference]: Finished difference. Result has 98 places, 89 transitions, 819 flow [2024-06-27 18:52:28,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=819, PETRI_PLACES=98, PETRI_TRANSITIONS=89} [2024-06-27 18:52:28,250 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 61 predicate places. [2024-06-27 18:52:28,250 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 89 transitions, 819 flow [2024-06-27 18:52:28,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:28,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:28,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:28,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 18:52:28,251 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:28,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:28,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1257700928, now seen corresponding path program 1 times [2024-06-27 18:52:28,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:28,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299790202] [2024-06-27 18:52:28,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:28,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:30,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:30,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299790202] [2024-06-27 18:52:30,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299790202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:30,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:30,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:52:30,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493957907] [2024-06-27 18:52:30,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:30,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:52:30,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:30,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:52:30,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:52:30,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:30,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 819 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:30,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:30,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:30,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:31,427 INFO L124 PetriNetUnfolderBase]: 696/1252 cut-off events. [2024-06-27 18:52:31,427 INFO L125 PetriNetUnfolderBase]: For 6332/6332 co-relation queries the response was YES. [2024-06-27 18:52:31,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5680 conditions, 1252 events. 696/1252 cut-off events. For 6332/6332 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6609 event pairs, 64 based on Foata normal form. 2/1253 useless extension candidates. Maximal degree in co-relation 5634. Up to 853 conditions per place. [2024-06-27 18:52:31,435 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 109 selfloop transitions, 25 changer transitions 0/139 dead transitions. [2024-06-27 18:52:31,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 139 transitions, 1293 flow [2024-06-27 18:52:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:52:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:52:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-27 18:52:31,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2024-06-27 18:52:31,437 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 819 flow. Second operand 8 states and 149 transitions. [2024-06-27 18:52:31,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 139 transitions, 1293 flow [2024-06-27 18:52:31,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 139 transitions, 1180 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-27 18:52:31,449 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 768 flow [2024-06-27 18:52:31,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=768, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2024-06-27 18:52:31,449 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 59 predicate places. [2024-06-27 18:52:31,450 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 768 flow [2024-06-27 18:52:31,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:31,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:31,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:31,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 18:52:31,450 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:31,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:31,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1254843968, now seen corresponding path program 2 times [2024-06-27 18:52:31,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:31,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226448057] [2024-06-27 18:52:31,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:31,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:33,392 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 18:52:33,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:33,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226448057] [2024-06-27 18:52:33,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226448057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:33,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:33,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:52:33,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662786318] [2024-06-27 18:52:33,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:33,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:52:33,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:33,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:52:33,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:52:33,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:33,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 768 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:33,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:33,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:33,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:34,185 INFO L124 PetriNetUnfolderBase]: 718/1290 cut-off events. [2024-06-27 18:52:34,185 INFO L125 PetriNetUnfolderBase]: For 5669/5669 co-relation queries the response was YES. [2024-06-27 18:52:34,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5644 conditions, 1290 events. 718/1290 cut-off events. For 5669/5669 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6849 event pairs, 108 based on Foata normal form. 2/1291 useless extension candidates. Maximal degree in co-relation 5598. Up to 996 conditions per place. [2024-06-27 18:52:34,192 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 109 selfloop transitions, 24 changer transitions 0/138 dead transitions. [2024-06-27 18:52:34,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 138 transitions, 1206 flow [2024-06-27 18:52:34,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:52:34,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:52:34,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-27 18:52:34,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2024-06-27 18:52:34,217 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 768 flow. Second operand 8 states and 149 transitions. [2024-06-27 18:52:34,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 138 transitions, 1206 flow [2024-06-27 18:52:34,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 138 transitions, 1158 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 18:52:34,228 INFO L231 Difference]: Finished difference. Result has 99 places, 91 transitions, 782 flow [2024-06-27 18:52:34,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=782, PETRI_PLACES=99, PETRI_TRANSITIONS=91} [2024-06-27 18:52:34,229 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 62 predicate places. [2024-06-27 18:52:34,229 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 782 flow [2024-06-27 18:52:34,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:34,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:34,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:34,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 18:52:34,230 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:34,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:34,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1139552798, now seen corresponding path program 3 times [2024-06-27 18:52:34,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:34,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213209461] [2024-06-27 18:52:34,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:34,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:36,019 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 18:52:36,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213209461] [2024-06-27 18:52:36,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213209461] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:36,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:36,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:52:36,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964828573] [2024-06-27 18:52:36,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:36,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:52:36,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:36,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:52:36,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:52:36,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:36,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 782 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:36,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:36,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:36,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:36,655 INFO L124 PetriNetUnfolderBase]: 740/1330 cut-off events. [2024-06-27 18:52:36,656 INFO L125 PetriNetUnfolderBase]: For 6030/6030 co-relation queries the response was YES. [2024-06-27 18:52:36,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5781 conditions, 1330 events. 740/1330 cut-off events. For 6030/6030 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7131 event pairs, 107 based on Foata normal form. 2/1331 useless extension candidates. Maximal degree in co-relation 5734. Up to 1085 conditions per place. [2024-06-27 18:52:36,663 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 110 selfloop transitions, 19 changer transitions 0/134 dead transitions. [2024-06-27 18:52:36,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 134 transitions, 1183 flow [2024-06-27 18:52:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 18:52:36,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 18:52:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 18:52:36,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 18:52:36,669 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 782 flow. Second operand 8 states and 144 transitions. [2024-06-27 18:52:36,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 134 transitions, 1183 flow [2024-06-27 18:52:36,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 134 transitions, 1121 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-27 18:52:36,682 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 772 flow [2024-06-27 18:52:36,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=772, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2024-06-27 18:52:36,683 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 63 predicate places. [2024-06-27 18:52:36,683 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 92 transitions, 772 flow [2024-06-27 18:52:36,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:36,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:36,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:36,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 18:52:36,684 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:36,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:36,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1139368100, now seen corresponding path program 1 times [2024-06-27 18:52:36,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:36,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22810089] [2024-06-27 18:52:36,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:36,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:39,043 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 18:52:39,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:39,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22810089] [2024-06-27 18:52:39,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22810089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:39,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:39,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:39,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746752722] [2024-06-27 18:52:39,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:39,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:39,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:39,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:39,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:39,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:39,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 772 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:39,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:39,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:39,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:39,876 INFO L124 PetriNetUnfolderBase]: 762/1348 cut-off events. [2024-06-27 18:52:39,876 INFO L125 PetriNetUnfolderBase]: For 6373/6373 co-relation queries the response was YES. [2024-06-27 18:52:39,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5787 conditions, 1348 events. 762/1348 cut-off events. For 6373/6373 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7103 event pairs, 93 based on Foata normal form. 2/1349 useless extension candidates. Maximal degree in co-relation 5740. Up to 1087 conditions per place. [2024-06-27 18:52:39,884 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 116 selfloop transitions, 22 changer transitions 0/143 dead transitions. [2024-06-27 18:52:39,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 143 transitions, 1206 flow [2024-06-27 18:52:39,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:52:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:52:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-27 18:52:39,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174603174603175 [2024-06-27 18:52:39,885 INFO L175 Difference]: Start difference. First operand has 100 places, 92 transitions, 772 flow. Second operand 9 states and 163 transitions. [2024-06-27 18:52:39,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 143 transitions, 1206 flow [2024-06-27 18:52:39,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 143 transitions, 1169 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-27 18:52:39,898 INFO L231 Difference]: Finished difference. Result has 103 places, 94 transitions, 812 flow [2024-06-27 18:52:39,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=812, PETRI_PLACES=103, PETRI_TRANSITIONS=94} [2024-06-27 18:52:39,898 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 66 predicate places. [2024-06-27 18:52:39,898 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 94 transitions, 812 flow [2024-06-27 18:52:39,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:39,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:39,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:39,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 18:52:39,899 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:39,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:39,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2064219470, now seen corresponding path program 4 times [2024-06-27 18:52:39,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:39,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102148478] [2024-06-27 18:52:39,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:39,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:41,812 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 18:52:41,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:41,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102148478] [2024-06-27 18:52:41,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102148478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:41,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:41,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 18:52:41,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309612492] [2024-06-27 18:52:41,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:41,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 18:52:41,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:41,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 18:52:41,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 18:52:41,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:41,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 94 transitions, 812 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:41,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:41,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:41,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:42,724 INFO L124 PetriNetUnfolderBase]: 759/1365 cut-off events. [2024-06-27 18:52:42,725 INFO L125 PetriNetUnfolderBase]: For 6687/6687 co-relation queries the response was YES. [2024-06-27 18:52:42,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5866 conditions, 1365 events. 759/1365 cut-off events. For 6687/6687 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7374 event pairs, 65 based on Foata normal form. 2/1366 useless extension candidates. Maximal degree in co-relation 5818. Up to 1004 conditions per place. [2024-06-27 18:52:42,733 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 105 selfloop transitions, 24 changer transitions 0/134 dead transitions. [2024-06-27 18:52:42,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 134 transitions, 1210 flow [2024-06-27 18:52:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:52:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:52:42,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-27 18:52:42,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5387755102040817 [2024-06-27 18:52:42,735 INFO L175 Difference]: Start difference. First operand has 103 places, 94 transitions, 812 flow. Second operand 7 states and 132 transitions. [2024-06-27 18:52:42,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 134 transitions, 1210 flow [2024-06-27 18:52:42,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 134 transitions, 1149 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-27 18:52:42,749 INFO L231 Difference]: Finished difference. Result has 103 places, 94 transitions, 808 flow [2024-06-27 18:52:42,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=808, PETRI_PLACES=103, PETRI_TRANSITIONS=94} [2024-06-27 18:52:42,749 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 66 predicate places. [2024-06-27 18:52:42,749 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 94 transitions, 808 flow [2024-06-27 18:52:42,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:42,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:42,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 18:52:42,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 18:52:42,750 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:42,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:42,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2064034772, now seen corresponding path program 2 times [2024-06-27 18:52:42,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:42,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790042567] [2024-06-27 18:52:42,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:42,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:45,022 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 18:52:45,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:45,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790042567] [2024-06-27 18:52:45,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790042567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:45,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:45,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:45,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052988370] [2024-06-27 18:52:45,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:45,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:45,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:45,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:45,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:45,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:45,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 94 transitions, 808 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:45,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:45,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:45,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:45,636 INFO L124 PetriNetUnfolderBase]: 781/1383 cut-off events. [2024-06-27 18:52:45,637 INFO L125 PetriNetUnfolderBase]: For 7359/7359 co-relation queries the response was YES. [2024-06-27 18:52:45,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6035 conditions, 1383 events. 781/1383 cut-off events. For 7359/7359 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7364 event pairs, 94 based on Foata normal form. 2/1384 useless extension candidates. Maximal degree in co-relation 5986. Up to 1092 conditions per place. [2024-06-27 18:52:45,643 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 103 selfloop transitions, 23 changer transitions 0/131 dead transitions. [2024-06-27 18:52:45,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 131 transitions, 1180 flow [2024-06-27 18:52:45,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:52:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:52:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-27 18:52:45,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2024-06-27 18:52:45,644 INFO L175 Difference]: Start difference. First operand has 103 places, 94 transitions, 808 flow. Second operand 7 states and 128 transitions. [2024-06-27 18:52:45,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 131 transitions, 1180 flow [2024-06-27 18:52:45,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 131 transitions, 1122 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-27 18:52:45,658 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 836 flow [2024-06-27 18:52:45,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=836, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2024-06-27 18:52:45,658 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 66 predicate places. [2024-06-27 18:52:45,658 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 836 flow [2024-06-27 18:52:45,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:45,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:45,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:45,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 18:52:45,659 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:45,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:45,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1070346614, now seen corresponding path program 3 times [2024-06-27 18:52:45,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:45,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825571993] [2024-06-27 18:52:45,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:45,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:48,026 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 18:52:48,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:48,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825571993] [2024-06-27 18:52:48,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825571993] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:48,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:48,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:48,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872389965] [2024-06-27 18:52:48,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:48,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:48,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:48,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:48,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:48,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:48,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 836 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:48,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:48,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:48,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:48,757 INFO L124 PetriNetUnfolderBase]: 803/1442 cut-off events. [2024-06-27 18:52:48,757 INFO L125 PetriNetUnfolderBase]: For 7724/7726 co-relation queries the response was YES. [2024-06-27 18:52:48,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6234 conditions, 1442 events. 803/1442 cut-off events. For 7724/7726 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7876 event pairs, 98 based on Foata normal form. 4/1445 useless extension candidates. Maximal degree in co-relation 6185. Up to 1080 conditions per place. [2024-06-27 18:52:48,765 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 105 selfloop transitions, 21 changer transitions 0/131 dead transitions. [2024-06-27 18:52:48,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 131 transitions, 1228 flow [2024-06-27 18:52:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:52:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:52:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-27 18:52:48,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 18:52:48,766 INFO L175 Difference]: Start difference. First operand has 103 places, 96 transitions, 836 flow. Second operand 7 states and 126 transitions. [2024-06-27 18:52:48,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 131 transitions, 1228 flow [2024-06-27 18:52:48,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 131 transitions, 1154 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 18:52:48,782 INFO L231 Difference]: Finished difference. Result has 105 places, 97 transitions, 826 flow [2024-06-27 18:52:48,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=826, PETRI_PLACES=105, PETRI_TRANSITIONS=97} [2024-06-27 18:52:48,782 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 68 predicate places. [2024-06-27 18:52:48,782 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 97 transitions, 826 flow [2024-06-27 18:52:48,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:48,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:48,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:48,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 18:52:48,783 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:48,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:48,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1610908608, now seen corresponding path program 4 times [2024-06-27 18:52:48,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:48,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571095068] [2024-06-27 18:52:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:50,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:50,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571095068] [2024-06-27 18:52:50,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571095068] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:50,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:50,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:50,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690083170] [2024-06-27 18:52:50,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:50,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:50,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:50,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:50,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:50,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:50,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 97 transitions, 826 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:50,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:50,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:50,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:51,726 INFO L124 PetriNetUnfolderBase]: 804/1449 cut-off events. [2024-06-27 18:52:51,726 INFO L125 PetriNetUnfolderBase]: For 6872/6874 co-relation queries the response was YES. [2024-06-27 18:52:51,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6159 conditions, 1449 events. 804/1449 cut-off events. For 6872/6874 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7892 event pairs, 99 based on Foata normal form. 4/1452 useless extension candidates. Maximal degree in co-relation 6109. Up to 949 conditions per place. [2024-06-27 18:52:51,734 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 103 selfloop transitions, 25 changer transitions 0/133 dead transitions. [2024-06-27 18:52:51,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 133 transitions, 1236 flow [2024-06-27 18:52:51,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:52:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:52:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-27 18:52:51,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2024-06-27 18:52:51,735 INFO L175 Difference]: Start difference. First operand has 105 places, 97 transitions, 826 flow. Second operand 7 states and 124 transitions. [2024-06-27 18:52:51,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 133 transitions, 1236 flow [2024-06-27 18:52:51,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 133 transitions, 1192 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-27 18:52:51,750 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 847 flow [2024-06-27 18:52:51,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=847, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2024-06-27 18:52:51,750 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 70 predicate places. [2024-06-27 18:52:51,750 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 847 flow [2024-06-27 18:52:51,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:51,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:51,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:52:51,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 18:52:51,751 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:51,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:51,751 INFO L85 PathProgramCache]: Analyzing trace with hash 853818037, now seen corresponding path program 1 times [2024-06-27 18:52:51,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:51,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331530676] [2024-06-27 18:52:51,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:51,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:51,814 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 18:52:51,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:51,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331530676] [2024-06-27 18:52:51,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331530676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:51,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:51,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:52:51,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142534151] [2024-06-27 18:52:51,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:51,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:52:51,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:51,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:52:51,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:52:51,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 18:52:51,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 847 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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 18:52:51,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:51,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 18:52:51,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:51,975 INFO L124 PetriNetUnfolderBase]: 439/869 cut-off events. [2024-06-27 18:52:51,975 INFO L125 PetriNetUnfolderBase]: For 4877/4930 co-relation queries the response was YES. [2024-06-27 18:52:51,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3428 conditions, 869 events. 439/869 cut-off events. For 4877/4930 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4604 event pairs, 87 based on Foata normal form. 71/909 useless extension candidates. Maximal degree in co-relation 3378. Up to 327 conditions per place. [2024-06-27 18:52:51,979 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 52 selfloop transitions, 22 changer transitions 1/96 dead transitions. [2024-06-27 18:52:51,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 96 transitions, 904 flow [2024-06-27 18:52:51,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:52:51,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:52:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-06-27 18:52:51,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2024-06-27 18:52:51,979 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 847 flow. Second operand 4 states and 86 transitions. [2024-06-27 18:52:51,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 96 transitions, 904 flow [2024-06-27 18:52:51,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 766 flow, removed 18 selfloop flow, removed 14 redundant places. [2024-06-27 18:52:51,988 INFO L231 Difference]: Finished difference. Result has 98 places, 78 transitions, 629 flow [2024-06-27 18:52:51,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=629, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2024-06-27 18:52:51,989 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 61 predicate places. [2024-06-27 18:52:51,989 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 629 flow [2024-06-27 18:52:51,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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 18:52:51,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:51,989 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 18:52:51,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 18:52:51,989 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:51,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:51,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1058492536, now seen corresponding path program 1 times [2024-06-27 18:52:51,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:51,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367249280] [2024-06-27 18:52:51,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:51,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:53,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:52:53,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:53,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367249280] [2024-06-27 18:52:53,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367249280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:53,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:53,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:53,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340851933] [2024-06-27 18:52:53,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:53,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:53,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:53,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:53,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:53,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:53,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 629 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:53,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:53,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:53,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:54,860 INFO L124 PetriNetUnfolderBase]: 843/1588 cut-off events. [2024-06-27 18:52:54,861 INFO L125 PetriNetUnfolderBase]: For 9050/9052 co-relation queries the response was YES. [2024-06-27 18:52:54,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6159 conditions, 1588 events. 843/1588 cut-off events. For 9050/9052 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8768 event pairs, 240 based on Foata normal form. 10/1597 useless extension candidates. Maximal degree in co-relation 6114. Up to 755 conditions per place. [2024-06-27 18:52:54,869 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 109 selfloop transitions, 76 changer transitions 0/190 dead transitions. [2024-06-27 18:52:54,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 190 transitions, 1783 flow [2024-06-27 18:52:54,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 18:52:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 18:52:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 215 transitions. [2024-06-27 18:52:54,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725274725274725 [2024-06-27 18:52:54,870 INFO L175 Difference]: Start difference. First operand has 98 places, 78 transitions, 629 flow. Second operand 13 states and 215 transitions. [2024-06-27 18:52:54,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 190 transitions, 1783 flow [2024-06-27 18:52:54,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 190 transitions, 1572 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-27 18:52:54,890 INFO L231 Difference]: Finished difference. Result has 111 places, 128 transitions, 1230 flow [2024-06-27 18:52:54,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1230, PETRI_PLACES=111, PETRI_TRANSITIONS=128} [2024-06-27 18:52:54,891 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 74 predicate places. [2024-06-27 18:52:54,891 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 128 transitions, 1230 flow [2024-06-27 18:52:54,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:54,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:54,891 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 18:52:54,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 18:52:54,892 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:54,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:54,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1951640294, now seen corresponding path program 2 times [2024-06-27 18:52:54,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:54,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604125805] [2024-06-27 18:52:54,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:54,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:56,920 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 18:52:56,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:56,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604125805] [2024-06-27 18:52:56,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604125805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:56,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:56,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:56,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71898225] [2024-06-27 18:52:56,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:56,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:56,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:56,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:56,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:56,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:56,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 128 transitions, 1230 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:56,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:56,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:56,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:52:57,689 INFO L124 PetriNetUnfolderBase]: 994/1866 cut-off events. [2024-06-27 18:52:57,690 INFO L125 PetriNetUnfolderBase]: For 11847/11849 co-relation queries the response was YES. [2024-06-27 18:52:57,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7421 conditions, 1866 events. 994/1866 cut-off events. For 11847/11849 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10740 event pairs, 250 based on Foata normal form. 10/1875 useless extension candidates. Maximal degree in co-relation 7372. Up to 647 conditions per place. [2024-06-27 18:52:57,699 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 99 selfloop transitions, 83 changer transitions 0/187 dead transitions. [2024-06-27 18:52:57,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 187 transitions, 1890 flow [2024-06-27 18:52:57,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:52:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:52:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2024-06-27 18:52:57,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2024-06-27 18:52:57,701 INFO L175 Difference]: Start difference. First operand has 111 places, 128 transitions, 1230 flow. Second operand 11 states and 182 transitions. [2024-06-27 18:52:57,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 187 transitions, 1890 flow [2024-06-27 18:52:57,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 187 transitions, 1838 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 18:52:57,723 INFO L231 Difference]: Finished difference. Result has 121 places, 133 transitions, 1466 flow [2024-06-27 18:52:57,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1466, PETRI_PLACES=121, PETRI_TRANSITIONS=133} [2024-06-27 18:52:57,724 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 84 predicate places. [2024-06-27 18:52:57,724 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 133 transitions, 1466 flow [2024-06-27 18:52:57,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:57,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:52:57,724 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 18:52:57,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 18:52:57,724 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:52:57,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:52:57,725 INFO L85 PathProgramCache]: Analyzing trace with hash -245455730, now seen corresponding path program 3 times [2024-06-27 18:52:57,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:52:57,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130858068] [2024-06-27 18:52:57,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:52:57,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:52:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:52:59,855 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 18:52:59,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:52:59,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130858068] [2024-06-27 18:52:59,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130858068] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:52:59,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:52:59,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:52:59,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227391200] [2024-06-27 18:52:59,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:52:59,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:52:59,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:52:59,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:52:59,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:52:59,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:52:59,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 133 transitions, 1466 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:52:59,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:52:59,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:52:59,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:00,944 INFO L124 PetriNetUnfolderBase]: 1296/2406 cut-off events. [2024-06-27 18:53:00,944 INFO L125 PetriNetUnfolderBase]: For 22030/22032 co-relation queries the response was YES. [2024-06-27 18:53:00,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9852 conditions, 2406 events. 1296/2406 cut-off events. For 22030/22032 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 14820 event pairs, 491 based on Foata normal form. 18/2423 useless extension candidates. Maximal degree in co-relation 9800. Up to 1436 conditions per place. [2024-06-27 18:53:00,959 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 105 selfloop transitions, 80 changer transitions 0/190 dead transitions. [2024-06-27 18:53:00,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 190 transitions, 2136 flow [2024-06-27 18:53:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:53:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:53:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 190 transitions. [2024-06-27 18:53:00,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-06-27 18:53:00,961 INFO L175 Difference]: Start difference. First operand has 121 places, 133 transitions, 1466 flow. Second operand 12 states and 190 transitions. [2024-06-27 18:53:00,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 190 transitions, 2136 flow [2024-06-27 18:53:00,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 190 transitions, 2008 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-27 18:53:00,996 INFO L231 Difference]: Finished difference. Result has 128 places, 138 transitions, 1591 flow [2024-06-27 18:53:00,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1591, PETRI_PLACES=128, PETRI_TRANSITIONS=138} [2024-06-27 18:53:00,997 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 91 predicate places. [2024-06-27 18:53:00,997 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 138 transitions, 1591 flow [2024-06-27 18:53:00,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:00,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:00,998 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 18:53:00,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 18:53:00,998 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:53:00,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:00,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2040353924, now seen corresponding path program 4 times [2024-06-27 18:53:00,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:00,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64403539] [2024-06-27 18:53:00,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:00,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:53:03,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:03,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64403539] [2024-06-27 18:53:03,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64403539] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:03,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:03,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:53:03,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967511034] [2024-06-27 18:53:03,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:03,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:53:03,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:03,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:53:03,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:53:03,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:53:03,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 138 transitions, 1591 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:03,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:03,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:53:03,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:04,428 INFO L124 PetriNetUnfolderBase]: 1270/2360 cut-off events. [2024-06-27 18:53:04,428 INFO L125 PetriNetUnfolderBase]: For 19678/19680 co-relation queries the response was YES. [2024-06-27 18:53:04,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9534 conditions, 2360 events. 1270/2360 cut-off events. For 19678/19680 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14378 event pairs, 570 based on Foata normal form. 22/2381 useless extension candidates. Maximal degree in co-relation 9479. Up to 1701 conditions per place. [2024-06-27 18:53:04,447 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 100 selfloop transitions, 77 changer transitions 0/182 dead transitions. [2024-06-27 18:53:04,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 182 transitions, 2138 flow [2024-06-27 18:53:04,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:53:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:53:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2024-06-27 18:53:04,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-06-27 18:53:04,449 INFO L175 Difference]: Start difference. First operand has 128 places, 138 transitions, 1591 flow. Second operand 11 states and 170 transitions. [2024-06-27 18:53:04,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 182 transitions, 2138 flow [2024-06-27 18:53:04,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 182 transitions, 1996 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-27 18:53:04,492 INFO L231 Difference]: Finished difference. Result has 131 places, 140 transitions, 1653 flow [2024-06-27 18:53:04,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1653, PETRI_PLACES=131, PETRI_TRANSITIONS=140} [2024-06-27 18:53:04,493 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 94 predicate places. [2024-06-27 18:53:04,493 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 140 transitions, 1653 flow [2024-06-27 18:53:04,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:04,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:04,493 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 18:53:04,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 18:53:04,493 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:53:04,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:04,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1319412898, now seen corresponding path program 5 times [2024-06-27 18:53:04,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:04,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552257731] [2024-06-27 18:53:04,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:04,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:07,278 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 18:53:07,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:07,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552257731] [2024-06-27 18:53:07,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552257731] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:07,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:07,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:53:07,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973378902] [2024-06-27 18:53:07,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:07,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:53:07,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:07,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:53:07,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:53:07,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:53:07,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 140 transitions, 1653 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:07,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:07,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:53:07,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:08,328 INFO L124 PetriNetUnfolderBase]: 1426/2632 cut-off events. [2024-06-27 18:53:08,329 INFO L125 PetriNetUnfolderBase]: For 21045/21047 co-relation queries the response was YES. [2024-06-27 18:53:08,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10504 conditions, 2632 events. 1426/2632 cut-off events. For 21045/21047 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 16486 event pairs, 674 based on Foata normal form. 22/2653 useless extension candidates. Maximal degree in co-relation 10447. Up to 2091 conditions per place. [2024-06-27 18:53:08,344 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 135 selfloop transitions, 44 changer transitions 0/184 dead transitions. [2024-06-27 18:53:08,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 184 transitions, 2208 flow [2024-06-27 18:53:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:53:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:53:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 167 transitions. [2024-06-27 18:53:08,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43376623376623374 [2024-06-27 18:53:08,346 INFO L175 Difference]: Start difference. First operand has 131 places, 140 transitions, 1653 flow. Second operand 11 states and 167 transitions. [2024-06-27 18:53:08,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 184 transitions, 2208 flow [2024-06-27 18:53:08,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 184 transitions, 2060 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-27 18:53:08,384 INFO L231 Difference]: Finished difference. Result has 133 places, 142 transitions, 1641 flow [2024-06-27 18:53:08,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1641, PETRI_PLACES=133, PETRI_TRANSITIONS=142} [2024-06-27 18:53:08,385 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 96 predicate places. [2024-06-27 18:53:08,385 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 142 transitions, 1641 flow [2024-06-27 18:53:08,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:08,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:08,386 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 18:53:08,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 18:53:08,386 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:53:08,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:08,386 INFO L85 PathProgramCache]: Analyzing trace with hash -966396756, now seen corresponding path program 6 times [2024-06-27 18:53:08,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:08,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188655322] [2024-06-27 18:53:08,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:08,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:10,695 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 18:53:10,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:10,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188655322] [2024-06-27 18:53:10,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188655322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:10,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:10,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:53:10,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42544953] [2024-06-27 18:53:10,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:10,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:53:10,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:10,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:53:10,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:53:10,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:53:10,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 142 transitions, 1641 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:10,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:10,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:53:10,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:11,846 INFO L124 PetriNetUnfolderBase]: 1689/3101 cut-off events. [2024-06-27 18:53:11,846 INFO L125 PetriNetUnfolderBase]: For 25380/25382 co-relation queries the response was YES. [2024-06-27 18:53:11,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12263 conditions, 3101 events. 1689/3101 cut-off events. For 25380/25382 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 20238 event pairs, 741 based on Foata normal form. 18/3118 useless extension candidates. Maximal degree in co-relation 12205. Up to 1974 conditions per place. [2024-06-27 18:53:11,865 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 144 selfloop transitions, 46 changer transitions 0/195 dead transitions. [2024-06-27 18:53:11,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 195 transitions, 2331 flow [2024-06-27 18:53:11,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:53:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:53:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2024-06-27 18:53:11,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45194805194805193 [2024-06-27 18:53:11,886 INFO L175 Difference]: Start difference. First operand has 133 places, 142 transitions, 1641 flow. Second operand 11 states and 174 transitions. [2024-06-27 18:53:11,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 195 transitions, 2331 flow [2024-06-27 18:53:11,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 195 transitions, 2235 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-27 18:53:11,936 INFO L231 Difference]: Finished difference. Result has 136 places, 147 transitions, 1752 flow [2024-06-27 18:53:11,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1752, PETRI_PLACES=136, PETRI_TRANSITIONS=147} [2024-06-27 18:53:11,937 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 99 predicate places. [2024-06-27 18:53:11,937 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 147 transitions, 1752 flow [2024-06-27 18:53:11,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:11,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:11,937 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 18:53:11,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 18:53:11,937 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:53:11,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:11,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1324775278, now seen corresponding path program 7 times [2024-06-27 18:53:11,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:11,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835694889] [2024-06-27 18:53:11,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:11,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:14,135 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 18:53:14,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:14,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835694889] [2024-06-27 18:53:14,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835694889] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:14,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:14,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:53:14,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198433479] [2024-06-27 18:53:14,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:14,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:53:14,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:14,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:53:14,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:53:14,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:53:14,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 147 transitions, 1752 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:14,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:14,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:53:14,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:15,102 INFO L124 PetriNetUnfolderBase]: 1663/3055 cut-off events. [2024-06-27 18:53:15,103 INFO L125 PetriNetUnfolderBase]: For 22455/22457 co-relation queries the response was YES. [2024-06-27 18:53:15,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11803 conditions, 3055 events. 1663/3055 cut-off events. For 22455/22457 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 19804 event pairs, 838 based on Foata normal form. 22/3076 useless extension candidates. Maximal degree in co-relation 11743. Up to 2514 conditions per place. [2024-06-27 18:53:15,124 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 144 selfloop transitions, 44 changer transitions 0/193 dead transitions. [2024-06-27 18:53:15,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 193 transitions, 2343 flow [2024-06-27 18:53:15,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:53:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:53:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 178 transitions. [2024-06-27 18:53:15,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2024-06-27 18:53:15,126 INFO L175 Difference]: Start difference. First operand has 136 places, 147 transitions, 1752 flow. Second operand 12 states and 178 transitions. [2024-06-27 18:53:15,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 193 transitions, 2343 flow [2024-06-27 18:53:15,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 193 transitions, 2234 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-27 18:53:15,176 INFO L231 Difference]: Finished difference. Result has 141 places, 149 transitions, 1789 flow [2024-06-27 18:53:15,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1789, PETRI_PLACES=141, PETRI_TRANSITIONS=149} [2024-06-27 18:53:15,177 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 104 predicate places. [2024-06-27 18:53:15,177 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 149 transitions, 1789 flow [2024-06-27 18:53:15,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:15,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:15,177 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 18:53:15,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 18:53:15,177 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:53:15,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:15,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2025537052, now seen corresponding path program 1 times [2024-06-27 18:53:15,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:15,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654891771] [2024-06-27 18:53:15,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:15,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:18,439 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 18:53:18,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:18,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654891771] [2024-06-27 18:53:18,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654891771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:18,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:18,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:53:18,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343947659] [2024-06-27 18:53:18,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:18,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:53:18,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:18,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:53:18,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:53:18,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:53:18,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 149 transitions, 1789 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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 18:53:18,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:18,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:53:18,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:19,743 INFO L124 PetriNetUnfolderBase]: 1705/3145 cut-off events. [2024-06-27 18:53:19,743 INFO L125 PetriNetUnfolderBase]: For 17797/17799 co-relation queries the response was YES. [2024-06-27 18:53:19,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11992 conditions, 3145 events. 1705/3145 cut-off events. For 17797/17799 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 20633 event pairs, 813 based on Foata normal form. 8/3152 useless extension candidates. Maximal degree in co-relation 11930. Up to 2209 conditions per place. [2024-06-27 18:53:19,764 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 144 selfloop transitions, 49 changer transitions 0/198 dead transitions. [2024-06-27 18:53:19,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 198 transitions, 2373 flow [2024-06-27 18:53:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 18:53:19,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 18:53:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 183 transitions. [2024-06-27 18:53:19,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2024-06-27 18:53:19,767 INFO L175 Difference]: Start difference. First operand has 141 places, 149 transitions, 1789 flow. Second operand 12 states and 183 transitions. [2024-06-27 18:53:19,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 198 transitions, 2373 flow [2024-06-27 18:53:19,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 198 transitions, 2287 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-27 18:53:19,817 INFO L231 Difference]: Finished difference. Result has 143 places, 150 transitions, 1823 flow [2024-06-27 18:53:19,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1703, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1823, PETRI_PLACES=143, PETRI_TRANSITIONS=150} [2024-06-27 18:53:19,817 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 106 predicate places. [2024-06-27 18:53:19,817 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 150 transitions, 1823 flow [2024-06-27 18:53:19,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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 18:53:19,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:19,818 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 18:53:19,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 18:53:19,818 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:53:19,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:19,819 INFO L85 PathProgramCache]: Analyzing trace with hash 984840150, now seen corresponding path program 8 times [2024-06-27 18:53:19,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:19,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031621256] [2024-06-27 18:53:19,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:19,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:22,183 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 18:53:22,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:22,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031621256] [2024-06-27 18:53:22,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031621256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:22,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:22,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:53:22,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953299152] [2024-06-27 18:53:22,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:22,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:53:22,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:22,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:53:22,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:53:22,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:53:22,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 150 transitions, 1823 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:22,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:22,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:53:22,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:23,406 INFO L124 PetriNetUnfolderBase]: 1835/3375 cut-off events. [2024-06-27 18:53:23,406 INFO L125 PetriNetUnfolderBase]: For 21045/21047 co-relation queries the response was YES. [2024-06-27 18:53:23,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12850 conditions, 3375 events. 1835/3375 cut-off events. For 21045/21047 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 22486 event pairs, 929 based on Foata normal form. 12/3386 useless extension candidates. Maximal degree in co-relation 12787. Up to 2534 conditions per place. [2024-06-27 18:53:23,428 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 117 selfloop transitions, 67 changer transitions 0/189 dead transitions. [2024-06-27 18:53:23,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 189 transitions, 2368 flow [2024-06-27 18:53:23,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:53:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:53:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-27 18:53:23,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634920634920635 [2024-06-27 18:53:23,430 INFO L175 Difference]: Start difference. First operand has 143 places, 150 transitions, 1823 flow. Second operand 9 states and 146 transitions. [2024-06-27 18:53:23,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 189 transitions, 2368 flow [2024-06-27 18:53:23,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 189 transitions, 2258 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-27 18:53:23,480 INFO L231 Difference]: Finished difference. Result has 142 places, 152 transitions, 1907 flow [2024-06-27 18:53:23,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1713, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1907, PETRI_PLACES=142, PETRI_TRANSITIONS=152} [2024-06-27 18:53:23,481 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 105 predicate places. [2024-06-27 18:53:23,481 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 152 transitions, 1907 flow [2024-06-27 18:53:23,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:23,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:23,481 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 18:53:23,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 18:53:23,481 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:53:23,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:23,482 INFO L85 PathProgramCache]: Analyzing trace with hash 979477770, now seen corresponding path program 9 times [2024-06-27 18:53:23,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:23,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073514796] [2024-06-27 18:53:23,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:23,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:25,700 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 18:53:25,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:25,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073514796] [2024-06-27 18:53:25,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073514796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:25,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:25,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:53:25,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427763566] [2024-06-27 18:53:25,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:25,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:53:25,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:25,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:53:25,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:53:25,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:53:25,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 152 transitions, 1907 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:25,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:25,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:53:25,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:26,890 INFO L124 PetriNetUnfolderBase]: 1932/3550 cut-off events. [2024-06-27 18:53:26,890 INFO L125 PetriNetUnfolderBase]: For 22289/22291 co-relation queries the response was YES. [2024-06-27 18:53:26,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13473 conditions, 3550 events. 1932/3550 cut-off events. For 22289/22291 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 23882 event pairs, 1009 based on Foata normal form. 12/3561 useless extension candidates. Maximal degree in co-relation 13409. Up to 2709 conditions per place. [2024-06-27 18:53:26,913 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 123 selfloop transitions, 67 changer transitions 0/195 dead transitions. [2024-06-27 18:53:26,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 195 transitions, 2484 flow [2024-06-27 18:53:26,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:53:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:53:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-27 18:53:26,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4514285714285714 [2024-06-27 18:53:26,915 INFO L175 Difference]: Start difference. First operand has 142 places, 152 transitions, 1907 flow. Second operand 10 states and 158 transitions. [2024-06-27 18:53:26,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 195 transitions, 2484 flow [2024-06-27 18:53:26,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 195 transitions, 2350 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-27 18:53:26,966 INFO L231 Difference]: Finished difference. Result has 145 places, 154 transitions, 1971 flow [2024-06-27 18:53:26,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1773, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1971, PETRI_PLACES=145, PETRI_TRANSITIONS=154} [2024-06-27 18:53:26,967 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 108 predicate places. [2024-06-27 18:53:26,967 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 154 transitions, 1971 flow [2024-06-27 18:53:26,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:26,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:26,968 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 18:53:26,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 18:53:26,968 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:53:26,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:26,968 INFO L85 PathProgramCache]: Analyzing trace with hash 979329900, now seen corresponding path program 10 times [2024-06-27 18:53:26,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:26,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80805814] [2024-06-27 18:53:26,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:26,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:53:28,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:28,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80805814] [2024-06-27 18:53:28,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80805814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:28,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:28,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:53:28,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659623975] [2024-06-27 18:53:28,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:28,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:53:28,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:28,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:53:28,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:53:28,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:53:28,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 154 transitions, 1971 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:28,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:28,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:53:28,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:30,120 INFO L124 PetriNetUnfolderBase]: 1922/3528 cut-off events. [2024-06-27 18:53:30,120 INFO L125 PetriNetUnfolderBase]: For 19046/19048 co-relation queries the response was YES. [2024-06-27 18:53:30,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13234 conditions, 3528 events. 1922/3528 cut-off events. For 19046/19048 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 23694 event pairs, 637 based on Foata normal form. 10/3537 useless extension candidates. Maximal degree in co-relation 13169. Up to 1644 conditions per place. [2024-06-27 18:53:30,145 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 115 selfloop transitions, 83 changer transitions 0/203 dead transitions. [2024-06-27 18:53:30,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 203 transitions, 2589 flow [2024-06-27 18:53:30,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:53:30,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:53:30,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-06-27 18:53:30,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-27 18:53:30,147 INFO L175 Difference]: Start difference. First operand has 145 places, 154 transitions, 1971 flow. Second operand 10 states and 165 transitions. [2024-06-27 18:53:30,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 203 transitions, 2589 flow [2024-06-27 18:53:30,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 203 transitions, 2447 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-27 18:53:30,205 INFO L231 Difference]: Finished difference. Result has 148 places, 157 transitions, 2108 flow [2024-06-27 18:53:30,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1833, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2108, PETRI_PLACES=148, PETRI_TRANSITIONS=157} [2024-06-27 18:53:30,205 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 111 predicate places. [2024-06-27 18:53:30,205 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 157 transitions, 2108 flow [2024-06-27 18:53:30,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:30,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:30,206 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 18:53:30,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 18:53:30,206 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:53:30,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:30,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1867351758, now seen corresponding path program 11 times [2024-06-27 18:53:30,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:30,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910005474] [2024-06-27 18:53:30,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:30,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:32,432 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 18:53:32,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:32,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910005474] [2024-06-27 18:53:32,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910005474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:32,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:32,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 18:53:32,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061681142] [2024-06-27 18:53:32,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:32,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 18:53:32,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:32,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 18:53:32,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:53:32,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:53:32,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 157 transitions, 2108 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:32,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:32,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:53:32,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:33,769 INFO L124 PetriNetUnfolderBase]: 1974/3657 cut-off events. [2024-06-27 18:53:33,769 INFO L125 PetriNetUnfolderBase]: For 20299/20303 co-relation queries the response was YES. [2024-06-27 18:53:33,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13753 conditions, 3657 events. 1974/3657 cut-off events. For 20299/20303 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 24875 event pairs, 1028 based on Foata normal form. 14/3670 useless extension candidates. Maximal degree in co-relation 13686. Up to 3078 conditions per place. [2024-06-27 18:53:33,792 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 125 selfloop transitions, 67 changer transitions 0/197 dead transitions. [2024-06-27 18:53:33,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 197 transitions, 2655 flow [2024-06-27 18:53:33,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:53:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:53:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2024-06-27 18:53:33,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44857142857142857 [2024-06-27 18:53:33,793 INFO L175 Difference]: Start difference. First operand has 148 places, 157 transitions, 2108 flow. Second operand 10 states and 157 transitions. [2024-06-27 18:53:33,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 197 transitions, 2655 flow [2024-06-27 18:53:33,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 197 transitions, 2398 flow, removed 16 selfloop flow, removed 10 redundant places. [2024-06-27 18:53:33,842 INFO L231 Difference]: Finished difference. Result has 148 places, 157 transitions, 1989 flow [2024-06-27 18:53:33,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1851, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1989, PETRI_PLACES=148, PETRI_TRANSITIONS=157} [2024-06-27 18:53:33,842 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 111 predicate places. [2024-06-27 18:53:33,842 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 157 transitions, 1989 flow [2024-06-27 18:53:33,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:33,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:33,843 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 18:53:33,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 18:53:33,843 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:53:33,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:33,843 INFO L85 PathProgramCache]: Analyzing trace with hash -342137614, now seen corresponding path program 2 times [2024-06-27 18:53:33,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:33,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675594097] [2024-06-27 18:53:33,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:33,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:36,365 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 18:53:36,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:36,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675594097] [2024-06-27 18:53:36,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675594097] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:36,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:36,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:53:36,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226411257] [2024-06-27 18:53:36,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:36,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:53:36,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:36,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:53:36,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:53:36,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:53:36,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 157 transitions, 1989 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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 18:53:36,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:36,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:53:36,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:37,684 INFO L124 PetriNetUnfolderBase]: 2016/3747 cut-off events. [2024-06-27 18:53:37,685 INFO L125 PetriNetUnfolderBase]: For 16873/16875 co-relation queries the response was YES. [2024-06-27 18:53:37,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13563 conditions, 3747 events. 2016/3747 cut-off events. For 16873/16875 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 25686 event pairs, 985 based on Foata normal form. 8/3754 useless extension candidates. Maximal degree in co-relation 13497. Up to 2161 conditions per place. [2024-06-27 18:53:37,712 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 121 selfloop transitions, 73 changer transitions 0/199 dead transitions. [2024-06-27 18:53:37,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 199 transitions, 2545 flow [2024-06-27 18:53:37,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:53:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:53:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-27 18:53:37,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793650793650794 [2024-06-27 18:53:37,714 INFO L175 Difference]: Start difference. First operand has 148 places, 157 transitions, 1989 flow. Second operand 9 states and 151 transitions. [2024-06-27 18:53:37,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 199 transitions, 2545 flow [2024-06-27 18:53:37,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 199 transitions, 2407 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-27 18:53:37,776 INFO L231 Difference]: Finished difference. Result has 149 places, 158 transitions, 2023 flow [2024-06-27 18:53:37,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1853, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2023, PETRI_PLACES=149, PETRI_TRANSITIONS=158} [2024-06-27 18:53:37,777 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 112 predicate places. [2024-06-27 18:53:37,777 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 158 transitions, 2023 flow [2024-06-27 18:53:37,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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 18:53:37,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:37,778 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 18:53:37,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 18:53:37,778 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:53:37,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:37,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1867136556, now seen corresponding path program 3 times [2024-06-27 18:53:37,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:37,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298668549] [2024-06-27 18:53:37,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:37,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:53:40,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:40,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298668549] [2024-06-27 18:53:40,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298668549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:40,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:40,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:53:40,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932855650] [2024-06-27 18:53:40,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:40,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:53:40,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:40,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:53:40,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:53:40,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:53:40,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 158 transitions, 2023 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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 18:53:40,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:40,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:53:40,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:41,957 INFO L124 PetriNetUnfolderBase]: 2066/3857 cut-off events. [2024-06-27 18:53:41,957 INFO L125 PetriNetUnfolderBase]: For 18137/18141 co-relation queries the response was YES. [2024-06-27 18:53:41,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13980 conditions, 3857 events. 2066/3857 cut-off events. For 18137/18141 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 26787 event pairs, 1064 based on Foata normal form. 10/3866 useless extension candidates. Maximal degree in co-relation 13913. Up to 3115 conditions per place. [2024-06-27 18:53:41,984 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 135 selfloop transitions, 68 changer transitions 0/208 dead transitions. [2024-06-27 18:53:41,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 208 transitions, 2639 flow [2024-06-27 18:53:41,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 18:53:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 18:53:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 176 transitions. [2024-06-27 18:53:41,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-27 18:53:41,985 INFO L175 Difference]: Start difference. First operand has 149 places, 158 transitions, 2023 flow. Second operand 11 states and 176 transitions. [2024-06-27 18:53:41,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 208 transitions, 2639 flow [2024-06-27 18:53:42,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 208 transitions, 2475 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-27 18:53:42,043 INFO L231 Difference]: Finished difference. Result has 153 places, 158 transitions, 2002 flow [2024-06-27 18:53:42,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2002, PETRI_PLACES=153, PETRI_TRANSITIONS=158} [2024-06-27 18:53:42,044 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 116 predicate places. [2024-06-27 18:53:42,044 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 158 transitions, 2002 flow [2024-06-27 18:53:42,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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 18:53:42,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:42,045 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 18:53:42,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 18:53:42,045 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:53:42,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:42,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1601439276, now seen corresponding path program 4 times [2024-06-27 18:53:42,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:42,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016804479] [2024-06-27 18:53:42,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:42,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:44,487 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 18:53:44,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:44,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016804479] [2024-06-27 18:53:44,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016804479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:44,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:44,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 18:53:44,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957332093] [2024-06-27 18:53:44,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:44,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 18:53:44,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:44,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 18:53:44,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:53:44,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 18:53:44,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 158 transitions, 2002 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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 18:53:44,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:44,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 18:53:44,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:45,710 INFO L124 PetriNetUnfolderBase]: 2083/3926 cut-off events. [2024-06-27 18:53:45,710 INFO L125 PetriNetUnfolderBase]: For 14584/14588 co-relation queries the response was YES. [2024-06-27 18:53:45,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13828 conditions, 3926 events. 2083/3926 cut-off events. For 14584/14588 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 27306 event pairs, 1048 based on Foata normal form. 10/3935 useless extension candidates. Maximal degree in co-relation 13760. Up to 1701 conditions per place. [2024-06-27 18:53:45,740 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 134 selfloop transitions, 69 changer transitions 0/208 dead transitions. [2024-06-27 18:53:45,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 208 transitions, 2549 flow [2024-06-27 18:53:45,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:53:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:53:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-06-27 18:53:45,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-27 18:53:45,743 INFO L175 Difference]: Start difference. First operand has 153 places, 158 transitions, 2002 flow. Second operand 10 states and 165 transitions. [2024-06-27 18:53:45,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 208 transitions, 2549 flow [2024-06-27 18:53:45,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 208 transitions, 2248 flow, removed 7 selfloop flow, removed 29 redundant places. [2024-06-27 18:53:45,786 INFO L231 Difference]: Finished difference. Result has 132 places, 157 transitions, 1779 flow [2024-06-27 18:53:45,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1779, PETRI_PLACES=132, PETRI_TRANSITIONS=157} [2024-06-27 18:53:45,788 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 95 predicate places. [2024-06-27 18:53:45,788 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 157 transitions, 1779 flow [2024-06-27 18:53:45,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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 18:53:45,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:45,791 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 18:53:45,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 18:53:45,791 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:53:45,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:45,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1402181659, now seen corresponding path program 1 times [2024-06-27 18:53:45,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:45,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609909352] [2024-06-27 18:53:45,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:45,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:53:45,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 18:53:45,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:53:45,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609909352] [2024-06-27 18:53:45,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609909352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:53:45,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:53:45,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:53:45,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903712820] [2024-06-27 18:53:45,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:53:45,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:53:45,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:53:45,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:53:45,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:53:45,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 18:53:45,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 157 transitions, 1779 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:45,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:53:45,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 18:53:45,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:53:46,188 INFO L124 PetriNetUnfolderBase]: 1342/2736 cut-off events. [2024-06-27 18:53:46,189 INFO L125 PetriNetUnfolderBase]: For 6873/6908 co-relation queries the response was YES. [2024-06-27 18:53:46,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8941 conditions, 2736 events. 1342/2736 cut-off events. For 6873/6908 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19084 event pairs, 179 based on Foata normal form. 233/2909 useless extension candidates. Maximal degree in co-relation 8894. Up to 954 conditions per place. [2024-06-27 18:53:46,203 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 72 selfloop transitions, 54 changer transitions 1/153 dead transitions. [2024-06-27 18:53:46,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 153 transitions, 1902 flow [2024-06-27 18:53:46,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:53:46,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:53:46,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-06-27 18:53:46,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-27 18:53:46,204 INFO L175 Difference]: Start difference. First operand has 132 places, 157 transitions, 1779 flow. Second operand 5 states and 95 transitions. [2024-06-27 18:53:46,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 153 transitions, 1902 flow [2024-06-27 18:53:46,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 153 transitions, 1402 flow, removed 24 selfloop flow, removed 27 redundant places. [2024-06-27 18:53:46,218 INFO L231 Difference]: Finished difference. Result has 111 places, 139 transitions, 1274 flow [2024-06-27 18:53:46,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1274, PETRI_PLACES=111, PETRI_TRANSITIONS=139} [2024-06-27 18:53:46,219 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 74 predicate places. [2024-06-27 18:53:46,219 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 139 transitions, 1274 flow [2024-06-27 18:53:46,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:53:46,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:53:46,219 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 18:53:46,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 18:53:46,219 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:53:46,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:53:46,220 INFO L85 PathProgramCache]: Analyzing trace with hash 560416719, now seen corresponding path program 1 times [2024-06-27 18:53:46,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:53:46,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851479385] [2024-06-27 18:53:46,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:53:46,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:53:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 18:53:46,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 18:53:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 18:53:46,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 18:53:46,276 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 18:53:46,277 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-06-27 18:53:46,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-06-27 18:53:46,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-06-27 18:53:46,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-06-27 18:53:46,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-06-27 18:53:46,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 18:53:46,280 INFO L445 BasicCegarLoop]: Path program histogram: [11, 6, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:53:46,283 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 18:53:46,283 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 18:53:46,312 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:53:46,313 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:53:46,313 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:53:46,313 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:53:46,315 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:53:46,315 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:53:46,315 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:53:46,315 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 18:53:46,326 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-27 18:53:46,334 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 18:53:46,334 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 18:53:46,335 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 06:53:46 BasicIcfg [2024-06-27 18:53:46,335 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 18:53:46,335 INFO L158 Benchmark]: Toolchain (without parser) took 127469.37ms. Allocated memory was 127.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 68.4MB in the beginning and 1.0GB in the end (delta: -979.6MB). Peak memory consumption was 264.0MB. Max. memory is 16.1GB. [2024-06-27 18:53:46,335 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 18:53:46,335 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 127.9MB. Free memory is still 77.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 18:53:46,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 675.94ms. Allocated memory is still 127.9MB. Free memory was 68.4MB in the beginning and 78.4MB in the end (delta: -10.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-06-27 18:53:46,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.95ms. Allocated memory is still 127.9MB. Free memory was 78.4MB in the beginning and 75.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 18:53:46,336 INFO L158 Benchmark]: Boogie Preprocessor took 36.55ms. Allocated memory is still 127.9MB. Free memory was 75.6MB in the beginning and 72.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 18:53:46,336 INFO L158 Benchmark]: RCFGBuilder took 859.72ms. Allocated memory was 127.9MB in the beginning and 186.6MB in the end (delta: 58.7MB). Free memory was 72.1MB in the beginning and 102.0MB in the end (delta: -29.9MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2024-06-27 18:53:46,336 INFO L158 Benchmark]: TraceAbstraction took 125853.99ms. Allocated memory was 186.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 101.9MB in the beginning and 1.0GB in the end (delta: -946.1MB). Peak memory consumption was 237.8MB. Max. memory is 16.1GB. [2024-06-27 18:53:46,337 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 127.9MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.16ms. Allocated memory is still 127.9MB. Free memory is still 77.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 675.94ms. Allocated memory is still 127.9MB. Free memory was 68.4MB in the beginning and 78.4MB in the end (delta: -10.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.95ms. Allocated memory is still 127.9MB. Free memory was 78.4MB in the beginning and 75.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.55ms. Allocated memory is still 127.9MB. Free memory was 75.6MB in the beginning and 72.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 859.72ms. Allocated memory was 127.9MB in the beginning and 186.6MB in the end (delta: 58.7MB). Free memory was 72.1MB in the beginning and 102.0MB in the end (delta: -29.9MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * TraceAbstraction took 125853.99ms. Allocated memory was 186.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 101.9MB in the beginning and 1.0GB in the end (delta: -946.1MB). Peak memory consumption was 237.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1929; [L813] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] FCALL, FORK 0 pthread_create(&t1929, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L814] 0 pthread_t t1930; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] 0 //@ assert ((((((((((((((((((((((((((((((((!multithreaded || (y$r_buff1_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p0_EAX$w_buff1 == 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (y$w_buff1_used == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$mem_tmp == 0))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (y$w_buff1 == 0))) && (!multithreaded || ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1)))))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (y$w_buff0 == 0))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))); [L815] 0 y [L815] 0 y [L815] 0 __unbuffered_p0_EAX$read_delayed_var [L815] 0 __unbuffered_p0_EAX$read_delayed_var VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] FCALL, FORK 0 pthread_create(&t1930, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] 0 y [L815] 0 y [L815] 0 __unbuffered_p0_EAX$read_delayed_var [L815] 0 __unbuffered_p0_EAX$read_delayed_var [L816] 0 //@ assert ((((((((((((((((((((((((((((((((!multithreaded || (y$r_buff1_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p0_EAX$w_buff1 == 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (y$w_buff1_used == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$mem_tmp == 0))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (y$w_buff1 == 0))) && (!multithreaded || ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1)))))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (y$w_buff0 == 0))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))); [L816] 0 y [L816] 0 y [L816] 0 __unbuffered_p0_EAX$read_delayed_var [L816] 0 __unbuffered_p0_EAX$read_delayed_var VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] EXPR 1 \read(y) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L772] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L787] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 \read(y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L816] 0 y [L816] 0 y [L816] 0 __unbuffered_p0_EAX$read_delayed_var [L816] 0 __unbuffered_p0_EAX$read_delayed_var [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L832] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 815]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 815]: 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: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 5 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: 125.7s, OverallIterations: 44, TraceHistogramMax: 1, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 38.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2306 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2245 mSDsluCounter, 673 SdHoareTripleChecker+Invalid, 10.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 533 mSDsCounter, 670 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11374 IncrementalHoareTripleChecker+Invalid, 12044 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 670 mSolverCounterUnsat, 140 mSDtfsCounter, 11374 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 435 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 433 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 40.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2108occurred in iteration=38, InterpolantAutomatonStates: 358, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 86.1s InterpolantComputationTime, 676 NumberOfCodeBlocks, 676 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 69708 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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 18:53:46,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE