./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-inc-subseq.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b 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/weaver/popl20-more-inc-subseq.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-inc-subseq.wvr.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-dev-8857f20-m [2024-01-29 22:58:47,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:58:47,774 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:58:47,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:58:47,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:58:47,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:58:47,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:58:47,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:58:47,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:58:47,806 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:58:47,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:58:47,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:58:47,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:58:47,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:58:47,809 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:58:47,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:58:47,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:58:47,809 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:58:47,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:58:47,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:58:47,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:58:47,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:58:47,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:58:47,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:58:47,810 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:58:47,811 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:58:47,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:58:47,811 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:58:47,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:58:47,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:58:47,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:58:47,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:58:47,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:58:47,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:58:47,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:58:47,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:58:47,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:58:47,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:58:47,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:58:47,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:58:47,814 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:58:47,814 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:58:47,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:58:47,814 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-01-29 22:58:48,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:58:48,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:58:48,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:58:48,039 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:58:48,039 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:58:48,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-01-29 22:58:49,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:58:49,402 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:58:49,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-01-29 22:58:49,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6f82d1e/df7c87d9a612418da3ac731fd5d19339/FLAGbbc7d88a6 [2024-01-29 22:58:49,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6f82d1e/df7c87d9a612418da3ac731fd5d19339 [2024-01-29 22:58:49,458 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:58:49,459 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:58:49,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-inc-subseq.wvr.yml/witness.yml [2024-01-29 22:58:49,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:58:49,638 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:58:49,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:58:49,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:58:49,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:58:49,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:58:49" (1/2) ... [2024-01-29 22:58:49,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a8884c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:58:49, skipping insertion in model container [2024-01-29 22:58:49,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:58:49" (1/2) ... [2024-01-29 22:58:49,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@24c61baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:58:49, skipping insertion in model container [2024-01-29 22:58:49,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:58:49" (2/2) ... [2024-01-29 22:58:49,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a8884c2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:58:49, skipping insertion in model container [2024-01-29 22:58:49,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:58:49" (2/2) ... [2024-01-29 22:58:49,645 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:58:49,684 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:58:49,685 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (1 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:58:49,685 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] 1 <= i [2024-01-29 22:58:49,685 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] A == 0 [2024-01-29 22:58:49,686 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (A == 0) && (i == 0) [2024-01-29 22:58:49,686 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (A == 0) && (last == 0) [2024-01-29 22:58:49,686 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (A == 0) && (new == 0) [2024-01-29 22:58:49,686 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (A == 0) && (ok == (_Bool)1) [2024-01-29 22:58:49,686 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (A == 0) && (v_old == 0) [2024-01-29 22:58:49,686 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] (unsigned long )_argptr == 0UL [2024-01-29 22:58:49,686 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] 0 <= i [2024-01-29 22:58:49,687 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:58:49,687 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((0LL - (long long )end) + (long long )start >= 0LL) && (i == 0) [2024-01-29 22:58:49,687 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (((0LL - (long long )end) + (long long )start >= 0LL) && (i == 0)) && (new == 0) [2024-01-29 22:58:49,687 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (((0LL - (long long )end) + (long long )start >= 0LL) && (i == 0)) && (last == 0) [2024-01-29 22:58:49,687 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end - (long long )start >= 0LL) [2024-01-29 22:58:49,687 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((0LL - (long long )end) + (long long )start >= 0LL) && (queue == 0) [2024-01-29 22:58:49,687 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (((0LL - (long long )end) + (long long )start >= 0LL) && (i == 0)) && (v_old == 0) [2024-01-29 22:58:49,687 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-29 22:58:49,688 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((0LL - (long long )end) + (long long )start >= 0LL) && ((0LL - (long long )end) - (long long )start >= 0LL) [2024-01-29 22:58:49,688 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL) [2024-01-29 22:58:49,688 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (((0LL - (long long )end) + (long long )start >= 0LL) && (i == 0)) && (end == 0) [2024-01-29 22:58:49,688 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (((0LL - (long long )end) + (long long )start >= 0LL) && (i == 0)) && (start == 0) [2024-01-29 22:58:49,689 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((0LL - (long long )end) + (long long )start >= 0LL) && (A == 0) [2024-01-29 22:58:49,689 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (((0LL - (long long )end) + (long long )start >= 0LL) && (i == 0)) && (ok == (_Bool)1) [2024-01-29 22:58:49,689 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-29 22:58:49,689 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] ((A == 0) && (i == 0)) && (ok == (_Bool)1) [2024-01-29 22:58:49,689 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] (A == 0) && (i == 0) [2024-01-29 22:58:49,689 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] ((A == 0) && (i == 0)) && (new == 0) [2024-01-29 22:58:49,689 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] ((A == 0) && (i == 0)) && (last == 0) [2024-01-29 22:58:49,689 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] ((A == 0) && (i == 0)) && (v_old == 0) [2024-01-29 22:58:49,690 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] A == 0 [2024-01-29 22:58:49,690 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] queue == 0 [2024-01-29 22:58:49,690 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (queue == 0) && (A == 0) [2024-01-29 22:58:49,690 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (queue == 0) && (v_old == 0) [2024-01-29 22:58:49,690 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (queue == 0) && (i == 0) [2024-01-29 22:58:49,691 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (queue == 0) && (last == 0) [2024-01-29 22:58:49,691 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (queue == 0) && (end == 0) [2024-01-29 22:58:49,691 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (queue == 0) && (ok == (_Bool)1) [2024-01-29 22:58:49,692 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (queue == 0) && (new == 0) [2024-01-29 22:58:49,692 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L56] (unsigned long )_argptr == 0UL [2024-01-29 22:58:49,692 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-29 22:58:49,692 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-29 22:58:49,693 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] (A == 0) && (last == 0) [2024-01-29 22:58:49,693 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] ((A == 0) && (last == 0)) && (v_old == 0) [2024-01-29 22:58:49,693 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] ((A == 0) && (last == 0)) && (ok == (_Bool)1) [2024-01-29 22:58:49,693 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] A == 0 [2024-01-29 22:58:49,693 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] (A == 0) && (i == 0) [2024-01-29 22:58:49,693 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] ((A == 0) && (last == 0)) && (new == 0) [2024-01-29 22:58:49,693 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-29 22:58:49,694 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] 0 <= i [2024-01-29 22:58:49,694 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:58:49,694 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] ((A == 0) && (i == 0)) && (last == 0) [2024-01-29 22:58:49,694 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] (A == 0) && (i == 0) [2024-01-29 22:58:49,694 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] (((A == 0) && (i == 0)) && (last == 0)) && ((((((((0LL - (long long )i) + (long long )size >= 0LL && size != 0) && (((((4 <= size && (-8LL + (long long )i) + (long long )size >= 0LL) && i == 4) || ((3 <= size && (-6LL + (long long )i) + (long long )size >= 0LL) && i == 3)) || ((2 <= size && (-4LL + (long long )i) + (long long )size >= 0LL) && i == 2)) || ((1 <= size && (-2LL + (long long )i) + (long long )size >= 0LL) && i == 1))) || (0 == i && i == 0)) || (((((8 <= size && 8 <= i) && (-16LL + (long long )i) + (long long )size >= 0LL) && (0LL - (long long )i) + (long long )size >= 0LL) && size != 0) && i != 1)) || ((((7 <= size && (-14LL + (long long )i) + (long long )size >= 0LL) && (0LL - (long long )i) + (long long )size >= 0LL) && i == 7) && size != 0)) || ((((6 <= size && (-12LL + (long long )i) + (long long )size >= 0LL) && (0LL - (long long )i) + (long long )size >= 0LL) && i == 6) && size != 0)) || ((((5 <= size && (-10LL + (long long )i) + (long long )size >= 0LL) && (0LL - (long long )i) + (long long )size >= 0LL) && i == 5) && size != 0)) [2024-01-29 22:58:49,695 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] (((A == 0) && (i == 0)) && (last == 0)) && (ok == (_Bool)1) [2024-01-29 22:58:49,695 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] (((A == 0) && (i == 0)) && (last == 0)) && (new == 0) [2024-01-29 22:58:49,695 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] (((A == 0) && (i == 0)) && (last == 0)) && (v_old == 0) [2024-01-29 22:58:49,696 INFO L98 nessWitnessExtractor]: Loop invariant at [L117-L119] A == 0 [2024-01-29 22:58:49,696 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-29 22:58:49,696 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] 0 <= i [2024-01-29 22:58:49,696 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:58:49,696 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (unsigned long )_argptr == 0UL [2024-01-29 22:58:49,697 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] (queue == 0) && (A == 0) [2024-01-29 22:58:49,697 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] queue == 0 [2024-01-29 22:58:49,697 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] ((queue == 0) && (A == 0)) && (last == 0) [2024-01-29 22:58:49,697 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] ((queue == 0) && (A == 0)) && (ok == (_Bool)1) [2024-01-29 22:58:49,697 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] ((queue == 0) && (A == 0)) && (i == 0) [2024-01-29 22:58:49,697 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] ((queue == 0) && (A == 0)) && (new == 0) [2024-01-29 22:58:49,697 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] ((queue == 0) && (A == 0)) && (v_old == 0) [2024-01-29 22:58:49,697 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (i == 0) [2024-01-29 22:58:49,698 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (i == 0)) && (ok == (_Bool)1) [2024-01-29 22:58:49,698 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (i == 0)) && (v_old == 0) [2024-01-29 22:58:49,698 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-29 22:58:49,698 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (i == 0)) && (n == 0) [2024-01-29 22:58:49,698 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (i == 0)) && (end == 0) [2024-01-29 22:58:49,698 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (i == 0)) && (last == 0) [2024-01-29 22:58:49,698 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL) [2024-01-29 22:58:49,699 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((long long )end - (long long )start >= 0LL) [2024-01-29 22:58:49,699 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (queue == 0) [2024-01-29 22:58:49,699 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (i == 0)) && (start == 0) [2024-01-29 22:58:49,699 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL) [2024-01-29 22:58:49,699 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (A == 0) [2024-01-29 22:58:49,700 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (i == 0)) && (new == 0) [2024-01-29 22:58:49,700 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:58:49,700 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] 0 <= i [2024-01-29 22:58:49,700 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (-2147483647 <= end) && (0 <= i) [2024-01-29 22:58:49,700 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] ((-2147483647 <= end) && (0 <= i)) && (start <= 2147483646) [2024-01-29 22:58:49,700 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] -2147483647 <= end [2024-01-29 22:58:49,700 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] ((-2147483647 <= end) && (0 <= i)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:58:49,701 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] ((-2147483647 <= start) && (0 <= i)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:58:49,701 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (-2147483647 <= start) && (0 <= i) [2024-01-29 22:58:49,701 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] -2147483647 <= start [2024-01-29 22:58:49,701 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-29 22:58:49,701 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] (A == 0) && (i == 0) [2024-01-29 22:58:49,701 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] ((A == 0) && (i == 0)) && (ok == (_Bool)1) [2024-01-29 22:58:49,701 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] ((A == 0) && (i == 0)) && (new == 0) [2024-01-29 22:58:49,701 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] A == 0 [2024-01-29 22:58:49,702 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] ((A == 0) && (i == 0)) && (last == 0) [2024-01-29 22:58:49,702 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] ((A == 0) && (i == 0)) && (v_old == 0) [2024-01-29 22:58:49,702 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && (n == 0) [2024-01-29 22:58:49,702 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && ((long long )end - (long long )start >= 0LL) [2024-01-29 22:58:49,702 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && (A == 0) [2024-01-29 22:58:49,702 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && (last == 0) [2024-01-29 22:58:49,702 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-29 22:58:49,703 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && (i == 0) [2024-01-29 22:58:49,703 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && (end == 0) [2024-01-29 22:58:49,703 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && (N == 0) [2024-01-29 22:58:49,703 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && (n == 0)) && (ok == (_Bool)0) [2024-01-29 22:58:49,704 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL) [2024-01-29 22:58:49,704 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL) [2024-01-29 22:58:49,705 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && (new == 0) [2024-01-29 22:58:49,705 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && (queue == 0) [2024-01-29 22:58:49,705 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && (n == 0)) && (v_old == 0) [2024-01-29 22:58:49,705 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL)) && (start == 0) [2024-01-29 22:58:49,705 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] 0 <= i [2024-01-29 22:58:49,706 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] (0 <= i) && (i == 0) [2024-01-29 22:58:49,706 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] (0 <= i) && ((long long )i - (long long )size >= 0LL) [2024-01-29 22:58:49,706 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] (0 <= i) && (ok == (_Bool)1) [2024-01-29 22:58:49,706 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] (0 <= i) && (new == 0) [2024-01-29 22:58:49,706 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] (0 <= i) && (A == 0) [2024-01-29 22:58:49,706 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] (0 <= i) && (v_old == 0) [2024-01-29 22:58:49,706 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] (0 <= i) && (last == 0) [2024-01-29 22:58:49,707 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] 0 <= i [2024-01-29 22:58:49,707 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:58:49,707 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] 0 <= i [2024-01-29 22:58:49,707 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:58:49,707 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] ((i == 0) && (last == 0)) && (ok == (_Bool)1) [2024-01-29 22:58:49,707 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] (i == 0) && (last == 0) [2024-01-29 22:58:49,707 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] ((i == 0) && (last == 0)) && (new == 0) [2024-01-29 22:58:49,708 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] ((i == 0) && (last == 0)) && (v_old == 0) [2024-01-29 22:58:49,708 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] i == 0 [2024-01-29 22:58:49,708 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (start == 0) [2024-01-29 22:58:49,708 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (new == 0) [2024-01-29 22:58:49,708 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((0LL - (long long )end) - (long long )start >= 0LL) [2024-01-29 22:58:49,708 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (0LL - (long long )end) + (long long )start >= 0LL [2024-01-29 22:58:49,708 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (last == 0) [2024-01-29 22:58:49,708 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && ((long long )end - (long long )start >= 0LL) [2024-01-29 22:58:49,709 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (queue == 0) [2024-01-29 22:58:49,709 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (start == 0)) && (ok == (_Bool)1) [2024-01-29 22:58:49,709 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (A == 0) [2024-01-29 22:58:49,709 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (start == 0)) && (v_old == 0) [2024-01-29 22:58:49,709 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL) [2024-01-29 22:58:49,709 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (N == 0) [2024-01-29 22:58:49,710 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (end == 0) [2024-01-29 22:58:49,710 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (i == 0) [2024-01-29 22:58:49,710 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (((0LL - (long long )end) + (long long )start >= 0LL) && ((long long )end + (long long )start >= 0LL)) && (n == 0) [2024-01-29 22:58:49,711 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-29 22:58:49,711 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] 0 <= i [2024-01-29 22:58:49,711 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:58:49,711 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] (i == 0) && (new == 0) [2024-01-29 22:58:49,711 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] i == 0 [2024-01-29 22:58:49,711 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] ((i == 0) && (new == 0)) && (ok == (_Bool)1) [2024-01-29 22:58:49,711 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] (i == 0) && (last == 0) [2024-01-29 22:58:49,711 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] ((i == 0) && (last == 0)) && (ok == (_Bool)1) [2024-01-29 22:58:49,712 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] ((i == 0) && (last == 0)) && (new == 0) [2024-01-29 22:58:49,712 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] i == 0 [2024-01-29 22:58:49,712 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] ((i == 0) && (last == 0)) && (v_old == 0) [2024-01-29 22:58:49,712 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((A == 0) && (i == 0)) && (ok == (_Bool)1) [2024-01-29 22:58:49,712 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (A == 0) && (i == 0) [2024-01-29 22:58:49,712 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((A == 0) && (i == 0)) && (new == 0) [2024-01-29 22:58:49,712 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((A == 0) && (i == 0)) && (v_old == 0) [2024-01-29 22:58:49,712 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((A == 0) && (i == 0)) && (last == 0) [2024-01-29 22:58:49,713 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] A == 0 [2024-01-29 22:58:49,713 INFO L98 nessWitnessExtractor]: Loop invariant at [L69-L80] (unsigned long )_argptr == 0UL [2024-01-29 22:58:49,713 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] i == 0 [2024-01-29 22:58:49,713 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] (i == 0) && (last == 0) [2024-01-29 22:58:49,713 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] (i == 0) && (ok == (_Bool)1) [2024-01-29 22:58:49,714 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] (i == 0) && (new == 0) [2024-01-29 22:58:49,714 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (unsigned long )_argptr == 0UL [2024-01-29 22:58:49,714 INFO L98 nessWitnessExtractor]: Loop invariant at [L48-L60] (unsigned long )_argptr == 0UL [2024-01-29 22:58:49,714 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] (((-1LL - (long long )i) + (long long )size >= 0LL) && (A == 0)) && (v_old == 0) [2024-01-29 22:58:49,714 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] ((((-1LL - (long long )i) + (long long )size >= 0LL) && (A == 0)) && (v_old == 0)) && ((((((((((5 <= size && (-9LL + (long long )i) + (long long )size >= 0LL) && i == 4) || ((4 <= size && (-7LL + (long long )i) + (long long )size >= 0LL) && i == 3)) || ((3 <= size && (-5LL + (long long )i) + (long long )size >= 0LL) && i == 2)) || ((2 <= size && (-3LL + (long long )i) + (long long )size >= 0LL) && i == 1)) || (((1 <= size && (-1LL + (long long )i) + (long long )size >= 0LL) && 0 == i) && i == 0)) || (((((8 <= i && 9 <= size) && i <= 2147483646) && (-17LL + (long long )i) + (long long )size >= 0LL) && i != 0) && i != 1)) || ((8 <= size && (-15LL + (long long )i) + (long long )size >= 0LL) && i == 7)) || ((7 <= size && (-13LL + (long long )i) + (long long )size >= 0LL) && i == 6)) || ((6 <= size && (-11LL + (long long )i) + (long long )size >= 0LL) && i == 5)) [2024-01-29 22:58:49,714 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] ((-1LL - (long long )i) + (long long )size >= 0LL) && (A == 0) [2024-01-29 22:58:49,714 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] (((-1LL - (long long )i) + (long long )size >= 0LL) && (A == 0)) && (last == 0) [2024-01-29 22:58:49,714 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] ((((-1LL - (long long )i) + (long long )size >= 0LL) && (A == 0)) && (v_old == 0)) && (ok == (_Bool)1) [2024-01-29 22:58:49,715 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] ((((-1LL - (long long )i) + (long long )size >= 0LL) && (A == 0)) && (v_old == 0)) && (size != 0) [2024-01-29 22:58:49,715 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] (((-1LL - (long long )i) + (long long )size >= 0LL) && (A == 0)) && (new == 0) [2024-01-29 22:58:49,715 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] (-1LL - (long long )i) + (long long )size >= 0LL [2024-01-29 22:58:49,715 INFO L98 nessWitnessExtractor]: Location invariant before [L118-L118] (((-1LL - (long long )i) + (long long )size >= 0LL) && (A == 0)) && (i == 0) [2024-01-29 22:58:49,716 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (-2147483647 <= end) && (0 <= i) [2024-01-29 22:58:49,716 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] ((-2147483647 <= end) && (0 <= i)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:58:49,716 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] -2147483647 <= end [2024-01-29 22:58:49,716 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] ((0 <= i) && (0 <= end)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:58:49,716 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (0 <= i) && (0 <= end) [2024-01-29 22:58:49,717 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] 0 <= i [2024-01-29 22:58:49,717 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:58:49,717 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] 0 <= i [2024-01-29 22:58:49,717 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] 0 <= i [2024-01-29 22:58:49,717 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (0 <= i) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:58:49,739 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:58:49,877 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] [2024-01-29 22:58:49,882 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:58:49,888 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 22:58:49,898 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:58:50,044 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:58:50,080 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:58:50,091 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:58:50,092 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:58:50 WrapperNode [2024-01-29 22:58:50,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:58:50,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:58:50,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:58:50,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:58:50,107 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 29.01 10:58:50" (1/1) ... [2024-01-29 22:58:50,117 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 29.01 10:58:50" (1/1) ... [2024-01-29 22:58:50,173 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 440 [2024-01-29 22:58:50,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:58:50,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:58:50,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:58:50,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:58:50,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:58:50" (1/1) ... [2024-01-29 22:58:50,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:58:50" (1/1) ... [2024-01-29 22:58:50,199 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:58:50" (1/1) ... [2024-01-29 22:58:50,223 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 8, 2, 2]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 2, 1, 1]. [2024-01-29 22:58:50,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:58:50" (1/1) ... [2024-01-29 22:58:50,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:58:50" (1/1) ... [2024-01-29 22:58:50,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:58:50" (1/1) ... [2024-01-29 22:58:50,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:58:50" (1/1) ... [2024-01-29 22:58:50,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:58:50" (1/1) ... [2024-01-29 22:58:50,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:58:50" (1/1) ... [2024-01-29 22:58:50,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:58:50,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:58:50,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:58:50,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:58:50,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:58:50" (1/1) ... [2024-01-29 22:58:50,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:58:50,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:58:50,360 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-01-29 22:58:50,377 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-01-29 22:58:50,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:58:50,403 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 22:58:50,403 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 22:58:50,403 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 22:58:50,403 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 22:58:50,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:58:50,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:58:50,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:58:50,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 22:58:50,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:58:50,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:58:50,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:58:50,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:58:50,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 22:58:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-29 22:58:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-29 22:58:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-29 22:58:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:58:50,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:58:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:58:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:58:50,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:58:50,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 22:58:50,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:58:50,407 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 22:58:50,504 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:58:50,506 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:58:51,201 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:58:51,201 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:58:51,445 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:58:51,445 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-29 22:58:51,446 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:58:51 BoogieIcfgContainer [2024-01-29 22:58:51,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:58:51,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:58:51,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:58:51,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:58:51,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:58:49" (1/4) ... [2024-01-29 22:58:51,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9fa2515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:58:51, skipping insertion in model container [2024-01-29 22:58:51,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:58:49" (2/4) ... [2024-01-29 22:58:51,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9fa2515 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:58:51, skipping insertion in model container [2024-01-29 22:58:51,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:58:50" (3/4) ... [2024-01-29 22:58:51,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9fa2515 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:58:51, skipping insertion in model container [2024-01-29 22:58:51,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:58:51" (4/4) ... [2024-01-29 22:58:51,454 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2024-01-29 22:58:51,468 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:58:51,468 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 242 error locations. [2024-01-29 22:58:51,469 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:58:51,594 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 22:58:51,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 481 places, 479 transitions, 972 flow [2024-01-29 22:58:51,820 INFO L124 PetriNetUnfolderBase]: 5/477 cut-off events. [2024-01-29 22:58:51,821 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 22:58:51,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 477 events. 5/477 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 792 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 430. Up to 2 conditions per place. [2024-01-29 22:58:51,826 INFO L82 GeneralOperation]: Start removeDead. Operand has 481 places, 479 transitions, 972 flow [2024-01-29 22:58:51,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 478 places, 476 transitions, 964 flow [2024-01-29 22:58:51,842 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:58:51,848 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;@4d5d88fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:58:51,848 INFO L358 AbstractCegarLoop]: Starting to check reachability of 292 error locations. [2024-01-29 22:58:51,850 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:58:51,850 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:58:51,850 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:58:51,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:58:51,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:58:51,851 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:58:51,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:58:51,856 INFO L85 PathProgramCache]: Analyzing trace with hash 41820, now seen corresponding path program 1 times [2024-01-29 22:58:51,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:58:51,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918317304] [2024-01-29 22:58:51,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:58:51,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:58:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:58:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:58:52,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:58:52,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918317304] [2024-01-29 22:58:52,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918317304] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:58:52,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:58:52,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:58:52,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649752469] [2024-01-29 22:58:52,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:58:52,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:58:52,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:58:52,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:58:52,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:58:52,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 479 [2024-01-29 22:58:52,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 476 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 372.6666666666667) internal successors, (1118), 3 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:52,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:58:52,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 479 [2024-01-29 22:58:52,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:58:52,785 INFO L124 PetriNetUnfolderBase]: 603/1684 cut-off events. [2024-01-29 22:58:52,785 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-01-29 22:58:52,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2692 conditions, 1684 events. 603/1684 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9307 event pairs, 429 based on Foata normal form. 16/1102 useless extension candidates. Maximal degree in co-relation 2141. Up to 956 conditions per place. [2024-01-29 22:58:52,797 INFO L140 encePairwiseOnDemand]: 432/479 looper letters, 59 selfloop transitions, 2 changer transitions 0/431 dead transitions. [2024-01-29 22:58:52,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 431 transitions, 996 flow [2024-01-29 22:58:52,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:58:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:58:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2024-01-29 22:58:52,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8503827418232429 [2024-01-29 22:58:52,812 INFO L175 Difference]: Start difference. First operand has 478 places, 476 transitions, 964 flow. Second operand 3 states and 1222 transitions. [2024-01-29 22:58:52,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 431 transitions, 996 flow [2024-01-29 22:58:52,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 431 transitions, 988 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 22:58:52,825 INFO L231 Difference]: Finished difference. Result has 431 places, 431 transitions, 870 flow [2024-01-29 22:58:52,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=431, PETRI_TRANSITIONS=431} [2024-01-29 22:58:52,830 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -47 predicate places. [2024-01-29 22:58:52,830 INFO L495 AbstractCegarLoop]: Abstraction has has 431 places, 431 transitions, 870 flow [2024-01-29 22:58:52,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.6666666666667) internal successors, (1118), 3 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:52,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:58:52,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 22:58:52,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:58:52,832 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:58:52,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:58:52,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1297661, now seen corresponding path program 1 times [2024-01-29 22:58:52,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:58:52,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376894295] [2024-01-29 22:58:52,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:58:52,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:58:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:58:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:58:52,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:58:52,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376894295] [2024-01-29 22:58:52,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376894295] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:58:52,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:58:52,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:58:52,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482870579] [2024-01-29 22:58:52,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:58:52,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:58:52,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:58:52,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:58:52,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:58:53,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 479 [2024-01-29 22:58:53,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 431 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 374.6666666666667) internal successors, (1124), 3 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:53,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:58:53,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 479 [2024-01-29 22:58:53,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:58:53,484 INFO L124 PetriNetUnfolderBase]: 603/1680 cut-off events. [2024-01-29 22:58:53,486 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:58:53,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2657 conditions, 1680 events. 603/1680 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9315 event pairs, 429 based on Foata normal form. 3/1085 useless extension candidates. Maximal degree in co-relation 2556. Up to 957 conditions per place. [2024-01-29 22:58:53,499 INFO L140 encePairwiseOnDemand]: 473/479 looper letters, 53 selfloop transitions, 2 changer transitions 0/427 dead transitions. [2024-01-29 22:58:53,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 427 transitions, 972 flow [2024-01-29 22:58:53,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:58:53,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:58:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1181 transitions. [2024-01-29 22:58:53,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8218510786360473 [2024-01-29 22:58:53,515 INFO L175 Difference]: Start difference. First operand has 431 places, 431 transitions, 870 flow. Second operand 3 states and 1181 transitions. [2024-01-29 22:58:53,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 427 transitions, 972 flow [2024-01-29 22:58:53,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 427 transitions, 968 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:58:53,520 INFO L231 Difference]: Finished difference. Result has 427 places, 427 transitions, 862 flow [2024-01-29 22:58:53,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=427, PETRI_TRANSITIONS=427} [2024-01-29 22:58:53,536 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -51 predicate places. [2024-01-29 22:58:53,537 INFO L495 AbstractCegarLoop]: Abstraction has has 427 places, 427 transitions, 862 flow [2024-01-29 22:58:53,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.6666666666667) internal successors, (1124), 3 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:53,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:58:53,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 22:58:53,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:58:53,538 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:58:53,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:58:53,539 INFO L85 PathProgramCache]: Analyzing trace with hash 40228762, now seen corresponding path program 1 times [2024-01-29 22:58:53,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:58:53,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845092046] [2024-01-29 22:58:53,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:58:53,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:58:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:58:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:58:53,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:58:53,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845092046] [2024-01-29 22:58:53,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845092046] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:58:53,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:58:53,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:58:53,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715177200] [2024-01-29 22:58:53,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:58:53,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:58:53,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:58:53,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:58:53,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:58:53,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 479 [2024-01-29 22:58:53,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 427 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 371.6666666666667) internal successors, (1115), 3 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:53,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:58:53,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 479 [2024-01-29 22:58:53,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:58:54,018 INFO L124 PetriNetUnfolderBase]: 603/1676 cut-off events. [2024-01-29 22:58:54,018 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:58:54,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2656 conditions, 1676 events. 603/1676 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9356 event pairs, 429 based on Foata normal form. 4/1087 useless extension candidates. Maximal degree in co-relation 2581. Up to 959 conditions per place. [2024-01-29 22:58:54,024 INFO L140 encePairwiseOnDemand]: 473/479 looper letters, 56 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2024-01-29 22:58:54,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 423 transitions, 970 flow [2024-01-29 22:58:54,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:58:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:58:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1175 transitions. [2024-01-29 22:58:54,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8176757132915797 [2024-01-29 22:58:54,027 INFO L175 Difference]: Start difference. First operand has 427 places, 427 transitions, 862 flow. Second operand 3 states and 1175 transitions. [2024-01-29 22:58:54,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 423 transitions, 970 flow [2024-01-29 22:58:54,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 423 transitions, 966 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:58:54,032 INFO L231 Difference]: Finished difference. Result has 423 places, 423 transitions, 854 flow [2024-01-29 22:58:54,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=423, PETRI_TRANSITIONS=423} [2024-01-29 22:58:54,034 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -55 predicate places. [2024-01-29 22:58:54,034 INFO L495 AbstractCegarLoop]: Abstraction has has 423 places, 423 transitions, 854 flow [2024-01-29 22:58:54,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.6666666666667) internal successors, (1115), 3 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:54,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:58:54,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 22:58:54,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:58:54,035 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:58:54,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:58:54,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1247093008, now seen corresponding path program 1 times [2024-01-29 22:58:54,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:58:54,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030008426] [2024-01-29 22:58:54,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:58:54,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:58:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:58:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:58:54,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:58:54,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030008426] [2024-01-29 22:58:54,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030008426] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:58:54,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:58:54,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:58:54,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473811640] [2024-01-29 22:58:54,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:58:54,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:58:54,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:58:54,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:58:54,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:58:54,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 479 [2024-01-29 22:58:54,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 423 transitions, 854 flow. Second operand has 3 states, 3 states have (on average 376.6666666666667) internal successors, (1130), 3 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:54,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:58:54,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 479 [2024-01-29 22:58:54,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:58:54,455 INFO L124 PetriNetUnfolderBase]: 603/1674 cut-off events. [2024-01-29 22:58:54,455 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:58:54,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 1674 events. 603/1674 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9378 event pairs, 429 based on Foata normal form. 2/1084 useless extension candidates. Maximal degree in co-relation 2556. Up to 956 conditions per place. [2024-01-29 22:58:54,462 INFO L140 encePairwiseOnDemand]: 475/479 looper letters, 53 selfloop transitions, 2 changer transitions 0/421 dead transitions. [2024-01-29 22:58:54,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 421 transitions, 960 flow [2024-01-29 22:58:54,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:58:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:58:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2024-01-29 22:58:54,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.824634655532359 [2024-01-29 22:58:54,465 INFO L175 Difference]: Start difference. First operand has 423 places, 423 transitions, 854 flow. Second operand 3 states and 1185 transitions. [2024-01-29 22:58:54,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 421 transitions, 960 flow [2024-01-29 22:58:54,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 421 transitions, 956 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:58:54,470 INFO L231 Difference]: Finished difference. Result has 421 places, 421 transitions, 850 flow [2024-01-29 22:58:54,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=421, PETRI_TRANSITIONS=421} [2024-01-29 22:58:54,471 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -57 predicate places. [2024-01-29 22:58:54,471 INFO L495 AbstractCegarLoop]: Abstraction has has 421 places, 421 transitions, 850 flow [2024-01-29 22:58:54,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.6666666666667) internal successors, (1130), 3 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:54,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:58:54,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:58:54,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:58:54,472 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:58:54,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:58:54,473 INFO L85 PathProgramCache]: Analyzing trace with hash 682232509, now seen corresponding path program 1 times [2024-01-29 22:58:54,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:58:54,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6471215] [2024-01-29 22:58:54,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:58:54,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:58:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:58:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:58:54,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:58:54,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6471215] [2024-01-29 22:58:54,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6471215] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:58:54,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:58:54,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:58:54,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795044682] [2024-01-29 22:58:54,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:58:54,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:58:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:58:54,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:58:54,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:58:54,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2024-01-29 22:58:54,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 421 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:54,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:58:54,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2024-01-29 22:58:54,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:58:54,932 INFO L124 PetriNetUnfolderBase]: 603/1673 cut-off events. [2024-01-29 22:58:54,932 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:58:54,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2671 conditions, 1673 events. 603/1673 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9388 event pairs, 429 based on Foata normal form. 1/1104 useless extension candidates. Maximal degree in co-relation 2574. Up to 980 conditions per place. [2024-01-29 22:58:54,940 INFO L140 encePairwiseOnDemand]: 476/479 looper letters, 74 selfloop transitions, 2 changer transitions 0/420 dead transitions. [2024-01-29 22:58:54,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 420 transitions, 1000 flow [2024-01-29 22:58:54,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:58:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:58:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1139 transitions. [2024-01-29 22:58:54,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7926235212247739 [2024-01-29 22:58:54,942 INFO L175 Difference]: Start difference. First operand has 421 places, 421 transitions, 850 flow. Second operand 3 states and 1139 transitions. [2024-01-29 22:58:54,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 420 transitions, 1000 flow [2024-01-29 22:58:54,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 420 transitions, 996 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:58:54,948 INFO L231 Difference]: Finished difference. Result has 420 places, 420 transitions, 848 flow [2024-01-29 22:58:54,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=420, PETRI_TRANSITIONS=420} [2024-01-29 22:58:54,949 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -58 predicate places. [2024-01-29 22:58:54,949 INFO L495 AbstractCegarLoop]: Abstraction has has 420 places, 420 transitions, 848 flow [2024-01-29 22:58:54,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:54,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:58:54,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:58:54,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:58:54,950 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:58:54,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:58:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash -325627256, now seen corresponding path program 1 times [2024-01-29 22:58:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:58:54,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121729835] [2024-01-29 22:58:54,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:58:54,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:58:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:58:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:58:55,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:58:55,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121729835] [2024-01-29 22:58:55,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121729835] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:58:55,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:58:55,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:58:55,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545346876] [2024-01-29 22:58:55,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:58:55,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:58:55,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:58:55,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:58:55,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:58:55,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 479 [2024-01-29 22:58:55,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 420 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 376.6666666666667) internal successors, (1130), 3 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:55,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:58:55,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 479 [2024-01-29 22:58:55,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:58:55,464 INFO L124 PetriNetUnfolderBase]: 603/1671 cut-off events. [2024-01-29 22:58:55,464 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:58:55,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2648 conditions, 1671 events. 603/1671 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9392 event pairs, 429 based on Foata normal form. 2/1084 useless extension candidates. Maximal degree in co-relation 2622. Up to 958 conditions per place. [2024-01-29 22:58:55,470 INFO L140 encePairwiseOnDemand]: 475/479 looper letters, 53 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2024-01-29 22:58:55,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 418 transitions, 954 flow [2024-01-29 22:58:55,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:58:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:58:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2024-01-29 22:58:55,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.824634655532359 [2024-01-29 22:58:55,473 INFO L175 Difference]: Start difference. First operand has 420 places, 420 transitions, 848 flow. Second operand 3 states and 1185 transitions. [2024-01-29 22:58:55,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 418 transitions, 954 flow [2024-01-29 22:58:55,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 418 transitions, 950 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:58:55,478 INFO L231 Difference]: Finished difference. Result has 418 places, 418 transitions, 844 flow [2024-01-29 22:58:55,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=844, PETRI_PLACES=418, PETRI_TRANSITIONS=418} [2024-01-29 22:58:55,479 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -60 predicate places. [2024-01-29 22:58:55,479 INFO L495 AbstractCegarLoop]: Abstraction has has 418 places, 418 transitions, 844 flow [2024-01-29 22:58:55,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.6666666666667) internal successors, (1130), 3 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:55,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:58:55,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:58:55,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:58:55,480 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:58:55,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:58:55,481 INFO L85 PathProgramCache]: Analyzing trace with hash 604865678, now seen corresponding path program 1 times [2024-01-29 22:58:55,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:58:55,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116648773] [2024-01-29 22:58:55,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:58:55,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:58:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:58:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:58:55,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:58:55,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116648773] [2024-01-29 22:58:55,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116648773] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:58:55,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:58:55,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:58:55,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062620889] [2024-01-29 22:58:55,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:58:55,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:58:55,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:58:55,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:58:55,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:58:55,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 479 [2024-01-29 22:58:55,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 418 transitions, 844 flow. Second operand has 3 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:55,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:58:55,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 479 [2024-01-29 22:58:55,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:58:56,062 INFO L124 PetriNetUnfolderBase]: 603/1663 cut-off events. [2024-01-29 22:58:56,062 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:58:56,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2649 conditions, 1663 events. 603/1663 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9394 event pairs, 429 based on Foata normal form. 5/1087 useless extension candidates. Maximal degree in co-relation 2605. Up to 964 conditions per place. [2024-01-29 22:58:56,071 INFO L140 encePairwiseOnDemand]: 469/479 looper letters, 62 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2024-01-29 22:58:56,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 410 transitions, 956 flow [2024-01-29 22:58:56,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:58:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:58:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1155 transitions. [2024-01-29 22:58:56,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8037578288100209 [2024-01-29 22:58:56,073 INFO L175 Difference]: Start difference. First operand has 418 places, 418 transitions, 844 flow. Second operand 3 states and 1155 transitions. [2024-01-29 22:58:56,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 410 transitions, 956 flow [2024-01-29 22:58:56,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 410 transitions, 952 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:58:56,079 INFO L231 Difference]: Finished difference. Result has 410 places, 410 transitions, 828 flow [2024-01-29 22:58:56,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=410, PETRI_TRANSITIONS=410} [2024-01-29 22:58:56,080 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -68 predicate places. [2024-01-29 22:58:56,080 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 410 transitions, 828 flow [2024-01-29 22:58:56,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:56,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:58:56,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:58:56,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 22:58:56,081 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:58:56,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:58:56,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1455382410, now seen corresponding path program 1 times [2024-01-29 22:58:56,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:58:56,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3231821] [2024-01-29 22:58:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:58:56,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:58:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:58:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:58:56,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:58:56,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3231821] [2024-01-29 22:58:56,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3231821] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:58:56,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:58:56,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:58:56,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943361272] [2024-01-29 22:58:56,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:58:56,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:58:56,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:58:56,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:58:56,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:58:56,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 479 [2024-01-29 22:58:56,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 410 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 376.6666666666667) internal successors, (1130), 3 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:56,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:58:56,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 479 [2024-01-29 22:58:56,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:58:56,627 INFO L124 PetriNetUnfolderBase]: 603/1661 cut-off events. [2024-01-29 22:58:56,628 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:58:56,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2638 conditions, 1661 events. 603/1661 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9383 event pairs, 429 based on Foata normal form. 2/1082 useless extension candidates. Maximal degree in co-relation 2556. Up to 956 conditions per place. [2024-01-29 22:58:56,633 INFO L140 encePairwiseOnDemand]: 475/479 looper letters, 53 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2024-01-29 22:58:56,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 408 transitions, 934 flow [2024-01-29 22:58:56,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:58:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:58:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2024-01-29 22:58:56,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.824634655532359 [2024-01-29 22:58:56,636 INFO L175 Difference]: Start difference. First operand has 410 places, 410 transitions, 828 flow. Second operand 3 states and 1185 transitions. [2024-01-29 22:58:56,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 408 transitions, 934 flow [2024-01-29 22:58:56,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 408 transitions, 930 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:58:56,641 INFO L231 Difference]: Finished difference. Result has 408 places, 408 transitions, 824 flow [2024-01-29 22:58:56,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=824, PETRI_PLACES=408, PETRI_TRANSITIONS=408} [2024-01-29 22:58:56,642 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -70 predicate places. [2024-01-29 22:58:56,642 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 408 transitions, 824 flow [2024-01-29 22:58:56,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.6666666666667) internal successors, (1130), 3 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:56,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:58:56,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:58:56,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 22:58:56,643 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:58:56,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:58:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2127784079, now seen corresponding path program 1 times [2024-01-29 22:58:56,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:58:56,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697609751] [2024-01-29 22:58:56,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:58:56,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:58:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:58:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:58:56,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:58:56,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697609751] [2024-01-29 22:58:56,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697609751] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:58:56,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:58:56,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:58:56,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293979580] [2024-01-29 22:58:56,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:58:56,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:58:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:58:56,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:58:56,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:58:57,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 479 [2024-01-29 22:58:57,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 408 transitions, 824 flow. Second operand has 3 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:57,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:58:57,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 479 [2024-01-29 22:58:57,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:58:57,214 INFO L124 PetriNetUnfolderBase]: 603/1657 cut-off events. [2024-01-29 22:58:57,215 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:58:57,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2645 conditions, 1657 events. 603/1657 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9418 event pairs, 429 based on Foata normal form. 4/1093 useless extension candidates. Maximal degree in co-relation 2567. Up to 967 conditions per place. [2024-01-29 22:58:57,222 INFO L140 encePairwiseOnDemand]: 473/479 looper letters, 64 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2024-01-29 22:58:57,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 404 transitions, 948 flow [2024-01-29 22:58:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:58:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:58:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1159 transitions. [2024-01-29 22:58:57,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8065414057063326 [2024-01-29 22:58:57,225 INFO L175 Difference]: Start difference. First operand has 408 places, 408 transitions, 824 flow. Second operand 3 states and 1159 transitions. [2024-01-29 22:58:57,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 404 transitions, 948 flow [2024-01-29 22:58:57,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 404 transitions, 944 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:58:57,230 INFO L231 Difference]: Finished difference. Result has 404 places, 404 transitions, 816 flow [2024-01-29 22:58:57,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=404, PETRI_TRANSITIONS=404} [2024-01-29 22:58:57,231 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -74 predicate places. [2024-01-29 22:58:57,231 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 404 transitions, 816 flow [2024-01-29 22:58:57,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:57,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:58:57,232 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] [2024-01-29 22:58:57,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 22:58:57,233 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:58:57,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:58:57,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1625073099, now seen corresponding path program 1 times [2024-01-29 22:58:57,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:58:57,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592607274] [2024-01-29 22:58:57,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:58:57,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:58:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:58:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:58:57,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:58:57,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592607274] [2024-01-29 22:58:57,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592607274] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:58:57,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:58:57,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:58:57,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092587674] [2024-01-29 22:58:57,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:58:57,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:58:57,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:58:57,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:58:57,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:58:57,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 479 [2024-01-29 22:58:57,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 404 transitions, 816 flow. Second operand has 4 states, 4 states have (on average 372.0) internal successors, (1488), 4 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:57,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:58:57,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 479 [2024-01-29 22:58:57,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:58:57,796 INFO L124 PetriNetUnfolderBase]: 603/1656 cut-off events. [2024-01-29 22:58:57,812 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:58:57,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2640 conditions, 1656 events. 603/1656 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9400 event pairs, 429 based on Foata normal form. 0/1080 useless extension candidates. Maximal degree in co-relation 2556. Up to 956 conditions per place. [2024-01-29 22:58:57,819 INFO L140 encePairwiseOnDemand]: 475/479 looper letters, 59 selfloop transitions, 3 changer transitions 0/403 dead transitions. [2024-01-29 22:58:57,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 403 transitions, 938 flow [2024-01-29 22:58:57,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:58:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:58:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1543 transitions. [2024-01-29 22:58:57,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8053235908141962 [2024-01-29 22:58:57,822 INFO L175 Difference]: Start difference. First operand has 404 places, 404 transitions, 816 flow. Second operand 4 states and 1543 transitions. [2024-01-29 22:58:57,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 403 transitions, 938 flow [2024-01-29 22:58:57,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 403 transitions, 934 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:58:57,827 INFO L231 Difference]: Finished difference. Result has 404 places, 403 transitions, 816 flow [2024-01-29 22:58:57,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=816, PETRI_PLACES=404, PETRI_TRANSITIONS=403} [2024-01-29 22:58:57,840 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -74 predicate places. [2024-01-29 22:58:57,841 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 403 transitions, 816 flow [2024-01-29 22:58:57,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 372.0) internal successors, (1488), 4 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:57,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:58:57,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:58:57,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 22:58:57,842 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:58:57,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:58:57,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1706283310, now seen corresponding path program 1 times [2024-01-29 22:58:57,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:58:57,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285405135] [2024-01-29 22:58:57,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:58:57,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:58:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:58:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:58:57,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:58:57,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285405135] [2024-01-29 22:58:57,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285405135] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:58:57,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:58:57,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:58:57,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109476171] [2024-01-29 22:58:57,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:58:57,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:58:57,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:58:57,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:58:57,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:58:58,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2024-01-29 22:58:58,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 403 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:58,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:58:58,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2024-01-29 22:58:58,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:58:58,366 INFO L124 PetriNetUnfolderBase]: 603/1654 cut-off events. [2024-01-29 22:58:58,366 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-29 22:58:58,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2644 conditions, 1654 events. 603/1654 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9437 event pairs, 429 based on Foata normal form. 2/1086 useless extension candidates. Maximal degree in co-relation 2568. Up to 968 conditions per place. [2024-01-29 22:58:58,373 INFO L140 encePairwiseOnDemand]: 475/479 looper letters, 65 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2024-01-29 22:58:58,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 401 transitions, 946 flow [2024-01-29 22:58:58,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:58:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:58:58,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2024-01-29 22:58:58,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7870563674321504 [2024-01-29 22:58:58,375 INFO L175 Difference]: Start difference. First operand has 404 places, 403 transitions, 816 flow. Second operand 3 states and 1131 transitions. [2024-01-29 22:58:58,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 401 transitions, 946 flow [2024-01-29 22:58:58,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 401 transitions, 940 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:58:58,380 INFO L231 Difference]: Finished difference. Result has 401 places, 401 transitions, 810 flow [2024-01-29 22:58:58,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=401, PETRI_TRANSITIONS=401} [2024-01-29 22:58:58,381 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -77 predicate places. [2024-01-29 22:58:58,381 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 401 transitions, 810 flow [2024-01-29 22:58:58,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:58,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:58:58,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:58:58,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 22:58:58,382 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:58:58,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:58:58,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1210281202, now seen corresponding path program 1 times [2024-01-29 22:58:58,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:58:58,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968013019] [2024-01-29 22:58:58,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:58:58,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:58:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:58:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:58:58,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:58:58,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968013019] [2024-01-29 22:58:58,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968013019] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:58:58,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:58:58,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:58:58,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891140462] [2024-01-29 22:58:58,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:58:58,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:58:58,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:58:58,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:58:58,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:58:58,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 479 [2024-01-29 22:58:58,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 401 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 354.3333333333333) internal successors, (1063), 3 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:58,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:58:58,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 479 [2024-01-29 22:58:58,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:58:58,997 INFO L124 PetriNetUnfolderBase]: 603/1652 cut-off events. [2024-01-29 22:58:58,998 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:58:58,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2642 conditions, 1652 events. 603/1652 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9457 event pairs, 429 based on Foata normal form. 2/1087 useless extension candidates. Maximal degree in co-relation 2569. Up to 969 conditions per place. [2024-01-29 22:58:59,003 INFO L140 encePairwiseOnDemand]: 475/479 looper letters, 66 selfloop transitions, 2 changer transitions 0/399 dead transitions. [2024-01-29 22:58:59,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 399 transitions, 942 flow [2024-01-29 22:58:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:58:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:58:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2024-01-29 22:58:59,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7856645789839944 [2024-01-29 22:58:59,006 INFO L175 Difference]: Start difference. First operand has 401 places, 401 transitions, 810 flow. Second operand 3 states and 1129 transitions. [2024-01-29 22:58:59,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 399 transitions, 942 flow [2024-01-29 22:58:59,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 399 transitions, 938 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:58:59,011 INFO L231 Difference]: Finished difference. Result has 399 places, 399 transitions, 806 flow [2024-01-29 22:58:59,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=399, PETRI_TRANSITIONS=399} [2024-01-29 22:58:59,012 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -79 predicate places. [2024-01-29 22:58:59,012 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 399 transitions, 806 flow [2024-01-29 22:58:59,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 354.3333333333333) internal successors, (1063), 3 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:59,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:58:59,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:58:59,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 22:58:59,013 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:58:59,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:58:59,013 INFO L85 PathProgramCache]: Analyzing trace with hash -855852211, now seen corresponding path program 1 times [2024-01-29 22:58:59,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:58:59,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303110753] [2024-01-29 22:58:59,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:58:59,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:58:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:58:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:58:59,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:58:59,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303110753] [2024-01-29 22:58:59,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303110753] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:58:59,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:58:59,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:58:59,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881252985] [2024-01-29 22:58:59,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:58:59,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:58:59,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:58:59,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:58:59,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:58:59,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 479 [2024-01-29 22:58:59,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 399 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:59,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:58:59,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 479 [2024-01-29 22:58:59,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:58:59,472 INFO L124 PetriNetUnfolderBase]: 603/1651 cut-off events. [2024-01-29 22:58:59,473 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:58:59,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2636 conditions, 1651 events. 603/1651 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9434 event pairs, 429 based on Foata normal form. 1/1083 useless extension candidates. Maximal degree in co-relation 2564. Up to 965 conditions per place. [2024-01-29 22:58:59,478 INFO L140 encePairwiseOnDemand]: 476/479 looper letters, 61 selfloop transitions, 2 changer transitions 0/398 dead transitions. [2024-01-29 22:58:59,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 398 transitions, 930 flow [2024-01-29 22:58:59,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:58:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:58:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1141 transitions. [2024-01-29 22:58:59,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7940153096729298 [2024-01-29 22:58:59,480 INFO L175 Difference]: Start difference. First operand has 399 places, 399 transitions, 806 flow. Second operand 3 states and 1141 transitions. [2024-01-29 22:58:59,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 398 transitions, 930 flow [2024-01-29 22:58:59,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 398 transitions, 926 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:58:59,485 INFO L231 Difference]: Finished difference. Result has 398 places, 398 transitions, 804 flow [2024-01-29 22:58:59,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=398, PETRI_TRANSITIONS=398} [2024-01-29 22:58:59,485 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -80 predicate places. [2024-01-29 22:58:59,486 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 398 transitions, 804 flow [2024-01-29 22:58:59,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:59,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:58:59,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:58:59,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 22:58:59,487 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:58:59,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:58:59,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2135179983, now seen corresponding path program 1 times [2024-01-29 22:58:59,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:58:59,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263290732] [2024-01-29 22:58:59,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:58:59,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:58:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:58:59,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:58:59,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:58:59,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263290732] [2024-01-29 22:58:59,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263290732] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:58:59,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:58:59,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:58:59,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976714900] [2024-01-29 22:58:59,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:58:59,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:58:59,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:58:59,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:58:59,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:58:59,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2024-01-29 22:58:59,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 398 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:58:59,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:58:59,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2024-01-29 22:58:59,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:00,034 INFO L124 PetriNetUnfolderBase]: 603/1649 cut-off events. [2024-01-29 22:59:00,034 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:00,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2636 conditions, 1649 events. 603/1649 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9436 event pairs, 429 based on Foata normal form. 2/1086 useless extension candidates. Maximal degree in co-relation 2581. Up to 966 conditions per place. [2024-01-29 22:59:00,041 INFO L140 encePairwiseOnDemand]: 475/479 looper letters, 63 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2024-01-29 22:59:00,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 396 transitions, 930 flow [2024-01-29 22:59:00,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2024-01-29 22:59:00,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7919276270006959 [2024-01-29 22:59:00,043 INFO L175 Difference]: Start difference. First operand has 398 places, 398 transitions, 804 flow. Second operand 3 states and 1138 transitions. [2024-01-29 22:59:00,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 396 transitions, 930 flow [2024-01-29 22:59:00,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 396 transitions, 926 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:00,048 INFO L231 Difference]: Finished difference. Result has 396 places, 396 transitions, 800 flow [2024-01-29 22:59:00,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=396, PETRI_TRANSITIONS=396} [2024-01-29 22:59:00,049 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -82 predicate places. [2024-01-29 22:59:00,049 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 396 transitions, 800 flow [2024-01-29 22:59:00,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:00,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:00,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:00,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 22:59:00,050 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:00,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1766068830, now seen corresponding path program 1 times [2024-01-29 22:59:00,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:00,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361162139] [2024-01-29 22:59:00,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:00,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:00,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:00,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361162139] [2024-01-29 22:59:00,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361162139] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:00,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:00,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:00,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809936480] [2024-01-29 22:59:00,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:00,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:59:00,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:00,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:59:00,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:59:00,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 479 [2024-01-29 22:59:00,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 396 transitions, 800 flow. Second operand has 4 states, 4 states have (on average 334.75) internal successors, (1339), 4 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:00,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:00,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 479 [2024-01-29 22:59:00,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:00,741 INFO L124 PetriNetUnfolderBase]: 603/1647 cut-off events. [2024-01-29 22:59:00,742 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:00,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2658 conditions, 1647 events. 603/1647 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9440 event pairs, 429 based on Foata normal form. 0/1097 useless extension candidates. Maximal degree in co-relation 2585. Up to 985 conditions per place. [2024-01-29 22:59:00,747 INFO L140 encePairwiseOnDemand]: 474/479 looper letters, 86 selfloop transitions, 3 changer transitions 0/394 dead transitions. [2024-01-29 22:59:00,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 394 transitions, 974 flow [2024-01-29 22:59:00,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:59:00,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:59:00,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1423 transitions. [2024-01-29 22:59:00,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7426931106471816 [2024-01-29 22:59:00,750 INFO L175 Difference]: Start difference. First operand has 396 places, 396 transitions, 800 flow. Second operand 4 states and 1423 transitions. [2024-01-29 22:59:00,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 394 transitions, 974 flow [2024-01-29 22:59:00,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 394 transitions, 970 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:00,755 INFO L231 Difference]: Finished difference. Result has 395 places, 394 transitions, 798 flow [2024-01-29 22:59:00,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=798, PETRI_PLACES=395, PETRI_TRANSITIONS=394} [2024-01-29 22:59:00,756 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -83 predicate places. [2024-01-29 22:59:00,756 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 394 transitions, 798 flow [2024-01-29 22:59:00,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 334.75) internal successors, (1339), 4 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:00,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:00,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-29 22:59:00,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 22:59:00,757 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:00,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:00,758 INFO L85 PathProgramCache]: Analyzing trace with hash 431244029, now seen corresponding path program 1 times [2024-01-29 22:59:00,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:00,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742278563] [2024-01-29 22:59:00,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:00,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:00,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:00,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742278563] [2024-01-29 22:59:00,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742278563] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:00,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:00,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:00,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163308925] [2024-01-29 22:59:00,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:00,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:00,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:00,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:00,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:00,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 479 [2024-01-29 22:59:00,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 394 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:00,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:00,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 479 [2024-01-29 22:59:00,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:01,090 INFO L124 PetriNetUnfolderBase]: 603/1644 cut-off events. [2024-01-29 22:59:01,090 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-29 22:59:01,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2624 conditions, 1644 events. 603/1644 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9435 event pairs, 429 based on Foata normal form. 1/1081 useless extension candidates. Maximal degree in co-relation 2555. Up to 948 conditions per place. [2024-01-29 22:59:01,095 INFO L140 encePairwiseOnDemand]: 474/479 looper letters, 55 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2024-01-29 22:59:01,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 391 transitions, 906 flow [2024-01-29 22:59:01,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2024-01-29 22:59:01,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8622129436325678 [2024-01-29 22:59:01,097 INFO L175 Difference]: Start difference. First operand has 395 places, 394 transitions, 798 flow. Second operand 3 states and 1239 transitions. [2024-01-29 22:59:01,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 391 transitions, 906 flow [2024-01-29 22:59:01,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 391 transitions, 900 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:59:01,101 INFO L231 Difference]: Finished difference. Result has 391 places, 391 transitions, 790 flow [2024-01-29 22:59:01,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=391, PETRI_TRANSITIONS=391} [2024-01-29 22:59:01,102 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -87 predicate places. [2024-01-29 22:59:01,102 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 391 transitions, 790 flow [2024-01-29 22:59:01,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:01,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:01,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-29 22:59:01,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 22:59:01,103 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:01,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:01,104 INFO L85 PathProgramCache]: Analyzing trace with hash 483664480, now seen corresponding path program 1 times [2024-01-29 22:59:01,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:01,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133968712] [2024-01-29 22:59:01,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:01,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:01,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:01,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133968712] [2024-01-29 22:59:01,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133968712] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:01,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:01,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:01,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631625744] [2024-01-29 22:59:01,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:01,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:59:01,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:01,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:59:01,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:59:01,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 479 [2024-01-29 22:59:01,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 391 transitions, 790 flow. Second operand has 4 states, 4 states have (on average 361.75) internal successors, (1447), 4 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:01,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:01,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 479 [2024-01-29 22:59:01,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:01,459 INFO L124 PetriNetUnfolderBase]: 603/1643 cut-off events. [2024-01-29 22:59:01,459 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:01,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2657 conditions, 1643 events. 603/1643 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9380 event pairs, 429 based on Foata normal form. 0/1105 useless extension candidates. Maximal degree in co-relation 2428. Up to 958 conditions per place. [2024-01-29 22:59:01,465 INFO L140 encePairwiseOnDemand]: 475/479 looper letters, 89 selfloop transitions, 3 changer transitions 0/390 dead transitions. [2024-01-29 22:59:01,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 390 transitions, 972 flow [2024-01-29 22:59:01,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:59:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:59:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1525 transitions. [2024-01-29 22:59:01,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.795929018789144 [2024-01-29 22:59:01,468 INFO L175 Difference]: Start difference. First operand has 391 places, 391 transitions, 790 flow. Second operand 4 states and 1525 transitions. [2024-01-29 22:59:01,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 390 transitions, 972 flow [2024-01-29 22:59:01,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 390 transitions, 968 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:01,473 INFO L231 Difference]: Finished difference. Result has 391 places, 390 transitions, 790 flow [2024-01-29 22:59:01,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=790, PETRI_PLACES=391, PETRI_TRANSITIONS=390} [2024-01-29 22:59:01,473 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -87 predicate places. [2024-01-29 22:59:01,474 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 390 transitions, 790 flow [2024-01-29 22:59:01,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 361.75) internal successors, (1447), 4 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:01,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:01,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:01,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 22:59:01,475 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:01,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:01,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2108698538, now seen corresponding path program 1 times [2024-01-29 22:59:01,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:01,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327902536] [2024-01-29 22:59:01,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:01,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:01,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:01,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327902536] [2024-01-29 22:59:01,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327902536] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:01,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:01,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:01,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045646339] [2024-01-29 22:59:01,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:01,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:01,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:01,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:01,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:01,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 479 [2024-01-29 22:59:01,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 390 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:01,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:01,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 479 [2024-01-29 22:59:01,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:01,863 INFO L124 PetriNetUnfolderBase]: 603/1642 cut-off events. [2024-01-29 22:59:01,863 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-29 22:59:01,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2621 conditions, 1642 events. 603/1642 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9364 event pairs, 429 based on Foata normal form. 0/1079 useless extension candidates. Maximal degree in co-relation 2418. Up to 955 conditions per place. [2024-01-29 22:59:01,869 INFO L140 encePairwiseOnDemand]: 476/479 looper letters, 54 selfloop transitions, 2 changer transitions 0/389 dead transitions. [2024-01-29 22:59:01,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 389 transitions, 900 flow [2024-01-29 22:59:01,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2024-01-29 22:59:01,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8622129436325678 [2024-01-29 22:59:01,872 INFO L175 Difference]: Start difference. First operand has 391 places, 390 transitions, 790 flow. Second operand 3 states and 1239 transitions. [2024-01-29 22:59:01,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 389 transitions, 900 flow [2024-01-29 22:59:01,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 389 transitions, 894 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:59:01,877 INFO L231 Difference]: Finished difference. Result has 389 places, 389 transitions, 786 flow [2024-01-29 22:59:01,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=389, PETRI_TRANSITIONS=389} [2024-01-29 22:59:01,878 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -89 predicate places. [2024-01-29 22:59:01,878 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 389 transitions, 786 flow [2024-01-29 22:59:01,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:01,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:01,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:01,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-29 22:59:01,879 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:01,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:01,879 INFO L85 PathProgramCache]: Analyzing trace with hash 945146764, now seen corresponding path program 1 times [2024-01-29 22:59:01,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:01,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054896317] [2024-01-29 22:59:01,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:01,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:01,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:01,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054896317] [2024-01-29 22:59:01,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054896317] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:01,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:01,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:01,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917850996] [2024-01-29 22:59:01,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:01,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:01,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:01,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:01,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:02,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 479 [2024-01-29 22:59:02,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 389 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:02,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:02,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 479 [2024-01-29 22:59:02,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:02,302 INFO L124 PetriNetUnfolderBase]: 603/1641 cut-off events. [2024-01-29 22:59:02,302 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:02,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2620 conditions, 1641 events. 603/1641 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9325 event pairs, 429 based on Foata normal form. 0/1080 useless extension candidates. Maximal degree in co-relation 2539. Up to 948 conditions per place. [2024-01-29 22:59:02,308 INFO L140 encePairwiseOnDemand]: 476/479 looper letters, 55 selfloop transitions, 2 changer transitions 0/388 dead transitions. [2024-01-29 22:59:02,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 388 transitions, 898 flow [2024-01-29 22:59:02,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2024-01-29 22:59:02,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8608211551844119 [2024-01-29 22:59:02,310 INFO L175 Difference]: Start difference. First operand has 389 places, 389 transitions, 786 flow. Second operand 3 states and 1237 transitions. [2024-01-29 22:59:02,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 388 transitions, 898 flow [2024-01-29 22:59:02,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 388 transitions, 894 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:02,315 INFO L231 Difference]: Finished difference. Result has 388 places, 388 transitions, 784 flow [2024-01-29 22:59:02,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=388, PETRI_TRANSITIONS=388} [2024-01-29 22:59:02,316 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -90 predicate places. [2024-01-29 22:59:02,316 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 388 transitions, 784 flow [2024-01-29 22:59:02,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:02,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:02,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:02,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-01-29 22:59:02,317 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:02,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:02,317 INFO L85 PathProgramCache]: Analyzing trace with hash -765220057, now seen corresponding path program 1 times [2024-01-29 22:59:02,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:02,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996037789] [2024-01-29 22:59:02,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:02,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:02,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:02,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996037789] [2024-01-29 22:59:02,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996037789] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:02,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:02,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:02,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088352112] [2024-01-29 22:59:02,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:02,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:02,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:02,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:02,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:02,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 479 [2024-01-29 22:59:02,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 388 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 387.0) internal successors, (1161), 3 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:02,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:02,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 479 [2024-01-29 22:59:02,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:02,763 INFO L124 PetriNetUnfolderBase]: 603/1638 cut-off events. [2024-01-29 22:59:02,764 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:02,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2623 conditions, 1638 events. 603/1638 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9339 event pairs, 429 based on Foata normal form. 2/1083 useless extension candidates. Maximal degree in co-relation 2424. Up to 954 conditions per place. [2024-01-29 22:59:02,769 INFO L140 encePairwiseOnDemand]: 474/479 looper letters, 61 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2024-01-29 22:59:02,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 385 transitions, 904 flow [2024-01-29 22:59:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1221 transitions. [2024-01-29 22:59:02,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8496868475991649 [2024-01-29 22:59:02,772 INFO L175 Difference]: Start difference. First operand has 388 places, 388 transitions, 784 flow. Second operand 3 states and 1221 transitions. [2024-01-29 22:59:02,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 385 transitions, 904 flow [2024-01-29 22:59:02,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 385 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:02,776 INFO L231 Difference]: Finished difference. Result has 385 places, 385 transitions, 778 flow [2024-01-29 22:59:02,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=385, PETRI_TRANSITIONS=385} [2024-01-29 22:59:02,777 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -93 predicate places. [2024-01-29 22:59:02,777 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 385 transitions, 778 flow [2024-01-29 22:59:02,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 387.0) internal successors, (1161), 3 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:02,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:02,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:02,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-01-29 22:59:02,778 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:02,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:02,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2047983596, now seen corresponding path program 1 times [2024-01-29 22:59:02,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:02,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79851480] [2024-01-29 22:59:02,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:02,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:02,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:02,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79851480] [2024-01-29 22:59:02,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79851480] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:02,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:02,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:02,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405866181] [2024-01-29 22:59:02,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:02,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:02,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:02,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:02,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:02,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 479 [2024-01-29 22:59:02,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 385 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:02,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:02,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 479 [2024-01-29 22:59:02,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:03,109 INFO L124 PetriNetUnfolderBase]: 603/1637 cut-off events. [2024-01-29 22:59:03,109 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:03,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2616 conditions, 1637 events. 603/1637 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9308 event pairs, 429 based on Foata normal form. 0/1079 useless extension candidates. Maximal degree in co-relation 2418. Up to 948 conditions per place. [2024-01-29 22:59:03,114 INFO L140 encePairwiseOnDemand]: 476/479 looper letters, 55 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2024-01-29 22:59:03,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 384 transitions, 890 flow [2024-01-29 22:59:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2024-01-29 22:59:03,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8608211551844119 [2024-01-29 22:59:03,116 INFO L175 Difference]: Start difference. First operand has 385 places, 385 transitions, 778 flow. Second operand 3 states and 1237 transitions. [2024-01-29 22:59:03,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 384 transitions, 890 flow [2024-01-29 22:59:03,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 384 transitions, 886 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:03,120 INFO L231 Difference]: Finished difference. Result has 384 places, 384 transitions, 776 flow [2024-01-29 22:59:03,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=384, PETRI_TRANSITIONS=384} [2024-01-29 22:59:03,121 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -94 predicate places. [2024-01-29 22:59:03,121 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 384 transitions, 776 flow [2024-01-29 22:59:03,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:03,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:03,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:03,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-01-29 22:59:03,122 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:03,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:03,123 INFO L85 PathProgramCache]: Analyzing trace with hash -937016489, now seen corresponding path program 1 times [2024-01-29 22:59:03,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:03,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434168247] [2024-01-29 22:59:03,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:03,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:03,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-01-29 22:59:03,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:03,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434168247] [2024-01-29 22:59:03,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434168247] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:03,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:03,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:03,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304113856] [2024-01-29 22:59:03,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:03,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:03,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:03,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:03,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:03,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 479 [2024-01-29 22:59:03,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 384 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 379.0) internal successors, (1137), 3 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:03,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:03,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 479 [2024-01-29 22:59:03,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:03,584 INFO L124 PetriNetUnfolderBase]: 603/1630 cut-off events. [2024-01-29 22:59:03,584 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:03,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2619 conditions, 1630 events. 603/1630 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9313 event pairs, 429 based on Foata normal form. 5/1091 useless extension candidates. Maximal degree in co-relation 2424. Up to 954 conditions per place. [2024-01-29 22:59:03,589 INFO L140 encePairwiseOnDemand]: 470/479 looper letters, 65 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-01-29 22:59:03,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 377 transitions, 896 flow [2024-01-29 22:59:03,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:03,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:03,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1205 transitions. [2024-01-29 22:59:03,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8385525400139179 [2024-01-29 22:59:03,592 INFO L175 Difference]: Start difference. First operand has 384 places, 384 transitions, 776 flow. Second operand 3 states and 1205 transitions. [2024-01-29 22:59:03,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 377 transitions, 896 flow [2024-01-29 22:59:03,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 377 transitions, 892 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:03,596 INFO L231 Difference]: Finished difference. Result has 377 places, 377 transitions, 762 flow [2024-01-29 22:59:03,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=377, PETRI_TRANSITIONS=377} [2024-01-29 22:59:03,596 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -101 predicate places. [2024-01-29 22:59:03,596 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 377 transitions, 762 flow [2024-01-29 22:59:03,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 379.0) internal successors, (1137), 3 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:03,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:03,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:03,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-01-29 22:59:03,597 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:03,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:03,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1470331436, now seen corresponding path program 1 times [2024-01-29 22:59:03,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:03,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594001223] [2024-01-29 22:59:03,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:03,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:03,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:03,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:03,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594001223] [2024-01-29 22:59:03,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594001223] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:03,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:03,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:03,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553402216] [2024-01-29 22:59:03,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:03,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:03,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:03,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:03,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:03,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 479 [2024-01-29 22:59:03,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 377 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:03,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:03,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 479 [2024-01-29 22:59:03,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:04,115 INFO L124 PetriNetUnfolderBase]: 603/1629 cut-off events. [2024-01-29 22:59:04,116 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:04,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2614 conditions, 1629 events. 603/1629 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9306 event pairs, 429 based on Foata normal form. 0/1082 useless extension candidates. Maximal degree in co-relation 2425. Up to 955 conditions per place. [2024-01-29 22:59:04,120 INFO L140 encePairwiseOnDemand]: 476/479 looper letters, 61 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2024-01-29 22:59:04,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 376 transitions, 886 flow [2024-01-29 22:59:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:04,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1201 transitions. [2024-01-29 22:59:04,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8357689631176062 [2024-01-29 22:59:04,122 INFO L175 Difference]: Start difference. First operand has 377 places, 377 transitions, 762 flow. Second operand 3 states and 1201 transitions. [2024-01-29 22:59:04,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 376 transitions, 886 flow [2024-01-29 22:59:04,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 376 transitions, 882 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:04,126 INFO L231 Difference]: Finished difference. Result has 376 places, 376 transitions, 760 flow [2024-01-29 22:59:04,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=376, PETRI_TRANSITIONS=376} [2024-01-29 22:59:04,127 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -102 predicate places. [2024-01-29 22:59:04,127 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 376 transitions, 760 flow [2024-01-29 22:59:04,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:04,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:04,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:04,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-01-29 22:59:04,128 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:04,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:04,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1664364471, now seen corresponding path program 1 times [2024-01-29 22:59:04,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:04,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765376762] [2024-01-29 22:59:04,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:04,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:04,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:04,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765376762] [2024-01-29 22:59:04,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765376762] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:04,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:04,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:04,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959483355] [2024-01-29 22:59:04,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:04,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:04,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:04,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:04,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:04,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 479 [2024-01-29 22:59:04,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 376 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:04,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:04,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 479 [2024-01-29 22:59:04,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:04,622 INFO L124 PetriNetUnfolderBase]: 603/1628 cut-off events. [2024-01-29 22:59:04,622 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:04,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2613 conditions, 1628 events. 603/1628 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9277 event pairs, 429 based on Foata normal form. 0/1082 useless extension candidates. Maximal degree in co-relation 2425. Up to 955 conditions per place. [2024-01-29 22:59:04,627 INFO L140 encePairwiseOnDemand]: 476/479 looper letters, 61 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2024-01-29 22:59:04,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 375 transitions, 884 flow [2024-01-29 22:59:04,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:04,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1201 transitions. [2024-01-29 22:59:04,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8357689631176062 [2024-01-29 22:59:04,630 INFO L175 Difference]: Start difference. First operand has 376 places, 376 transitions, 760 flow. Second operand 3 states and 1201 transitions. [2024-01-29 22:59:04,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 375 transitions, 884 flow [2024-01-29 22:59:04,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 375 transitions, 880 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:04,634 INFO L231 Difference]: Finished difference. Result has 375 places, 375 transitions, 758 flow [2024-01-29 22:59:04,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=375, PETRI_TRANSITIONS=375} [2024-01-29 22:59:04,634 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -103 predicate places. [2024-01-29 22:59:04,634 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 375 transitions, 758 flow [2024-01-29 22:59:04,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:04,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:04,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:04,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-01-29 22:59:04,635 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:04,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:04,636 INFO L85 PathProgramCache]: Analyzing trace with hash -55689800, now seen corresponding path program 1 times [2024-01-29 22:59:04,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:04,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579006401] [2024-01-29 22:59:04,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:04,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:04,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:04,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:04,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579006401] [2024-01-29 22:59:04,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579006401] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:04,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:04,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:04,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052970770] [2024-01-29 22:59:04,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:04,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:04,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:04,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:04,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:05,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 479 [2024-01-29 22:59:05,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 375 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:05,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:05,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 479 [2024-01-29 22:59:05,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:05,239 INFO L124 PetriNetUnfolderBase]: 603/1623 cut-off events. [2024-01-29 22:59:05,239 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:05,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2618 conditions, 1623 events. 603/1623 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9325 event pairs, 429 based on Foata normal form. 3/1088 useless extension candidates. Maximal degree in co-relation 2435. Up to 965 conditions per place. [2024-01-29 22:59:05,244 INFO L140 encePairwiseOnDemand]: 472/479 looper letters, 71 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2024-01-29 22:59:05,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 370 transitions, 894 flow [2024-01-29 22:59:05,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:05,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1167 transitions. [2024-01-29 22:59:05,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8121085594989561 [2024-01-29 22:59:05,247 INFO L175 Difference]: Start difference. First operand has 375 places, 375 transitions, 758 flow. Second operand 3 states and 1167 transitions. [2024-01-29 22:59:05,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 370 transitions, 894 flow [2024-01-29 22:59:05,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 370 transitions, 890 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:05,251 INFO L231 Difference]: Finished difference. Result has 370 places, 370 transitions, 748 flow [2024-01-29 22:59:05,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=370, PETRI_TRANSITIONS=370} [2024-01-29 22:59:05,252 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -108 predicate places. [2024-01-29 22:59:05,252 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 370 transitions, 748 flow [2024-01-29 22:59:05,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:05,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:05,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:05,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-01-29 22:59:05,253 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:05,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:05,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1726382343, now seen corresponding path program 1 times [2024-01-29 22:59:05,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:05,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783728596] [2024-01-29 22:59:05,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:05,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:05,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:05,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:05,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783728596] [2024-01-29 22:59:05,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783728596] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:05,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:05,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:05,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696991305] [2024-01-29 22:59:05,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:05,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:59:05,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:05,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:59:05,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:59:05,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 479 [2024-01-29 22:59:05,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 370 transitions, 748 flow. Second operand has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:05,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:05,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 479 [2024-01-29 22:59:05,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:05,995 INFO L124 PetriNetUnfolderBase]: 603/1622 cut-off events. [2024-01-29 22:59:05,995 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:05,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2633 conditions, 1622 events. 603/1622 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9313 event pairs, 429 based on Foata normal form. 0/1096 useless extension candidates. Maximal degree in co-relation 2435. Up to 965 conditions per place. [2024-01-29 22:59:06,000 INFO L140 encePairwiseOnDemand]: 475/479 looper letters, 86 selfloop transitions, 3 changer transitions 0/369 dead transitions. [2024-01-29 22:59:06,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 369 transitions, 924 flow [2024-01-29 22:59:06,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:59:06,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:59:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1502 transitions. [2024-01-29 22:59:06,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7839248434237995 [2024-01-29 22:59:06,004 INFO L175 Difference]: Start difference. First operand has 370 places, 370 transitions, 748 flow. Second operand 4 states and 1502 transitions. [2024-01-29 22:59:06,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 369 transitions, 924 flow [2024-01-29 22:59:06,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 369 transitions, 920 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:06,008 INFO L231 Difference]: Finished difference. Result has 370 places, 369 transitions, 748 flow [2024-01-29 22:59:06,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=748, PETRI_PLACES=370, PETRI_TRANSITIONS=369} [2024-01-29 22:59:06,009 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -108 predicate places. [2024-01-29 22:59:06,009 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 369 transitions, 748 flow [2024-01-29 22:59:06,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:06,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:06,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:06,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-01-29 22:59:06,010 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:06,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:06,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1978243602, now seen corresponding path program 1 times [2024-01-29 22:59:06,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:06,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383546863] [2024-01-29 22:59:06,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:06,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:06,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:06,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383546863] [2024-01-29 22:59:06,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383546863] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:06,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:06,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:06,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406721385] [2024-01-29 22:59:06,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:06,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:06,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:06,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:06,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:06,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 479 [2024-01-29 22:59:06,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 369 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:06,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:06,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 479 [2024-01-29 22:59:06,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:06,593 INFO L124 PetriNetUnfolderBase]: 603/1620 cut-off events. [2024-01-29 22:59:06,594 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-29 22:59:06,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 1620 events. 603/1620 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9335 event pairs, 429 based on Foata normal form. 0/1079 useless extension candidates. Maximal degree in co-relation 2426. Up to 956 conditions per place. [2024-01-29 22:59:06,598 INFO L140 encePairwiseOnDemand]: 475/479 looper letters, 62 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2024-01-29 22:59:06,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 367 transitions, 872 flow [2024-01-29 22:59:06,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1197 transitions. [2024-01-29 22:59:06,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8329853862212944 [2024-01-29 22:59:06,601 INFO L175 Difference]: Start difference. First operand has 370 places, 369 transitions, 748 flow. Second operand 3 states and 1197 transitions. [2024-01-29 22:59:06,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 367 transitions, 872 flow [2024-01-29 22:59:06,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 367 transitions, 866 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:59:06,605 INFO L231 Difference]: Finished difference. Result has 367 places, 367 transitions, 742 flow [2024-01-29 22:59:06,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=367, PETRI_TRANSITIONS=367} [2024-01-29 22:59:06,606 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -111 predicate places. [2024-01-29 22:59:06,606 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 367 transitions, 742 flow [2024-01-29 22:59:06,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:06,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:06,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:06,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-01-29 22:59:06,607 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:06,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1687273336, now seen corresponding path program 1 times [2024-01-29 22:59:06,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:06,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652794854] [2024-01-29 22:59:06,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:06,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:06,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:06,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652794854] [2024-01-29 22:59:06,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652794854] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:06,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:06,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:06,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461273085] [2024-01-29 22:59:06,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:06,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:06,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:06,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:06,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:06,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 479 [2024-01-29 22:59:06,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 367 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:06,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:06,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 479 [2024-01-29 22:59:06,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:07,137 INFO L124 PetriNetUnfolderBase]: 603/1609 cut-off events. [2024-01-29 22:59:07,138 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:07,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2592 conditions, 1609 events. 603/1609 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9286 event pairs, 429 based on Foata normal form. 7/1084 useless extension candidates. Maximal degree in co-relation 2411. Up to 941 conditions per place. [2024-01-29 22:59:07,143 INFO L140 encePairwiseOnDemand]: 466/479 looper letters, 59 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2024-01-29 22:59:07,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 356 transitions, 842 flow [2024-01-29 22:59:07,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:07,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1197 transitions. [2024-01-29 22:59:07,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8329853862212944 [2024-01-29 22:59:07,147 INFO L175 Difference]: Start difference. First operand has 367 places, 367 transitions, 742 flow. Second operand 3 states and 1197 transitions. [2024-01-29 22:59:07,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 356 transitions, 842 flow [2024-01-29 22:59:07,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 356 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:07,151 INFO L231 Difference]: Finished difference. Result has 356 places, 356 transitions, 720 flow [2024-01-29 22:59:07,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=356, PETRI_TRANSITIONS=356} [2024-01-29 22:59:07,154 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -122 predicate places. [2024-01-29 22:59:07,154 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 356 transitions, 720 flow [2024-01-29 22:59:07,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:07,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:07,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:07,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-01-29 22:59:07,155 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:07,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:07,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1558864865, now seen corresponding path program 1 times [2024-01-29 22:59:07,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:07,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240668533] [2024-01-29 22:59:07,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:07,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:07,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:07,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240668533] [2024-01-29 22:59:07,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240668533] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:07,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:07,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:07,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076298883] [2024-01-29 22:59:07,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:07,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:59:07,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:07,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:59:07,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:59:07,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 479 [2024-01-29 22:59:07,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 356 transitions, 720 flow. Second operand has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:07,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:07,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 479 [2024-01-29 22:59:07,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:07,792 INFO L124 PetriNetUnfolderBase]: 603/1606 cut-off events. [2024-01-29 22:59:07,793 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:07,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2633 conditions, 1606 events. 603/1606 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9247 event pairs, 429 based on Foata normal form. 0/1110 useless extension candidates. Maximal degree in co-relation 2302. Up to 944 conditions per place. [2024-01-29 22:59:07,797 INFO L140 encePairwiseOnDemand]: 473/479 looper letters, 102 selfloop transitions, 3 changer transitions 0/353 dead transitions. [2024-01-29 22:59:07,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 353 transitions, 924 flow [2024-01-29 22:59:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:59:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:59:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1432 transitions. [2024-01-29 22:59:07,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7473903966597077 [2024-01-29 22:59:07,800 INFO L175 Difference]: Start difference. First operand has 356 places, 356 transitions, 720 flow. Second operand 4 states and 1432 transitions. [2024-01-29 22:59:07,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 353 transitions, 924 flow [2024-01-29 22:59:07,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 353 transitions, 920 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:07,804 INFO L231 Difference]: Finished difference. Result has 354 places, 353 transitions, 716 flow [2024-01-29 22:59:07,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=716, PETRI_PLACES=354, PETRI_TRANSITIONS=353} [2024-01-29 22:59:07,805 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -124 predicate places. [2024-01-29 22:59:07,805 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 353 transitions, 716 flow [2024-01-29 22:59:07,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:07,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:07,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:07,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-01-29 22:59:07,806 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:07,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:07,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1080171738, now seen corresponding path program 1 times [2024-01-29 22:59:07,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:07,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220612250] [2024-01-29 22:59:07,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:07,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:07,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:07,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220612250] [2024-01-29 22:59:07,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220612250] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:07,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:07,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:07,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146911761] [2024-01-29 22:59:07,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:07,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:07,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:07,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:07,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:08,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 479 [2024-01-29 22:59:08,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 353 transitions, 716 flow. Second operand has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:08,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:08,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 479 [2024-01-29 22:59:08,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:08,301 INFO L124 PetriNetUnfolderBase]: 603/1603 cut-off events. [2024-01-29 22:59:08,302 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-29 22:59:08,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2587 conditions, 1603 events. 603/1603 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9265 event pairs, 429 based on Foata normal form. 1/1078 useless extension candidates. Maximal degree in co-relation 2299. Up to 941 conditions per place. [2024-01-29 22:59:08,307 INFO L140 encePairwiseOnDemand]: 474/479 looper letters, 59 selfloop transitions, 2 changer transitions 0/350 dead transitions. [2024-01-29 22:59:08,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 350 transitions, 832 flow [2024-01-29 22:59:08,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:08,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1189 transitions. [2024-01-29 22:59:08,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8274182324286709 [2024-01-29 22:59:08,309 INFO L175 Difference]: Start difference. First operand has 354 places, 353 transitions, 716 flow. Second operand 3 states and 1189 transitions. [2024-01-29 22:59:08,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 350 transitions, 832 flow [2024-01-29 22:59:08,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 350 transitions, 826 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:59:08,313 INFO L231 Difference]: Finished difference. Result has 350 places, 350 transitions, 708 flow [2024-01-29 22:59:08,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=350, PETRI_TRANSITIONS=350} [2024-01-29 22:59:08,314 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -128 predicate places. [2024-01-29 22:59:08,314 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 350 transitions, 708 flow [2024-01-29 22:59:08,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:08,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:08,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:08,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-01-29 22:59:08,315 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:08,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:08,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1336996966, now seen corresponding path program 1 times [2024-01-29 22:59:08,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:08,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329010158] [2024-01-29 22:59:08,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:08,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:08,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-01-29 22:59:08,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:08,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329010158] [2024-01-29 22:59:08,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329010158] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:08,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:08,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:08,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904922779] [2024-01-29 22:59:08,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:08,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:08,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:08,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:08,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:08,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 479 [2024-01-29 22:59:08,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 350 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:08,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:08,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 479 [2024-01-29 22:59:08,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:08,845 INFO L124 PetriNetUnfolderBase]: 603/1590 cut-off events. [2024-01-29 22:59:08,845 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:08,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 1590 events. 603/1590 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9180 event pairs, 429 based on Foata normal form. 8/1081 useless extension candidates. Maximal degree in co-relation 2303. Up to 945 conditions per place. [2024-01-29 22:59:08,849 INFO L140 encePairwiseOnDemand]: 464/479 looper letters, 61 selfloop transitions, 2 changer transitions 0/337 dead transitions. [2024-01-29 22:59:08,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 337 transitions, 808 flow [2024-01-29 22:59:08,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1153 transitions. [2024-01-29 22:59:08,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.802366040361865 [2024-01-29 22:59:08,852 INFO L175 Difference]: Start difference. First operand has 350 places, 350 transitions, 708 flow. Second operand 3 states and 1153 transitions. [2024-01-29 22:59:08,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 337 transitions, 808 flow [2024-01-29 22:59:08,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 337 transitions, 804 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:08,855 INFO L231 Difference]: Finished difference. Result has 337 places, 337 transitions, 682 flow [2024-01-29 22:59:08,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=337, PETRI_TRANSITIONS=337} [2024-01-29 22:59:08,856 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -141 predicate places. [2024-01-29 22:59:08,856 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 337 transitions, 682 flow [2024-01-29 22:59:08,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:08,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:08,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:08,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-01-29 22:59:08,857 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:08,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:08,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1502768355, now seen corresponding path program 1 times [2024-01-29 22:59:08,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:08,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735411835] [2024-01-29 22:59:08,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:08,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:08,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-01-29 22:59:08,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:08,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735411835] [2024-01-29 22:59:08,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735411835] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:08,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:08,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:08,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017726725] [2024-01-29 22:59:08,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:08,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:08,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:08,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:08,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:09,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2024-01-29 22:59:09,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 337 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:09,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:09,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2024-01-29 22:59:09,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:09,541 INFO L124 PetriNetUnfolderBase]: 603/1584 cut-off events. [2024-01-29 22:59:09,541 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:09,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2572 conditions, 1584 events. 603/1584 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9212 event pairs, 429 based on Foata normal form. 2/1076 useless extension candidates. Maximal degree in co-relation 2306. Up to 948 conditions per place. [2024-01-29 22:59:09,545 INFO L140 encePairwiseOnDemand]: 471/479 looper letters, 64 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2024-01-29 22:59:09,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 331 transitions, 802 flow [2024-01-29 22:59:09,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2024-01-29 22:59:09,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7891440501043842 [2024-01-29 22:59:09,549 INFO L175 Difference]: Start difference. First operand has 337 places, 337 transitions, 682 flow. Second operand 3 states and 1134 transitions. [2024-01-29 22:59:09,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 331 transitions, 802 flow [2024-01-29 22:59:09,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 331 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:09,557 INFO L231 Difference]: Finished difference. Result has 331 places, 331 transitions, 670 flow [2024-01-29 22:59:09,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=331, PETRI_TRANSITIONS=331} [2024-01-29 22:59:09,558 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -147 predicate places. [2024-01-29 22:59:09,558 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 331 transitions, 670 flow [2024-01-29 22:59:09,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:09,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:09,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:09,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-01-29 22:59:09,564 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:09,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:09,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1051422903, now seen corresponding path program 1 times [2024-01-29 22:59:09,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:09,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662179312] [2024-01-29 22:59:09,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:09,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:09,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:09,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662179312] [2024-01-29 22:59:09,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662179312] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:09,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:09,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:09,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796971423] [2024-01-29 22:59:09,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:09,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:09,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:09,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:09,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:10,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2024-01-29 22:59:10,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 331 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 360.0) internal successors, (1080), 3 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:10,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:10,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2024-01-29 22:59:10,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:10,448 INFO L124 PetriNetUnfolderBase]: 603/1578 cut-off events. [2024-01-29 22:59:10,448 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:10,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2565 conditions, 1578 events. 603/1578 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9117 event pairs, 429 based on Foata normal form. 2/1075 useless extension candidates. Maximal degree in co-relation 2305. Up to 947 conditions per place. [2024-01-29 22:59:10,453 INFO L140 encePairwiseOnDemand]: 471/479 looper letters, 63 selfloop transitions, 2 changer transitions 0/325 dead transitions. [2024-01-29 22:59:10,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 325 transitions, 788 flow [2024-01-29 22:59:10,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1142 transitions. [2024-01-29 22:59:10,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7947112038970077 [2024-01-29 22:59:10,455 INFO L175 Difference]: Start difference. First operand has 331 places, 331 transitions, 670 flow. Second operand 3 states and 1142 transitions. [2024-01-29 22:59:10,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 325 transitions, 788 flow [2024-01-29 22:59:10,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 325 transitions, 784 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:10,460 INFO L231 Difference]: Finished difference. Result has 325 places, 325 transitions, 658 flow [2024-01-29 22:59:10,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=325, PETRI_TRANSITIONS=325} [2024-01-29 22:59:10,460 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -153 predicate places. [2024-01-29 22:59:10,460 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 325 transitions, 658 flow [2024-01-29 22:59:10,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.0) internal successors, (1080), 3 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:10,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:10,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:10,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-01-29 22:59:10,461 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:10,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:10,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1765627015, now seen corresponding path program 1 times [2024-01-29 22:59:10,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:10,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502768286] [2024-01-29 22:59:10,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:10,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:10,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:10,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502768286] [2024-01-29 22:59:10,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502768286] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:10,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:10,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:10,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505480663] [2024-01-29 22:59:10,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:10,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:59:10,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:10,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:59:10,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:59:10,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 479 [2024-01-29 22:59:10,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 325 transitions, 658 flow. Second operand has 4 states, 4 states have (on average 327.25) internal successors, (1309), 4 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:10,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:10,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 479 [2024-01-29 22:59:10,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:11,188 INFO L124 PetriNetUnfolderBase]: 603/1572 cut-off events. [2024-01-29 22:59:11,188 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:11,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2594 conditions, 1572 events. 603/1572 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9145 event pairs, 429 based on Foata normal form. 0/1079 useless extension candidates. Maximal degree in co-relation 2307. Up to 949 conditions per place. [2024-01-29 22:59:11,193 INFO L140 encePairwiseOnDemand]: 470/479 looper letters, 97 selfloop transitions, 3 changer transitions 0/319 dead transitions. [2024-01-29 22:59:11,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 319 transitions, 846 flow [2024-01-29 22:59:11,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:59:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:59:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1394 transitions. [2024-01-29 22:59:11,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7275574112734864 [2024-01-29 22:59:11,195 INFO L175 Difference]: Start difference. First operand has 325 places, 325 transitions, 658 flow. Second operand 4 states and 1394 transitions. [2024-01-29 22:59:11,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 319 transitions, 846 flow [2024-01-29 22:59:11,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 319 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:11,199 INFO L231 Difference]: Finished difference. Result has 320 places, 319 transitions, 648 flow [2024-01-29 22:59:11,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=648, PETRI_PLACES=320, PETRI_TRANSITIONS=319} [2024-01-29 22:59:11,201 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -158 predicate places. [2024-01-29 22:59:11,201 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 319 transitions, 648 flow [2024-01-29 22:59:11,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 327.25) internal successors, (1309), 4 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:11,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:11,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-29 22:59:11,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-01-29 22:59:11,202 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:11,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:11,202 INFO L85 PathProgramCache]: Analyzing trace with hash -644775469, now seen corresponding path program 1 times [2024-01-29 22:59:11,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:11,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544932016] [2024-01-29 22:59:11,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:11,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:11,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:11,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544932016] [2024-01-29 22:59:11,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544932016] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:11,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:11,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:11,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562359374] [2024-01-29 22:59:11,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:11,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:59:11,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:11,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:59:11,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:59:11,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 479 [2024-01-29 22:59:11,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 319 transitions, 648 flow. Second operand has 4 states, 4 states have (on average 336.25) internal successors, (1345), 4 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:11,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:11,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 479 [2024-01-29 22:59:11,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:11,911 INFO L124 PetriNetUnfolderBase]: 603/1562 cut-off events. [2024-01-29 22:59:11,911 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-29 22:59:11,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2582 conditions, 1562 events. 603/1562 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9091 event pairs, 429 based on Foata normal form. 0/1085 useless extension candidates. Maximal degree in co-relation 2299. Up to 941 conditions per place. [2024-01-29 22:59:11,916 INFO L140 encePairwiseOnDemand]: 459/479 looper letters, 87 selfloop transitions, 10 changer transitions 0/309 dead transitions. [2024-01-29 22:59:11,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 309 transitions, 822 flow [2024-01-29 22:59:11,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:59:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:59:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1435 transitions. [2024-01-29 22:59:11,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7489561586638831 [2024-01-29 22:59:11,918 INFO L175 Difference]: Start difference. First operand has 320 places, 319 transitions, 648 flow. Second operand 4 states and 1435 transitions. [2024-01-29 22:59:11,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 309 transitions, 822 flow [2024-01-29 22:59:11,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 309 transitions, 816 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:59:11,922 INFO L231 Difference]: Finished difference. Result has 310 places, 309 transitions, 642 flow [2024-01-29 22:59:11,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=642, PETRI_PLACES=310, PETRI_TRANSITIONS=309} [2024-01-29 22:59:11,923 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -168 predicate places. [2024-01-29 22:59:11,923 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 309 transitions, 642 flow [2024-01-29 22:59:11,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 336.25) internal successors, (1345), 4 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:11,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:11,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:11,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-01-29 22:59:11,924 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:11,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:11,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1410869316, now seen corresponding path program 1 times [2024-01-29 22:59:11,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:11,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645114014] [2024-01-29 22:59:11,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:11,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:12,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:12,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645114014] [2024-01-29 22:59:12,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645114014] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:12,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:12,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:59:12,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092738432] [2024-01-29 22:59:12,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:12,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:59:12,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:12,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:59:12,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:59:12,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 479 [2024-01-29 22:59:12,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 309 transitions, 642 flow. Second operand has 5 states, 5 states have (on average 314.4) internal successors, (1572), 5 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:12,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:12,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 479 [2024-01-29 22:59:12,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:12,795 INFO L124 PetriNetUnfolderBase]: 603/1558 cut-off events. [2024-01-29 22:59:12,796 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-29 22:59:12,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 1558 events. 603/1558 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9085 event pairs, 429 based on Foata normal form. 0/1088 useless extension candidates. Maximal degree in co-relation 2302. Up to 944 conditions per place. [2024-01-29 22:59:12,800 INFO L140 encePairwiseOnDemand]: 464/479 looper letters, 102 selfloop transitions, 11 changer transitions 0/305 dead transitions. [2024-01-29 22:59:12,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 305 transitions, 860 flow [2024-01-29 22:59:12,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:59:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:59:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1662 transitions. [2024-01-29 22:59:12,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6939457202505219 [2024-01-29 22:59:12,802 INFO L175 Difference]: Start difference. First operand has 310 places, 309 transitions, 642 flow. Second operand 5 states and 1662 transitions. [2024-01-29 22:59:12,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 305 transitions, 860 flow [2024-01-29 22:59:12,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 305 transitions, 840 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:59:12,806 INFO L231 Difference]: Finished difference. Result has 307 places, 305 transitions, 636 flow [2024-01-29 22:59:12,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=636, PETRI_PLACES=307, PETRI_TRANSITIONS=305} [2024-01-29 22:59:12,807 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -171 predicate places. [2024-01-29 22:59:12,807 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 305 transitions, 636 flow [2024-01-29 22:59:12,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 314.4) internal successors, (1572), 5 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:12,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:12,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:12,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-01-29 22:59:12,808 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:12,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:12,808 INFO L85 PathProgramCache]: Analyzing trace with hash -787274263, now seen corresponding path program 1 times [2024-01-29 22:59:12,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:12,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701030135] [2024-01-29 22:59:12,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:12,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:12,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:12,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701030135] [2024-01-29 22:59:12,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701030135] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:12,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:12,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:12,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855445629] [2024-01-29 22:59:12,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:12,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:59:12,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:12,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:59:12,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:59:13,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 479 [2024-01-29 22:59:13,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 305 transitions, 636 flow. Second operand has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:13,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:13,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 479 [2024-01-29 22:59:13,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:13,454 INFO L124 PetriNetUnfolderBase]: 603/1554 cut-off events. [2024-01-29 22:59:13,454 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-01-29 22:59:13,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2570 conditions, 1554 events. 603/1554 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9075 event pairs, 429 based on Foata normal form. 0/1077 useless extension candidates. Maximal degree in co-relation 2299. Up to 941 conditions per place. [2024-01-29 22:59:13,458 INFO L140 encePairwiseOnDemand]: 465/479 looper letters, 75 selfloop transitions, 10 changer transitions 0/301 dead transitions. [2024-01-29 22:59:13,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 301 transitions, 798 flow [2024-01-29 22:59:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:59:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:59:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1437 transitions. [2024-01-29 22:59:13,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-01-29 22:59:13,460 INFO L175 Difference]: Start difference. First operand has 307 places, 305 transitions, 636 flow. Second operand 4 states and 1437 transitions. [2024-01-29 22:59:13,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 301 transitions, 798 flow [2024-01-29 22:59:13,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 301 transitions, 776 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 22:59:13,463 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 626 flow [2024-01-29 22:59:13,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=626, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2024-01-29 22:59:13,464 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -176 predicate places. [2024-01-29 22:59:13,464 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 626 flow [2024-01-29 22:59:13,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:13,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:13,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:13,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-01-29 22:59:13,465 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr95ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:13,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:13,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1364303027, now seen corresponding path program 1 times [2024-01-29 22:59:13,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:13,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3002826] [2024-01-29 22:59:13,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:13,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:13,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:13,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:13,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3002826] [2024-01-29 22:59:13,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3002826] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:13,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:13,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:13,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582568893] [2024-01-29 22:59:13,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:13,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:59:13,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:13,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:59:13,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:59:13,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 479 [2024-01-29 22:59:13,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 626 flow. Second operand has 4 states, 4 states have (on average 341.25) internal successors, (1365), 4 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:13,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:13,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 479 [2024-01-29 22:59:13,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:14,174 INFO L124 PetriNetUnfolderBase]: 603/1550 cut-off events. [2024-01-29 22:59:14,175 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-29 22:59:14,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2565 conditions, 1550 events. 603/1550 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9101 event pairs, 429 based on Foata normal form. 0/1073 useless extension candidates. Maximal degree in co-relation 2299. Up to 941 conditions per place. [2024-01-29 22:59:14,179 INFO L140 encePairwiseOnDemand]: 465/479 looper letters, 75 selfloop transitions, 10 changer transitions 0/297 dead transitions. [2024-01-29 22:59:14,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 297 transitions, 788 flow [2024-01-29 22:59:14,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:59:14,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:59:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1437 transitions. [2024-01-29 22:59:14,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-01-29 22:59:14,180 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 626 flow. Second operand 4 states and 1437 transitions. [2024-01-29 22:59:14,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 297 transitions, 788 flow [2024-01-29 22:59:14,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 297 transitions, 768 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:59:14,184 INFO L231 Difference]: Finished difference. Result has 298 places, 297 transitions, 618 flow [2024-01-29 22:59:14,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=618, PETRI_PLACES=298, PETRI_TRANSITIONS=297} [2024-01-29 22:59:14,184 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -180 predicate places. [2024-01-29 22:59:14,185 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 297 transitions, 618 flow [2024-01-29 22:59:14,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 341.25) internal successors, (1365), 4 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:14,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:14,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:14,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-01-29 22:59:14,185 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:14,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:14,186 INFO L85 PathProgramCache]: Analyzing trace with hash 677458412, now seen corresponding path program 1 times [2024-01-29 22:59:14,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:14,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558168891] [2024-01-29 22:59:14,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:14,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:14,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:14,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558168891] [2024-01-29 22:59:14,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558168891] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:14,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:14,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:59:14,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2371224] [2024-01-29 22:59:14,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:14,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:59:14,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:14,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:59:14,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:59:14,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 479 [2024-01-29 22:59:14,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 297 transitions, 618 flow. Second operand has 5 states, 5 states have (on average 292.8) internal successors, (1464), 5 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:14,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:14,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 479 [2024-01-29 22:59:14,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:14,799 INFO L124 PetriNetUnfolderBase]: 603/1544 cut-off events. [2024-01-29 22:59:14,816 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:14,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2622 conditions, 1544 events. 603/1544 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9035 event pairs, 429 based on Foata normal form. 0/1081 useless extension candidates. Maximal degree in co-relation 2299. Up to 941 conditions per place. [2024-01-29 22:59:14,820 INFO L140 encePairwiseOnDemand]: 461/479 looper letters, 136 selfloop transitions, 12 changer transitions 0/291 dead transitions. [2024-01-29 22:59:14,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 291 transitions, 902 flow [2024-01-29 22:59:14,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:59:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:59:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1574 transitions. [2024-01-29 22:59:14,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6572025052192066 [2024-01-29 22:59:14,823 INFO L175 Difference]: Start difference. First operand has 298 places, 297 transitions, 618 flow. Second operand 5 states and 1574 transitions. [2024-01-29 22:59:14,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 291 transitions, 902 flow [2024-01-29 22:59:14,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 291 transitions, 882 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:59:14,827 INFO L231 Difference]: Finished difference. Result has 293 places, 291 transitions, 610 flow [2024-01-29 22:59:14,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=610, PETRI_PLACES=293, PETRI_TRANSITIONS=291} [2024-01-29 22:59:14,827 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -185 predicate places. [2024-01-29 22:59:14,828 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 291 transitions, 610 flow [2024-01-29 22:59:14,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 292.8) internal successors, (1464), 5 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:14,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:14,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:14,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-01-29 22:59:14,829 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:14,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:14,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1797449672, now seen corresponding path program 1 times [2024-01-29 22:59:14,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:14,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134288967] [2024-01-29 22:59:14,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:14,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:14,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:14,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134288967] [2024-01-29 22:59:14,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134288967] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:14,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:14,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:14,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288718931] [2024-01-29 22:59:14,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:14,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:59:14,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:14,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:59:14,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:59:15,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 479 [2024-01-29 22:59:15,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 291 transitions, 610 flow. Second operand has 4 states, 4 states have (on average 354.75) internal successors, (1419), 4 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:15,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:15,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 479 [2024-01-29 22:59:15,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:15,468 INFO L124 PetriNetUnfolderBase]: 603/1542 cut-off events. [2024-01-29 22:59:15,482 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-01-29 22:59:15,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 1542 events. 603/1542 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9049 event pairs, 429 based on Foata normal form. 0/1077 useless extension candidates. Maximal degree in co-relation 2299. Up to 941 conditions per place. [2024-01-29 22:59:15,487 INFO L140 encePairwiseOnDemand]: 471/479 looper letters, 79 selfloop transitions, 6 changer transitions 0/289 dead transitions. [2024-01-29 22:59:15,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 289 transitions, 776 flow [2024-01-29 22:59:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:59:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:59:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1487 transitions. [2024-01-29 22:59:15,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7760960334029228 [2024-01-29 22:59:15,489 INFO L175 Difference]: Start difference. First operand has 293 places, 291 transitions, 610 flow. Second operand 4 states and 1487 transitions. [2024-01-29 22:59:15,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 289 transitions, 776 flow [2024-01-29 22:59:15,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 289 transitions, 752 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 22:59:15,492 INFO L231 Difference]: Finished difference. Result has 290 places, 289 transitions, 594 flow [2024-01-29 22:59:15,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=594, PETRI_PLACES=290, PETRI_TRANSITIONS=289} [2024-01-29 22:59:15,495 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -188 predicate places. [2024-01-29 22:59:15,495 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 289 transitions, 594 flow [2024-01-29 22:59:15,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 354.75) internal successors, (1419), 4 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:15,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:15,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:15,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-01-29 22:59:15,504 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:15,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:15,505 INFO L85 PathProgramCache]: Analyzing trace with hash 113636475, now seen corresponding path program 1 times [2024-01-29 22:59:15,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:15,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654750420] [2024-01-29 22:59:15,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:15,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:15,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:15,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654750420] [2024-01-29 22:59:15,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654750420] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:15,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:15,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:59:15,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278625401] [2024-01-29 22:59:15,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:15,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:59:15,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:15,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:59:15,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:59:16,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 479 [2024-01-29 22:59:16,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 289 transitions, 594 flow. Second operand has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:16,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:16,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 479 [2024-01-29 22:59:16,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:16,246 INFO L124 PetriNetUnfolderBase]: 603/1536 cut-off events. [2024-01-29 22:59:16,246 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-01-29 22:59:16,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2567 conditions, 1536 events. 603/1536 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8977 event pairs, 429 based on Foata normal form. 2/1075 useless extension candidates. Maximal degree in co-relation 2299. Up to 941 conditions per place. [2024-01-29 22:59:16,250 INFO L140 encePairwiseOnDemand]: 461/479 looper letters, 93 selfloop transitions, 12 changer transitions 0/283 dead transitions. [2024-01-29 22:59:16,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 283 transitions, 792 flow [2024-01-29 22:59:16,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:59:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:59:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1711 transitions. [2024-01-29 22:59:16,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7144050104384133 [2024-01-29 22:59:16,252 INFO L175 Difference]: Start difference. First operand has 290 places, 289 transitions, 594 flow. Second operand 5 states and 1711 transitions. [2024-01-29 22:59:16,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 283 transitions, 792 flow [2024-01-29 22:59:16,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 283 transitions, 780 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:59:16,255 INFO L231 Difference]: Finished difference. Result has 285 places, 283 transitions, 594 flow [2024-01-29 22:59:16,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=594, PETRI_PLACES=285, PETRI_TRANSITIONS=283} [2024-01-29 22:59:16,256 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -193 predicate places. [2024-01-29 22:59:16,256 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 283 transitions, 594 flow [2024-01-29 22:59:16,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:16,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:16,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:16,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-01-29 22:59:16,257 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:16,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:16,257 INFO L85 PathProgramCache]: Analyzing trace with hash -772235035, now seen corresponding path program 1 times [2024-01-29 22:59:16,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:16,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508756111] [2024-01-29 22:59:16,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:16,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:16,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:16,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508756111] [2024-01-29 22:59:16,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508756111] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:16,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:16,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:59:16,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729142653] [2024-01-29 22:59:16,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:16,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:59:16,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:16,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:59:16,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:59:17,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 479 [2024-01-29 22:59:17,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 283 transitions, 594 flow. Second operand has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:17,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:17,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 479 [2024-01-29 22:59:17,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:17,228 INFO L124 PetriNetUnfolderBase]: 603/1534 cut-off events. [2024-01-29 22:59:17,228 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-01-29 22:59:17,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2571 conditions, 1534 events. 603/1534 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9024 event pairs, 429 based on Foata normal form. 0/1072 useless extension candidates. Maximal degree in co-relation 2302. Up to 944 conditions per place. [2024-01-29 22:59:17,232 INFO L140 encePairwiseOnDemand]: 470/479 looper letters, 98 selfloop transitions, 7 changer transitions 0/281 dead transitions. [2024-01-29 22:59:17,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 281 transitions, 800 flow [2024-01-29 22:59:17,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:59:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:59:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1742 transitions. [2024-01-29 22:59:17,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.727348643006263 [2024-01-29 22:59:17,234 INFO L175 Difference]: Start difference. First operand has 285 places, 283 transitions, 594 flow. Second operand 5 states and 1742 transitions. [2024-01-29 22:59:17,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 281 transitions, 800 flow [2024-01-29 22:59:17,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 281 transitions, 776 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 22:59:17,238 INFO L231 Difference]: Finished difference. Result has 283 places, 281 transitions, 580 flow [2024-01-29 22:59:17,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=580, PETRI_PLACES=283, PETRI_TRANSITIONS=281} [2024-01-29 22:59:17,238 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -195 predicate places. [2024-01-29 22:59:17,238 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 281 transitions, 580 flow [2024-01-29 22:59:17,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:17,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:17,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:17,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-01-29 22:59:17,239 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr118ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:17,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:17,240 INFO L85 PathProgramCache]: Analyzing trace with hash -350401058, now seen corresponding path program 1 times [2024-01-29 22:59:17,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:17,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602961187] [2024-01-29 22:59:17,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:17,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:17,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:17,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602961187] [2024-01-29 22:59:17,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602961187] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:17,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:17,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:59:17,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850317575] [2024-01-29 22:59:17,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:17,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:59:17,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:17,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:59:17,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:59:17,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 479 [2024-01-29 22:59:17,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 281 transitions, 580 flow. Second operand has 5 states, 5 states have (on average 313.8) internal successors, (1569), 5 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:17,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:17,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 479 [2024-01-29 22:59:17,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:17,982 INFO L124 PetriNetUnfolderBase]: 1030/2383 cut-off events. [2024-01-29 22:59:17,982 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-29 22:59:17,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4143 conditions, 2383 events. 1030/2383 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16021 event pairs, 357 based on Foata normal form. 0/1665 useless extension candidates. Maximal degree in co-relation 3860. Up to 879 conditions per place. [2024-01-29 22:59:17,989 INFO L140 encePairwiseOnDemand]: 460/479 looper letters, 153 selfloop transitions, 12 changer transitions 0/304 dead transitions. [2024-01-29 22:59:17,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 304 transitions, 959 flow [2024-01-29 22:59:17,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:59:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:59:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1697 transitions. [2024-01-29 22:59:17,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7085594989561587 [2024-01-29 22:59:17,991 INFO L175 Difference]: Start difference. First operand has 283 places, 281 transitions, 580 flow. Second operand 5 states and 1697 transitions. [2024-01-29 22:59:17,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 304 transitions, 959 flow [2024-01-29 22:59:17,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 304 transitions, 945 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 22:59:17,995 INFO L231 Difference]: Finished difference. Result has 278 places, 276 transitions, 594 flow [2024-01-29 22:59:17,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=594, PETRI_PLACES=278, PETRI_TRANSITIONS=276} [2024-01-29 22:59:17,995 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -200 predicate places. [2024-01-29 22:59:17,996 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 276 transitions, 594 flow [2024-01-29 22:59:17,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 313.8) internal successors, (1569), 5 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:17,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:17,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:17,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-01-29 22:59:17,997 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:17,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:17,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1830519089, now seen corresponding path program 1 times [2024-01-29 22:59:17,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:17,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405757637] [2024-01-29 22:59:17,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:17,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:59:18,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:18,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405757637] [2024-01-29 22:59:18,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405757637] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:18,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:18,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:18,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995471587] [2024-01-29 22:59:18,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:18,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:59:18,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:18,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:59:18,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:59:18,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 479 [2024-01-29 22:59:18,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 276 transitions, 594 flow. Second operand has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:18,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:18,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 479 [2024-01-29 22:59:18,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:18,834 INFO L124 PetriNetUnfolderBase]: 1030/2473 cut-off events. [2024-01-29 22:59:18,835 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2024-01-29 22:59:18,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4315 conditions, 2473 events. 1030/2473 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17026 event pairs, 775 based on Foata normal form. 0/1778 useless extension candidates. Maximal degree in co-relation 1819. Up to 1629 conditions per place. [2024-01-29 22:59:18,842 INFO L140 encePairwiseOnDemand]: 471/479 looper letters, 100 selfloop transitions, 6 changer transitions 0/274 dead transitions. [2024-01-29 22:59:18,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 274 transitions, 802 flow [2024-01-29 22:59:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:59:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:59:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1419 transitions. [2024-01-29 22:59:18,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7406054279749478 [2024-01-29 22:59:18,844 INFO L175 Difference]: Start difference. First operand has 278 places, 276 transitions, 594 flow. Second operand 4 states and 1419 transitions. [2024-01-29 22:59:18,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 274 transitions, 802 flow [2024-01-29 22:59:18,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 274 transitions, 788 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:59:18,848 INFO L231 Difference]: Finished difference. Result has 276 places, 274 transitions, 588 flow [2024-01-29 22:59:18,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=588, PETRI_PLACES=276, PETRI_TRANSITIONS=274} [2024-01-29 22:59:18,848 INFO L281 CegarLoopForPetriNet]: 478 programPoint places, -202 predicate places. [2024-01-29 22:59:18,848 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 274 transitions, 588 flow [2024-01-29 22:59:18,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:59:18,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:18,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:18,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-01-29 22:59:18,849 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (and 289 more)] === [2024-01-29 22:59:18,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2036092288, now seen corresponding path program 1 times [2024-01-29 22:59:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:18,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542976764] [2024-01-29 22:59:18,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:18,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:59:18,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 22:59:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:59:18,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 22:59:18,931 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 22:59:18,932 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT (291 of 292 remaining) [2024-01-29 22:59:18,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (290 of 292 remaining) [2024-01-29 22:59:18,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (289 of 292 remaining) [2024-01-29 22:59:18,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (288 of 292 remaining) [2024-01-29 22:59:18,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (287 of 292 remaining) [2024-01-29 22:59:18,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (286 of 292 remaining) [2024-01-29 22:59:18,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (285 of 292 remaining) [2024-01-29 22:59:18,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (284 of 292 remaining) [2024-01-29 22:59:18,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (283 of 292 remaining) [2024-01-29 22:59:18,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (282 of 292 remaining) [2024-01-29 22:59:18,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (281 of 292 remaining) [2024-01-29 22:59:18,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (280 of 292 remaining) [2024-01-29 22:59:18,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (279 of 292 remaining) [2024-01-29 22:59:18,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (278 of 292 remaining) [2024-01-29 22:59:18,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (277 of 292 remaining) [2024-01-29 22:59:18,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (276 of 292 remaining) [2024-01-29 22:59:18,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (275 of 292 remaining) [2024-01-29 22:59:18,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (274 of 292 remaining) [2024-01-29 22:59:18,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (273 of 292 remaining) [2024-01-29 22:59:18,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (272 of 292 remaining) [2024-01-29 22:59:18,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (271 of 292 remaining) [2024-01-29 22:59:18,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (270 of 292 remaining) [2024-01-29 22:59:18,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (269 of 292 remaining) [2024-01-29 22:59:18,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (268 of 292 remaining) [2024-01-29 22:59:18,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (267 of 292 remaining) [2024-01-29 22:59:18,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (266 of 292 remaining) [2024-01-29 22:59:18,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (265 of 292 remaining) [2024-01-29 22:59:18,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (264 of 292 remaining) [2024-01-29 22:59:18,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (263 of 292 remaining) [2024-01-29 22:59:18,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (262 of 292 remaining) [2024-01-29 22:59:18,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (261 of 292 remaining) [2024-01-29 22:59:18,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (260 of 292 remaining) [2024-01-29 22:59:18,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (259 of 292 remaining) [2024-01-29 22:59:18,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (258 of 292 remaining) [2024-01-29 22:59:18,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (257 of 292 remaining) [2024-01-29 22:59:18,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (256 of 292 remaining) [2024-01-29 22:59:18,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (255 of 292 remaining) [2024-01-29 22:59:18,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (254 of 292 remaining) [2024-01-29 22:59:18,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (253 of 292 remaining) [2024-01-29 22:59:18,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (252 of 292 remaining) [2024-01-29 22:59:18,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (251 of 292 remaining) [2024-01-29 22:59:18,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (250 of 292 remaining) [2024-01-29 22:59:18,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (249 of 292 remaining) [2024-01-29 22:59:18,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (248 of 292 remaining) [2024-01-29 22:59:18,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (247 of 292 remaining) [2024-01-29 22:59:18,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (246 of 292 remaining) [2024-01-29 22:59:18,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (245 of 292 remaining) [2024-01-29 22:59:18,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (244 of 292 remaining) [2024-01-29 22:59:18,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (243 of 292 remaining) [2024-01-29 22:59:18,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (242 of 292 remaining) [2024-01-29 22:59:18,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (241 of 292 remaining) [2024-01-29 22:59:18,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (240 of 292 remaining) [2024-01-29 22:59:18,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (239 of 292 remaining) [2024-01-29 22:59:18,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (238 of 292 remaining) [2024-01-29 22:59:18,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (237 of 292 remaining) [2024-01-29 22:59:18,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (236 of 292 remaining) [2024-01-29 22:59:18,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (235 of 292 remaining) [2024-01-29 22:59:18,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (234 of 292 remaining) [2024-01-29 22:59:18,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (233 of 292 remaining) [2024-01-29 22:59:18,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (232 of 292 remaining) [2024-01-29 22:59:18,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (231 of 292 remaining) [2024-01-29 22:59:18,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (230 of 292 remaining) [2024-01-29 22:59:18,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (229 of 292 remaining) [2024-01-29 22:59:18,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (228 of 292 remaining) [2024-01-29 22:59:18,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (227 of 292 remaining) [2024-01-29 22:59:18,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (226 of 292 remaining) [2024-01-29 22:59:18,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (225 of 292 remaining) [2024-01-29 22:59:18,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (224 of 292 remaining) [2024-01-29 22:59:18,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (223 of 292 remaining) [2024-01-29 22:59:18,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (222 of 292 remaining) [2024-01-29 22:59:18,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (221 of 292 remaining) [2024-01-29 22:59:18,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (220 of 292 remaining) [2024-01-29 22:59:18,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (219 of 292 remaining) [2024-01-29 22:59:18,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (218 of 292 remaining) [2024-01-29 22:59:18,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (217 of 292 remaining) [2024-01-29 22:59:18,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (216 of 292 remaining) [2024-01-29 22:59:18,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (215 of 292 remaining) [2024-01-29 22:59:18,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (214 of 292 remaining) [2024-01-29 22:59:18,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (213 of 292 remaining) [2024-01-29 22:59:18,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (212 of 292 remaining) [2024-01-29 22:59:18,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (211 of 292 remaining) [2024-01-29 22:59:18,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (210 of 292 remaining) [2024-01-29 22:59:18,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (209 of 292 remaining) [2024-01-29 22:59:18,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (208 of 292 remaining) [2024-01-29 22:59:18,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (207 of 292 remaining) [2024-01-29 22:59:18,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (206 of 292 remaining) [2024-01-29 22:59:18,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (205 of 292 remaining) [2024-01-29 22:59:18,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (204 of 292 remaining) [2024-01-29 22:59:18,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (203 of 292 remaining) [2024-01-29 22:59:18,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (202 of 292 remaining) [2024-01-29 22:59:18,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (201 of 292 remaining) [2024-01-29 22:59:18,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (200 of 292 remaining) [2024-01-29 22:59:18,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (199 of 292 remaining) [2024-01-29 22:59:18,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (198 of 292 remaining) [2024-01-29 22:59:18,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (197 of 292 remaining) [2024-01-29 22:59:18,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (196 of 292 remaining) [2024-01-29 22:59:18,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (195 of 292 remaining) [2024-01-29 22:59:18,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (194 of 292 remaining) [2024-01-29 22:59:18,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (193 of 292 remaining) [2024-01-29 22:59:18,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (192 of 292 remaining) [2024-01-29 22:59:18,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (191 of 292 remaining) [2024-01-29 22:59:18,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (190 of 292 remaining) [2024-01-29 22:59:18,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (189 of 292 remaining) [2024-01-29 22:59:18,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (188 of 292 remaining) [2024-01-29 22:59:18,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (187 of 292 remaining) [2024-01-29 22:59:18,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (186 of 292 remaining) [2024-01-29 22:59:18,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (185 of 292 remaining) [2024-01-29 22:59:18,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (184 of 292 remaining) [2024-01-29 22:59:18,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (183 of 292 remaining) [2024-01-29 22:59:18,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (182 of 292 remaining) [2024-01-29 22:59:18,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (181 of 292 remaining) [2024-01-29 22:59:18,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (180 of 292 remaining) [2024-01-29 22:59:18,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (179 of 292 remaining) [2024-01-29 22:59:18,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (178 of 292 remaining) [2024-01-29 22:59:18,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (177 of 292 remaining) [2024-01-29 22:59:18,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (176 of 292 remaining) [2024-01-29 22:59:18,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (175 of 292 remaining) [2024-01-29 22:59:18,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (174 of 292 remaining) [2024-01-29 22:59:18,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 292 remaining) [2024-01-29 22:59:18,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 292 remaining) [2024-01-29 22:59:18,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 292 remaining) [2024-01-29 22:59:18,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 292 remaining) [2024-01-29 22:59:18,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 292 remaining) [2024-01-29 22:59:18,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 292 remaining) [2024-01-29 22:59:18,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 292 remaining) [2024-01-29 22:59:18,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 292 remaining) [2024-01-29 22:59:18,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 292 remaining) [2024-01-29 22:59:18,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 292 remaining) [2024-01-29 22:59:18,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 292 remaining) [2024-01-29 22:59:18,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 292 remaining) [2024-01-29 22:59:18,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 292 remaining) [2024-01-29 22:59:18,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 292 remaining) [2024-01-29 22:59:18,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 292 remaining) [2024-01-29 22:59:18,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 292 remaining) [2024-01-29 22:59:18,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 292 remaining) [2024-01-29 22:59:18,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 292 remaining) [2024-01-29 22:59:18,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 292 remaining) [2024-01-29 22:59:18,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 292 remaining) [2024-01-29 22:59:18,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 292 remaining) [2024-01-29 22:59:18,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 292 remaining) [2024-01-29 22:59:18,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 292 remaining) [2024-01-29 22:59:18,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 292 remaining) [2024-01-29 22:59:18,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 292 remaining) [2024-01-29 22:59:18,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 292 remaining) [2024-01-29 22:59:18,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 292 remaining) [2024-01-29 22:59:18,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 292 remaining) [2024-01-29 22:59:18,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 292 remaining) [2024-01-29 22:59:18,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 292 remaining) [2024-01-29 22:59:18,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 292 remaining) [2024-01-29 22:59:18,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 292 remaining) [2024-01-29 22:59:18,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 292 remaining) [2024-01-29 22:59:18,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 292 remaining) [2024-01-29 22:59:18,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 292 remaining) [2024-01-29 22:59:18,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 292 remaining) [2024-01-29 22:59:18,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 292 remaining) [2024-01-29 22:59:18,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 292 remaining) [2024-01-29 22:59:18,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 292 remaining) [2024-01-29 22:59:18,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 292 remaining) [2024-01-29 22:59:18,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 292 remaining) [2024-01-29 22:59:18,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 292 remaining) [2024-01-29 22:59:18,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 292 remaining) [2024-01-29 22:59:18,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 292 remaining) [2024-01-29 22:59:18,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 292 remaining) [2024-01-29 22:59:18,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 292 remaining) [2024-01-29 22:59:18,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 292 remaining) [2024-01-29 22:59:18,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 292 remaining) [2024-01-29 22:59:18,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 292 remaining) [2024-01-29 22:59:18,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 292 remaining) [2024-01-29 22:59:18,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 292 remaining) [2024-01-29 22:59:18,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 292 remaining) [2024-01-29 22:59:18,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 292 remaining) [2024-01-29 22:59:18,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 292 remaining) [2024-01-29 22:59:18,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 292 remaining) [2024-01-29 22:59:18,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 292 remaining) [2024-01-29 22:59:18,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 292 remaining) [2024-01-29 22:59:18,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 292 remaining) [2024-01-29 22:59:18,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 292 remaining) [2024-01-29 22:59:18,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 292 remaining) [2024-01-29 22:59:18,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 292 remaining) [2024-01-29 22:59:18,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 292 remaining) [2024-01-29 22:59:18,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 292 remaining) [2024-01-29 22:59:18,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 292 remaining) [2024-01-29 22:59:18,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 292 remaining) [2024-01-29 22:59:18,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 292 remaining) [2024-01-29 22:59:18,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 292 remaining) [2024-01-29 22:59:18,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 292 remaining) [2024-01-29 22:59:18,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 292 remaining) [2024-01-29 22:59:18,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 292 remaining) [2024-01-29 22:59:18,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 292 remaining) [2024-01-29 22:59:18,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 292 remaining) [2024-01-29 22:59:18,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 292 remaining) [2024-01-29 22:59:18,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 292 remaining) [2024-01-29 22:59:18,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 292 remaining) [2024-01-29 22:59:18,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 292 remaining) [2024-01-29 22:59:18,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 292 remaining) [2024-01-29 22:59:18,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 292 remaining) [2024-01-29 22:59:18,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 292 remaining) [2024-01-29 22:59:18,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 292 remaining) [2024-01-29 22:59:18,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 292 remaining) [2024-01-29 22:59:18,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 292 remaining) [2024-01-29 22:59:18,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 292 remaining) [2024-01-29 22:59:18,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr168ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 292 remaining) [2024-01-29 22:59:18,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 292 remaining) [2024-01-29 22:59:18,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr169ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 292 remaining) [2024-01-29 22:59:18,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 292 remaining) [2024-01-29 22:59:18,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr170ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 292 remaining) [2024-01-29 22:59:18,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 292 remaining) [2024-01-29 22:59:18,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr171ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 292 remaining) [2024-01-29 22:59:18,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 292 remaining) [2024-01-29 22:59:18,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr172ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 292 remaining) [2024-01-29 22:59:18,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 292 remaining) [2024-01-29 22:59:18,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr173ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 292 remaining) [2024-01-29 22:59:18,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 292 remaining) [2024-01-29 22:59:18,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr174ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 292 remaining) [2024-01-29 22:59:18,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 292 remaining) [2024-01-29 22:59:18,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr175ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 292 remaining) [2024-01-29 22:59:18,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 292 remaining) [2024-01-29 22:59:18,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr176ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 292 remaining) [2024-01-29 22:59:18,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 292 remaining) [2024-01-29 22:59:18,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr177ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 292 remaining) [2024-01-29 22:59:18,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr162ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 292 remaining) [2024-01-29 22:59:18,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr178ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 292 remaining) [2024-01-29 22:59:18,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr163ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 292 remaining) [2024-01-29 22:59:18,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr179ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 292 remaining) [2024-01-29 22:59:18,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr164ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 292 remaining) [2024-01-29 22:59:18,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr180ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 292 remaining) [2024-01-29 22:59:18,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr165ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 292 remaining) [2024-01-29 22:59:18,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr181ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 292 remaining) [2024-01-29 22:59:18,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr166ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 292 remaining) [2024-01-29 22:59:18,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr182ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 292 remaining) [2024-01-29 22:59:18,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr167ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 292 remaining) [2024-01-29 22:59:18,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr183ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 292 remaining) [2024-01-29 22:59:18,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr184ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 292 remaining) [2024-01-29 22:59:18,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr185ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 292 remaining) [2024-01-29 22:59:18,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr186ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 292 remaining) [2024-01-29 22:59:18,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr187ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 292 remaining) [2024-01-29 22:59:18,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr188ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 292 remaining) [2024-01-29 22:59:18,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr189ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 292 remaining) [2024-01-29 22:59:18,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr190ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 292 remaining) [2024-01-29 22:59:18,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr191ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 292 remaining) [2024-01-29 22:59:18,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr192ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 292 remaining) [2024-01-29 22:59:18,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr193ASSERT_VIOLATIONERROR_FUNCTION (50 of 292 remaining) [2024-01-29 22:59:18,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 292 remaining) [2024-01-29 22:59:18,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 292 remaining) [2024-01-29 22:59:18,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 292 remaining) [2024-01-29 22:59:18,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 292 remaining) [2024-01-29 22:59:18,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 292 remaining) [2024-01-29 22:59:18,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 292 remaining) [2024-01-29 22:59:18,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 292 remaining) [2024-01-29 22:59:18,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 292 remaining) [2024-01-29 22:59:18,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 292 remaining) [2024-01-29 22:59:18,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 292 remaining) [2024-01-29 22:59:18,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 292 remaining) [2024-01-29 22:59:18,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 292 remaining) [2024-01-29 22:59:18,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 292 remaining) [2024-01-29 22:59:18,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 292 remaining) [2024-01-29 22:59:18,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 292 remaining) [2024-01-29 22:59:18,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 292 remaining) [2024-01-29 22:59:18,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 292 remaining) [2024-01-29 22:59:18,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 292 remaining) [2024-01-29 22:59:18,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 292 remaining) [2024-01-29 22:59:18,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 292 remaining) [2024-01-29 22:59:18,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 292 remaining) [2024-01-29 22:59:18,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 292 remaining) [2024-01-29 22:59:18,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 292 remaining) [2024-01-29 22:59:18,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 292 remaining) [2024-01-29 22:59:18,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 292 remaining) [2024-01-29 22:59:18,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 292 remaining) [2024-01-29 22:59:18,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 292 remaining) [2024-01-29 22:59:18,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 292 remaining) [2024-01-29 22:59:18,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 292 remaining) [2024-01-29 22:59:18,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 292 remaining) [2024-01-29 22:59:18,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 292 remaining) [2024-01-29 22:59:18,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 292 remaining) [2024-01-29 22:59:18,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 292 remaining) [2024-01-29 22:59:18,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 292 remaining) [2024-01-29 22:59:18,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 292 remaining) [2024-01-29 22:59:18,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 292 remaining) [2024-01-29 22:59:18,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 292 remaining) [2024-01-29 22:59:18,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 292 remaining) [2024-01-29 22:59:18,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 292 remaining) [2024-01-29 22:59:18,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 292 remaining) [2024-01-29 22:59:18,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 292 remaining) [2024-01-29 22:59:18,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 292 remaining) [2024-01-29 22:59:18,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 292 remaining) [2024-01-29 22:59:18,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 292 remaining) [2024-01-29 22:59:18,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 292 remaining) [2024-01-29 22:59:18,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 292 remaining) [2024-01-29 22:59:18,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 292 remaining) [2024-01-29 22:59:18,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 292 remaining) [2024-01-29 22:59:18,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 292 remaining) [2024-01-29 22:59:18,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 292 remaining) [2024-01-29 22:59:18,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-01-29 22:59:18,973 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:18,981 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 22:59:18,981 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 22:59:19,047 INFO L503 ceAbstractionStarter]: Automizer considered 241 witness invariants [2024-01-29 22:59:19,047 INFO L504 ceAbstractionStarter]: WitnessConsidered=241 [2024-01-29 22:59:19,048 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:59:19 BasicIcfg [2024-01-29 22:59:19,048 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 22:59:19,048 INFO L158 Benchmark]: Toolchain (without parser) took 29410.50ms. Allocated memory was 241.2MB in the beginning and 885.0MB in the end (delta: 643.8MB). Free memory was 207.2MB in the beginning and 434.7MB in the end (delta: -227.5MB). Peak memory consumption was 416.3MB. Max. memory is 16.1GB. [2024-01-29 22:59:19,048 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory was 86.1MB in the beginning and 86.0MB in the end (delta: 79.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:59:19,049 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 241.2MB. Free memory was 211.2MB in the beginning and 211.1MB in the end (delta: 36.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:59:19,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.26ms. Allocated memory is still 241.2MB. Free memory was 207.2MB in the beginning and 172.6MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-01-29 22:59:19,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.20ms. Allocated memory is still 241.2MB. Free memory was 172.6MB in the beginning and 167.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 22:59:19,051 INFO L158 Benchmark]: Boogie Preprocessor took 148.40ms. Allocated memory is still 241.2MB. Free memory was 167.4MB in the beginning and 163.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 22:59:19,051 INFO L158 Benchmark]: RCFGBuilder took 1123.49ms. Allocated memory is still 241.2MB. Free memory was 163.2MB in the beginning and 142.3MB in the end (delta: 20.9MB). Peak memory consumption was 101.7MB. Max. memory is 16.1GB. [2024-01-29 22:59:19,052 INFO L158 Benchmark]: TraceAbstraction took 27599.34ms. Allocated memory was 241.2MB in the beginning and 885.0MB in the end (delta: 643.8MB). Free memory was 141.2MB in the beginning and 434.7MB in the end (delta: -293.5MB). Peak memory consumption was 350.2MB. Max. memory is 16.1GB. [2024-01-29 22:59:19,053 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.17ms. Allocated memory is still 125.8MB. Free memory was 86.1MB in the beginning and 86.0MB in the end (delta: 79.2kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.16ms. Allocated memory is still 241.2MB. Free memory was 211.2MB in the beginning and 211.1MB in the end (delta: 36.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.26ms. Allocated memory is still 241.2MB. Free memory was 207.2MB in the beginning and 172.6MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.20ms. Allocated memory is still 241.2MB. Free memory was 172.6MB in the beginning and 167.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 148.40ms. Allocated memory is still 241.2MB. Free memory was 167.4MB in the beginning and 163.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1123.49ms. Allocated memory is still 241.2MB. Free memory was 163.2MB in the beginning and 142.3MB in the end (delta: 20.9MB). Peak memory consumption was 101.7MB. Max. memory is 16.1GB. * TraceAbstraction took 27599.34ms. Allocated memory was 241.2MB in the beginning and 885.0MB in the end (delta: 643.8MB). Free memory was 141.2MB in the beginning and 434.7MB in the end (delta: -293.5MB). Peak memory consumption was 350.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 117]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L41] int *queue, *A; [L42] int i, N, n, last, start, end, new, v_old; [L43] _Bool ok; [L86] pthread_t t1, t2; VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=0, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]]]] [L88] ok = 1 VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]]]] [L89] N = __VERIFIER_nondet_int() [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=0, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] [L90] n = __VERIFIER_nondet_int() [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[start],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[end]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[end]]],CastExpression[ACSLType[long long],IdentifierExpression[start]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] [L91] start = __VERIFIER_nondet_int() [L92] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[end],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]] [L92] end = start VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, start=0, t1={5:0}, t2={3:0}, v_old=0] [L93] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[queue],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]]] [L93] CALL create_fresh_int_array(n) [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]]] [L113] CALL assume_abort_if_not(size >= 0) [L38] COND FALSE !(!cond) [L113] RET assume_abort_if_not(size >= 0) [L114] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L114] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L114] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L114] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L114] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L114] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] [L114] CALL assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE !(!cond) [L114] RET assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L116] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L116] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L116] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L116] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L116] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L116] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L116] int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L117] int i = 0; VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[8LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[6LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[4LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[2LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[16LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[7],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[14LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[6],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[12LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[10LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] COND TRUE i < size VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[new],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ok],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[9LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[7LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[5LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[3LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IntegerLiteral[9],IdentifierExpression[size]]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[2147483646]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[17LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[15LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[7],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[13LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[6],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[11LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=0, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L118] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[v_old],IntegerLiteral[0]]]]] [L118] arr[i] = __VERIFIER_nondet_int() [L117] i++ VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=1, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] [L117] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[last],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=17, arr={-1:0}, i=0, i=1, last=0, n=0, n=0, n=17, ok=1, queue={0:0}, size=17, start=0, v_old=0] - UnprovableResult [Line: 48]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 117]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 102]: 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: 101]: 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, 552 locations, 292 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: 27.3s, OverallIterations: 45, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28447 SdHoareTripleChecker+Valid, 16.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11840 mSDsluCounter, 3380 SdHoareTripleChecker+Invalid, 13.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 336 mSDsCounter, 1810 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26708 IncrementalHoareTripleChecker+Invalid, 28518 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1810 mSolverCounterUnsat, 3044 mSDtfsCounter, 26708 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=964occurred in iteration=0, InterpolantAutomatonStates: 153, 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.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2736 NumberOfCodeBlocks, 2736 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 2583 ConstructedInterpolants, 0 QuantifiedInterpolants, 32425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 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-01-29 22:59:19,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE