./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-misc-1.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/parallel-misc-1.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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/parallel-misc-1.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/parallel-misc-1.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-a340643-m [2024-01-27 14:51:18,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 14:51:18,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 14:51:18,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 14:51:18,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 14:51:18,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 14:51:18,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 14:51:18,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 14:51:18,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 14:51:18,101 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 14:51:18,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 14:51:18,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 14:51:18,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 14:51:18,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 14:51:18,104 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 14:51:18,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 14:51:18,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 14:51:18,105 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 14:51:18,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 14:51:18,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 14:51:18,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 14:51:18,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 14:51:18,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 14:51:18,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 14:51:18,106 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 14:51:18,107 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 14:51:18,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 14:51:18,107 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 14:51:18,107 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 14:51:18,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 14:51:18,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 14:51:18,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 14:51:18,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:51:18,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 14:51:18,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 14:51:18,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 14:51:18,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 14:51:18,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 14:51:18,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 14:51:18,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 14:51:18,110 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 14:51:18,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 14:51:18,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 14:51:18,111 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 14:51:18,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 14:51:18,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 14:51:18,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 14:51:18,382 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 14:51:18,382 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 14:51:18,383 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/parallel-misc-1.wvr.yml/witness.yml [2024-01-27 14:51:18,511 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 14:51:18,512 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 14:51:18,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2024-01-27 14:51:19,550 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 14:51:19,738 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 14:51:19,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2024-01-27 14:51:19,747 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626f3a18a/fa1ad28b45ea49e1a9445395a3fe118f/FLAGe8425ff72 [2024-01-27 14:51:19,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626f3a18a/fa1ad28b45ea49e1a9445395a3fe118f [2024-01-27 14:51:19,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 14:51:19,762 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 14:51:19,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 14:51:19,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 14:51:19,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 14:51:19,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:51:18" (1/2) ... [2024-01-27 14:51:19,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5768def9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:51:19, skipping insertion in model container [2024-01-27 14:51:19,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:51:18" (1/2) ... [2024-01-27 14:51:19,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6a3906dc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:51:19, skipping insertion in model container [2024-01-27 14:51:19,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:51:19" (2/2) ... [2024-01-27 14:51:19,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5768def9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:19, skipping insertion in model container [2024-01-27 14:51:19,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:51:19" (2/2) ... [2024-01-27 14:51:19,771 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 14:51:19,807 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 14:51:19,808 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] ((((((((((((8 <= i && 9 <= size) && i <= 2147483646) && (-17LL + (long long )i) + (long long )size >= 0LL) && i != 0) && i != 1) || ((8 <= size && (-15LL + (long long )i) + (long long )size >= 0LL) && i == 7)) || ((7 <= size && (-13LL + (long long )i) + (long long )size >= 0LL) && i == 6)) || ((6 <= size && (-11LL + (long long )i) + (long long )size >= 0LL) && i == 5)) || ((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) [2024-01-27 14:51:19,808 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] size != 0 [2024-01-27 14:51:19,808 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] (-1LL - (long long )i) + (long long )size >= 0LL [2024-01-27 14:51:19,808 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] A == 0 [2024-01-27 14:51:19,808 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (unsigned long )_argptr == 0UL [2024-01-27 14:51:19,809 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] (long long )i - (long long )size >= 0LL [2024-01-27 14:51:19,809 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] A == 0 [2024-01-27 14:51:19,809 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] 0 <= i [2024-01-27 14:51:19,809 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-27 14:51:19,809 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] A == 0 [2024-01-27 14:51:19,809 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] A == 0 [2024-01-27 14:51:19,809 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] N == 0 [2024-01-27 14:51:19,810 INFO L98 nessWitnessExtractor]: Loop invariant at [L63-L74] (unsigned long )_argptr == 0UL [2024-01-27 14:51:19,810 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cap1 == 0 [2024-01-27 14:51:19,810 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] A == 0 [2024-01-27 14:51:19,810 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cap2 == 0 [2024-01-27 14:51:19,810 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] i == 0 [2024-01-27 14:51:19,810 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] sum1 == 0 [2024-01-27 14:51:19,810 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] sum2 == 0 [2024-01-27 14:51:19,810 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] j == 0 [2024-01-27 14:51:19,811 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] N == 0 [2024-01-27 14:51:19,811 INFO L98 nessWitnessExtractor]: Location invariant before [L112-L112] A == 0 [2024-01-27 14:51:19,811 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] j == 0 [2024-01-27 14:51:19,811 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] A == 0 [2024-01-27 14:51:19,811 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] N == 0 [2024-01-27 14:51:19,812 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] bag1 == 0 [2024-01-27 14:51:19,812 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cap1 == 0 [2024-01-27 14:51:19,812 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] bag2 == 0 [2024-01-27 14:51:19,812 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] i == 0 [2024-01-27 14:51:19,812 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] A == 0 [2024-01-27 14:51:19,812 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cap2 == 0 [2024-01-27 14:51:19,812 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] j == 0 [2024-01-27 14:51:19,813 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] sum2 == 0 [2024-01-27 14:51:19,813 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] N == 0 [2024-01-27 14:51:19,813 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] sum1 == 0 [2024-01-27 14:51:19,813 INFO L98 nessWitnessExtractor]: Location invariant before [L121-L121] b != 0 [2024-01-27 14:51:19,813 INFO L98 nessWitnessExtractor]: Location invariant before [L121-L121] 1 <= b [2024-01-27 14:51:19,814 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] A == 0 [2024-01-27 14:51:19,815 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] i == 0 [2024-01-27 14:51:19,815 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] N == 0 [2024-01-27 14:51:19,815 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] j == 0 [2024-01-27 14:51:19,815 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L72] (unsigned long )_argptr == 0UL [2024-01-27 14:51:19,815 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] N == 0 [2024-01-27 14:51:19,815 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] sum2 == 0 [2024-01-27 14:51:19,815 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] bag2 == 0 [2024-01-27 14:51:19,815 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] sum1 == 0 [2024-01-27 14:51:19,816 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] j == 0 [2024-01-27 14:51:19,816 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] A == 0 [2024-01-27 14:51:19,816 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cap1 == 0 [2024-01-27 14:51:19,816 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cap2 == 0 [2024-01-27 14:51:19,816 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] i == 0 [2024-01-27 14:51:19,817 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] A == 0 [2024-01-27 14:51:19,817 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (unsigned long )_argptr == 0UL [2024-01-27 14:51:19,817 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] A == 0 [2024-01-27 14:51:19,817 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-27 14:51:19,818 INFO L98 nessWitnessExtractor]: Loop invariant at [L113-L115] A == 0 [2024-01-27 14:51:19,818 INFO L98 nessWitnessExtractor]: Loop invariant at [L113-L115] (((0LL - (long long )i) + (long long )size >= 0LL && size != 0) && ((((((((((8 <= size && 8 <= i) && (-16LL + (long long )i) + (long long )size >= 0LL) && i != 1) || ((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) [2024-01-27 14:51:19,819 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] sum2 == 0 [2024-01-27 14:51:19,819 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] j == 0 [2024-01-27 14:51:19,819 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] A == 0 [2024-01-27 14:51:19,819 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] i == 0 [2024-01-27 14:51:19,819 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] N == 0 [2024-01-27 14:51:19,819 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] sum1 == 0 [2024-01-27 14:51:19,819 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-27 14:51:19,819 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-27 14:51:19,820 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-27 14:51:19,820 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-27 14:51:19,820 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] A == 0 [2024-01-27 14:51:19,820 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-27 14:51:19,820 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] b <= -1 [2024-01-27 14:51:19,820 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] b != 0 [2024-01-27 14:51:19,820 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] A == 0 [2024-01-27 14:51:19,820 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] sum2 == 0 [2024-01-27 14:51:19,821 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] i == 0 [2024-01-27 14:51:19,821 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] N == 0 [2024-01-27 14:51:19,821 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] j == 0 [2024-01-27 14:51:19,821 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-27 14:51:19,821 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-01-27 14:51:19,821 INFO L98 nessWitnessExtractor]: Loop invariant at [L46-L57] (unsigned long )_argptr == 0UL [2024-01-27 14:51:19,821 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] i == 0 [2024-01-27 14:51:19,821 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] j == 0 [2024-01-27 14:51:19,822 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] sum2 == 0 [2024-01-27 14:51:19,822 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] A == 0 [2024-01-27 14:51:19,822 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] N == 0 [2024-01-27 14:51:19,822 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] sum1 == 0 [2024-01-27 14:51:19,822 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cap2 == 0 [2024-01-27 14:51:19,822 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-27 14:51:19,822 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L55] (unsigned long )_argptr == 0UL [2024-01-27 14:51:19,842 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 14:51:20,005 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/parallel-misc-1.wvr.c[2781,2794] [2024-01-27 14:51:20,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:51:20,031 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 14:51:20,040 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 [2024-01-27 14:51:20,119 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/parallel-misc-1.wvr.c[2781,2794] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local 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 14:51:20,147 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:51:20,157 INFO L206 MainTranslator]: Completed translation [2024-01-27 14:51:20,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:20 WrapperNode [2024-01-27 14:51:20,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 14:51:20,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 14:51:20,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 14:51:20,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 14:51:20,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:20" (1/1) ... [2024-01-27 14:51:20,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:20" (1/1) ... [2024-01-27 14:51:20,218 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 408 [2024-01-27 14:51:20,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 14:51:20,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 14:51:20,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 14:51:20,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 14:51:20,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:20" (1/1) ... [2024-01-27 14:51:20,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:20" (1/1) ... [2024-01-27 14:51:20,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:20" (1/1) ... [2024-01-27 14:51:20,289 INFO L175 MemorySlicer]: Split 13 memory accesses to 4 slices as follows [2, 7, 2, 2]. 54 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-27 14:51:20,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:20" (1/1) ... [2024-01-27 14:51:20,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:20" (1/1) ... [2024-01-27 14:51:20,304 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:20" (1/1) ... [2024-01-27 14:51:20,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:20" (1/1) ... [2024-01-27 14:51:20,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:20" (1/1) ... [2024-01-27 14:51:20,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:20" (1/1) ... [2024-01-27 14:51:20,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 14:51:20,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 14:51:20,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 14:51:20,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 14:51:20,317 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:20" (1/1) ... [2024-01-27 14:51:20,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:51:20,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 14:51:20,404 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 14:51:20,424 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 14:51:20,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 14:51:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 14:51:20,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 14:51:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 14:51:20,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 14:51:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 14:51:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 14:51:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 14:51:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 14:51:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 14:51:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 14:51:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 14:51:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 14:51:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 14:51:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 14:51:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 14:51:20,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 14:51:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 14:51:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 14:51:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 14:51:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 14:51:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 14:51:20,454 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 14:51:20,545 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 14:51:20,547 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 14:51:21,161 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 14:51:21,161 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 14:51:21,547 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 14:51:21,547 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-27 14:51:21,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:51:21 BoogieIcfgContainer [2024-01-27 14:51:21,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 14:51:21,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 14:51:21,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 14:51:21,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 14:51:21,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:51:18" (1/4) ... [2024-01-27 14:51:21,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c9db10 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 02:51:21, skipping insertion in model container [2024-01-27 14:51:21,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 02:51:19" (2/4) ... [2024-01-27 14:51:21,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c9db10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:51:21, skipping insertion in model container [2024-01-27 14:51:21,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:20" (3/4) ... [2024-01-27 14:51:21,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c9db10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:51:21, skipping insertion in model container [2024-01-27 14:51:21,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:51:21" (4/4) ... [2024-01-27 14:51:21,557 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2024-01-27 14:51:21,571 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 14:51:21,571 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 120 error locations. [2024-01-27 14:51:21,572 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 14:51:21,643 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 14:51:21,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 263 transitions, 540 flow [2024-01-27 14:51:21,717 INFO L124 PetriNetUnfolderBase]: 5/261 cut-off events. [2024-01-27 14:51:21,717 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 14:51:21,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 261 events. 5/261 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 616 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 200. Up to 2 conditions per place. [2024-01-27 14:51:21,722 INFO L82 GeneralOperation]: Start removeDead. Operand has 265 places, 263 transitions, 540 flow [2024-01-27 14:51:21,732 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 262 places, 260 transitions, 532 flow [2024-01-27 14:51:21,745 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 14:51:21,776 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;@3e3f1427, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 14:51:21,777 INFO L358 AbstractCegarLoop]: Starting to check reachability of 172 error locations. [2024-01-27 14:51:21,779 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 14:51:21,779 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 14:51:21,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:51:21,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:21,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 14:51:21,781 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 14:51:21,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:21,786 INFO L85 PathProgramCache]: Analyzing trace with hash 42637, now seen corresponding path program 1 times [2024-01-27 14:51:21,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:21,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44689507] [2024-01-27 14:51:21,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:21,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:21,943 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 14:51:21,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:21,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44689507] [2024-01-27 14:51:21,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44689507] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:21,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:21,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:21,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555853896] [2024-01-27 14:51:21,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:21,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:21,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:21,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:21,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:21,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 263 [2024-01-27 14:51:21,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 260 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 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 14:51:21,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:21,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 263 [2024-01-27 14:51:21,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:22,781 INFO L124 PetriNetUnfolderBase]: 2108/5996 cut-off events. [2024-01-27 14:51:22,782 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-01-27 14:51:22,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9462 conditions, 5996 events. 2108/5996 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 53216 event pairs, 773 based on Foata normal form. 0/5075 useless extension candidates. Maximal degree in co-relation 9120. Up to 1870 conditions per place. [2024-01-27 14:51:22,821 INFO L140 encePairwiseOnDemand]: 253/263 looper letters, 98 selfloop transitions, 5 changer transitions 0/292 dead transitions. [2024-01-27 14:51:22,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 292 transitions, 805 flow [2024-01-27 14:51:22,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 681 transitions. [2024-01-27 14:51:22,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8631178707224335 [2024-01-27 14:51:22,841 INFO L175 Difference]: Start difference. First operand has 262 places, 260 transitions, 532 flow. Second operand 3 states and 681 transitions. [2024-01-27 14:51:22,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 292 transitions, 805 flow [2024-01-27 14:51:22,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 292 transitions, 795 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 14:51:22,854 INFO L231 Difference]: Finished difference. Result has 256 places, 257 transitions, 537 flow [2024-01-27 14:51:22,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=537, PETRI_PLACES=256, PETRI_TRANSITIONS=257} [2024-01-27 14:51:22,859 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -6 predicate places. [2024-01-27 14:51:22,859 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 257 transitions, 537 flow [2024-01-27 14:51:22,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 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 14:51:22,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:22,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 14:51:22,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 14:51:22,860 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 14:51:22,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:22,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1322941, now seen corresponding path program 1 times [2024-01-27 14:51:22,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:22,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152250029] [2024-01-27 14:51:22,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:22,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:22,923 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 14:51:22,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:22,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152250029] [2024-01-27 14:51:22,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152250029] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:22,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:22,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:22,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958046017] [2024-01-27 14:51:22,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:22,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:22,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:22,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:22,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:22,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 263 [2024-01-27 14:51:22,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 257 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 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 14:51:22,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:22,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 263 [2024-01-27 14:51:22,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:23,550 INFO L124 PetriNetUnfolderBase]: 2108/6131 cut-off events. [2024-01-27 14:51:23,550 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2024-01-27 14:51:23,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9780 conditions, 6131 events. 2108/6131 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 55772 event pairs, 1725 based on Foata normal form. 0/5166 useless extension candidates. Maximal degree in co-relation 4222. Up to 3364 conditions per place. [2024-01-27 14:51:23,584 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 69 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2024-01-27 14:51:23,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 248 transitions, 661 flow [2024-01-27 14:51:23,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2024-01-27 14:51:23,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7984790874524715 [2024-01-27 14:51:23,586 INFO L175 Difference]: Start difference. First operand has 256 places, 257 transitions, 537 flow. Second operand 3 states and 630 transitions. [2024-01-27 14:51:23,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 248 transitions, 661 flow [2024-01-27 14:51:23,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 248 transitions, 656 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:51:23,590 INFO L231 Difference]: Finished difference. Result has 248 places, 248 transitions, 518 flow [2024-01-27 14:51:23,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=248, PETRI_TRANSITIONS=248} [2024-01-27 14:51:23,591 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -14 predicate places. [2024-01-27 14:51:23,591 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 248 transitions, 518 flow [2024-01-27 14:51:23,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 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 14:51:23,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:23,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 14:51:23,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 14:51:23,592 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 14:51:23,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:23,593 INFO L85 PathProgramCache]: Analyzing trace with hash 41012416, now seen corresponding path program 1 times [2024-01-27 14:51:23,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:23,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666279707] [2024-01-27 14:51:23,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:23,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:51:23,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:23,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666279707] [2024-01-27 14:51:23,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666279707] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:23,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:23,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:23,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940988082] [2024-01-27 14:51:23,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:23,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:23,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:23,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:23,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:23,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 263 [2024-01-27 14:51:23,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 248 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 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 14:51:23,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:23,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 263 [2024-01-27 14:51:23,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:24,644 INFO L124 PetriNetUnfolderBase]: 3724/10611 cut-off events. [2024-01-27 14:51:24,645 INFO L125 PetriNetUnfolderBase]: For 292/292 co-relation queries the response was YES. [2024-01-27 14:51:24,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16834 conditions, 10611 events. 3724/10611 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 102413 event pairs, 1437 based on Foata normal form. 1/9012 useless extension candidates. Maximal degree in co-relation 16722. Up to 3135 conditions per place. [2024-01-27 14:51:24,694 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 102 selfloop transitions, 5 changer transitions 0/281 dead transitions. [2024-01-27 14:51:24,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 281 transitions, 807 flow [2024-01-27 14:51:24,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2024-01-27 14:51:24,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8605830164765526 [2024-01-27 14:51:24,696 INFO L175 Difference]: Start difference. First operand has 248 places, 248 transitions, 518 flow. Second operand 3 states and 679 transitions. [2024-01-27 14:51:24,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 281 transitions, 807 flow [2024-01-27 14:51:24,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 281 transitions, 803 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:51:24,700 INFO L231 Difference]: Finished difference. Result has 243 places, 244 transitions, 525 flow [2024-01-27 14:51:24,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=243, PETRI_TRANSITIONS=244} [2024-01-27 14:51:24,701 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -19 predicate places. [2024-01-27 14:51:24,701 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 244 transitions, 525 flow [2024-01-27 14:51:24,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 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 14:51:24,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:24,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 14:51:24,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 14:51:24,702 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 14:51:24,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:24,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1271386181, now seen corresponding path program 1 times [2024-01-27 14:51:24,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:24,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190600762] [2024-01-27 14:51:24,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:24,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:24,722 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 14:51:24,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:24,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190600762] [2024-01-27 14:51:24,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190600762] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:24,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:24,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:24,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924023642] [2024-01-27 14:51:24,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:24,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:24,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:24,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:24,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:24,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 263 [2024-01-27 14:51:24,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 244 transitions, 525 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 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 14:51:24,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:24,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 263 [2024-01-27 14:51:24,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:26,197 INFO L124 PetriNetUnfolderBase]: 5531/15762 cut-off events. [2024-01-27 14:51:26,197 INFO L125 PetriNetUnfolderBase]: For 844/844 co-relation queries the response was YES. [2024-01-27 14:51:26,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25722 conditions, 15762 events. 5531/15762 cut-off events. For 844/844 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 165372 event pairs, 1725 based on Foata normal form. 0/13431 useless extension candidates. Maximal degree in co-relation 14375. Up to 5673 conditions per place. [2024-01-27 14:51:26,254 INFO L140 encePairwiseOnDemand]: 251/263 looper letters, 111 selfloop transitions, 4 changer transitions 0/279 dead transitions. [2024-01-27 14:51:26,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 279 transitions, 841 flow [2024-01-27 14:51:26,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2024-01-27 14:51:26,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8555133079847909 [2024-01-27 14:51:26,257 INFO L175 Difference]: Start difference. First operand has 243 places, 244 transitions, 525 flow. Second operand 3 states and 675 transitions. [2024-01-27 14:51:26,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 279 transitions, 841 flow [2024-01-27 14:51:26,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 279 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:51:26,261 INFO L231 Difference]: Finished difference. Result has 237 places, 237 transitions, 520 flow [2024-01-27 14:51:26,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=237, PETRI_TRANSITIONS=237} [2024-01-27 14:51:26,262 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -25 predicate places. [2024-01-27 14:51:26,262 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 237 transitions, 520 flow [2024-01-27 14:51:26,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 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 14:51:26,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:26,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 14:51:26,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 14:51:26,263 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 14:51:26,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:26,264 INFO L85 PathProgramCache]: Analyzing trace with hash 758267242, now seen corresponding path program 1 times [2024-01-27 14:51:26,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:26,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462703846] [2024-01-27 14:51:26,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:26,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:26,304 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 14:51:26,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:26,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462703846] [2024-01-27 14:51:26,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462703846] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:26,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:26,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:26,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061663121] [2024-01-27 14:51:26,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:26,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:26,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:26,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:26,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:26,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 263 [2024-01-27 14:51:26,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 237 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 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 14:51:26,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:26,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 263 [2024-01-27 14:51:26,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:27,787 INFO L124 PetriNetUnfolderBase]: 5531/15758 cut-off events. [2024-01-27 14:51:27,787 INFO L125 PetriNetUnfolderBase]: For 882/882 co-relation queries the response was YES. [2024-01-27 14:51:27,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25851 conditions, 15758 events. 5531/15758 cut-off events. For 882/882 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 166414 event pairs, 4767 based on Foata normal form. 0/13427 useless extension candidates. Maximal degree in co-relation 14573. Up to 8845 conditions per place. [2024-01-27 14:51:27,852 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 68 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2024-01-27 14:51:27,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 233 transitions, 652 flow [2024-01-27 14:51:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:27,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:27,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2024-01-27 14:51:27,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8212927756653993 [2024-01-27 14:51:27,854 INFO L175 Difference]: Start difference. First operand has 237 places, 237 transitions, 520 flow. Second operand 3 states and 648 transitions. [2024-01-27 14:51:27,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 233 transitions, 652 flow [2024-01-27 14:51:27,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 233 transitions, 648 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:51:27,859 INFO L231 Difference]: Finished difference. Result has 234 places, 233 transitions, 512 flow [2024-01-27 14:51:27,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=234, PETRI_TRANSITIONS=233} [2024-01-27 14:51:27,861 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -28 predicate places. [2024-01-27 14:51:27,861 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 233 transitions, 512 flow [2024-01-27 14:51:27,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 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 14:51:27,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:27,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:27,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 14:51:27,862 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 14:51:27,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:27,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2031449405, now seen corresponding path program 1 times [2024-01-27 14:51:27,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:27,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620707578] [2024-01-27 14:51:27,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:27,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:27,909 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 14:51:27,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:27,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620707578] [2024-01-27 14:51:27,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620707578] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:27,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:27,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:27,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970976034] [2024-01-27 14:51:27,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:27,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:27,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:27,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:27,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:27,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 263 [2024-01-27 14:51:27,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 233 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 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 14:51:27,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:27,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 263 [2024-01-27 14:51:27,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:29,450 INFO L124 PetriNetUnfolderBase]: 5531/15741 cut-off events. [2024-01-27 14:51:29,451 INFO L125 PetriNetUnfolderBase]: For 875/875 co-relation queries the response was YES. [2024-01-27 14:51:29,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25709 conditions, 15741 events. 5531/15741 cut-off events. For 875/875 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 166439 event pairs, 4767 based on Foata normal form. 1/13421 useless extension candidates. Maximal degree in co-relation 25644. Up to 8833 conditions per place. [2024-01-27 14:51:29,533 INFO L140 encePairwiseOnDemand]: 244/263 looper letters, 74 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2024-01-27 14:51:29,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 216 transitions, 630 flow [2024-01-27 14:51:29,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:29,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:29,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 610 transitions. [2024-01-27 14:51:29,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628 [2024-01-27 14:51:29,541 INFO L175 Difference]: Start difference. First operand has 234 places, 233 transitions, 512 flow. Second operand 3 states and 610 transitions. [2024-01-27 14:51:29,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 216 transitions, 630 flow [2024-01-27 14:51:29,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 216 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:51:29,547 INFO L231 Difference]: Finished difference. Result has 217 places, 216 transitions, 478 flow [2024-01-27 14:51:29,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=217, PETRI_TRANSITIONS=216} [2024-01-27 14:51:29,549 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -45 predicate places. [2024-01-27 14:51:29,550 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 216 transitions, 478 flow [2024-01-27 14:51:29,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 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 14:51:29,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:29,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:29,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 14:51:29,551 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 14:51:29,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:29,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1449576677, now seen corresponding path program 1 times [2024-01-27 14:51:29,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:29,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283483828] [2024-01-27 14:51:29,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:29,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:29,594 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 14:51:29,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:29,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283483828] [2024-01-27 14:51:29,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283483828] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:29,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:29,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:29,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766370345] [2024-01-27 14:51:29,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:29,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:29,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:29,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:29,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:29,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 263 [2024-01-27 14:51:29,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 216 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 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 14:51:29,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:29,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 263 [2024-01-27 14:51:29,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:31,442 INFO L124 PetriNetUnfolderBase]: 8307/23781 cut-off events. [2024-01-27 14:51:31,443 INFO L125 PetriNetUnfolderBase]: For 1526/1526 co-relation queries the response was YES. [2024-01-27 14:51:31,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38902 conditions, 23781 events. 8307/23781 cut-off events. For 1526/1526 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 270394 event pairs, 2681 based on Foata normal form. 0/20331 useless extension candidates. Maximal degree in co-relation 38776. Up to 8686 conditions per place. [2024-01-27 14:51:31,567 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 115 selfloop transitions, 4 changer transitions 0/255 dead transitions. [2024-01-27 14:51:31,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 255 transitions, 813 flow [2024-01-27 14:51:31,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2024-01-27 14:51:31,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8605830164765526 [2024-01-27 14:51:31,570 INFO L175 Difference]: Start difference. First operand has 217 places, 216 transitions, 478 flow. Second operand 3 states and 679 transitions. [2024-01-27 14:51:31,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 255 transitions, 813 flow [2024-01-27 14:51:31,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 255 transitions, 809 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:51:31,574 INFO L231 Difference]: Finished difference. Result has 211 places, 210 transitions, 476 flow [2024-01-27 14:51:31,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=211, PETRI_TRANSITIONS=210} [2024-01-27 14:51:31,574 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -51 predicate places. [2024-01-27 14:51:31,575 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 210 transitions, 476 flow [2024-01-27 14:51:31,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 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 14:51:31,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:31,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:31,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 14:51:31,575 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 14:51:31,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:31,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1987202594, now seen corresponding path program 1 times [2024-01-27 14:51:31,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:31,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941491917] [2024-01-27 14:51:31,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:31,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:31,600 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 14:51:31,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:31,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941491917] [2024-01-27 14:51:31,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941491917] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:31,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:31,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:31,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567980754] [2024-01-27 14:51:31,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:31,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:31,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:31,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:31,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:31,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 263 [2024-01-27 14:51:31,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 210 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 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 14:51:31,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:31,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 263 [2024-01-27 14:51:31,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:33,525 INFO L124 PetriNetUnfolderBase]: 8307/23777 cut-off events. [2024-01-27 14:51:33,525 INFO L125 PetriNetUnfolderBase]: For 1585/1585 co-relation queries the response was YES. [2024-01-27 14:51:33,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39496 conditions, 23777 events. 8307/23777 cut-off events. For 1585/1585 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 270158 event pairs, 2413 based on Foata normal form. 0/20364 useless extension candidates. Maximal degree in co-relation 22202. Up to 9142 conditions per place. [2024-01-27 14:51:33,623 INFO L140 encePairwiseOnDemand]: 256/263 looper letters, 107 selfloop transitions, 5 changer transitions 0/251 dead transitions. [2024-01-27 14:51:33,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 251 transitions, 801 flow [2024-01-27 14:51:33,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 696 transitions. [2024-01-27 14:51:33,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8821292775665399 [2024-01-27 14:51:33,626 INFO L175 Difference]: Start difference. First operand has 211 places, 210 transitions, 476 flow. Second operand 3 states and 696 transitions. [2024-01-27 14:51:33,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 251 transitions, 801 flow [2024-01-27 14:51:33,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 251 transitions, 796 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:51:33,630 INFO L231 Difference]: Finished difference. Result has 211 places, 210 transitions, 491 flow [2024-01-27 14:51:33,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=491, PETRI_PLACES=211, PETRI_TRANSITIONS=210} [2024-01-27 14:51:33,631 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -51 predicate places. [2024-01-27 14:51:33,631 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 210 transitions, 491 flow [2024-01-27 14:51:33,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 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 14:51:33,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:33,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:33,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 14:51:33,632 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 14:51:33,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:33,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1473736885, now seen corresponding path program 1 times [2024-01-27 14:51:33,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:33,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817908411] [2024-01-27 14:51:33,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:33,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:33,650 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 14:51:33,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:33,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817908411] [2024-01-27 14:51:33,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817908411] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:33,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:33,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:33,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22805768] [2024-01-27 14:51:33,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:33,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:33,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:33,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:33,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:33,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 263 [2024-01-27 14:51:33,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 210 transitions, 491 flow. Second operand has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 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 14:51:33,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:33,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 263 [2024-01-27 14:51:33,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:35,608 INFO L124 PetriNetUnfolderBase]: 8307/23840 cut-off events. [2024-01-27 14:51:35,608 INFO L125 PetriNetUnfolderBase]: For 2027/2027 co-relation queries the response was YES. [2024-01-27 14:51:35,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40077 conditions, 23840 events. 8307/23840 cut-off events. For 2027/2027 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 272796 event pairs, 7396 based on Foata normal form. 0/20385 useless extension candidates. Maximal degree in co-relation 22458. Up to 13425 conditions per place. [2024-01-27 14:51:35,725 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 69 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2024-01-27 14:51:35,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 207 transitions, 627 flow [2024-01-27 14:51:35,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions. [2024-01-27 14:51:35,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8288973384030418 [2024-01-27 14:51:35,733 INFO L175 Difference]: Start difference. First operand has 211 places, 210 transitions, 491 flow. Second operand 3 states and 654 transitions. [2024-01-27 14:51:35,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 207 transitions, 627 flow [2024-01-27 14:51:35,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 207 transitions, 622 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:51:35,752 INFO L231 Difference]: Finished difference. Result has 209 places, 207 transitions, 484 flow [2024-01-27 14:51:35,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=209, PETRI_TRANSITIONS=207} [2024-01-27 14:51:35,753 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -53 predicate places. [2024-01-27 14:51:35,754 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 207 transitions, 484 flow [2024-01-27 14:51:35,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 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 14:51:35,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:35,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:35,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 14:51:35,755 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 14:51:35,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:35,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1558798196, now seen corresponding path program 1 times [2024-01-27 14:51:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:35,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208716241] [2024-01-27 14:51:35,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:35,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:35,783 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 14:51:35,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:35,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208716241] [2024-01-27 14:51:35,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208716241] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:35,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:35,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:35,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301322920] [2024-01-27 14:51:35,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:35,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:35,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:35,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:35,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:35,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 263 [2024-01-27 14:51:35,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 207 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 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 14:51:35,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:35,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 263 [2024-01-27 14:51:35,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:37,655 INFO L124 PetriNetUnfolderBase]: 8307/23621 cut-off events. [2024-01-27 14:51:37,656 INFO L125 PetriNetUnfolderBase]: For 1992/1992 co-relation queries the response was YES. [2024-01-27 14:51:37,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39653 conditions, 23621 events. 8307/23621 cut-off events. For 1992/1992 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 267310 event pairs, 2349 based on Foata normal form. 0/20254 useless extension candidates. Maximal degree in co-relation 39605. Up to 9205 conditions per place. [2024-01-27 14:51:37,763 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 111 selfloop transitions, 5 changer transitions 0/253 dead transitions. [2024-01-27 14:51:37,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 253 transitions, 835 flow [2024-01-27 14:51:37,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2024-01-27 14:51:37,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8922686945500634 [2024-01-27 14:51:37,765 INFO L175 Difference]: Start difference. First operand has 209 places, 207 transitions, 484 flow. Second operand 3 states and 704 transitions. [2024-01-27 14:51:37,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 253 transitions, 835 flow [2024-01-27 14:51:37,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 253 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:51:37,770 INFO L231 Difference]: Finished difference. Result has 209 places, 208 transitions, 501 flow [2024-01-27 14:51:37,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=209, PETRI_TRANSITIONS=208} [2024-01-27 14:51:37,771 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -53 predicate places. [2024-01-27 14:51:37,771 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 208 transitions, 501 flow [2024-01-27 14:51:37,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 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 14:51:37,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:37,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:51:37,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 14:51:37,772 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 14:51:37,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:37,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1942248267, now seen corresponding path program 1 times [2024-01-27 14:51:37,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:37,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192521488] [2024-01-27 14:51:37,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:37,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:37,808 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 14:51:37,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192521488] [2024-01-27 14:51:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192521488] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:37,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:37,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 14:51:37,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767593876] [2024-01-27 14:51:37,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:37,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:37,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:37,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:37,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:37,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 263 [2024-01-27 14:51:37,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 208 transitions, 501 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 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 14:51:37,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:37,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 263 [2024-01-27 14:51:37,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:39,935 INFO L124 PetriNetUnfolderBase]: 8308/23777 cut-off events. [2024-01-27 14:51:39,936 INFO L125 PetriNetUnfolderBase]: For 2425/2425 co-relation queries the response was YES. [2024-01-27 14:51:39,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40515 conditions, 23777 events. 8308/23777 cut-off events. For 2425/2425 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 271701 event pairs, 7296 based on Foata normal form. 1/20355 useless extension candidates. Maximal degree in co-relation 22726. Up to 13430 conditions per place. [2024-01-27 14:51:40,049 INFO L140 encePairwiseOnDemand]: 259/263 looper letters, 71 selfloop transitions, 3 changer transitions 0/209 dead transitions. [2024-01-27 14:51:40,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 209 transitions, 651 flow [2024-01-27 14:51:40,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2024-01-27 14:51:40,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8390367553865653 [2024-01-27 14:51:40,051 INFO L175 Difference]: Start difference. First operand has 209 places, 208 transitions, 501 flow. Second operand 3 states and 662 transitions. [2024-01-27 14:51:40,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 209 transitions, 651 flow [2024-01-27 14:51:40,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 209 transitions, 646 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:51:40,055 INFO L231 Difference]: Finished difference. Result has 210 places, 209 transitions, 511 flow [2024-01-27 14:51:40,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=511, PETRI_PLACES=210, PETRI_TRANSITIONS=209} [2024-01-27 14:51:40,056 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -52 predicate places. [2024-01-27 14:51:40,056 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 209 transitions, 511 flow [2024-01-27 14:51:40,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 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 14:51:40,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:40,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:40,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 14:51:40,057 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 14:51:40,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1810148343, now seen corresponding path program 1 times [2024-01-27 14:51:40,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:40,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139090955] [2024-01-27 14:51:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:40,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:51:40,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 14:51:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:51:40,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 14:51:40,101 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 14:51:40,102 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 172 remaining) [2024-01-27 14:51:40,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 172 remaining) [2024-01-27 14:51:40,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 172 remaining) [2024-01-27 14:51:40,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 172 remaining) [2024-01-27 14:51:40,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 172 remaining) [2024-01-27 14:51:40,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 172 remaining) [2024-01-27 14:51:40,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 172 remaining) [2024-01-27 14:51:40,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 172 remaining) [2024-01-27 14:51:40,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 172 remaining) [2024-01-27 14:51:40,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 172 remaining) [2024-01-27 14:51:40,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 172 remaining) [2024-01-27 14:51:40,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 172 remaining) [2024-01-27 14:51:40,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 172 remaining) [2024-01-27 14:51:40,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 172 remaining) [2024-01-27 14:51:40,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 172 remaining) [2024-01-27 14:51:40,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 172 remaining) [2024-01-27 14:51:40,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 172 remaining) [2024-01-27 14:51:40,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 172 remaining) [2024-01-27 14:51:40,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 172 remaining) [2024-01-27 14:51:40,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 172 remaining) [2024-01-27 14:51:40,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 172 remaining) [2024-01-27 14:51:40,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 172 remaining) [2024-01-27 14:51:40,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 172 remaining) [2024-01-27 14:51:40,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 172 remaining) [2024-01-27 14:51:40,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 172 remaining) [2024-01-27 14:51:40,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 172 remaining) [2024-01-27 14:51:40,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 172 remaining) [2024-01-27 14:51:40,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 172 remaining) [2024-01-27 14:51:40,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 172 remaining) [2024-01-27 14:51:40,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 172 remaining) [2024-01-27 14:51:40,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 172 remaining) [2024-01-27 14:51:40,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 172 remaining) [2024-01-27 14:51:40,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 172 remaining) [2024-01-27 14:51:40,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 172 remaining) [2024-01-27 14:51:40,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 172 remaining) [2024-01-27 14:51:40,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 172 remaining) [2024-01-27 14:51:40,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 172 remaining) [2024-01-27 14:51:40,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 172 remaining) [2024-01-27 14:51:40,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 172 remaining) [2024-01-27 14:51:40,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 172 remaining) [2024-01-27 14:51:40,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 172 remaining) [2024-01-27 14:51:40,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 172 remaining) [2024-01-27 14:51:40,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 172 remaining) [2024-01-27 14:51:40,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 172 remaining) [2024-01-27 14:51:40,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 172 remaining) [2024-01-27 14:51:40,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 172 remaining) [2024-01-27 14:51:40,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 172 remaining) [2024-01-27 14:51:40,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 172 remaining) [2024-01-27 14:51:40,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 172 remaining) [2024-01-27 14:51:40,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 172 remaining) [2024-01-27 14:51:40,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 172 remaining) [2024-01-27 14:51:40,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 172 remaining) [2024-01-27 14:51:40,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 172 remaining) [2024-01-27 14:51:40,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 172 remaining) [2024-01-27 14:51:40,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 172 remaining) [2024-01-27 14:51:40,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 172 remaining) [2024-01-27 14:51:40,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 172 remaining) [2024-01-27 14:51:40,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 172 remaining) [2024-01-27 14:51:40,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 172 remaining) [2024-01-27 14:51:40,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 172 remaining) [2024-01-27 14:51:40,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 172 remaining) [2024-01-27 14:51:40,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 172 remaining) [2024-01-27 14:51:40,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 172 remaining) [2024-01-27 14:51:40,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 172 remaining) [2024-01-27 14:51:40,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 172 remaining) [2024-01-27 14:51:40,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 172 remaining) [2024-01-27 14:51:40,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 172 remaining) [2024-01-27 14:51:40,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 172 remaining) [2024-01-27 14:51:40,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 172 remaining) [2024-01-27 14:51:40,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 172 remaining) [2024-01-27 14:51:40,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 172 remaining) [2024-01-27 14:51:40,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 172 remaining) [2024-01-27 14:51:40,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 172 remaining) [2024-01-27 14:51:40,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 172 remaining) [2024-01-27 14:51:40,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 172 remaining) [2024-01-27 14:51:40,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 172 remaining) [2024-01-27 14:51:40,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 172 remaining) [2024-01-27 14:51:40,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 172 remaining) [2024-01-27 14:51:40,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 172 remaining) [2024-01-27 14:51:40,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 172 remaining) [2024-01-27 14:51:40,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 172 remaining) [2024-01-27 14:51:40,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 172 remaining) [2024-01-27 14:51:40,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 172 remaining) [2024-01-27 14:51:40,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 172 remaining) [2024-01-27 14:51:40,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 172 remaining) [2024-01-27 14:51:40,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 172 remaining) [2024-01-27 14:51:40,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 172 remaining) [2024-01-27 14:51:40,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 172 remaining) [2024-01-27 14:51:40,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 172 remaining) [2024-01-27 14:51:40,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 172 remaining) [2024-01-27 14:51:40,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 172 remaining) [2024-01-27 14:51:40,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 172 remaining) [2024-01-27 14:51:40,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 172 remaining) [2024-01-27 14:51:40,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 172 remaining) [2024-01-27 14:51:40,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 172 remaining) [2024-01-27 14:51:40,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 172 remaining) [2024-01-27 14:51:40,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 172 remaining) [2024-01-27 14:51:40,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 172 remaining) [2024-01-27 14:51:40,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 172 remaining) [2024-01-27 14:51:40,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 172 remaining) [2024-01-27 14:51:40,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 172 remaining) [2024-01-27 14:51:40,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 172 remaining) [2024-01-27 14:51:40,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 172 remaining) [2024-01-27 14:51:40,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 172 remaining) [2024-01-27 14:51:40,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 172 remaining) [2024-01-27 14:51:40,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 172 remaining) [2024-01-27 14:51:40,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 172 remaining) [2024-01-27 14:51:40,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 172 remaining) [2024-01-27 14:51:40,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 172 remaining) [2024-01-27 14:51:40,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 172 remaining) [2024-01-27 14:51:40,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 172 remaining) [2024-01-27 14:51:40,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 172 remaining) [2024-01-27 14:51:40,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 172 remaining) [2024-01-27 14:51:40,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 172 remaining) [2024-01-27 14:51:40,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 172 remaining) [2024-01-27 14:51:40,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 172 remaining) [2024-01-27 14:51:40,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 172 remaining) [2024-01-27 14:51:40,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 172 remaining) [2024-01-27 14:51:40,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 172 remaining) [2024-01-27 14:51:40,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION (52 of 172 remaining) [2024-01-27 14:51:40,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 172 remaining) [2024-01-27 14:51:40,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 172 remaining) [2024-01-27 14:51:40,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 172 remaining) [2024-01-27 14:51:40,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 172 remaining) [2024-01-27 14:51:40,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 172 remaining) [2024-01-27 14:51:40,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 172 remaining) [2024-01-27 14:51:40,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 172 remaining) [2024-01-27 14:51:40,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 172 remaining) [2024-01-27 14:51:40,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 172 remaining) [2024-01-27 14:51:40,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 172 remaining) [2024-01-27 14:51:40,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 172 remaining) [2024-01-27 14:51:40,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 172 remaining) [2024-01-27 14:51:40,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 172 remaining) [2024-01-27 14:51:40,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 172 remaining) [2024-01-27 14:51:40,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 172 remaining) [2024-01-27 14:51:40,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 172 remaining) [2024-01-27 14:51:40,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 172 remaining) [2024-01-27 14:51:40,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 172 remaining) [2024-01-27 14:51:40,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 172 remaining) [2024-01-27 14:51:40,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 172 remaining) [2024-01-27 14:51:40,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 172 remaining) [2024-01-27 14:51:40,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 172 remaining) [2024-01-27 14:51:40,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 172 remaining) [2024-01-27 14:51:40,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 172 remaining) [2024-01-27 14:51:40,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 172 remaining) [2024-01-27 14:51:40,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 172 remaining) [2024-01-27 14:51:40,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 172 remaining) [2024-01-27 14:51:40,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 172 remaining) [2024-01-27 14:51:40,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 172 remaining) [2024-01-27 14:51:40,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 172 remaining) [2024-01-27 14:51:40,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 172 remaining) [2024-01-27 14:51:40,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 172 remaining) [2024-01-27 14:51:40,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 172 remaining) [2024-01-27 14:51:40,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 172 remaining) [2024-01-27 14:51:40,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 172 remaining) [2024-01-27 14:51:40,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 172 remaining) [2024-01-27 14:51:40,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 172 remaining) [2024-01-27 14:51:40,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 172 remaining) [2024-01-27 14:51:40,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 172 remaining) [2024-01-27 14:51:40,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 172 remaining) [2024-01-27 14:51:40,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 172 remaining) [2024-01-27 14:51:40,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 172 remaining) [2024-01-27 14:51:40,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 172 remaining) [2024-01-27 14:51:40,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 172 remaining) [2024-01-27 14:51:40,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 172 remaining) [2024-01-27 14:51:40,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 172 remaining) [2024-01-27 14:51:40,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 172 remaining) [2024-01-27 14:51:40,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 172 remaining) [2024-01-27 14:51:40,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 172 remaining) [2024-01-27 14:51:40,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 172 remaining) [2024-01-27 14:51:40,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 172 remaining) [2024-01-27 14:51:40,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 172 remaining) [2024-01-27 14:51:40,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 14:51:40,124 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:40,132 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 14:51:40,132 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 14:51:40,176 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-27 14:51:40,188 INFO L503 ceAbstractionStarter]: Automizer considered 119 witness invariants [2024-01-27 14:51:40,188 INFO L504 ceAbstractionStarter]: WitnessConsidered=119 [2024-01-27 14:51:40,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 02:51:40 BasicIcfg [2024-01-27 14:51:40,188 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 14:51:40,189 INFO L158 Benchmark]: Toolchain (without parser) took 20427.11ms. Allocated memory was 172.0MB in the beginning and 11.0GB in the end (delta: 10.9GB). Free memory was 92.0MB in the beginning and 9.5GB in the end (delta: -9.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-01-27 14:51:40,189 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:51:40,189 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 172.0MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:51:40,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.54ms. Allocated memory is still 172.0MB. Free memory was 91.6MB in the beginning and 69.3MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-01-27 14:51:40,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.64ms. Allocated memory is still 172.0MB. Free memory was 69.3MB in the beginning and 66.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 14:51:40,189 INFO L158 Benchmark]: Boogie Preprocessor took 94.17ms. Allocated memory is still 172.0MB. Free memory was 66.0MB in the beginning and 140.2MB in the end (delta: -74.2MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-01-27 14:51:40,190 INFO L158 Benchmark]: RCFGBuilder took 1233.04ms. Allocated memory is still 172.0MB. Free memory was 140.2MB in the beginning and 102.2MB in the end (delta: 38.0MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. [2024-01-27 14:51:40,190 INFO L158 Benchmark]: TraceAbstraction took 18637.45ms. Allocated memory was 172.0MB in the beginning and 11.0GB in the end (delta: 10.9GB). Free memory was 102.2MB in the beginning and 9.5GB in the end (delta: -9.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-01-27 14:51:40,191 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 172.0MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.54ms. Allocated memory is still 172.0MB. Free memory was 91.6MB in the beginning and 69.3MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.64ms. Allocated memory is still 172.0MB. Free memory was 69.3MB in the beginning and 66.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.17ms. Allocated memory is still 172.0MB. Free memory was 66.0MB in the beginning and 140.2MB in the end (delta: -74.2MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1233.04ms. Allocated memory is still 172.0MB. Free memory was 140.2MB in the beginning and 102.2MB in the end (delta: 38.0MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18637.45ms. Allocated memory was 172.0MB in the beginning and 11.0GB in the end (delta: 10.9GB). Free memory was 102.2MB in the beginning and 9.5GB in the end (delta: -9.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 116]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L39] int* A; [L40] int bag1, bag2, cap1, cap2, sum1, sum2, i, j, N; [L80] pthread_t t1, t2; VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[bag2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cap1],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[bag1],IntegerLiteral[0]]]] [L83] bag1 = __VERIFIER_nondet_int() [L84] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cap1],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[bag2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] [L84] bag2 = __VERIFIER_nondet_int() [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cap1],IntegerLiteral[0]]]] [L85] cap1 = __VERIFIER_nondet_int() [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] [L86] cap2 = __VERIFIER_nondet_int() [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]]] [L87] sum1 = __VERIFIER_nondet_int() [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L88] sum2 = __VERIFIER_nondet_int() [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L89] i = __VERIFIER_nondet_int() [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L90] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] [L90] j = __VERIFIER_nondet_int() [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L91] N = __VERIFIER_nondet_int() [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L92] CALL create_fresh_int_array(N) [L109] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L109] CALL assume_abort_if_not(size >= 0) [L36] COND FALSE !(!cond) [L109] RET assume_abort_if_not(size >= 0) [L110] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L110] CALL assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE !(!cond) [L110] RET assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L112] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L112] int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L113] int i = 0; VAL [A={0:0}, N=0, \old(size)=0, arr={-1:0}, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, i=0, j=0, size=0, sum1=0, sum2=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=0, arr={-1:0}, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, i=0, j=0, size=0, sum1=0, sum2=0] [L113] CodeAnnotStmt[Assertion[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[LOGICOR,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[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]],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]]]]]] VAL [A={0:0}, N=0, \old(size)=0, arr={-1:0}, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, i=0, j=0, size=0, sum1=0, sum2=0] [L113] COND FALSE !(i < size) [L116] CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]]]] VAL [A={0:0}, N=0, \old(size)=0, arr={-1:0}, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, j=0, size=0, sum1=0, sum2=0] - UnprovableResult [Line: 46]: 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: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 48]: 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: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: 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: 53]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: 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: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: 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: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 120]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 121]: 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: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: 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: 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: 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: 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: 109]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 110]: 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: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 103]: 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: 98]: 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, 369 locations, 172 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: 18.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 508 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1359 IncrementalHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 22 mSDtfsCounter, 1359 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=537occurred in iteration=1, InterpolantAutomatonStates: 33, 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.3s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 14:51:40,279 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