./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-two-queue.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-two-queue.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 59af5db6 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-two-queue.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-two-queue.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-59af5db-m [2024-02-02 09:21:59,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 09:21:59,923 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 09:21:59,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 09:21:59,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 09:21:59,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 09:21:59,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 09:21:59,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 09:21:59,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 09:21:59,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 09:21:59,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 09:21:59,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 09:21:59,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 09:21:59,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 09:21:59,969 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 09:21:59,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 09:21:59,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 09:21:59,970 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 09:21:59,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 09:21:59,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 09:21:59,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 09:21:59,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 09:21:59,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 09:21:59,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 09:21:59,972 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 09:21:59,972 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 09:21:59,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 09:21:59,973 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 09:21:59,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 09:21:59,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 09:21:59,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 09:21:59,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 09:21:59,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:21:59,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 09:21:59,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 09:21:59,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 09:21:59,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 09:21:59,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 09:21:59,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 09:21:59,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 09:21:59,983 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 09:21:59,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 09:21:59,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 09:21:59,984 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-02-02 09:22:00,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 09:22:00,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 09:22:00,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 09:22:00,220 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 09:22:00,221 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 09:22:00,222 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-two-queue.wvr.yml/witness.yml [2024-02-02 09:22:00,356 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 09:22:00,357 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 09:22:00,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-02-02 09:22:01,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 09:22:01,564 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 09:22:01,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-02-02 09:22:01,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4ede0639/a75ea7fb90d34f9f9ebd304fb7884be3/FLAGfa83f40cb [2024-02-02 09:22:01,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4ede0639/a75ea7fb90d34f9f9ebd304fb7884be3 [2024-02-02 09:22:01,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 09:22:01,582 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 09:22:01,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 09:22:01,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 09:22:01,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 09:22:01,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:22:00" (1/2) ... [2024-02-02 09:22:01,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6000f08d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:22:01, skipping insertion in model container [2024-02-02 09:22:01,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:22:00" (1/2) ... [2024-02-02 09:22:01,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@31db06d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:22:01, skipping insertion in model container [2024-02-02 09:22:01,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:22:01" (2/2) ... [2024-02-02 09:22:01,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6000f08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:01, skipping insertion in model container [2024-02-02 09:22:01,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:22:01" (2/2) ... [2024-02-02 09:22:01,589 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 09:22:01,627 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 09:22:01,628 INFO L101 nessWitnessExtractor]: Location invariant before [L22-L25] ((q2 == 0) && (i == 0)) && (j == 0) [2024-02-02 09:22:01,628 INFO L101 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,628 INFO L101 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,628 INFO L101 nessWitnessExtractor]: Location invariant before [L67-L67] (0 <= q1_back) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:22:01,628 INFO L101 nessWitnessExtractor]: Location invariant before [L86-L86] (((((((((q1 == 0) && (q2 == 0)) && (q1_front == 0)) && (q1_back == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0)) && (n1 == 0)) && (n2 == 0) [2024-02-02 09:22:01,628 INFO L101 nessWitnessExtractor]: Location invariant before [L87-L87] ((((((((q1 == 0) && (q2 == 0)) && (q1_front == 0)) && (q1_back == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0)) && (n2 == 0) [2024-02-02 09:22:01,629 INFO L101 nessWitnessExtractor]: Location invariant before [L72-L72] ((-2147483647 <= q2_back) && (q2_front <= 2147483646)) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:22:01,629 INFO L101 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,629 INFO L101 nessWitnessExtractor]: Location invariant before [L70-L70] (-2147483647 <= q1_back) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:22:01,629 INFO L101 nessWitnessExtractor]: Location invariant before [L57-L57] (-2147483647 <= q1_front) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:22:01,629 INFO L101 nessWitnessExtractor]: Location invariant before [L79-L79] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,629 INFO L101 nessWitnessExtractor]: Location invariant before [L71-L71] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,629 INFO L101 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,629 INFO L101 nessWitnessExtractor]: Location invariant before [L111-L111] ((q2 == 0) && (i == 0)) && (j == 0) [2024-02-02 09:22:01,629 INFO L101 nessWitnessExtractor]: Location invariant before [L74-L74] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,629 INFO L101 nessWitnessExtractor]: Location invariant before [L115-L115] ((((0 <= i) && ((long long )i - (long long )size >= 0LL)) && (q2 == 0)) && (i == 0)) && (j == 0) [2024-02-02 09:22:01,629 INFO L101 nessWitnessExtractor]: Location invariant before [L92-L92] (((q1 == 0) && (q2 == 0)) && (i == 0)) && (j == 0) [2024-02-02 09:22:01,629 INFO L101 nessWitnessExtractor]: Location invariant before [L69-L69] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,630 INFO L101 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,630 INFO L101 nessWitnessExtractor]: Location invariant before [L54-L54] ((-2147483647 <= q1_back) && (q1_front <= 2147483646)) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:22:01,630 INFO L101 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,630 INFO L101 nessWitnessExtractor]: Location invariant before [L113-L113] ((((((-1LL - (long long )i) + (long long )size >= 0LL) && (q2 == 0)) && (i == 0)) && (j == 0)) && (size != 0)) && ((((((((((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)) || ((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)) [2024-02-02 09:22:01,630 INFO L101 nessWitnessExtractor]: Location invariant before [L88-L88] (((((((q1 == 0) && (q2 == 0)) && (q1_front == 0)) && (q1_back == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0) [2024-02-02 09:22:01,630 INFO L101 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,630 INFO L101 nessWitnessExtractor]: Location invariant before [L96-L96] (i == 0) && (j == 0) [2024-02-02 09:22:01,630 INFO L101 nessWitnessExtractor]: Location invariant before [L90-L90] (((((q1 == 0) && (q2 == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0) [2024-02-02 09:22:01,630 INFO L101 nessWitnessExtractor]: Location invariant before [L109-L109] ((q2 == 0) && (i == 0)) && (j == 0) [2024-02-02 09:22:01,630 INFO L101 nessWitnessExtractor]: Loop invariant at [L47-L59] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,630 INFO L101 nessWitnessExtractor]: Location invariant before [L91-L91] ((((q1 == 0) && (q2 == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0) [2024-02-02 09:22:01,630 INFO L101 nessWitnessExtractor]: Location invariant before [L68-L68] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,630 INFO L101 nessWitnessExtractor]: Location invariant before [L108-L108] ((q2 == 0) && (i == 0)) && (j == 0) [2024-02-02 09:22:01,631 INFO L101 nessWitnessExtractor]: Loop invariant at [L112-L114] (((q2 == 0) && (i == 0)) && (j == 0)) && (((((0LL - (long long )i) + (long long )size >= 0LL && size != 0) && ((((((((7 <= size && (-14LL + (long long )i) + (long long )size >= 0LL) && i == 7) || ((6 <= size && (-12LL + (long long )i) + (long long )size >= 0LL) && i == 6)) || ((5 <= size && (-10LL + (long long )i) + (long long )size >= 0LL) && i == 5)) || ((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)) [2024-02-02 09:22:01,631 INFO L101 nessWitnessExtractor]: Location invariant before [L75-L75] (-2147483647 <= q2_front) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:22:01,631 INFO L101 nessWitnessExtractor]: Loop invariant at [L65-L77] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,631 INFO L101 nessWitnessExtractor]: Location invariant before [L52-L52] (-2147483647 <= q2_back) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:22:01,631 INFO L101 nessWitnessExtractor]: Location invariant before [L85-L85] ((((((((((q1 == 0) && (q2 == 0)) && (q1_front == 0)) && (q1_back == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0)) && (n1 == 0)) && (n2 == 0)) && (N == 0) [2024-02-02 09:22:01,631 INFO L101 nessWitnessExtractor]: Location invariant before [L49-L49] (0 <= q2_back) && ((unsigned long )_argptr == 0UL) [2024-02-02 09:22:01,631 INFO L101 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,631 INFO L101 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,631 INFO L101 nessWitnessExtractor]: Location invariant before [L89-L89] ((((((q1 == 0) && (q2 == 0)) && (q1_back == 0)) && (q2_front == 0)) && (q2_back == 0)) && (i == 0)) && (j == 0) [2024-02-02 09:22:01,631 INFO L101 nessWitnessExtractor]: Location invariant before [L93-L93] ((q2 == 0) && (i == 0)) && (j == 0) [2024-02-02 09:22:01,631 INFO L101 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,631 INFO L101 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-02-02 09:22:01,651 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-02 09:22:01,816 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-two-queue.wvr.c[3013,3026] [2024-02-02 09:22:01,834 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:22:01,845 INFO L202 MainTranslator]: Completed pre-run [2024-02-02 09:22:01,853 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 [2024-02-02 09:22:01,911 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-two-queue.wvr.c[3013,3026] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-02 09:22:01,925 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:22:01,936 INFO L206 MainTranslator]: Completed translation [2024-02-02 09:22:01,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:01 WrapperNode [2024-02-02 09:22:01,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 09:22:01,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 09:22:01,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 09:22:01,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 09:22:01,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:01" (1/1) ... [2024-02-02 09:22:01,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:01" (1/1) ... [2024-02-02 09:22:02,012 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 262 [2024-02-02 09:22:02,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 09:22:02,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 09:22:02,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 09:22:02,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 09:22:02,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:01" (1/1) ... [2024-02-02 09:22:02,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:01" (1/1) ... [2024-02-02 09:22:02,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:01" (1/1) ... [2024-02-02 09:22:02,046 INFO L175 MemorySlicer]: Split 12 memory accesses to 4 slices as follows [2, 6, 2, 2]. 50 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-02-02 09:22:02,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:01" (1/1) ... [2024-02-02 09:22:02,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:01" (1/1) ... [2024-02-02 09:22:02,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:01" (1/1) ... [2024-02-02 09:22:02,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:01" (1/1) ... [2024-02-02 09:22:02,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:01" (1/1) ... [2024-02-02 09:22:02,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:01" (1/1) ... [2024-02-02 09:22:02,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 09:22:02,064 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 09:22:02,065 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 09:22:02,065 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 09:22:02,066 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:01" (1/1) ... [2024-02-02 09:22:02,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:22:02,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:22:02,104 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-02-02 09:22:02,121 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-02-02 09:22:02,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 09:22:02,143 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-02 09:22:02,144 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-02 09:22:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-02 09:22:02,144 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-02 09:22:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 09:22:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 09:22:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 09:22:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-02 09:22:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 09:22:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 09:22:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 09:22:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 09:22:02,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-02 09:22:02,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-02 09:22:02,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-02 09:22:02,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-02 09:22:02,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 09:22:02,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 09:22:02,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 09:22:02,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 09:22:02,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 09:22:02,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-02 09:22:02,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 09:22:02,147 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-02 09:22:02,253 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 09:22:02,255 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 09:22:02,759 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 09:22:02,759 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 09:22:02,976 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 09:22:02,977 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-02 09:22:02,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:22:02 BoogieIcfgContainer [2024-02-02 09:22:02,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 09:22:02,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 09:22:02,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 09:22:02,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 09:22:02,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:22:00" (1/4) ... [2024-02-02 09:22:02,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c32bde and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:22:02, skipping insertion in model container [2024-02-02 09:22:02,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:22:01" (2/4) ... [2024-02-02 09:22:02,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c32bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:22:02, skipping insertion in model container [2024-02-02 09:22:02,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:22:01" (3/4) ... [2024-02-02 09:22:02,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c32bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:22:02, skipping insertion in model container [2024-02-02 09:22:02,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:22:02" (4/4) ... [2024-02-02 09:22:02,987 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2024-02-02 09:22:03,003 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 09:22:03,004 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2024-02-02 09:22:03,004 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 09:22:03,052 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-02 09:22:03,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 115 transitions, 244 flow [2024-02-02 09:22:03,105 INFO L124 PetriNetUnfolderBase]: 4/113 cut-off events. [2024-02-02 09:22:03,105 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:22:03,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 113 events. 4/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 259 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2024-02-02 09:22:03,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 115 transitions, 244 flow [2024-02-02 09:22:03,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 112 transitions, 236 flow [2024-02-02 09:22:03,118 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 09:22:03,123 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;@1f913856, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 09:22:03,123 INFO L358 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2024-02-02 09:22:03,125 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 09:22:03,125 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 09:22:03,125 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:22:03,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:03,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 09:22:03,126 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 80 more)] === [2024-02-02 09:22:03,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:03,130 INFO L85 PathProgramCache]: Analyzing trace with hash 24841, now seen corresponding path program 1 times [2024-02-02 09:22:03,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:03,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003933033] [2024-02-02 09:22:03,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:03,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:03,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:03,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003933033] [2024-02-02 09:22:03,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003933033] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:03,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:03,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:22:03,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917892794] [2024-02-02 09:22:03,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:03,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:22:03,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:03,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:22:03,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:22:03,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 115 [2024-02-02 09:22:03,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:03,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:03,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 115 [2024-02-02 09:22:03,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:03,721 INFO L124 PetriNetUnfolderBase]: 314/705 cut-off events. [2024-02-02 09:22:03,721 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-02-02 09:22:03,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 705 events. 314/705 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3985 event pairs, 240 based on Foata normal form. 0/441 useless extension candidates. Maximal degree in co-relation 1088. Up to 542 conditions per place. [2024-02-02 09:22:03,729 INFO L140 encePairwiseOnDemand]: 100/115 looper letters, 60 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2024-02-02 09:22:03,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 99 transitions, 334 flow [2024-02-02 09:22:03,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:22:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:22:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2024-02-02 09:22:03,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5565217391304348 [2024-02-02 09:22:03,744 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 236 flow. Second operand 3 states and 192 transitions. [2024-02-02 09:22:03,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 99 transitions, 334 flow [2024-02-02 09:22:03,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 99 transitions, 326 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-02 09:22:03,755 INFO L231 Difference]: Finished difference. Result has 100 places, 99 transitions, 206 flow [2024-02-02 09:22:03,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=100, PETRI_TRANSITIONS=99} [2024-02-02 09:22:03,762 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -15 predicate places. [2024-02-02 09:22:03,762 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 99 transitions, 206 flow [2024-02-02 09:22:03,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:03,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:03,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-02 09:22:03,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 09:22:03,767 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 80 more)] === [2024-02-02 09:22:03,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:03,768 INFO L85 PathProgramCache]: Analyzing trace with hash 770813, now seen corresponding path program 1 times [2024-02-02 09:22:03,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:03,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261890786] [2024-02-02 09:22:03,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:03,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:03,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261890786] [2024-02-02 09:22:03,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261890786] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:03,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:03,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:22:03,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118931592] [2024-02-02 09:22:03,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:03,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:22:03,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:03,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:22:03,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:22:04,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 115 [2024-02-02 09:22:04,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 99 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:04,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:04,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 115 [2024-02-02 09:22:04,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:04,145 INFO L124 PetriNetUnfolderBase]: 285/709 cut-off events. [2024-02-02 09:22:04,146 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:22:04,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 709 events. 285/709 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4114 event pairs, 189 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 1189. Up to 474 conditions per place. [2024-02-02 09:22:04,151 INFO L140 encePairwiseOnDemand]: 112/115 looper letters, 57 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2024-02-02 09:22:04,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 98 transitions, 322 flow [2024-02-02 09:22:04,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:22:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:22:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2024-02-02 09:22:04,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5391304347826087 [2024-02-02 09:22:04,156 INFO L175 Difference]: Start difference. First operand has 100 places, 99 transitions, 206 flow. Second operand 3 states and 186 transitions. [2024-02-02 09:22:04,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 98 transitions, 322 flow [2024-02-02 09:22:04,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 98 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:22:04,159 INFO L231 Difference]: Finished difference. Result has 99 places, 98 transitions, 204 flow [2024-02-02 09:22:04,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=99, PETRI_TRANSITIONS=98} [2024-02-02 09:22:04,160 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -16 predicate places. [2024-02-02 09:22:04,161 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 98 transitions, 204 flow [2024-02-02 09:22:04,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:04,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:04,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-02 09:22:04,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 09:22:04,162 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 80 more)] === [2024-02-02 09:22:04,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:04,163 INFO L85 PathProgramCache]: Analyzing trace with hash 23896003, now seen corresponding path program 1 times [2024-02-02 09:22:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:04,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140309343] [2024-02-02 09:22:04,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:04,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:04,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:04,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140309343] [2024-02-02 09:22:04,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140309343] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:04,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:04,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:22:04,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546988545] [2024-02-02 09:22:04,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:04,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:22:04,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:04,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:22:04,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:22:04,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 115 [2024-02-02 09:22:04,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 98 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:04,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:04,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 115 [2024-02-02 09:22:04,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:04,437 INFO L124 PetriNetUnfolderBase]: 285/708 cut-off events. [2024-02-02 09:22:04,437 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:22:04,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 708 events. 285/708 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4135 event pairs, 189 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 1185. Up to 472 conditions per place. [2024-02-02 09:22:04,441 INFO L140 encePairwiseOnDemand]: 112/115 looper letters, 56 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2024-02-02 09:22:04,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 318 flow [2024-02-02 09:22:04,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:22:04,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:22:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2024-02-02 09:22:04,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5449275362318841 [2024-02-02 09:22:04,442 INFO L175 Difference]: Start difference. First operand has 99 places, 98 transitions, 204 flow. Second operand 3 states and 188 transitions. [2024-02-02 09:22:04,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 318 flow [2024-02-02 09:22:04,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 97 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:22:04,444 INFO L231 Difference]: Finished difference. Result has 98 places, 97 transitions, 202 flow [2024-02-02 09:22:04,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=98, PETRI_TRANSITIONS=97} [2024-02-02 09:22:04,445 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -17 predicate places. [2024-02-02 09:22:04,445 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 97 transitions, 202 flow [2024-02-02 09:22:04,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:04,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:04,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-02 09:22:04,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-02 09:22:04,446 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 80 more)] === [2024-02-02 09:22:04,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:04,446 INFO L85 PathProgramCache]: Analyzing trace with hash 740776918, now seen corresponding path program 1 times [2024-02-02 09:22:04,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:04,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496037303] [2024-02-02 09:22:04,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:04,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:04,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:04,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496037303] [2024-02-02 09:22:04,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496037303] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:04,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:04,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:22:04,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98656217] [2024-02-02 09:22:04,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:04,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:22:04,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:04,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:22:04,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:22:04,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 115 [2024-02-02 09:22:04,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 97 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:04,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:04,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 115 [2024-02-02 09:22:04,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:04,653 INFO L124 PetriNetUnfolderBase]: 285/707 cut-off events. [2024-02-02 09:22:04,653 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:22:04,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 707 events. 285/707 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4145 event pairs, 189 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 1181. Up to 470 conditions per place. [2024-02-02 09:22:04,673 INFO L140 encePairwiseOnDemand]: 112/115 looper letters, 55 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2024-02-02 09:22:04,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 96 transitions, 314 flow [2024-02-02 09:22:04,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:22:04,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:22:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2024-02-02 09:22:04,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5507246376811594 [2024-02-02 09:22:04,674 INFO L175 Difference]: Start difference. First operand has 98 places, 97 transitions, 202 flow. Second operand 3 states and 190 transitions. [2024-02-02 09:22:04,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 96 transitions, 314 flow [2024-02-02 09:22:04,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 96 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:22:04,676 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 200 flow [2024-02-02 09:22:04,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2024-02-02 09:22:04,676 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -18 predicate places. [2024-02-02 09:22:04,676 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 200 flow [2024-02-02 09:22:04,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:04,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:04,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-02 09:22:04,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-02 09:22:04,677 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 80 more)] === [2024-02-02 09:22:04,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:04,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1489248792, now seen corresponding path program 1 times [2024-02-02 09:22:04,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:04,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948349109] [2024-02-02 09:22:04,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:04,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:04,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:04,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948349109] [2024-02-02 09:22:04,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948349109] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:04,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:04,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:22:04,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309109055] [2024-02-02 09:22:04,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:04,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:22:04,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:04,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:22:04,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:22:04,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 115 [2024-02-02 09:22:04,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:04,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:04,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 115 [2024-02-02 09:22:04,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:04,919 INFO L124 PetriNetUnfolderBase]: 285/706 cut-off events. [2024-02-02 09:22:04,920 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:22:04,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 706 events. 285/706 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4143 event pairs, 189 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 1177. Up to 468 conditions per place. [2024-02-02 09:22:04,923 INFO L140 encePairwiseOnDemand]: 112/115 looper letters, 54 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2024-02-02 09:22:04,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 95 transitions, 310 flow [2024-02-02 09:22:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:22:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:22:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2024-02-02 09:22:04,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5565217391304348 [2024-02-02 09:22:04,924 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 200 flow. Second operand 3 states and 192 transitions. [2024-02-02 09:22:04,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 95 transitions, 310 flow [2024-02-02 09:22:04,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 95 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:22:04,927 INFO L231 Difference]: Finished difference. Result has 96 places, 95 transitions, 198 flow [2024-02-02 09:22:04,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=96, PETRI_TRANSITIONS=95} [2024-02-02 09:22:04,929 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -19 predicate places. [2024-02-02 09:22:04,929 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 95 transitions, 198 flow [2024-02-02 09:22:04,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:04,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:04,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:04,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-02 09:22:04,929 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 80 more)] === [2024-02-02 09:22:04,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:04,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1077926853, now seen corresponding path program 1 times [2024-02-02 09:22:04,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:04,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247353592] [2024-02-02 09:22:04,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:04,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:04,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:04,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247353592] [2024-02-02 09:22:04,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247353592] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:04,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:04,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:22:04,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783432944] [2024-02-02 09:22:04,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:04,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:22:04,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:04,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:22:04,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:22:05,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 115 [2024-02-02 09:22:05,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 95 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:05,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:05,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 115 [2024-02-02 09:22:05,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:05,161 INFO L124 PetriNetUnfolderBase]: 285/705 cut-off events. [2024-02-02 09:22:05,162 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:22:05,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190 conditions, 705 events. 285/705 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4136 event pairs, 189 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 1173. Up to 466 conditions per place. [2024-02-02 09:22:05,165 INFO L140 encePairwiseOnDemand]: 112/115 looper letters, 53 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-02-02 09:22:05,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 94 transitions, 306 flow [2024-02-02 09:22:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:22:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:22:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2024-02-02 09:22:05,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5623188405797102 [2024-02-02 09:22:05,167 INFO L175 Difference]: Start difference. First operand has 96 places, 95 transitions, 198 flow. Second operand 3 states and 194 transitions. [2024-02-02 09:22:05,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 94 transitions, 306 flow [2024-02-02 09:22:05,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 94 transitions, 302 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:22:05,168 INFO L231 Difference]: Finished difference. Result has 95 places, 94 transitions, 196 flow [2024-02-02 09:22:05,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=95, PETRI_TRANSITIONS=94} [2024-02-02 09:22:05,171 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -20 predicate places. [2024-02-02 09:22:05,172 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 94 transitions, 196 flow [2024-02-02 09:22:05,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:05,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:05,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:05,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-02 09:22:05,173 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 80 more)] === [2024-02-02 09:22:05,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:05,173 INFO L85 PathProgramCache]: Analyzing trace with hash 944006695, now seen corresponding path program 1 times [2024-02-02 09:22:05,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:05,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770073074] [2024-02-02 09:22:05,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:05,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:05,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:05,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770073074] [2024-02-02 09:22:05,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770073074] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:05,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:05,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:22:05,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823089281] [2024-02-02 09:22:05,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:05,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:22:05,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:05,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:22:05,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:22:05,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 115 [2024-02-02 09:22:05,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:05,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:05,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 115 [2024-02-02 09:22:05,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:05,391 INFO L124 PetriNetUnfolderBase]: 285/704 cut-off events. [2024-02-02 09:22:05,392 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:22:05,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 704 events. 285/704 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4139 event pairs, 189 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 1169. Up to 464 conditions per place. [2024-02-02 09:22:05,395 INFO L140 encePairwiseOnDemand]: 112/115 looper letters, 52 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-02-02 09:22:05,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 93 transitions, 302 flow [2024-02-02 09:22:05,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:22:05,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:22:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2024-02-02 09:22:05,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5681159420289855 [2024-02-02 09:22:05,396 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 196 flow. Second operand 3 states and 196 transitions. [2024-02-02 09:22:05,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 93 transitions, 302 flow [2024-02-02 09:22:05,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 93 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:22:05,397 INFO L231 Difference]: Finished difference. Result has 94 places, 93 transitions, 194 flow [2024-02-02 09:22:05,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=94, PETRI_TRANSITIONS=93} [2024-02-02 09:22:05,398 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -21 predicate places. [2024-02-02 09:22:05,398 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 93 transitions, 194 flow [2024-02-02 09:22:05,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:05,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:05,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:05,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 09:22:05,399 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 80 more)] === [2024-02-02 09:22:05,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:05,399 INFO L85 PathProgramCache]: Analyzing trace with hash -800562687, now seen corresponding path program 1 times [2024-02-02 09:22:05,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:05,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198987223] [2024-02-02 09:22:05,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:05,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:05,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:05,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198987223] [2024-02-02 09:22:05,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198987223] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:05,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:05,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:22:05,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079739067] [2024-02-02 09:22:05,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:05,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:22:05,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:05,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:22:05,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:22:05,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 115 [2024-02-02 09:22:05,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 93 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:05,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:05,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 115 [2024-02-02 09:22:05,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:05,586 INFO L124 PetriNetUnfolderBase]: 285/700 cut-off events. [2024-02-02 09:22:05,587 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:22:05,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1180 conditions, 700 events. 285/700 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4132 event pairs, 189 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 1159. Up to 453 conditions per place. [2024-02-02 09:22:05,590 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 48 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2024-02-02 09:22:05,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 89 transitions, 286 flow [2024-02-02 09:22:05,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:22:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:22:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2024-02-02 09:22:05,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5739130434782609 [2024-02-02 09:22:05,591 INFO L175 Difference]: Start difference. First operand has 94 places, 93 transitions, 194 flow. Second operand 3 states and 198 transitions. [2024-02-02 09:22:05,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 89 transitions, 286 flow [2024-02-02 09:22:05,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 89 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:22:05,592 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 186 flow [2024-02-02 09:22:05,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2024-02-02 09:22:05,594 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -25 predicate places. [2024-02-02 09:22:05,594 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 186 flow [2024-02-02 09:22:05,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:05,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:05,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:05,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-02 09:22:05,595 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 80 more)] === [2024-02-02 09:22:05,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:05,595 INFO L85 PathProgramCache]: Analyzing trace with hash -759337476, now seen corresponding path program 1 times [2024-02-02 09:22:05,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:05,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948633667] [2024-02-02 09:22:05,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:05,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:05,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:05,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948633667] [2024-02-02 09:22:05,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948633667] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:05,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:05,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:22:05,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772685793] [2024-02-02 09:22:05,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:05,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:22:05,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:05,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:22:05,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:22:05,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 115 [2024-02-02 09:22:05,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:05,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:05,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 115 [2024-02-02 09:22:05,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:05,855 INFO L124 PetriNetUnfolderBase]: 285/698 cut-off events. [2024-02-02 09:22:05,855 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:22:05,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 698 events. 285/698 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4138 event pairs, 189 based on Foata normal form. 0/476 useless extension candidates. Maximal degree in co-relation 1135. Up to 441 conditions per place. [2024-02-02 09:22:05,858 INFO L140 encePairwiseOnDemand]: 103/115 looper letters, 41 selfloop transitions, 10 changer transitions 0/87 dead transitions. [2024-02-02 09:22:05,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 87 transitions, 284 flow [2024-02-02 09:22:05,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:22:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:22:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2024-02-02 09:22:05,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5413043478260869 [2024-02-02 09:22:05,859 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 186 flow. Second operand 4 states and 249 transitions. [2024-02-02 09:22:05,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 87 transitions, 284 flow [2024-02-02 09:22:05,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 87 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:22:05,861 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 198 flow [2024-02-02 09:22:05,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2024-02-02 09:22:05,862 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -26 predicate places. [2024-02-02 09:22:05,862 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 198 flow [2024-02-02 09:22:05,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:05,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:05,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:05,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-02 09:22:05,862 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 80 more)] === [2024-02-02 09:22:05,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:05,863 INFO L85 PathProgramCache]: Analyzing trace with hash 421151714, now seen corresponding path program 1 times [2024-02-02 09:22:05,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:05,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664612396] [2024-02-02 09:22:05,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:05,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:05,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:05,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664612396] [2024-02-02 09:22:05,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664612396] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:05,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:05,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:22:05,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182910730] [2024-02-02 09:22:05,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:05,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:22:05,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:05,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:22:05,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:22:06,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 115 [2024-02-02 09:22:06,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:06,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:06,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 115 [2024-02-02 09:22:06,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:06,156 INFO L124 PetriNetUnfolderBase]: 285/696 cut-off events. [2024-02-02 09:22:06,156 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:22:06,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 696 events. 285/696 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4151 event pairs, 189 based on Foata normal form. 2/478 useless extension candidates. Maximal degree in co-relation 1108. Up to 441 conditions per place. [2024-02-02 09:22:06,159 INFO L140 encePairwiseOnDemand]: 101/115 looper letters, 41 selfloop transitions, 12 changer transitions 0/85 dead transitions. [2024-02-02 09:22:06,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 85 transitions, 300 flow [2024-02-02 09:22:06,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:22:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:22:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 280 transitions. [2024-02-02 09:22:06,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48695652173913045 [2024-02-02 09:22:06,160 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 198 flow. Second operand 5 states and 280 transitions. [2024-02-02 09:22:06,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 85 transitions, 300 flow [2024-02-02 09:22:06,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 85 transitions, 280 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-02 09:22:06,161 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 198 flow [2024-02-02 09:22:06,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2024-02-02 09:22:06,162 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -27 predicate places. [2024-02-02 09:22:06,162 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 198 flow [2024-02-02 09:22:06,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:06,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:06,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:06,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-02 09:22:06,162 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 80 more)] === [2024-02-02 09:22:06,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:06,163 INFO L85 PathProgramCache]: Analyzing trace with hash 421151704, now seen corresponding path program 1 times [2024-02-02 09:22:06,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:06,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316768469] [2024-02-02 09:22:06,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:06,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:22:06,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:22:06,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:22:06,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316768469] [2024-02-02 09:22:06,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316768469] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:22:06,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:22:06,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:22:06,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829057017] [2024-02-02 09:22:06,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:22:06,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:22:06,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:22:06,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:22:06,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:22:06,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 115 [2024-02-02 09:22:06,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:06,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:22:06,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 115 [2024-02-02 09:22:06,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:22:06,415 INFO L124 PetriNetUnfolderBase]: 285/690 cut-off events. [2024-02-02 09:22:06,415 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:22:06,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 690 events. 285/690 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4121 event pairs, 189 based on Foata normal form. 2/471 useless extension candidates. Maximal degree in co-relation 1109. Up to 442 conditions per place. [2024-02-02 09:22:06,418 INFO L140 encePairwiseOnDemand]: 98/115 looper letters, 41 selfloop transitions, 11 changer transitions 0/79 dead transitions. [2024-02-02 09:22:06,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 79 transitions, 290 flow [2024-02-02 09:22:06,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:22:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:22:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2024-02-02 09:22:06,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226086956521739 [2024-02-02 09:22:06,419 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 198 flow. Second operand 5 states and 243 transitions. [2024-02-02 09:22:06,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 79 transitions, 290 flow [2024-02-02 09:22:06,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 79 transitions, 266 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-02 09:22:06,421 INFO L231 Difference]: Finished difference. Result has 82 places, 79 transitions, 184 flow [2024-02-02 09:22:06,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=82, PETRI_TRANSITIONS=79} [2024-02-02 09:22:06,421 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -33 predicate places. [2024-02-02 09:22:06,421 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 79 transitions, 184 flow [2024-02-02 09:22:06,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:22:06,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:22:06,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:06,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-02 09:22:06,422 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 80 more)] === [2024-02-02 09:22:06,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:22:06,422 INFO L85 PathProgramCache]: Analyzing trace with hash 170802040, now seen corresponding path program 1 times [2024-02-02 09:22:06,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:22:06,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727098204] [2024-02-02 09:22:06,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:22:06,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:22:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:22:06,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 09:22:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:22:06,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 09:22:06,476 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 09:22:06,476 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 83 remaining) [2024-02-02 09:22:06,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 83 remaining) [2024-02-02 09:22:06,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 83 remaining) [2024-02-02 09:22:06,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 83 remaining) [2024-02-02 09:22:06,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 83 remaining) [2024-02-02 09:22:06,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 83 remaining) [2024-02-02 09:22:06,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 83 remaining) [2024-02-02 09:22:06,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 83 remaining) [2024-02-02 09:22:06,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 83 remaining) [2024-02-02 09:22:06,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 83 remaining) [2024-02-02 09:22:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 83 remaining) [2024-02-02 09:22:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 83 remaining) [2024-02-02 09:22:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 83 remaining) [2024-02-02 09:22:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 83 remaining) [2024-02-02 09:22:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 83 remaining) [2024-02-02 09:22:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 83 remaining) [2024-02-02 09:22:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 83 remaining) [2024-02-02 09:22:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 83 remaining) [2024-02-02 09:22:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 83 remaining) [2024-02-02 09:22:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 83 remaining) [2024-02-02 09:22:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 83 remaining) [2024-02-02 09:22:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 83 remaining) [2024-02-02 09:22:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 83 remaining) [2024-02-02 09:22:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 83 remaining) [2024-02-02 09:22:06,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 83 remaining) [2024-02-02 09:22:06,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 83 remaining) [2024-02-02 09:22:06,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 83 remaining) [2024-02-02 09:22:06,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 83 remaining) [2024-02-02 09:22:06,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 83 remaining) [2024-02-02 09:22:06,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 83 remaining) [2024-02-02 09:22:06,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 83 remaining) [2024-02-02 09:22:06,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 83 remaining) [2024-02-02 09:22:06,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 83 remaining) [2024-02-02 09:22:06,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 83 remaining) [2024-02-02 09:22:06,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 83 remaining) [2024-02-02 09:22:06,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 83 remaining) [2024-02-02 09:22:06,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 83 remaining) [2024-02-02 09:22:06,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 83 remaining) [2024-02-02 09:22:06,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 83 remaining) [2024-02-02 09:22:06,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 83 remaining) [2024-02-02 09:22:06,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 83 remaining) [2024-02-02 09:22:06,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 83 remaining) [2024-02-02 09:22:06,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 83 remaining) [2024-02-02 09:22:06,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 83 remaining) [2024-02-02 09:22:06,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 83 remaining) [2024-02-02 09:22:06,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 83 remaining) [2024-02-02 09:22:06,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 83 remaining) [2024-02-02 09:22:06,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 83 remaining) [2024-02-02 09:22:06,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 83 remaining) [2024-02-02 09:22:06,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 83 remaining) [2024-02-02 09:22:06,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 83 remaining) [2024-02-02 09:22:06,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 83 remaining) [2024-02-02 09:22:06,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (30 of 83 remaining) [2024-02-02 09:22:06,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 83 remaining) [2024-02-02 09:22:06,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 83 remaining) [2024-02-02 09:22:06,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 83 remaining) [2024-02-02 09:22:06,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 83 remaining) [2024-02-02 09:22:06,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 83 remaining) [2024-02-02 09:22:06,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 83 remaining) [2024-02-02 09:22:06,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 83 remaining) [2024-02-02 09:22:06,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 83 remaining) [2024-02-02 09:22:06,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 83 remaining) [2024-02-02 09:22:06,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 83 remaining) [2024-02-02 09:22:06,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 83 remaining) [2024-02-02 09:22:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 83 remaining) [2024-02-02 09:22:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 83 remaining) [2024-02-02 09:22:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 83 remaining) [2024-02-02 09:22:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 83 remaining) [2024-02-02 09:22:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 83 remaining) [2024-02-02 09:22:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 83 remaining) [2024-02-02 09:22:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 83 remaining) [2024-02-02 09:22:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 83 remaining) [2024-02-02 09:22:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 83 remaining) [2024-02-02 09:22:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 83 remaining) [2024-02-02 09:22:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 83 remaining) [2024-02-02 09:22:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 83 remaining) [2024-02-02 09:22:06,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 83 remaining) [2024-02-02 09:22:06,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 83 remaining) [2024-02-02 09:22:06,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 83 remaining) [2024-02-02 09:22:06,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 83 remaining) [2024-02-02 09:22:06,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 83 remaining) [2024-02-02 09:22:06,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 83 remaining) [2024-02-02 09:22:06,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 83 remaining) [2024-02-02 09:22:06,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-02 09:22:06,484 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:22:06,490 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 09:22:06,490 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 09:22:06,532 INFO L503 ceAbstractionStarter]: Automizer considered 52 witness invariants [2024-02-02 09:22:06,532 INFO L504 ceAbstractionStarter]: WitnessConsidered=52 [2024-02-02 09:22:06,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:22:06 BasicIcfg [2024-02-02 09:22:06,534 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 09:22:06,534 INFO L158 Benchmark]: Toolchain (without parser) took 4952.22ms. Allocated memory was 157.3MB in the beginning and 278.9MB in the end (delta: 121.6MB). Free memory was 97.1MB in the beginning and 120.7MB in the end (delta: -23.6MB). Peak memory consumption was 99.5MB. Max. memory is 16.1GB. [2024-02-02 09:22:06,534 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 117.4MB. Free memory was 88.3MB in the beginning and 88.2MB in the end (delta: 91.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:22:06,534 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:22:06,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.24ms. Allocated memory is still 157.3MB. Free memory was 96.7MB in the beginning and 77.6MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-02-02 09:22:06,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.04ms. Allocated memory is still 157.3MB. Free memory was 77.2MB in the beginning and 126.5MB in the end (delta: -49.3MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-02-02 09:22:06,536 INFO L158 Benchmark]: Boogie Preprocessor took 50.78ms. Allocated memory is still 157.3MB. Free memory was 126.5MB in the beginning and 122.5MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-02 09:22:06,536 INFO L158 Benchmark]: RCFGBuilder took 913.74ms. Allocated memory is still 157.3MB. Free memory was 122.5MB in the beginning and 86.3MB in the end (delta: 36.1MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2024-02-02 09:22:06,536 INFO L158 Benchmark]: TraceAbstraction took 3552.80ms. Allocated memory was 157.3MB in the beginning and 278.9MB in the end (delta: 121.6MB). Free memory was 85.2MB in the beginning and 120.7MB in the end (delta: -35.4MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2024-02-02 09:22:06,537 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 117.4MB. Free memory was 88.3MB in the beginning and 88.2MB in the end (delta: 91.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.24ms. Allocated memory is still 157.3MB. Free memory was 96.7MB in the beginning and 77.6MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.04ms. Allocated memory is still 157.3MB. Free memory was 77.2MB in the beginning and 126.5MB in the end (delta: -49.3MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.78ms. Allocated memory is still 157.3MB. Free memory was 126.5MB in the beginning and 122.5MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 913.74ms. Allocated memory is still 157.3MB. Free memory was 122.5MB in the beginning and 86.3MB in the end (delta: 36.1MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3552.80ms. Allocated memory was 157.3MB in the beginning and 278.9MB in the end (delta: 121.6MB). Free memory was 85.2MB in the beginning and 120.7MB in the end (delta: -35.4MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 112]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L41] int *q1, *q2; [L42] int q1_front, q1_back, q2_front, q2_back, i, j, n1, n2, N; [L83] pthread_t t1, t2; VAL [N=0, i=0, j=0, n1=0, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L85] N = __VERIFIER_nondet_int() [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]]]] [L86] n1 = __VERIFIER_nondet_int() [L87] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]]]] [L87] n2 = __VERIFIER_nondet_int() [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] [L88] q1_front = __VERIFIER_nondet_int() [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] [L89] q1_back = q1_front VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] [L90] q2_front = __VERIFIER_nondet_int() [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] [L91] q2_back = q2_front VAL [N=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, t1={5:0}, t2={3:0}] [L92] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] [L92] CALL create_fresh_int_array(n1) [L108] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] [L108] CALL assume_abort_if_not(size >= 0) [L38] COND FALSE !(!cond) [L108] RET assume_abort_if_not(size >= 0) [L109] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] [L109] CALL assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE !(!cond) [L109] RET assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L111] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]]] [L111] int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L112] int i = 0; VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],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[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,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[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],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[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]],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[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],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]]]]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] COND TRUE i < size VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=0, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,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[q2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPNEQ,IdentifierExpression[size],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[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]]]],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]]]]]]] [L113] arr[i] = __VERIFIER_nondet_int() [L112] i++ VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=1, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] [L112] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],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[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,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[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]],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[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]],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[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],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]]]]]]] VAL [N=0, \old(size)=17, arr={-1:0}, i=0, i=1, j=0, n1=17, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=17] - UnprovableResult [Line: 47]: 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: 61]: 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: 50]: 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: 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: 55]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: 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: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: 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: 79]: 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: 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: 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: 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: 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: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: 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: 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: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 111]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: 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: 115]: 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: 108]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 111]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: 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: 115]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: 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: 102]: 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: 97]: 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: 96]: 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, 164 locations, 83 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: 3.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 984 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 460 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1662 IncrementalHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 78 mSDtfsCounter, 1662 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=0, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 1402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-02-02 09:22:06,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE