./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 cb09d658 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-cb09d65-m [2024-01-27 23:10:40,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 23:10:40,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 23:10:40,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 23:10:40,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 23:10:40,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 23:10:40,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 23:10:40,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 23:10:40,602 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 23:10:40,606 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 23:10:40,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 23:10:40,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 23:10:40,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 23:10:40,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 23:10:40,609 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 23:10:40,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 23:10:40,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 23:10:40,610 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 23:10:40,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 23:10:40,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 23:10:40,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 23:10:40,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 23:10:40,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 23:10:40,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 23:10:40,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 23:10:40,612 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 23:10:40,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 23:10:40,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 23:10:40,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 23:10:40,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 23:10:40,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 23:10:40,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 23:10:40,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:10:40,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 23:10:40,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 23:10:40,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 23:10:40,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 23:10:40,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 23:10:40,617 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 23:10:40,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 23:10:40,618 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 23:10:40,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 23:10:40,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 23:10:40,618 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-27 23:10:40,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 23:10:40,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 23:10:40,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 23:10:40,878 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 23:10:40,879 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 23:10:40,880 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-01-27 23:10:41,027 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 23:10:41,027 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 23:10:41,028 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-01-27 23:10:42,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 23:10:42,386 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 23:10:42,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-01-27 23:10:42,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebe50b1a/7361ec6676464703942dbfcfce5c47fa/FLAG23b188369 [2024-01-27 23:10:42,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebe50b1a/7361ec6676464703942dbfcfce5c47fa [2024-01-27 23:10:42,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 23:10:42,413 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 23:10:42,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 23:10:42,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 23:10:42,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 23:10:42,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:10:41" (1/2) ... [2024-01-27 23:10:42,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74599fce and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:42, skipping insertion in model container [2024-01-27 23:10:42,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:10:41" (1/2) ... [2024-01-27 23:10:42,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@30a2f7cf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:10:42, skipping insertion in model container [2024-01-27 23:10:42,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:10:42" (2/2) ... [2024-01-27 23:10:42,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74599fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:42, skipping insertion in model container [2024-01-27 23:10:42,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:10:42" (2/2) ... [2024-01-27 23:10:42,427 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 23:10:42,466 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 23:10:42,467 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] -2147483647 <= q2_front [2024-01-27 23:10:42,468 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,468 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] 0 <= q1_back [2024-01-27 23:10:42,468 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,468 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,468 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,468 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,469 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,469 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] -2147483647 <= q1_back [2024-01-27 23:10:42,469 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] q2 == 0 [2024-01-27 23:10:42,469 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] i == 0 [2024-01-27 23:10:42,469 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] j == 0 [2024-01-27 23:10:42,469 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] i == 0 [2024-01-27 23:10:42,470 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] q2 == 0 [2024-01-27 23:10:42,470 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] j == 0 [2024-01-27 23:10:42,470 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,470 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,470 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,470 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,471 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] j == 0 [2024-01-27 23:10:42,471 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] i == 0 [2024-01-27 23:10:42,471 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,471 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L49] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,472 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L49] 0 <= q2_back [2024-01-27 23:10:42,472 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] q2 == 0 [2024-01-27 23:10:42,472 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] i == 0 [2024-01-27 23:10:42,472 INFO L98 nessWitnessExtractor]: Location invariant before [L108-L108] j == 0 [2024-01-27 23:10:42,472 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,472 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] q2_front <= 2147483646 [2024-01-27 23:10:42,473 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] -2147483647 <= q2_back [2024-01-27 23:10:42,473 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,473 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] q1 == 0 [2024-01-27 23:10:42,473 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] q2 == 0 [2024-01-27 23:10:42,473 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] i == 0 [2024-01-27 23:10:42,473 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] j == 0 [2024-01-27 23:10:42,474 INFO L98 nessWitnessExtractor]: Loop invariant at [L112-L114] i == 0 [2024-01-27 23:10:42,474 INFO L98 nessWitnessExtractor]: Loop invariant at [L112-L114] j == 0 [2024-01-27 23:10:42,474 INFO L98 nessWitnessExtractor]: Loop invariant at [L112-L114] q2 == 0 [2024-01-27 23:10:42,475 INFO L98 nessWitnessExtractor]: Loop invariant at [L112-L114] ((((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-01-27 23:10:42,476 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,476 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] -2147483647 <= q1_front [2024-01-27 23:10:42,476 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] i == 0 [2024-01-27 23:10:42,476 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] q2 == 0 [2024-01-27 23:10:42,476 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] q1 == 0 [2024-01-27 23:10:42,476 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] q2_back == 0 [2024-01-27 23:10:42,477 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] j == 0 [2024-01-27 23:10:42,477 INFO L98 nessWitnessExtractor]: Location invariant before [L111-L111] j == 0 [2024-01-27 23:10:42,477 INFO L98 nessWitnessExtractor]: Location invariant before [L111-L111] q2 == 0 [2024-01-27 23:10:42,477 INFO L98 nessWitnessExtractor]: Location invariant before [L111-L111] i == 0 [2024-01-27 23:10:42,478 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,478 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,478 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] q2_back == 0 [2024-01-27 23:10:42,478 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] j == 0 [2024-01-27 23:10:42,479 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] q1 == 0 [2024-01-27 23:10:42,479 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] q2 == 0 [2024-01-27 23:10:42,480 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] q1_back == 0 [2024-01-27 23:10:42,480 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] q2_front == 0 [2024-01-27 23:10:42,480 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] i == 0 [2024-01-27 23:10:42,481 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] n1 == 0 [2024-01-27 23:10:42,481 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q2 == 0 [2024-01-27 23:10:42,481 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q2_front == 0 [2024-01-27 23:10:42,481 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] j == 0 [2024-01-27 23:10:42,481 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q1_back == 0 [2024-01-27 23:10:42,481 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q1 == 0 [2024-01-27 23:10:42,481 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q1_front == 0 [2024-01-27 23:10:42,482 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] n2 == 0 [2024-01-27 23:10:42,482 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] q2_back == 0 [2024-01-27 23:10:42,482 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] i == 0 [2024-01-27 23:10:42,482 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] -2147483647 <= q2_back [2024-01-27 23:10:42,482 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,482 INFO L98 nessWitnessExtractor]: Loop invariant at [L47-L59] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,483 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] (-1LL - (long long )i) + (long long )size >= 0LL [2024-01-27 23:10:42,483 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] i == 0 [2024-01-27 23:10:42,483 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] (((((((((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-01-27 23:10:42,483 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] size != 0 [2024-01-27 23:10:42,483 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] j == 0 [2024-01-27 23:10:42,483 INFO L98 nessWitnessExtractor]: Location invariant before [L113-L113] q2 == 0 [2024-01-27 23:10:42,484 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] q2_back == 0 [2024-01-27 23:10:42,484 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] i == 0 [2024-01-27 23:10:42,484 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] q1 == 0 [2024-01-27 23:10:42,484 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] q2_front == 0 [2024-01-27 23:10:42,484 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] j == 0 [2024-01-27 23:10:42,484 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] q2 == 0 [2024-01-27 23:10:42,484 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] i == 0 [2024-01-27 23:10:42,485 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] j == 0 [2024-01-27 23:10:42,485 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] q2 == 0 [2024-01-27 23:10:42,485 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] 0 <= i [2024-01-27 23:10:42,485 INFO L98 nessWitnessExtractor]: Location invariant before [L115-L115] (long long )i - (long long )size >= 0LL [2024-01-27 23:10:42,485 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] q1_front <= 2147483646 [2024-01-27 23:10:42,485 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,486 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] -2147483647 <= q1_back [2024-01-27 23:10:42,486 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,486 INFO L98 nessWitnessExtractor]: Loop invariant at [L65-L77] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,486 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q2_back == 0 [2024-01-27 23:10:42,486 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] i == 0 [2024-01-27 23:10:42,486 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] N == 0 [2024-01-27 23:10:42,486 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] n1 == 0 [2024-01-27 23:10:42,487 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q2 == 0 [2024-01-27 23:10:42,487 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] n2 == 0 [2024-01-27 23:10:42,487 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q1_front == 0 [2024-01-27 23:10:42,487 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q1_back == 0 [2024-01-27 23:10:42,487 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] j == 0 [2024-01-27 23:10:42,487 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q1 == 0 [2024-01-27 23:10:42,488 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] q2_front == 0 [2024-01-27 23:10:42,488 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,488 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,489 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,489 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-27 23:10:42,489 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q1_back == 0 [2024-01-27 23:10:42,490 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] j == 0 [2024-01-27 23:10:42,490 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q2 == 0 [2024-01-27 23:10:42,490 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] n2 == 0 [2024-01-27 23:10:42,491 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q1 == 0 [2024-01-27 23:10:42,491 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q2_front == 0 [2024-01-27 23:10:42,491 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] i == 0 [2024-01-27 23:10:42,492 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q2_back == 0 [2024-01-27 23:10:42,492 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] q1_front == 0 [2024-01-27 23:10:42,492 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q1_front == 0 [2024-01-27 23:10:42,492 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q1 == 0 [2024-01-27 23:10:42,493 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q2 == 0 [2024-01-27 23:10:42,493 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] i == 0 [2024-01-27 23:10:42,493 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q1_back == 0 [2024-01-27 23:10:42,493 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q2_back == 0 [2024-01-27 23:10:42,493 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] q2_front == 0 [2024-01-27 23:10:42,493 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] j == 0 [2024-01-27 23:10:42,494 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] j == 0 [2024-01-27 23:10:42,494 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] q2 == 0 [2024-01-27 23:10:42,494 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] i == 0 [2024-01-27 23:10:42,517 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 23:10:42,675 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-01-27 23:10:42,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:10:42,694 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 23:10:42,713 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 23:10:42,803 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 Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 23:10:42,827 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:10:42,841 INFO L206 MainTranslator]: Completed translation [2024-01-27 23:10:42,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:42 WrapperNode [2024-01-27 23:10:42,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 23:10:42,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 23:10:42,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 23:10:42,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 23:10:42,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:42" (1/1) ... [2024-01-27 23:10:42,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:42" (1/1) ... [2024-01-27 23:10:42,903 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 369 [2024-01-27 23:10:42,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 23:10:42,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 23:10:42,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 23:10:42,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 23:10:42,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:42" (1/1) ... [2024-01-27 23:10:42,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:42" (1/1) ... [2024-01-27 23:10:42,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:42" (1/1) ... [2024-01-27 23:10:42,955 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-01-27 23:10:42,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:42" (1/1) ... [2024-01-27 23:10:42,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:42" (1/1) ... [2024-01-27 23:10:42,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:42" (1/1) ... [2024-01-27 23:10:42,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:42" (1/1) ... [2024-01-27 23:10:42,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:42" (1/1) ... [2024-01-27 23:10:42,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:42" (1/1) ... [2024-01-27 23:10:42,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 23:10:42,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 23:10:42,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 23:10:42,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 23:10:42,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:42" (1/1) ... [2024-01-27 23:10:42,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:10:43,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 23:10:43,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 23:10:43,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 23:10:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 23:10:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 23:10:43,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 23:10:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 23:10:43,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 23:10:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 23:10:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 23:10:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 23:10:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 23:10:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 23:10:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 23:10:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 23:10:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 23:10:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 23:10:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 23:10:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 23:10:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 23:10:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 23:10:43,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 23:10:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 23:10:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 23:10:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 23:10:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 23:10:43,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 23:10:43,088 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 23:10:43,200 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 23:10:43,202 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 23:10:43,967 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 23:10:43,968 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 23:10:44,267 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 23:10:44,268 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-27 23:10:44,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:10:44 BoogieIcfgContainer [2024-01-27 23:10:44,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 23:10:44,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 23:10:44,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 23:10:44,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 23:10:44,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:10:41" (1/4) ... [2024-01-27 23:10:44,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb814c0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:10:44, skipping insertion in model container [2024-01-27 23:10:44,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:10:42" (2/4) ... [2024-01-27 23:10:44,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb814c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:10:44, skipping insertion in model container [2024-01-27 23:10:44,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:10:42" (3/4) ... [2024-01-27 23:10:44,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb814c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:10:44, skipping insertion in model container [2024-01-27 23:10:44,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:10:44" (4/4) ... [2024-01-27 23:10:44,278 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2024-01-27 23:10:44,292 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 23:10:44,293 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 160 error locations. [2024-01-27 23:10:44,293 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 23:10:44,379 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 23:10:44,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 319 transitions, 652 flow [2024-01-27 23:10:44,547 INFO L124 PetriNetUnfolderBase]: 4/317 cut-off events. [2024-01-27 23:10:44,548 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 23:10:44,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 317 events. 4/317 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 562 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 281. Up to 2 conditions per place. [2024-01-27 23:10:44,553 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 319 transitions, 652 flow [2024-01-27 23:10:44,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 319 places, 316 transitions, 644 flow [2024-01-27 23:10:44,567 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 23:10:44,574 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;@38b604f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 23:10:44,574 INFO L358 AbstractCegarLoop]: Starting to check reachability of 200 error locations. [2024-01-27 23:10:44,577 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 23:10:44,577 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 23:10:44,577 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:10:44,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:44,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 23:10:44,578 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 23:10:44,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:44,585 INFO L85 PathProgramCache]: Analyzing trace with hash 38836, now seen corresponding path program 1 times [2024-01-27 23:10:44,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:44,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382404115] [2024-01-27 23:10:44,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:44,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:44,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:44,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382404115] [2024-01-27 23:10:44,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382404115] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:44,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:44,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:44,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29632353] [2024-01-27 23:10:44,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:44,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:44,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:44,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:44,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:44,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 319 [2024-01-27 23:10:44,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 316 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:44,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:44,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 319 [2024-01-27 23:10:44,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:45,186 INFO L124 PetriNetUnfolderBase]: 524/1342 cut-off events. [2024-01-27 23:10:45,187 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-01-27 23:10:45,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2211 conditions, 1342 events. 524/1342 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7999 event pairs, 360 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 1806. Up to 818 conditions per place. [2024-01-27 23:10:45,201 INFO L140 encePairwiseOnDemand]: 295/319 looper letters, 55 selfloop transitions, 2 changer transitions 0/294 dead transitions. [2024-01-27 23:10:45,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 294 transitions, 714 flow [2024-01-27 23:10:45,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 796 transitions. [2024-01-27 23:10:45,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.831765935214211 [2024-01-27 23:10:45,221 INFO L175 Difference]: Start difference. First operand has 319 places, 316 transitions, 644 flow. Second operand 3 states and 796 transitions. [2024-01-27 23:10:45,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 294 transitions, 714 flow [2024-01-27 23:10:45,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 294 transitions, 706 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 23:10:45,236 INFO L231 Difference]: Finished difference. Result has 295 places, 294 transitions, 596 flow [2024-01-27 23:10:45,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=295, PETRI_TRANSITIONS=294} [2024-01-27 23:10:45,242 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -24 predicate places. [2024-01-27 23:10:45,242 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 294 transitions, 596 flow [2024-01-27 23:10:45,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:45,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:45,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 23:10:45,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 23:10:45,244 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 23:10:45,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:45,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1204979, now seen corresponding path program 1 times [2024-01-27 23:10:45,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:45,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068568612] [2024-01-27 23:10:45,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:45,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:45,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:45,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:45,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068568612] [2024-01-27 23:10:45,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068568612] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:45,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:45,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:45,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523117566] [2024-01-27 23:10:45,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:45,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:45,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:45,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:45,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:45,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 319 [2024-01-27 23:10:45,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 294 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:45,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:45,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 319 [2024-01-27 23:10:45,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:45,568 INFO L124 PetriNetUnfolderBase]: 524/1334 cut-off events. [2024-01-27 23:10:45,568 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 23:10:45,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1334 events. 524/1334 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8044 event pairs, 360 based on Foata normal form. 0/775 useless extension candidates. Maximal degree in co-relation 2072. Up to 810 conditions per place. [2024-01-27 23:10:45,576 INFO L140 encePairwiseOnDemand]: 309/319 looper letters, 56 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2024-01-27 23:10:45,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 286 transitions, 696 flow [2024-01-27 23:10:45,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 774 transitions. [2024-01-27 23:10:45,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8087774294670846 [2024-01-27 23:10:45,582 INFO L175 Difference]: Start difference. First operand has 295 places, 294 transitions, 596 flow. Second operand 3 states and 774 transitions. [2024-01-27 23:10:45,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 286 transitions, 696 flow [2024-01-27 23:10:45,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 286 transitions, 692 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:45,588 INFO L231 Difference]: Finished difference. Result has 287 places, 286 transitions, 580 flow [2024-01-27 23:10:45,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=287, PETRI_TRANSITIONS=286} [2024-01-27 23:10:45,589 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -32 predicate places. [2024-01-27 23:10:45,590 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 286 transitions, 580 flow [2024-01-27 23:10:45,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:45,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:45,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 23:10:45,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 23:10:45,591 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 23:10:45,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:45,591 INFO L85 PathProgramCache]: Analyzing trace with hash 37355424, now seen corresponding path program 1 times [2024-01-27 23:10:45,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:45,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644450558] [2024-01-27 23:10:45,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:45,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:45,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:45,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644450558] [2024-01-27 23:10:45,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644450558] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:45,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:45,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:45,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896121205] [2024-01-27 23:10:45,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:45,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:45,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:45,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:45,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:45,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 319 [2024-01-27 23:10:45,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 286 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:45,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:45,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 319 [2024-01-27 23:10:45,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:46,010 INFO L124 PetriNetUnfolderBase]: 807/1901 cut-off events. [2024-01-27 23:10:46,011 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-27 23:10:46,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3248 conditions, 1901 events. 807/1901 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12802 event pairs, 294 based on Foata normal form. 0/1134 useless extension candidates. Maximal degree in co-relation 3064. Up to 677 conditions per place. [2024-01-27 23:10:46,021 INFO L140 encePairwiseOnDemand]: 293/319 looper letters, 94 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2024-01-27 23:10:46,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 286 transitions, 774 flow [2024-01-27 23:10:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:46,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 738 transitions. [2024-01-27 23:10:46,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7711598746081505 [2024-01-27 23:10:46,023 INFO L175 Difference]: Start difference. First operand has 287 places, 286 transitions, 580 flow. Second operand 3 states and 738 transitions. [2024-01-27 23:10:46,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 286 transitions, 774 flow [2024-01-27 23:10:46,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 286 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:46,028 INFO L231 Difference]: Finished difference. Result has 264 places, 263 transitions, 538 flow [2024-01-27 23:10:46,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=538, PETRI_PLACES=264, PETRI_TRANSITIONS=263} [2024-01-27 23:10:46,029 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -55 predicate places. [2024-01-27 23:10:46,029 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 263 transitions, 538 flow [2024-01-27 23:10:46,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:46,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:46,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 23:10:46,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 23:10:46,030 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 23:10:46,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:46,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1158019324, now seen corresponding path program 1 times [2024-01-27 23:10:46,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:46,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928499213] [2024-01-27 23:10:46,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:46,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:46,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:46,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928499213] [2024-01-27 23:10:46,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928499213] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:46,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:46,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:46,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755990735] [2024-01-27 23:10:46,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:46,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:46,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:46,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:46,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:46,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 319 [2024-01-27 23:10:46,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 263 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:46,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:46,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 319 [2024-01-27 23:10:46,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:46,352 INFO L124 PetriNetUnfolderBase]: 807/1891 cut-off events. [2024-01-27 23:10:46,352 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-01-27 23:10:46,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3293 conditions, 1891 events. 807/1891 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12930 event pairs, 624 based on Foata normal form. 0/1160 useless extension candidates. Maximal degree in co-relation 1650. Up to 1305 conditions per place. [2024-01-27 23:10:46,362 INFO L140 encePairwiseOnDemand]: 312/319 looper letters, 54 selfloop transitions, 2 changer transitions 0/258 dead transitions. [2024-01-27 23:10:46,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 258 transitions, 640 flow [2024-01-27 23:10:46,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 786 transitions. [2024-01-27 23:10:46,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8213166144200627 [2024-01-27 23:10:46,365 INFO L175 Difference]: Start difference. First operand has 264 places, 263 transitions, 538 flow. Second operand 3 states and 786 transitions. [2024-01-27 23:10:46,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 258 transitions, 640 flow [2024-01-27 23:10:46,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 258 transitions, 638 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:10:46,369 INFO L231 Difference]: Finished difference. Result has 260 places, 258 transitions, 530 flow [2024-01-27 23:10:46,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=260, PETRI_TRANSITIONS=258} [2024-01-27 23:10:46,370 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -59 predicate places. [2024-01-27 23:10:46,370 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 258 transitions, 530 flow [2024-01-27 23:10:46,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:46,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:46,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 23:10:46,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 23:10:46,371 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 23:10:46,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:46,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1538861994, now seen corresponding path program 1 times [2024-01-27 23:10:46,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:46,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764959159] [2024-01-27 23:10:46,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:46,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:46,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:46,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764959159] [2024-01-27 23:10:46,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764959159] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:46,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:46,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:46,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446710316] [2024-01-27 23:10:46,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:46,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:46,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:46,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:46,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:46,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 319 [2024-01-27 23:10:46,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 258 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:46,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:46,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 319 [2024-01-27 23:10:46,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:46,710 INFO L124 PetriNetUnfolderBase]: 807/1887 cut-off events. [2024-01-27 23:10:46,710 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-01-27 23:10:46,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3266 conditions, 1887 events. 807/1887 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12878 event pairs, 624 based on Foata normal form. 0/1159 useless extension candidates. Maximal degree in co-relation 3183. Up to 1306 conditions per place. [2024-01-27 23:10:46,721 INFO L140 encePairwiseOnDemand]: 313/319 looper letters, 53 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2024-01-27 23:10:46,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 254 transitions, 632 flow [2024-01-27 23:10:46,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2024-01-27 23:10:46,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8254963427377221 [2024-01-27 23:10:46,724 INFO L175 Difference]: Start difference. First operand has 260 places, 258 transitions, 530 flow. Second operand 3 states and 790 transitions. [2024-01-27 23:10:46,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 254 transitions, 632 flow [2024-01-27 23:10:46,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 254 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:46,729 INFO L231 Difference]: Finished difference. Result has 256 places, 254 transitions, 522 flow [2024-01-27 23:10:46,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=256, PETRI_TRANSITIONS=254} [2024-01-27 23:10:46,730 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -63 predicate places. [2024-01-27 23:10:46,731 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 254 transitions, 522 flow [2024-01-27 23:10:46,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:46,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:46,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:46,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 23:10:46,732 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 23:10:46,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:46,733 INFO L85 PathProgramCache]: Analyzing trace with hash 460082809, now seen corresponding path program 1 times [2024-01-27 23:10:46,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:46,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856336115] [2024-01-27 23:10:46,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:46,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:46,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:46,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856336115] [2024-01-27 23:10:46,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856336115] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:46,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:46,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:46,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678815783] [2024-01-27 23:10:46,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:46,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:46,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:46,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:46,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:46,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 319 [2024-01-27 23:10:46,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 254 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:46,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:46,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 319 [2024-01-27 23:10:46,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:47,060 INFO L124 PetriNetUnfolderBase]: 807/1884 cut-off events. [2024-01-27 23:10:47,061 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-01-27 23:10:47,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 1884 events. 807/1884 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12869 event pairs, 624 based on Foata normal form. 0/1159 useless extension candidates. Maximal degree in co-relation 3194. Up to 1307 conditions per place. [2024-01-27 23:10:47,072 INFO L140 encePairwiseOnDemand]: 314/319 looper letters, 53 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2024-01-27 23:10:47,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 251 transitions, 626 flow [2024-01-27 23:10:47,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2024-01-27 23:10:47,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8275862068965517 [2024-01-27 23:10:47,074 INFO L175 Difference]: Start difference. First operand has 256 places, 254 transitions, 522 flow. Second operand 3 states and 792 transitions. [2024-01-27 23:10:47,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 251 transitions, 626 flow [2024-01-27 23:10:47,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 251 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:47,079 INFO L231 Difference]: Finished difference. Result has 253 places, 251 transitions, 516 flow [2024-01-27 23:10:47,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=253, PETRI_TRANSITIONS=251} [2024-01-27 23:10:47,081 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -66 predicate places. [2024-01-27 23:10:47,081 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 251 transitions, 516 flow [2024-01-27 23:10:47,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:47,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:47,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:47,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 23:10:47,083 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 23:10:47,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:47,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1377666349, now seen corresponding path program 1 times [2024-01-27 23:10:47,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:47,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717088287] [2024-01-27 23:10:47,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:47,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:47,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:47,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717088287] [2024-01-27 23:10:47,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717088287] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:47,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:47,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:47,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084271587] [2024-01-27 23:10:47,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:47,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:47,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:47,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:47,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:47,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 319 [2024-01-27 23:10:47,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 251 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:47,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:47,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 319 [2024-01-27 23:10:47,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:47,383 INFO L124 PetriNetUnfolderBase]: 807/1861 cut-off events. [2024-01-27 23:10:47,383 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-01-27 23:10:47,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3256 conditions, 1861 events. 807/1861 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12785 event pairs, 624 based on Foata normal form. 0/1155 useless extension candidates. Maximal degree in co-relation 3202. Up to 1289 conditions per place. [2024-01-27 23:10:47,394 INFO L140 encePairwiseOnDemand]: 294/319 looper letters, 69 selfloop transitions, 2 changer transitions 0/228 dead transitions. [2024-01-27 23:10:47,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 228 transitions, 612 flow [2024-01-27 23:10:47,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:47,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2024-01-27 23:10:47,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7523510971786834 [2024-01-27 23:10:47,397 INFO L175 Difference]: Start difference. First operand has 253 places, 251 transitions, 516 flow. Second operand 3 states and 720 transitions. [2024-01-27 23:10:47,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 228 transitions, 612 flow [2024-01-27 23:10:47,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 228 transitions, 608 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:47,401 INFO L231 Difference]: Finished difference. Result has 230 places, 228 transitions, 470 flow [2024-01-27 23:10:47,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=230, PETRI_TRANSITIONS=228} [2024-01-27 23:10:47,402 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -89 predicate places. [2024-01-27 23:10:47,402 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 228 transitions, 470 flow [2024-01-27 23:10:47,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:47,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:47,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:47,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 23:10:47,404 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 23:10:47,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:47,404 INFO L85 PathProgramCache]: Analyzing trace with hash -242015110, now seen corresponding path program 1 times [2024-01-27 23:10:47,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:47,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705744439] [2024-01-27 23:10:47,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:47,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:47,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:47,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:47,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705744439] [2024-01-27 23:10:47,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705744439] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:47,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:47,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:47,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735883174] [2024-01-27 23:10:47,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:47,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:47,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:47,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:47,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:47,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 319 [2024-01-27 23:10:47,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 228 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:47,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:47,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 319 [2024-01-27 23:10:47,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:47,656 INFO L124 PetriNetUnfolderBase]: 807/1859 cut-off events. [2024-01-27 23:10:47,656 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-01-27 23:10:47,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3236 conditions, 1859 events. 807/1859 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12787 event pairs, 624 based on Foata normal form. 0/1154 useless extension candidates. Maximal degree in co-relation 3037. Up to 1308 conditions per place. [2024-01-27 23:10:47,666 INFO L140 encePairwiseOnDemand]: 315/319 looper letters, 51 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2024-01-27 23:10:47,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 226 transitions, 572 flow [2024-01-27 23:10:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 798 transitions. [2024-01-27 23:10:47,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8338557993730408 [2024-01-27 23:10:47,669 INFO L175 Difference]: Start difference. First operand has 230 places, 228 transitions, 470 flow. Second operand 3 states and 798 transitions. [2024-01-27 23:10:47,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 226 transitions, 572 flow [2024-01-27 23:10:47,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 226 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:47,673 INFO L231 Difference]: Finished difference. Result has 228 places, 226 transitions, 466 flow [2024-01-27 23:10:47,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=228, PETRI_TRANSITIONS=226} [2024-01-27 23:10:47,674 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -91 predicate places. [2024-01-27 23:10:47,674 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 226 transitions, 466 flow [2024-01-27 23:10:47,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:47,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:47,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:47,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 23:10:47,675 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 23:10:47,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:47,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1087467410, now seen corresponding path program 1 times [2024-01-27 23:10:47,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:47,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601606953] [2024-01-27 23:10:47,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:47,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:47,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:47,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601606953] [2024-01-27 23:10:47,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601606953] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:47,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:47,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:47,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185037968] [2024-01-27 23:10:47,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:47,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:47,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:47,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:47,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:47,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 319 [2024-01-27 23:10:47,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 226 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:47,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:47,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 319 [2024-01-27 23:10:47,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:47,945 INFO L124 PetriNetUnfolderBase]: 807/1858 cut-off events. [2024-01-27 23:10:47,946 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-01-27 23:10:47,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3235 conditions, 1858 events. 807/1858 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12751 event pairs, 624 based on Foata normal form. 0/1154 useless extension candidates. Maximal degree in co-relation 3198. Up to 1309 conditions per place. [2024-01-27 23:10:47,957 INFO L140 encePairwiseOnDemand]: 316/319 looper letters, 51 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2024-01-27 23:10:47,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 225 transitions, 570 flow [2024-01-27 23:10:47,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2024-01-27 23:10:47,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8359456635318704 [2024-01-27 23:10:47,960 INFO L175 Difference]: Start difference. First operand has 228 places, 226 transitions, 466 flow. Second operand 3 states and 800 transitions. [2024-01-27 23:10:47,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 225 transitions, 570 flow [2024-01-27 23:10:47,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 225 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:47,965 INFO L231 Difference]: Finished difference. Result has 227 places, 225 transitions, 464 flow [2024-01-27 23:10:47,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=227, PETRI_TRANSITIONS=225} [2024-01-27 23:10:47,967 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -92 predicate places. [2024-01-27 23:10:47,967 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 225 transitions, 464 flow [2024-01-27 23:10:47,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:47,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:47,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:47,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 23:10:47,969 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 23:10:47,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:47,969 INFO L85 PathProgramCache]: Analyzing trace with hash -648247593, now seen corresponding path program 1 times [2024-01-27 23:10:47,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:47,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33602515] [2024-01-27 23:10:47,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:47,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:48,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:48,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33602515] [2024-01-27 23:10:48,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33602515] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:48,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:48,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:48,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658262515] [2024-01-27 23:10:48,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:48,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:48,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:48,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:48,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:48,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 319 [2024-01-27 23:10:48,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 225 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:48,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:48,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 319 [2024-01-27 23:10:48,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:48,382 INFO L124 PetriNetUnfolderBase]: 1200/2806 cut-off events. [2024-01-27 23:10:48,382 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2024-01-27 23:10:48,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4996 conditions, 2806 events. 1200/2806 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 22012 event pairs, 510 based on Foata normal form. 2/1799 useless extension candidates. Maximal degree in co-relation 4973. Up to 1111 conditions per place. [2024-01-27 23:10:48,397 INFO L140 encePairwiseOnDemand]: 297/319 looper letters, 91 selfloop transitions, 2 changer transitions 0/232 dead transitions. [2024-01-27 23:10:48,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 232 transitions, 671 flow [2024-01-27 23:10:48,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:48,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2024-01-27 23:10:48,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7962382445141066 [2024-01-27 23:10:48,399 INFO L175 Difference]: Start difference. First operand has 227 places, 225 transitions, 464 flow. Second operand 3 states and 762 transitions. [2024-01-27 23:10:48,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 232 transitions, 671 flow [2024-01-27 23:10:48,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 232 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:48,404 INFO L231 Difference]: Finished difference. Result has 208 places, 206 transitions, 430 flow [2024-01-27 23:10:48,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=430, PETRI_PLACES=208, PETRI_TRANSITIONS=206} [2024-01-27 23:10:48,405 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -111 predicate places. [2024-01-27 23:10:48,405 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 206 transitions, 430 flow [2024-01-27 23:10:48,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:48,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:48,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:48,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 23:10:48,406 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 23:10:48,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:48,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1379162192, now seen corresponding path program 1 times [2024-01-27 23:10:48,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:48,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723884103] [2024-01-27 23:10:48,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:48,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:48,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:48,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723884103] [2024-01-27 23:10:48,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723884103] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:48,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:48,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:10:48,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124569267] [2024-01-27 23:10:48,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:48,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:48,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:48,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:48,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:48,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 319 [2024-01-27 23:10:48,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 206 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:48,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:48,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 319 [2024-01-27 23:10:48,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:48,784 INFO L124 PetriNetUnfolderBase]: 1200/2802 cut-off events. [2024-01-27 23:10:48,784 INFO L125 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2024-01-27 23:10:48,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5102 conditions, 2802 events. 1200/2802 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22103 event pairs, 1116 based on Foata normal form. 0/1853 useless extension candidates. Maximal degree in co-relation 2599. Up to 2059 conditions per place. [2024-01-27 23:10:48,796 INFO L140 encePairwiseOnDemand]: 310/319 looper letters, 55 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2024-01-27 23:10:48,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 199 transitions, 530 flow [2024-01-27 23:10:48,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2024-01-27 23:10:48,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8171368861024033 [2024-01-27 23:10:48,798 INFO L175 Difference]: Start difference. First operand has 208 places, 206 transitions, 430 flow. Second operand 3 states and 782 transitions. [2024-01-27 23:10:48,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 199 transitions, 530 flow [2024-01-27 23:10:48,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 199 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:10:48,802 INFO L231 Difference]: Finished difference. Result has 202 places, 199 transitions, 418 flow [2024-01-27 23:10:48,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=202, PETRI_TRANSITIONS=199} [2024-01-27 23:10:48,803 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -117 predicate places. [2024-01-27 23:10:48,803 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 199 transitions, 418 flow [2024-01-27 23:10:48,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:48,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:48,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:48,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 23:10:48,805 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 23:10:48,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:48,805 INFO L85 PathProgramCache]: Analyzing trace with hash 2080256159, now seen corresponding path program 1 times [2024-01-27 23:10:48,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:48,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211204661] [2024-01-27 23:10:48,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:48,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:48,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:48,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:48,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211204661] [2024-01-27 23:10:48,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211204661] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:48,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:48,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 23:10:48,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087964787] [2024-01-27 23:10:48,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:48,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:10:48,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:48,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:10:48,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:10:48,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 319 [2024-01-27 23:10:48,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 199 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:48,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:48,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 319 [2024-01-27 23:10:48,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:49,266 INFO L124 PetriNetUnfolderBase]: 1200/2794 cut-off events. [2024-01-27 23:10:49,266 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-01-27 23:10:49,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5060 conditions, 2794 events. 1200/2794 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 21990 event pairs, 1116 based on Foata normal form. 4/1857 useless extension candidates. Maximal degree in co-relation 4986. Up to 2066 conditions per place. [2024-01-27 23:10:49,279 INFO L140 encePairwiseOnDemand]: 303/319 looper letters, 53 selfloop transitions, 8 changer transitions 0/191 dead transitions. [2024-01-27 23:10:49,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 191 transitions, 524 flow [2024-01-27 23:10:49,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:10:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:10:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 772 transitions. [2024-01-27 23:10:49,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8066875653082549 [2024-01-27 23:10:49,281 INFO L175 Difference]: Start difference. First operand has 202 places, 199 transitions, 418 flow. Second operand 3 states and 772 transitions. [2024-01-27 23:10:49,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 191 transitions, 524 flow [2024-01-27 23:10:49,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 191 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:49,285 INFO L231 Difference]: Finished difference. Result has 194 places, 191 transitions, 414 flow [2024-01-27 23:10:49,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=194, PETRI_TRANSITIONS=191} [2024-01-27 23:10:49,286 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -125 predicate places. [2024-01-27 23:10:49,286 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 191 transitions, 414 flow [2024-01-27 23:10:49,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:49,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:49,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:49,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 23:10:49,287 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 23:10:49,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:49,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1930262247, now seen corresponding path program 1 times [2024-01-27 23:10:49,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:49,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400439752] [2024-01-27 23:10:49,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:49,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:49,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:49,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400439752] [2024-01-27 23:10:49,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400439752] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:49,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:49,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:10:49,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451514538] [2024-01-27 23:10:49,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:49,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 23:10:49,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:49,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 23:10:49,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-27 23:10:49,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 319 [2024-01-27 23:10:49,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 191 transitions, 414 flow. Second operand has 5 states, 5 states have (on average 190.2) internal successors, (951), 5 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:49,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:49,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 319 [2024-01-27 23:10:49,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:49,923 INFO L124 PetriNetUnfolderBase]: 1200/2789 cut-off events. [2024-01-27 23:10:49,923 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2024-01-27 23:10:49,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5089 conditions, 2789 events. 1200/2789 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 22059 event pairs, 510 based on Foata normal form. 0/1877 useless extension candidates. Maximal degree in co-relation 4892. Up to 1111 conditions per place. [2024-01-27 23:10:49,933 INFO L140 encePairwiseOnDemand]: 299/319 looper letters, 97 selfloop transitions, 18 changer transitions 0/215 dead transitions. [2024-01-27 23:10:49,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 215 transitions, 699 flow [2024-01-27 23:10:49,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 23:10:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 23:10:49,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1225 transitions. [2024-01-27 23:10:49,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6400208986415883 [2024-01-27 23:10:49,937 INFO L175 Difference]: Start difference. First operand has 194 places, 191 transitions, 414 flow. Second operand 6 states and 1225 transitions. [2024-01-27 23:10:49,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 215 transitions, 699 flow [2024-01-27 23:10:49,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 215 transitions, 683 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:10:49,941 INFO L231 Difference]: Finished difference. Result has 195 places, 189 transitions, 430 flow [2024-01-27 23:10:49,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=430, PETRI_PLACES=195, PETRI_TRANSITIONS=189} [2024-01-27 23:10:49,942 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -124 predicate places. [2024-01-27 23:10:49,942 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 189 transitions, 430 flow [2024-01-27 23:10:49,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.2) internal successors, (951), 5 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:49,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:49,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:49,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 23:10:49,943 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 23:10:49,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:49,944 INFO L85 PathProgramCache]: Analyzing trace with hash 444087002, now seen corresponding path program 1 times [2024-01-27 23:10:49,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:49,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29188977] [2024-01-27 23:10:49,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:49,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:50,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:50,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:50,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29188977] [2024-01-27 23:10:50,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29188977] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:50,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:50,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:10:50,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318322208] [2024-01-27 23:10:50,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:50,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:10:50,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:50,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:10:50,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:10:50,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 319 [2024-01-27 23:10:50,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 189 transitions, 430 flow. Second operand has 4 states, 4 states have (on average 232.75) internal successors, (931), 4 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:50,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:50,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 319 [2024-01-27 23:10:50,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:50,473 INFO L124 PetriNetUnfolderBase]: 1200/2792 cut-off events. [2024-01-27 23:10:50,473 INFO L125 PetriNetUnfolderBase]: For 273/273 co-relation queries the response was YES. [2024-01-27 23:10:50,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5117 conditions, 2792 events. 1200/2792 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22011 event pairs, 1116 based on Foata normal form. 4/1863 useless extension candidates. Maximal degree in co-relation 2599. Up to 2062 conditions per place. [2024-01-27 23:10:50,483 INFO L140 encePairwiseOnDemand]: 307/319 looper letters, 57 selfloop transitions, 10 changer transitions 0/189 dead transitions. [2024-01-27 23:10:50,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 189 transitions, 560 flow [2024-01-27 23:10:50,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 23:10:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 23:10:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1214 transitions. [2024-01-27 23:10:50,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.761128526645768 [2024-01-27 23:10:50,487 INFO L175 Difference]: Start difference. First operand has 195 places, 189 transitions, 430 flow. Second operand 5 states and 1214 transitions. [2024-01-27 23:10:50,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 189 transitions, 560 flow [2024-01-27 23:10:50,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 189 transitions, 540 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 23:10:50,490 INFO L231 Difference]: Finished difference. Result has 194 places, 189 transitions, 436 flow [2024-01-27 23:10:50,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=436, PETRI_PLACES=194, PETRI_TRANSITIONS=189} [2024-01-27 23:10:50,491 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -125 predicate places. [2024-01-27 23:10:50,492 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 189 transitions, 436 flow [2024-01-27 23:10:50,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 232.75) internal successors, (931), 4 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:50,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:50,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:50,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-27 23:10:50,493 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 23:10:50,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:50,494 INFO L85 PathProgramCache]: Analyzing trace with hash 881796483, now seen corresponding path program 1 times [2024-01-27 23:10:50,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:50,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144302901] [2024-01-27 23:10:50,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:50,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:10:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:10:50,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:10:50,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144302901] [2024-01-27 23:10:50,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144302901] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:10:50,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:10:50,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 23:10:50,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188215316] [2024-01-27 23:10:50,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:10:50,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 23:10:50,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:10:50,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 23:10:50,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-27 23:10:50,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 319 [2024-01-27 23:10:50,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 189 transitions, 436 flow. Second operand has 5 states, 5 states have (on average 226.2) internal successors, (1131), 5 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:50,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:10:50,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 319 [2024-01-27 23:10:50,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:10:50,998 INFO L124 PetriNetUnfolderBase]: 1200/2788 cut-off events. [2024-01-27 23:10:50,998 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2024-01-27 23:10:51,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5081 conditions, 2788 events. 1200/2788 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22020 event pairs, 1116 based on Foata normal form. 2/1855 useless extension candidates. Maximal degree in co-relation 4894. Up to 2056 conditions per place. [2024-01-27 23:10:51,010 INFO L140 encePairwiseOnDemand]: 301/319 looper letters, 53 selfloop transitions, 16 changer transitions 0/185 dead transitions. [2024-01-27 23:10:51,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 185 transitions, 562 flow [2024-01-27 23:10:51,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 23:10:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 23:10:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1184 transitions. [2024-01-27 23:10:51,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.742319749216301 [2024-01-27 23:10:51,013 INFO L175 Difference]: Start difference. First operand has 194 places, 189 transitions, 436 flow. Second operand 5 states and 1184 transitions. [2024-01-27 23:10:51,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 185 transitions, 562 flow [2024-01-27 23:10:51,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 185 transitions, 548 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 23:10:51,017 INFO L231 Difference]: Finished difference. Result has 190 places, 185 transitions, 442 flow [2024-01-27 23:10:51,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=442, PETRI_PLACES=190, PETRI_TRANSITIONS=185} [2024-01-27 23:10:51,018 INFO L281 CegarLoopForPetriNet]: 319 programPoint places, -129 predicate places. [2024-01-27 23:10:51,018 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 185 transitions, 442 flow [2024-01-27 23:10:51,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 226.2) internal successors, (1131), 5 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:10:51,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:10:51,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:51,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-27 23:10:51,019 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (and 197 more)] === [2024-01-27 23:10:51,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:10:51,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1580074524, now seen corresponding path program 1 times [2024-01-27 23:10:51,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:10:51,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984875936] [2024-01-27 23:10:51,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:10:51,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:10:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:10:51,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 23:10:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:10:51,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 23:10:51,077 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 23:10:51,078 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (199 of 200 remaining) [2024-01-27 23:10:51,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (198 of 200 remaining) [2024-01-27 23:10:51,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (197 of 200 remaining) [2024-01-27 23:10:51,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (196 of 200 remaining) [2024-01-27 23:10:51,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (195 of 200 remaining) [2024-01-27 23:10:51,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (194 of 200 remaining) [2024-01-27 23:10:51,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (193 of 200 remaining) [2024-01-27 23:10:51,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (192 of 200 remaining) [2024-01-27 23:10:51,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (191 of 200 remaining) [2024-01-27 23:10:51,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (190 of 200 remaining) [2024-01-27 23:10:51,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (189 of 200 remaining) [2024-01-27 23:10:51,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (188 of 200 remaining) [2024-01-27 23:10:51,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (187 of 200 remaining) [2024-01-27 23:10:51,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (186 of 200 remaining) [2024-01-27 23:10:51,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (185 of 200 remaining) [2024-01-27 23:10:51,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (184 of 200 remaining) [2024-01-27 23:10:51,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (183 of 200 remaining) [2024-01-27 23:10:51,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (182 of 200 remaining) [2024-01-27 23:10:51,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (181 of 200 remaining) [2024-01-27 23:10:51,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (180 of 200 remaining) [2024-01-27 23:10:51,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (179 of 200 remaining) [2024-01-27 23:10:51,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (178 of 200 remaining) [2024-01-27 23:10:51,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (177 of 200 remaining) [2024-01-27 23:10:51,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (176 of 200 remaining) [2024-01-27 23:10:51,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (175 of 200 remaining) [2024-01-27 23:10:51,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (174 of 200 remaining) [2024-01-27 23:10:51,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 200 remaining) [2024-01-27 23:10:51,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 200 remaining) [2024-01-27 23:10:51,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 200 remaining) [2024-01-27 23:10:51,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 200 remaining) [2024-01-27 23:10:51,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 200 remaining) [2024-01-27 23:10:51,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 200 remaining) [2024-01-27 23:10:51,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 200 remaining) [2024-01-27 23:10:51,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 200 remaining) [2024-01-27 23:10:51,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 200 remaining) [2024-01-27 23:10:51,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 200 remaining) [2024-01-27 23:10:51,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 200 remaining) [2024-01-27 23:10:51,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 200 remaining) [2024-01-27 23:10:51,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 200 remaining) [2024-01-27 23:10:51,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 200 remaining) [2024-01-27 23:10:51,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 200 remaining) [2024-01-27 23:10:51,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 200 remaining) [2024-01-27 23:10:51,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 200 remaining) [2024-01-27 23:10:51,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 200 remaining) [2024-01-27 23:10:51,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 200 remaining) [2024-01-27 23:10:51,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 200 remaining) [2024-01-27 23:10:51,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 200 remaining) [2024-01-27 23:10:51,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 200 remaining) [2024-01-27 23:10:51,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 200 remaining) [2024-01-27 23:10:51,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 200 remaining) [2024-01-27 23:10:51,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 200 remaining) [2024-01-27 23:10:51,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 200 remaining) [2024-01-27 23:10:51,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 200 remaining) [2024-01-27 23:10:51,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 200 remaining) [2024-01-27 23:10:51,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 200 remaining) [2024-01-27 23:10:51,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 200 remaining) [2024-01-27 23:10:51,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 200 remaining) [2024-01-27 23:10:51,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 200 remaining) [2024-01-27 23:10:51,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 200 remaining) [2024-01-27 23:10:51,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 200 remaining) [2024-01-27 23:10:51,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 200 remaining) [2024-01-27 23:10:51,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 200 remaining) [2024-01-27 23:10:51,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 200 remaining) [2024-01-27 23:10:51,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 200 remaining) [2024-01-27 23:10:51,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 200 remaining) [2024-01-27 23:10:51,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 200 remaining) [2024-01-27 23:10:51,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 200 remaining) [2024-01-27 23:10:51,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 200 remaining) [2024-01-27 23:10:51,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 200 remaining) [2024-01-27 23:10:51,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 200 remaining) [2024-01-27 23:10:51,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 200 remaining) [2024-01-27 23:10:51,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 200 remaining) [2024-01-27 23:10:51,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 200 remaining) [2024-01-27 23:10:51,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 200 remaining) [2024-01-27 23:10:51,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 200 remaining) [2024-01-27 23:10:51,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 200 remaining) [2024-01-27 23:10:51,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 200 remaining) [2024-01-27 23:10:51,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 200 remaining) [2024-01-27 23:10:51,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 200 remaining) [2024-01-27 23:10:51,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 200 remaining) [2024-01-27 23:10:51,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 200 remaining) [2024-01-27 23:10:51,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 200 remaining) [2024-01-27 23:10:51,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 200 remaining) [2024-01-27 23:10:51,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 200 remaining) [2024-01-27 23:10:51,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 200 remaining) [2024-01-27 23:10:51,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 200 remaining) [2024-01-27 23:10:51,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 200 remaining) [2024-01-27 23:10:51,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 200 remaining) [2024-01-27 23:10:51,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 200 remaining) [2024-01-27 23:10:51,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 200 remaining) [2024-01-27 23:10:51,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 200 remaining) [2024-01-27 23:10:51,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 200 remaining) [2024-01-27 23:10:51,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 200 remaining) [2024-01-27 23:10:51,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 200 remaining) [2024-01-27 23:10:51,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 200 remaining) [2024-01-27 23:10:51,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 200 remaining) [2024-01-27 23:10:51,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 200 remaining) [2024-01-27 23:10:51,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 200 remaining) [2024-01-27 23:10:51,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 200 remaining) [2024-01-27 23:10:51,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 200 remaining) [2024-01-27 23:10:51,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 200 remaining) [2024-01-27 23:10:51,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 200 remaining) [2024-01-27 23:10:51,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 200 remaining) [2024-01-27 23:10:51,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 200 remaining) [2024-01-27 23:10:51,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 200 remaining) [2024-01-27 23:10:51,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 200 remaining) [2024-01-27 23:10:51,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 200 remaining) [2024-01-27 23:10:51,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 200 remaining) [2024-01-27 23:10:51,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 200 remaining) [2024-01-27 23:10:51,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 200 remaining) [2024-01-27 23:10:51,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 200 remaining) [2024-01-27 23:10:51,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 200 remaining) [2024-01-27 23:10:51,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 200 remaining) [2024-01-27 23:10:51,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 200 remaining) [2024-01-27 23:10:51,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 200 remaining) [2024-01-27 23:10:51,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 200 remaining) [2024-01-27 23:10:51,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 200 remaining) [2024-01-27 23:10:51,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 200 remaining) [2024-01-27 23:10:51,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 200 remaining) [2024-01-27 23:10:51,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 200 remaining) [2024-01-27 23:10:51,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 200 remaining) [2024-01-27 23:10:51,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 200 remaining) [2024-01-27 23:10:51,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 200 remaining) [2024-01-27 23:10:51,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 200 remaining) [2024-01-27 23:10:51,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 200 remaining) [2024-01-27 23:10:51,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 200 remaining) [2024-01-27 23:10:51,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 200 remaining) [2024-01-27 23:10:51,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 200 remaining) [2024-01-27 23:10:51,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 200 remaining) [2024-01-27 23:10:51,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 200 remaining) [2024-01-27 23:10:51,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 200 remaining) [2024-01-27 23:10:51,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 200 remaining) [2024-01-27 23:10:51,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 200 remaining) [2024-01-27 23:10:51,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 200 remaining) [2024-01-27 23:10:51,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 200 remaining) [2024-01-27 23:10:51,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 200 remaining) [2024-01-27 23:10:51,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 200 remaining) [2024-01-27 23:10:51,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 200 remaining) [2024-01-27 23:10:51,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 200 remaining) [2024-01-27 23:10:51,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 200 remaining) [2024-01-27 23:10:51,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 200 remaining) [2024-01-27 23:10:51,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 200 remaining) [2024-01-27 23:10:51,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 200 remaining) [2024-01-27 23:10:51,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 200 remaining) [2024-01-27 23:10:51,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 200 remaining) [2024-01-27 23:10:51,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 200 remaining) [2024-01-27 23:10:51,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 200 remaining) [2024-01-27 23:10:51,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 200 remaining) [2024-01-27 23:10:51,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 200 remaining) [2024-01-27 23:10:51,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 200 remaining) [2024-01-27 23:10:51,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 200 remaining) [2024-01-27 23:10:51,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 200 remaining) [2024-01-27 23:10:51,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 200 remaining) [2024-01-27 23:10:51,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 200 remaining) [2024-01-27 23:10:51,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 200 remaining) [2024-01-27 23:10:51,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 200 remaining) [2024-01-27 23:10:51,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 200 remaining) [2024-01-27 23:10:51,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 200 remaining) [2024-01-27 23:10:51,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 200 remaining) [2024-01-27 23:10:51,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONERROR_FUNCTION (40 of 200 remaining) [2024-01-27 23:10:51,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 200 remaining) [2024-01-27 23:10:51,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 200 remaining) [2024-01-27 23:10:51,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 200 remaining) [2024-01-27 23:10:51,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 200 remaining) [2024-01-27 23:10:51,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 200 remaining) [2024-01-27 23:10:51,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 200 remaining) [2024-01-27 23:10:51,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 200 remaining) [2024-01-27 23:10:51,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 200 remaining) [2024-01-27 23:10:51,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 200 remaining) [2024-01-27 23:10:51,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 200 remaining) [2024-01-27 23:10:51,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 200 remaining) [2024-01-27 23:10:51,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 200 remaining) [2024-01-27 23:10:51,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 200 remaining) [2024-01-27 23:10:51,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 200 remaining) [2024-01-27 23:10:51,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 200 remaining) [2024-01-27 23:10:51,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 200 remaining) [2024-01-27 23:10:51,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 200 remaining) [2024-01-27 23:10:51,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 200 remaining) [2024-01-27 23:10:51,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 200 remaining) [2024-01-27 23:10:51,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 200 remaining) [2024-01-27 23:10:51,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 200 remaining) [2024-01-27 23:10:51,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 200 remaining) [2024-01-27 23:10:51,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 200 remaining) [2024-01-27 23:10:51,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 200 remaining) [2024-01-27 23:10:51,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 200 remaining) [2024-01-27 23:10:51,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 200 remaining) [2024-01-27 23:10:51,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 200 remaining) [2024-01-27 23:10:51,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 200 remaining) [2024-01-27 23:10:51,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 200 remaining) [2024-01-27 23:10:51,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 200 remaining) [2024-01-27 23:10:51,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 200 remaining) [2024-01-27 23:10:51,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 200 remaining) [2024-01-27 23:10:51,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 200 remaining) [2024-01-27 23:10:51,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 200 remaining) [2024-01-27 23:10:51,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 200 remaining) [2024-01-27 23:10:51,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 200 remaining) [2024-01-27 23:10:51,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 200 remaining) [2024-01-27 23:10:51,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 200 remaining) [2024-01-27 23:10:51,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 200 remaining) [2024-01-27 23:10:51,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 200 remaining) [2024-01-27 23:10:51,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-27 23:10:51,113 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:10:51,120 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 23:10:51,121 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 23:10:51,208 INFO L503 ceAbstractionStarter]: Automizer considered 159 witness invariants [2024-01-27 23:10:51,208 INFO L504 ceAbstractionStarter]: WitnessConsidered=159 [2024-01-27 23:10:51,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:10:51 BasicIcfg [2024-01-27 23:10:51,209 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 23:10:51,209 INFO L158 Benchmark]: Toolchain (without parser) took 8795.98ms. Allocated memory was 161.5MB in the beginning and 423.6MB in the end (delta: 262.1MB). Free memory was 102.2MB in the beginning and 348.3MB in the end (delta: -246.1MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-01-27 23:10:51,209 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 161.5MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:10:51,210 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 161.5MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:10:51,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.93ms. Allocated memory is still 161.5MB. Free memory was 102.2MB in the beginning and 76.3MB in the end (delta: 25.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-01-27 23:10:51,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.10ms. Allocated memory is still 161.5MB. Free memory was 76.3MB in the beginning and 72.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 23:10:51,210 INFO L158 Benchmark]: Boogie Preprocessor took 82.40ms. Allocated memory is still 161.5MB. Free memory was 72.9MB in the beginning and 69.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 23:10:51,211 INFO L158 Benchmark]: RCFGBuilder took 1280.73ms. Allocated memory was 161.5MB in the beginning and 260.0MB in the end (delta: 98.6MB). Free memory was 69.4MB in the beginning and 223.5MB in the end (delta: -154.2MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2024-01-27 23:10:51,211 INFO L158 Benchmark]: TraceAbstraction took 6938.02ms. Allocated memory was 260.0MB in the beginning and 423.6MB in the end (delta: 163.6MB). Free memory was 222.6MB in the beginning and 348.3MB in the end (delta: -125.7MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2024-01-27 23:10:51,212 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.18ms. Allocated memory is still 161.5MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.18ms. Allocated memory is still 161.5MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.93ms. Allocated memory is still 161.5MB. Free memory was 102.2MB in the beginning and 76.3MB in the end (delta: 25.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.10ms. Allocated memory is still 161.5MB. Free memory was 76.3MB in the beginning and 72.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.40ms. Allocated memory is still 161.5MB. Free memory was 72.9MB in the beginning and 69.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1280.73ms. Allocated memory was 161.5MB in the beginning and 260.0MB in the end (delta: 98.6MB). Free memory was 69.4MB in the beginning and 223.5MB in the end (delta: -154.2MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6938.02ms. Allocated memory was 260.0MB in the beginning and 423.6MB in the end (delta: 163.6MB). Free memory was 222.6MB in the beginning and 348.3MB in the end (delta: -125.7MB). Peak memory consumption was 38.9MB. 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[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[n1],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] [L85] N = __VERIFIER_nondet_int() [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] 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}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] 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}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]]] 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}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]]] 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}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] 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}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]] 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}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] 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}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] 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}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] 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}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n1],IntegerLiteral[0]]]] [L86] n1 = __VERIFIER_nondet_int() [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]]] 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}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] 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}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] 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}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] 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}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] 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}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n2],IntegerLiteral[0]]]] 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}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] 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}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] 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}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]] [L87] n2 = __VERIFIER_nondet_int() [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] 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}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] 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}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] 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}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]] 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}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] 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}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] 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}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] 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}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_front],IntegerLiteral[0]]]] [L88] q1_front = __VERIFIER_nondet_int() [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] 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}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] 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}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1_back],IntegerLiteral[0]]]] 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}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] 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}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] 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}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] 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}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],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[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[q2_front],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] [L90] q2_front = __VERIFIER_nondet_int() [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] 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}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2_back],IntegerLiteral[0]]]] 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}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] 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}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] 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}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],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[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] 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[COMPEQ,IdentifierExpression[q1],IntegerLiteral[0]]]] [L92] CALL create_fresh_int_array(n1) [L108] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, 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] [L108] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, 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] [L108] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],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[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, 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] [L109] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, 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] [L109] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],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[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, 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] [L111] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[q2],IntegerLiteral[0]]]] VAL [N=0, \old(size)=17, 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] [L111] CodeAnnotStmt[Assertion[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[COMPEQ,IdentifierExpression[i],IntegerLiteral[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[COMPEQ,IdentifierExpression[j],IntegerLiteral[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[COMPEQ,IdentifierExpression[q2],IntegerLiteral[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[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[COMPEQ,IdentifierExpression[q2],IntegerLiteral[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] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[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] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[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] [L113] CodeAnnotStmt[Assertion[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]]]]]] 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[COMPEQ,IdentifierExpression[i],IntegerLiteral[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] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,UnaryExpression[MINUS,IntegerLiteral[1LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]]] [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[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] 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: 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: 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: 54]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 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: 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: 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: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 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: 85]: 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: 85]: 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: 85]: 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: 85]: 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: 85]: 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: 86]: 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: 86]: 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: 86]: 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: 86]: 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: 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: 87]: 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: 87]: 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: 87]: 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: 87]: 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: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 108]: 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: 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: 109]: 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: 111]: 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: 112]: 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: 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: 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: 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: 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: 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: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 112]: 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: 112]: 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: 112]: 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: 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: 109]: 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: 111]: 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: 112]: 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: 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: 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: 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: 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: 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: 113]: 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: 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: 112]: 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: 112]: 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 378 locations, 200 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: 6.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1038 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 600 mSDsluCounter, 173 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 315 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2130 IncrementalHoareTripleChecker+Invalid, 2445 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 315 mSolverCounterUnsat, 137 mSDtfsCounter, 2130 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=644occurred in iteration=0, InterpolantAutomatonStates: 52, 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.6s InterpolantComputationTime, 463 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 366 ConstructedInterpolants, 0 QuantifiedInterpolants, 804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 23:10:51,244 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