./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 27552612 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-2755261-m [2024-01-26 15:20:55,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 15:20:55,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-26 15:20:55,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 15:20:55,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 15:20:55,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 15:20:55,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 15:20:55,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 15:20:55,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-26 15:20:55,164 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-26 15:20:55,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 15:20:55,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 15:20:55,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 15:20:55,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 15:20:55,167 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 15:20:55,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 15:20:55,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 15:20:55,168 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 15:20:55,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 15:20:55,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 15:20:55,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 15:20:55,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 15:20:55,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 15:20:55,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 15:20:55,169 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-26 15:20:55,169 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 15:20:55,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 15:20:55,170 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 15:20:55,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 15:20:55,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 15:20:55,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-26 15:20:55,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 15:20:55,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-26 15:20:55,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 15:20:55,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 15:20:55,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-26 15:20:55,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 15:20:55,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 15:20:55,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 15:20:55,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-26 15:20:55,173 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 15:20:55,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-26 15:20:55,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-26 15:20:55,174 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-26 15:20:55,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 15:20:55,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 15:20:55,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 15:20:55,429 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-26 15:20:55,430 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-26 15:20:55,431 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-26 15:20:55,565 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 15:20:55,565 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 15:20:55,567 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-26 15:20:56,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 15:20:56,718 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 15:20:56,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2024-01-26 15:20:56,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8e4ac7a/957abb670b014807baf4ac4cc0f3dbb0/FLAGd5f1f5d6b [2024-01-26 15:20:57,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8e4ac7a/957abb670b014807baf4ac4cc0f3dbb0 [2024-01-26 15:20:57,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 15:20:57,114 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 15:20:57,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 15:20:57,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 15:20:57,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 15:20:57,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 26.01 03:20:55" (1/2) ... [2024-01-26 15:20:57,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dae20b1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 26.01 03:20:57, skipping insertion in model container [2024-01-26 15:20:57,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 26.01 03:20:55" (1/2) ... [2024-01-26 15:20:57,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1c849356 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 26.01 03:20:57, skipping insertion in model container [2024-01-26 15:20:57,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 03:20:57" (2/2) ... [2024-01-26 15:20:57,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dae20b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:57, skipping insertion in model container [2024-01-26 15:20:57,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 03:20:57" (2/2) ... [2024-01-26 15:20:57,125 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-26 15:20:57,160 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-26 15:20:57,161 INFO L98 nessWitnessExtractor]: Location invariant before [L112-L112] A == 0 [2024-01-26 15:20:57,161 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] A == 0 [2024-01-26 15:20:57,161 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-26 15:20:57,161 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] A == 0 [2024-01-26 15:20:57,162 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] (-1LL - (long long )i) + (long long )size >= 0LL [2024-01-26 15:20:57,162 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] size != 0 [2024-01-26 15:20:57,162 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-26 15:20:57,162 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] A == 0 [2024-01-26 15:20:57,162 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] (long long )i - (long long )size >= 0LL [2024-01-26 15:20:57,162 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] 0 <= i [2024-01-26 15:20:57,162 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] A == 0 [2024-01-26 15:20:57,163 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-26 15:20:57,163 INFO L98 nessWitnessExtractor]: Loop invariant at [L46-L57] (unsigned long )_argptr == 0UL [2024-01-26 15:20:57,163 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-26 15:20:57,163 INFO L98 nessWitnessExtractor]: Loop invariant at [L113-L115] A == 0 [2024-01-26 15:20:57,163 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L72] (unsigned long )_argptr == 0UL [2024-01-26 15:20:57,163 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] N == 0 [2024-01-26 15:20:57,163 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] bag2 == 0 [2024-01-26 15:20:57,163 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] A == 0 [2024-01-26 15:20:57,164 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] j == 0 [2024-01-26 15:20:57,164 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] sum2 == 0 [2024-01-26 15:20:57,164 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] sum1 == 0 [2024-01-26 15:20:57,165 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cap1 == 0 [2024-01-26 15:20:57,165 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cap2 == 0 [2024-01-26 15:20:57,165 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] i == 0 [2024-01-26 15:20:57,165 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-26 15:20:57,165 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-26 15:20:57,165 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] A == 0 [2024-01-26 15:20:57,165 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] i == 0 [2024-01-26 15:20:57,165 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] sum2 == 0 [2024-01-26 15:20:57,166 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] j == 0 [2024-01-26 15:20:57,166 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] N == 0 [2024-01-26 15:20:57,166 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] A == 0 [2024-01-26 15:20:57,166 INFO L98 nessWitnessExtractor]: Location invariant before [L121-L121] 1 <= b [2024-01-26 15:20:57,166 INFO L98 nessWitnessExtractor]: Location invariant before [L121-L121] b != 0 [2024-01-26 15:20:57,166 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (unsigned long )_argptr == 0UL [2024-01-26 15:20:57,166 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] A == 0 [2024-01-26 15:20:57,167 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] sum1 == 0 [2024-01-26 15:20:57,167 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] j == 0 [2024-01-26 15:20:57,167 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] bag1 == 0 [2024-01-26 15:20:57,167 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] sum2 == 0 [2024-01-26 15:20:57,167 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cap2 == 0 [2024-01-26 15:20:57,167 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] i == 0 [2024-01-26 15:20:57,167 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] N == 0 [2024-01-26 15:20:57,168 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cap1 == 0 [2024-01-26 15:20:57,168 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] bag2 == 0 [2024-01-26 15:20:57,168 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-01-26 15:20:57,168 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] N == 0 [2024-01-26 15:20:57,168 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] j == 0 [2024-01-26 15:20:57,169 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] i == 0 [2024-01-26 15:20:57,169 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] A == 0 [2024-01-26 15:20:57,169 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-26 15:20:57,169 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] j == 0 [2024-01-26 15:20:57,169 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] A == 0 [2024-01-26 15:20:57,170 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] N == 0 [2024-01-26 15:20:57,170 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-26 15:20:57,170 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-26 15:20:57,171 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] sum1 == 0 [2024-01-26 15:20:57,171 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] j == 0 [2024-01-26 15:20:57,171 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cap2 == 0 [2024-01-26 15:20:57,171 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] N == 0 [2024-01-26 15:20:57,171 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] A == 0 [2024-01-26 15:20:57,172 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] sum2 == 0 [2024-01-26 15:20:57,172 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] i == 0 [2024-01-26 15:20:57,172 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] N == 0 [2024-01-26 15:20:57,172 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] A == 0 [2024-01-26 15:20:57,172 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] b <= -1 [2024-01-26 15:20:57,172 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] b != 0 [2024-01-26 15:20:57,172 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-26 15:20:57,172 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (unsigned long )_argptr == 0UL [2024-01-26 15:20:57,173 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-26 15:20:57,173 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] A == 0 [2024-01-26 15:20:57,173 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] A == 0 [2024-01-26 15:20:57,173 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] N == 0 [2024-01-26 15:20:57,173 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] sum2 == 0 [2024-01-26 15:20:57,174 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] i == 0 [2024-01-26 15:20:57,176 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] sum1 == 0 [2024-01-26 15:20:57,177 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] j == 0 [2024-01-26 15:20:57,177 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L55] (unsigned long )_argptr == 0UL [2024-01-26 15:20:57,177 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] j == 0 [2024-01-26 15:20:57,177 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] A == 0 [2024-01-26 15:20:57,177 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cap1 == 0 [2024-01-26 15:20:57,177 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cap2 == 0 [2024-01-26 15:20:57,177 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] i == 0 [2024-01-26 15:20:57,178 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] N == 0 [2024-01-26 15:20:57,178 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] sum1 == 0 [2024-01-26 15:20:57,178 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] sum2 == 0 [2024-01-26 15:20:57,178 INFO L98 nessWitnessExtractor]: Loop invariant at [L63-L74] (unsigned long )_argptr == 0UL [2024-01-26 15:20:57,197 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 15:20:57,407 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-26 15:20:57,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 15:20:57,445 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 15:20:57,456 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-26 15:20:57,539 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-26 15:20:57,572 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 15:20:57,590 INFO L206 MainTranslator]: Completed translation [2024-01-26 15:20:57,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:57 WrapperNode [2024-01-26 15:20:57,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 15:20:57,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 15:20:57,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 15:20:57,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 15:20:57,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:57" (1/1) ... [2024-01-26 15:20:57,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:57" (1/1) ... [2024-01-26 15:20:57,658 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 408 [2024-01-26 15:20:57,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 15:20:57,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 15:20:57,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 15:20:57,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 15:20:57,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:57" (1/1) ... [2024-01-26 15:20:57,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:57" (1/1) ... [2024-01-26 15:20:57,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:57" (1/1) ... [2024-01-26 15:20:57,708 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-26 15:20:57,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:57" (1/1) ... [2024-01-26 15:20:57,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:57" (1/1) ... [2024-01-26 15:20:57,729 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:57" (1/1) ... [2024-01-26 15:20:57,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:57" (1/1) ... [2024-01-26 15:20:57,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:57" (1/1) ... [2024-01-26 15:20:57,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:57" (1/1) ... [2024-01-26 15:20:57,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 15:20:57,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 15:20:57,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 15:20:57,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 15:20:57,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:57" (1/1) ... [2024-01-26 15:20:57,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-26 15:20:57,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-26 15:20:57,805 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-26 15:20:57,829 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-26 15:20:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 15:20:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 15:20:57,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 15:20:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 15:20:57,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 15:20:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-26 15:20:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-26 15:20:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-26 15:20:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-26 15:20:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 15:20:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-26 15:20:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-26 15:20:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-26 15:20:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-26 15:20:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-26 15:20:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 15:20:57,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 15:20:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-26 15:20:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-26 15:20:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-26 15:20:57,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-26 15:20:57,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 15:20:57,848 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 15:20:57,947 INFO L244 CfgBuilder]: Building ICFG [2024-01-26 15:20:57,949 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 15:20:58,517 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-26 15:20:58,517 INFO L293 CfgBuilder]: Performing block encoding [2024-01-26 15:20:58,722 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 15:20:58,722 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-26 15:20:58,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 03:20:58 BoogieIcfgContainer [2024-01-26 15:20:58,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 15:20:58,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 15:20:58,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 15:20:58,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 15:20:58,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 26.01 03:20:55" (1/4) ... [2024-01-26 15:20:58,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3f075e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 26.01 03:20:58, skipping insertion in model container [2024-01-26 15:20:58,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 03:20:57" (2/4) ... [2024-01-26 15:20:58,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3f075e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 03:20:58, skipping insertion in model container [2024-01-26 15:20:58,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:57" (3/4) ... [2024-01-26 15:20:58,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3f075e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 03:20:58, skipping insertion in model container [2024-01-26 15:20:58,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 03:20:58" (4/4) ... [2024-01-26 15:20:58,729 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2024-01-26 15:20:58,742 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 15:20:58,743 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 120 error locations. [2024-01-26 15:20:58,743 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 15:20:58,897 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-26 15:20:58,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 263 transitions, 540 flow [2024-01-26 15:20:58,969 INFO L124 PetriNetUnfolderBase]: 5/261 cut-off events. [2024-01-26 15:20:58,969 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-26 15:20:58,975 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-26 15:20:58,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 265 places, 263 transitions, 540 flow [2024-01-26 15:20:58,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 262 places, 260 transitions, 532 flow [2024-01-26 15:20:58,996 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-26 15:20:59,003 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;@1555124d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 15:20:59,005 INFO L358 AbstractCegarLoop]: Starting to check reachability of 172 error locations. [2024-01-26 15:20:59,007 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-26 15:20:59,008 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-26 15:20:59,008 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-26 15:20:59,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:59,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-26 15:20:59,011 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-26 15:20:59,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:59,015 INFO L85 PathProgramCache]: Analyzing trace with hash 42637, now seen corresponding path program 1 times [2024-01-26 15:20:59,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:59,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442724978] [2024-01-26 15:20:59,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:59,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:20:59,136 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-26 15:20:59,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:20:59,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442724978] [2024-01-26 15:20:59,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442724978] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:20:59,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:20:59,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:20:59,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078116175] [2024-01-26 15:20:59,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:20:59,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:20:59,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:20:59,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:20:59,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:20:59,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 263 [2024-01-26 15:20:59,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 260 transitions, 532 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-26 15:20:59,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:20:59,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 263 [2024-01-26 15:20:59,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:20:59,980 INFO L124 PetriNetUnfolderBase]: 2097/6022 cut-off events. [2024-01-26 15:20:59,981 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2024-01-26 15:20:59,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9507 conditions, 6022 events. 2097/6022 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 53871 event pairs, 861 based on Foata normal form. 0/5098 useless extension candidates. Maximal degree in co-relation 8956. Up to 1797 conditions per place. [2024-01-26 15:21:00,018 INFO L140 encePairwiseOnDemand]: 256/263 looper letters, 98 selfloop transitions, 5 changer transitions 0/298 dead transitions. [2024-01-26 15:21:00,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 298 transitions, 820 flow [2024-01-26 15:21:00,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:21:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:21:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 696 transitions. [2024-01-26 15:21:00,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8821292775665399 [2024-01-26 15:21:00,032 INFO L175 Difference]: Start difference. First operand has 262 places, 260 transitions, 532 flow. Second operand 3 states and 696 transitions. [2024-01-26 15:21:00,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 298 transitions, 820 flow [2024-01-26 15:21:00,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 298 transitions, 808 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-26 15:21:00,042 INFO L231 Difference]: Finished difference. Result has 259 places, 260 transitions, 543 flow [2024-01-26 15:21:00,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=543, PETRI_PLACES=259, PETRI_TRANSITIONS=260} [2024-01-26 15:21:00,047 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -3 predicate places. [2024-01-26 15:21:00,047 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 260 transitions, 543 flow [2024-01-26 15:21:00,047 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-26 15:21:00,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:21:00,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-26 15:21:00,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 15:21:00,048 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-26 15:21:00,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:21:00,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1322941, now seen corresponding path program 1 times [2024-01-26 15:21:00,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:21:00,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515226472] [2024-01-26 15:21:00,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:21:00,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:21:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:21:00,087 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-26 15:21:00,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:21:00,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515226472] [2024-01-26 15:21:00,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515226472] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:21:00,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:21:00,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:21:00,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517469375] [2024-01-26 15:21:00,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:21:00,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:21:00,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:21:00,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:21:00,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:21:00,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 263 [2024-01-26 15:21:00,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 260 transitions, 543 flow. Second operand has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 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-26 15:21:00,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:21:00,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 263 [2024-01-26 15:21:00,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:21:01,017 INFO L124 PetriNetUnfolderBase]: 2097/6023 cut-off events. [2024-01-26 15:21:01,017 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2024-01-26 15:21:01,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9687 conditions, 6023 events. 2097/6023 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 54257 event pairs, 1779 based on Foata normal form. 0/5098 useless extension candidates. Maximal degree in co-relation 4434. Up to 3404 conditions per place. [2024-01-26 15:21:01,051 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 64 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2024-01-26 15:21:01,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 257 transitions, 669 flow [2024-01-26 15:21:01,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:21:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:21:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2024-01-26 15:21:01,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.826362484157161 [2024-01-26 15:21:01,053 INFO L175 Difference]: Start difference. First operand has 259 places, 260 transitions, 543 flow. Second operand 3 states and 652 transitions. [2024-01-26 15:21:01,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 257 transitions, 669 flow [2024-01-26 15:21:01,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 257 transitions, 664 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-26 15:21:01,059 INFO L231 Difference]: Finished difference. Result has 257 places, 257 transitions, 536 flow [2024-01-26 15:21:01,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=257, PETRI_TRANSITIONS=257} [2024-01-26 15:21:01,060 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -5 predicate places. [2024-01-26 15:21:01,060 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 257 transitions, 536 flow [2024-01-26 15:21:01,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 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-26 15:21:01,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:21:01,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-26 15:21:01,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-26 15:21:01,061 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-26 15:21:01,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:21:01,062 INFO L85 PathProgramCache]: Analyzing trace with hash 41012416, now seen corresponding path program 1 times [2024-01-26 15:21:01,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:21:01,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493291244] [2024-01-26 15:21:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:21:01,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:21:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:21:01,112 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-26 15:21:01,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:21:01,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493291244] [2024-01-26 15:21:01,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493291244] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:21:01,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:21:01,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:21:01,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491533009] [2024-01-26 15:21:01,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:21:01,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:21:01,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:21:01,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:21:01,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:21:01,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 263 [2024-01-26 15:21:01,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 257 transitions, 536 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-26 15:21:01,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:21:01,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 263 [2024-01-26 15:21:01,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:21:01,784 INFO L124 PetriNetUnfolderBase]: 2097/6014 cut-off events. [2024-01-26 15:21:01,784 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2024-01-26 15:21:01,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9606 conditions, 6014 events. 2097/6014 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 54269 event pairs, 1779 based on Foata normal form. 1/5096 useless extension candidates. Maximal degree in co-relation 9545. Up to 3398 conditions per place. [2024-01-26 15:21:01,811 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 67 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2024-01-26 15:21:01,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 248 transitions, 656 flow [2024-01-26 15:21:01,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:21:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:21:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 634 transitions. [2024-01-26 15:21:01,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8035487959442332 [2024-01-26 15:21:01,816 INFO L175 Difference]: Start difference. First operand has 257 places, 257 transitions, 536 flow. Second operand 3 states and 634 transitions. [2024-01-26 15:21:01,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 248 transitions, 656 flow [2024-01-26 15:21:01,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 248 transitions, 652 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:21:01,822 INFO L231 Difference]: Finished difference. Result has 248 places, 248 transitions, 518 flow [2024-01-26 15:21:01,823 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-26 15:21:01,824 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -14 predicate places. [2024-01-26 15:21:01,824 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 248 transitions, 518 flow [2024-01-26 15:21:01,825 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-26 15:21:01,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:21:01,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-26 15:21:01,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-26 15:21:01,825 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-26 15:21:01,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:21:01,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1271386181, now seen corresponding path program 1 times [2024-01-26 15:21:01,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:21:01,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147528567] [2024-01-26 15:21:01,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:21:01,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:21:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:21:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 15:21:01,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:21:01,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147528567] [2024-01-26 15:21:01,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147528567] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:21:01,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:21:01,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:21:01,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560030797] [2024-01-26 15:21:01,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:21:01,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:21:01,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:21:01,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:21:01,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:21:01,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 263 [2024-01-26 15:21:01,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 248 transitions, 518 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-26 15:21:01,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:21:01,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 263 [2024-01-26 15:21:01,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:21:02,922 INFO L124 PetriNetUnfolderBase]: 3848/11023 cut-off events. [2024-01-26 15:21:02,922 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2024-01-26 15:21:02,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17678 conditions, 11023 events. 3848/11023 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 108279 event pairs, 1680 based on Foata normal form. 0/9419 useless extension candidates. Maximal degree in co-relation 17566. Up to 3228 conditions per place. [2024-01-26 15:21:02,980 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 111 selfloop transitions, 4 changer transitions 0/286 dead transitions. [2024-01-26 15:21:02,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 286 transitions, 835 flow [2024-01-26 15:21:02,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:21:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:21:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2024-01-26 15:21:02,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8605830164765526 [2024-01-26 15:21:02,983 INFO L175 Difference]: Start difference. First operand has 248 places, 248 transitions, 518 flow. Second operand 3 states and 679 transitions. [2024-01-26 15:21:02,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 286 transitions, 835 flow [2024-01-26 15:21:02,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 286 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:21:02,986 INFO L231 Difference]: Finished difference. Result has 242 places, 242 transitions, 516 flow [2024-01-26 15:21:02,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=242, PETRI_TRANSITIONS=242} [2024-01-26 15:21:02,987 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -20 predicate places. [2024-01-26 15:21:02,988 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 242 transitions, 516 flow [2024-01-26 15:21:02,988 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-26 15:21:02,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:21:02,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-26 15:21:02,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-26 15:21:02,989 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-26 15:21:02,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:21:02,989 INFO L85 PathProgramCache]: Analyzing trace with hash 758267242, now seen corresponding path program 1 times [2024-01-26 15:21:02,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:21:02,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154934383] [2024-01-26 15:21:02,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:21:02,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:21:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:21:03,088 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-26 15:21:03,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:21:03,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154934383] [2024-01-26 15:21:03,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154934383] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:21:03,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:21:03,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:21:03,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727664254] [2024-01-26 15:21:03,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:21:03,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:21:03,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:21:03,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:21:03,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:21:03,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 263 [2024-01-26 15:21:03,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 242 transitions, 516 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-26 15:21:03,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:21:03,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 263 [2024-01-26 15:21:03,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:21:03,936 INFO L124 PetriNetUnfolderBase]: 3848/11119 cut-off events. [2024-01-26 15:21:03,936 INFO L125 PetriNetUnfolderBase]: For 313/313 co-relation queries the response was YES. [2024-01-26 15:21:03,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17978 conditions, 11119 events. 3848/11119 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 110193 event pairs, 3427 based on Foata normal form. 0/9480 useless extension candidates. Maximal degree in co-relation 8616. Up to 6313 conditions per place. [2024-01-26 15:21:03,988 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 66 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2024-01-26 15:21:03,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 238 transitions, 644 flow [2024-01-26 15:21:03,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:21:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:21:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2024-01-26 15:21:03,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8212927756653993 [2024-01-26 15:21:03,990 INFO L175 Difference]: Start difference. First operand has 242 places, 242 transitions, 516 flow. Second operand 3 states and 648 transitions. [2024-01-26 15:21:03,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 238 transitions, 644 flow [2024-01-26 15:21:03,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 238 transitions, 640 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-26 15:21:03,994 INFO L231 Difference]: Finished difference. Result has 239 places, 238 transitions, 508 flow [2024-01-26 15:21:03,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=239, PETRI_TRANSITIONS=238} [2024-01-26 15:21:03,995 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -23 predicate places. [2024-01-26 15:21:03,995 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 238 transitions, 508 flow [2024-01-26 15:21:03,995 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-26 15:21:03,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:21:03,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:21:03,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-26 15:21:03,996 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-26 15:21:03,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:21:03,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2031449405, now seen corresponding path program 1 times [2024-01-26 15:21:03,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:21:03,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460308958] [2024-01-26 15:21:03,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:21:03,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:21:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:21:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 15:21:04,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:21:04,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460308958] [2024-01-26 15:21:04,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460308958] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:21:04,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:21:04,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:21:04,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104339594] [2024-01-26 15:21:04,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:21:04,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:21:04,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:21:04,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:21:04,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:21:04,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 263 [2024-01-26 15:21:04,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 238 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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-26 15:21:04,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:21:04,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 263 [2024-01-26 15:21:04,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:21:05,421 INFO L124 PetriNetUnfolderBase]: 5532/15967 cut-off events. [2024-01-26 15:21:05,421 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2024-01-26 15:21:05,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25581 conditions, 15967 events. 5532/15967 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 169613 event pairs, 2803 based on Foata normal form. 0/13628 useless extension candidates. Maximal degree in co-relation 25514. Up to 5068 conditions per place. [2024-01-26 15:21:05,525 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 103 selfloop transitions, 5 changer transitions 0/270 dead transitions. [2024-01-26 15:21:05,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 270 transitions, 795 flow [2024-01-26 15:21:05,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:21:05,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:21:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 677 transitions. [2024-01-26 15:21:05,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8580481622306717 [2024-01-26 15:21:05,527 INFO L175 Difference]: Start difference. First operand has 239 places, 238 transitions, 508 flow. Second operand 3 states and 677 transitions. [2024-01-26 15:21:05,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 270 transitions, 795 flow [2024-01-26 15:21:05,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 270 transitions, 791 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:21:05,532 INFO L231 Difference]: Finished difference. Result has 234 places, 234 transitions, 515 flow [2024-01-26 15:21:05,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=515, PETRI_PLACES=234, PETRI_TRANSITIONS=234} [2024-01-26 15:21:05,534 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -28 predicate places. [2024-01-26 15:21:05,535 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 234 transitions, 515 flow [2024-01-26 15:21:05,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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-26 15:21:05,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:21:05,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:21:05,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-26 15:21:05,536 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-26 15:21:05,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:21:05,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1449576677, now seen corresponding path program 1 times [2024-01-26 15:21:05,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:21:05,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807202659] [2024-01-26 15:21:05,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:21:05,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:21:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:21:05,578 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-26 15:21:05,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:21:05,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807202659] [2024-01-26 15:21:05,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807202659] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:21:05,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:21:05,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:21:05,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285730069] [2024-01-26 15:21:05,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:21:05,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:21:05,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:21:05,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:21:05,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:21:05,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 263 [2024-01-26 15:21:05,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 234 transitions, 515 flow. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 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-26 15:21:05,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:21:05,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 263 [2024-01-26 15:21:05,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:21:06,660 INFO L124 PetriNetUnfolderBase]: 5532/15724 cut-off events. [2024-01-26 15:21:06,661 INFO L125 PetriNetUnfolderBase]: For 778/778 co-relation queries the response was YES. [2024-01-26 15:21:06,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26056 conditions, 15724 events. 5532/15724 cut-off events. For 778/778 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 165368 event pairs, 2253 based on Foata normal form. 0/13470 useless extension candidates. Maximal degree in co-relation 14387. Up to 4950 conditions per place. [2024-01-26 15:21:06,746 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 108 selfloop transitions, 5 changer transitions 0/279 dead transitions. [2024-01-26 15:21:06,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 279 transitions, 852 flow [2024-01-26 15:21:06,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:21:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:21:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2024-01-26 15:21:06,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8897338403041825 [2024-01-26 15:21:06,748 INFO L175 Difference]: Start difference. First operand has 234 places, 234 transitions, 515 flow. Second operand 3 states and 702 transitions. [2024-01-26 15:21:06,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 279 transitions, 852 flow [2024-01-26 15:21:06,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 279 transitions, 845 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-26 15:21:06,753 INFO L231 Difference]: Finished difference. Result has 235 places, 235 transitions, 531 flow [2024-01-26 15:21:06,753 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=235, PETRI_TRANSITIONS=235} [2024-01-26 15:21:06,753 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -27 predicate places. [2024-01-26 15:21:06,753 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 235 transitions, 531 flow [2024-01-26 15:21:06,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 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-26 15:21:06,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:21:06,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:21:06,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-26 15:21:06,754 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-26 15:21:06,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:21:06,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1987202594, now seen corresponding path program 1 times [2024-01-26 15:21:06,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:21:06,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130897332] [2024-01-26 15:21:06,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:21:06,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:21:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:21:06,768 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-26 15:21:06,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:21:06,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130897332] [2024-01-26 15:21:06,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130897332] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:21:06,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:21:06,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:21:06,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040881896] [2024-01-26 15:21:06,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:21:06,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:21:06,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:21:06,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:21:06,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:21:06,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 263 [2024-01-26 15:21:06,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 235 transitions, 531 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-26 15:21:06,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:21:06,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 263 [2024-01-26 15:21:06,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:21:07,920 INFO L124 PetriNetUnfolderBase]: 5752/16608 cut-off events. [2024-01-26 15:21:07,920 INFO L125 PetriNetUnfolderBase]: For 1269/1269 co-relation queries the response was YES. [2024-01-26 15:21:07,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27633 conditions, 16608 events. 5752/16608 cut-off events. For 1269/1269 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 177393 event pairs, 1867 based on Foata normal form. 0/14198 useless extension candidates. Maximal degree in co-relation 15459. Up to 6015 conditions per place. [2024-01-26 15:21:08,011 INFO L140 encePairwiseOnDemand]: 251/263 looper letters, 112 selfloop transitions, 4 changer transitions 0/269 dead transitions. [2024-01-26 15:21:08,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 269 transitions, 851 flow [2024-01-26 15:21:08,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:21:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:21:08,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 677 transitions. [2024-01-26 15:21:08,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8580481622306717 [2024-01-26 15:21:08,013 INFO L175 Difference]: Start difference. First operand has 235 places, 235 transitions, 531 flow. Second operand 3 states and 677 transitions. [2024-01-26 15:21:08,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 269 transitions, 851 flow [2024-01-26 15:21:08,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 269 transitions, 844 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-26 15:21:08,020 INFO L231 Difference]: Finished difference. Result has 229 places, 228 transitions, 526 flow [2024-01-26 15:21:08,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2024-01-26 15:21:08,021 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -33 predicate places. [2024-01-26 15:21:08,021 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 526 flow [2024-01-26 15:21:08,021 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-26 15:21:08,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:21:08,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:21:08,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-26 15:21:08,022 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-26 15:21:08,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:21:08,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1473736885, now seen corresponding path program 1 times [2024-01-26 15:21:08,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:21:08,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385289463] [2024-01-26 15:21:08,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:21:08,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:21:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:21:08,047 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-26 15:21:08,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:21:08,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385289463] [2024-01-26 15:21:08,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385289463] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:21:08,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:21:08,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:21:08,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586331851] [2024-01-26 15:21:08,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:21:08,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:21:08,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:21:08,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:21:08,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:21:08,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 263 [2024-01-26 15:21:08,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 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-26 15:21:08,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:21:08,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 263 [2024-01-26 15:21:08,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:21:09,698 INFO L124 PetriNetUnfolderBase]: 8307/23074 cut-off events. [2024-01-26 15:21:09,698 INFO L125 PetriNetUnfolderBase]: For 1721/1721 co-relation queries the response was YES. [2024-01-26 15:21:09,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39213 conditions, 23074 events. 8307/23074 cut-off events. For 1721/1721 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 257350 event pairs, 4017 based on Foata normal form. 0/19896 useless extension candidates. Maximal degree in co-relation 21894. Up to 7207 conditions per place. [2024-01-26 15:21:09,824 INFO L140 encePairwiseOnDemand]: 253/263 looper letters, 111 selfloop transitions, 5 changer transitions 0/266 dead transitions. [2024-01-26 15:21:09,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 266 transitions, 862 flow [2024-01-26 15:21:09,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:21:09,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:21:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2024-01-26 15:21:09,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8656527249683144 [2024-01-26 15:21:09,826 INFO L175 Difference]: Start difference. First operand has 229 places, 228 transitions, 526 flow. Second operand 3 states and 683 transitions. [2024-01-26 15:21:09,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 266 transitions, 862 flow [2024-01-26 15:21:09,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 266 transitions, 857 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-26 15:21:09,831 INFO L231 Difference]: Finished difference. Result has 226 places, 225 transitions, 535 flow [2024-01-26 15:21:09,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=535, PETRI_PLACES=226, PETRI_TRANSITIONS=225} [2024-01-26 15:21:09,832 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -36 predicate places. [2024-01-26 15:21:09,832 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 225 transitions, 535 flow [2024-01-26 15:21:09,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 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-26 15:21:09,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:21:09,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:21:09,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-26 15:21:09,833 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-26 15:21:09,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:21:09,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1558798196, now seen corresponding path program 1 times [2024-01-26 15:21:09,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:21:09,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206312110] [2024-01-26 15:21:09,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:21:09,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:21:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:21:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 15:21:09,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:21:09,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206312110] [2024-01-26 15:21:09,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206312110] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:21:09,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:21:09,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:21:09,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243158934] [2024-01-26 15:21:09,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:21:09,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:21:09,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:21:09,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:21:09,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:21:09,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 263 [2024-01-26 15:21:09,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 225 transitions, 535 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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-26 15:21:09,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:21:09,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 263 [2024-01-26 15:21:09,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:21:11,909 INFO L124 PetriNetUnfolderBase]: 8307/23769 cut-off events. [2024-01-26 15:21:11,909 INFO L125 PetriNetUnfolderBase]: For 2424/2424 co-relation queries the response was YES. [2024-01-26 15:21:11,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40713 conditions, 23769 events. 8307/23769 cut-off events. For 2424/2424 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 272118 event pairs, 7296 based on Foata normal form. 3/20345 useless extension candidates. Maximal degree in co-relation 22842. Up to 13412 conditions per place. [2024-01-26 15:21:12,076 INFO L140 encePairwiseOnDemand]: 244/263 looper letters, 78 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2024-01-26 15:21:12,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 208 transitions, 661 flow [2024-01-26 15:21:12,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:21:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:21:12,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 612 transitions. [2024-01-26 15:21:12,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7756653992395437 [2024-01-26 15:21:12,078 INFO L175 Difference]: Start difference. First operand has 226 places, 225 transitions, 535 flow. Second operand 3 states and 612 transitions. [2024-01-26 15:21:12,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 208 transitions, 661 flow [2024-01-26 15:21:12,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 208 transitions, 656 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-26 15:21:12,084 INFO L231 Difference]: Finished difference. Result has 210 places, 208 transitions, 500 flow [2024-01-26 15:21:12,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=210, PETRI_TRANSITIONS=208} [2024-01-26 15:21:12,085 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -52 predicate places. [2024-01-26 15:21:12,085 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 208 transitions, 500 flow [2024-01-26 15:21:12,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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-26 15:21:12,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:21:12,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:21:12,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-26 15:21:12,086 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-26 15:21:12,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:21:12,087 INFO L85 PathProgramCache]: Analyzing trace with hash 62653126, now seen corresponding path program 1 times [2024-01-26 15:21:12,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:21:12,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562278849] [2024-01-26 15:21:12,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:21:12,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:21:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:21:12,127 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-26 15:21:12,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:21:12,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562278849] [2024-01-26 15:21:12,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562278849] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:21:12,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:21:12,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 15:21:12,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417526615] [2024-01-26 15:21:12,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:21:12,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:21:12,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:21:12,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:21:12,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:21:12,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 263 [2024-01-26 15:21:12,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 208 transitions, 500 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-26 15:21:12,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:21:12,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 263 [2024-01-26 15:21:12,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:21:13,859 INFO L124 PetriNetUnfolderBase]: 8308/23777 cut-off events. [2024-01-26 15:21:13,859 INFO L125 PetriNetUnfolderBase]: For 2425/2425 co-relation queries the response was YES. [2024-01-26 15:21:13,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40316 conditions, 23777 events. 8308/23777 cut-off events. For 2425/2425 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 272074 event pairs, 7296 based on Foata normal form. 1/20350 useless extension candidates. Maximal degree in co-relation 40180. Up to 13430 conditions per place. [2024-01-26 15:21:13,984 INFO L140 encePairwiseOnDemand]: 259/263 looper letters, 71 selfloop transitions, 3 changer transitions 0/209 dead transitions. [2024-01-26 15:21:13,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 209 transitions, 650 flow [2024-01-26 15:21:13,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:21:13,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:21:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2024-01-26 15:21:13,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8390367553865653 [2024-01-26 15:21:13,987 INFO L175 Difference]: Start difference. First operand has 210 places, 208 transitions, 500 flow. Second operand 3 states and 662 transitions. [2024-01-26 15:21:13,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 209 transitions, 650 flow [2024-01-26 15:21:13,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 209 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:21:13,991 INFO L231 Difference]: Finished difference. Result has 210 places, 209 transitions, 511 flow [2024-01-26 15:21:13,992 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-26 15:21:13,992 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -52 predicate places. [2024-01-26 15:21:13,992 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 209 transitions, 511 flow [2024-01-26 15:21:13,993 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-26 15:21:13,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:21:13,993 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-26 15:21:13,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-26 15:21:13,993 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-26 15:21:13,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:21:13,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1810148476, now seen corresponding path program 1 times [2024-01-26 15:21:13,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:21:13,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018702613] [2024-01-26 15:21:13,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:21:13,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:21:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:21:14,061 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-26 15:21:14,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:21:14,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018702613] [2024-01-26 15:21:14,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018702613] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:21:14,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:21:14,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 15:21:14,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598756509] [2024-01-26 15:21:14,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:21:14,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-26 15:21:14,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:21:14,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-26 15:21:14,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-26 15:21:14,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 263 [2024-01-26 15:21:14,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 209 transitions, 511 flow. Second operand has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 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-26 15:21:14,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:21:14,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 263 [2024-01-26 15:21:14,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:21:15,908 INFO L124 PetriNetUnfolderBase]: 8308/23774 cut-off events. [2024-01-26 15:21:15,909 INFO L125 PetriNetUnfolderBase]: For 2421/2421 co-relation queries the response was YES. [2024-01-26 15:21:15,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40328 conditions, 23774 events. 8308/23774 cut-off events. For 2421/2421 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 271979 event pairs, 7296 based on Foata normal form. 1/20351 useless extension candidates. Maximal degree in co-relation 40192. Up to 13436 conditions per place. [2024-01-26 15:21:16,027 INFO L140 encePairwiseOnDemand]: 256/263 looper letters, 79 selfloop transitions, 4 changer transitions 0/212 dead transitions. [2024-01-26 15:21:16,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 212 transitions, 683 flow [2024-01-26 15:21:16,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 15:21:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-26 15:21:16,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 848 transitions. [2024-01-26 15:21:16,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8060836501901141 [2024-01-26 15:21:16,029 INFO L175 Difference]: Start difference. First operand has 210 places, 209 transitions, 511 flow. Second operand 4 states and 848 transitions. [2024-01-26 15:21:16,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 212 transitions, 683 flow [2024-01-26 15:21:16,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 212 transitions, 680 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-26 15:21:16,034 INFO L231 Difference]: Finished difference. Result has 214 places, 210 transitions, 531 flow [2024-01-26 15:21:16,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=209, 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=4, PETRI_FLOW=531, PETRI_PLACES=214, PETRI_TRANSITIONS=210} [2024-01-26 15:21:16,035 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -48 predicate places. [2024-01-26 15:21:16,036 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 210 transitions, 531 flow [2024-01-26 15:21:16,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 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-26 15:21:16,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:21:16,036 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-26 15:21:16,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-26 15:21:16,037 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-26 15:21:16,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:21:16,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1810148343, now seen corresponding path program 1 times [2024-01-26 15:21:16,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:21:16,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911058663] [2024-01-26 15:21:16,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:21:16,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:21:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-26 15:21:16,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-26 15:21:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-26 15:21:16,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-26 15:21:16,077 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-26 15:21:16,078 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 172 remaining) [2024-01-26 15:21:16,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 172 remaining) [2024-01-26 15:21:16,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 172 remaining) [2024-01-26 15:21:16,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 172 remaining) [2024-01-26 15:21:16,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 172 remaining) [2024-01-26 15:21:16,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 172 remaining) [2024-01-26 15:21:16,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 172 remaining) [2024-01-26 15:21:16,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 172 remaining) [2024-01-26 15:21:16,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 172 remaining) [2024-01-26 15:21:16,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 172 remaining) [2024-01-26 15:21:16,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 172 remaining) [2024-01-26 15:21:16,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 172 remaining) [2024-01-26 15:21:16,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 172 remaining) [2024-01-26 15:21:16,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 172 remaining) [2024-01-26 15:21:16,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 172 remaining) [2024-01-26 15:21:16,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 172 remaining) [2024-01-26 15:21:16,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 172 remaining) [2024-01-26 15:21:16,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 172 remaining) [2024-01-26 15:21:16,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 172 remaining) [2024-01-26 15:21:16,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 172 remaining) [2024-01-26 15:21:16,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 172 remaining) [2024-01-26 15:21:16,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 172 remaining) [2024-01-26 15:21:16,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 172 remaining) [2024-01-26 15:21:16,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 172 remaining) [2024-01-26 15:21:16,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 172 remaining) [2024-01-26 15:21:16,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 172 remaining) [2024-01-26 15:21:16,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 172 remaining) [2024-01-26 15:21:16,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 172 remaining) [2024-01-26 15:21:16,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 172 remaining) [2024-01-26 15:21:16,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 172 remaining) [2024-01-26 15:21:16,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 172 remaining) [2024-01-26 15:21:16,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 172 remaining) [2024-01-26 15:21:16,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 172 remaining) [2024-01-26 15:21:16,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 172 remaining) [2024-01-26 15:21:16,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 172 remaining) [2024-01-26 15:21:16,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 172 remaining) [2024-01-26 15:21:16,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 172 remaining) [2024-01-26 15:21:16,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 172 remaining) [2024-01-26 15:21:16,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 172 remaining) [2024-01-26 15:21:16,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 172 remaining) [2024-01-26 15:21:16,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 172 remaining) [2024-01-26 15:21:16,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 172 remaining) [2024-01-26 15:21:16,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 172 remaining) [2024-01-26 15:21:16,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 172 remaining) [2024-01-26 15:21:16,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 172 remaining) [2024-01-26 15:21:16,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 172 remaining) [2024-01-26 15:21:16,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 172 remaining) [2024-01-26 15:21:16,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 172 remaining) [2024-01-26 15:21:16,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 172 remaining) [2024-01-26 15:21:16,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 172 remaining) [2024-01-26 15:21:16,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 172 remaining) [2024-01-26 15:21:16,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 172 remaining) [2024-01-26 15:21:16,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 172 remaining) [2024-01-26 15:21:16,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 172 remaining) [2024-01-26 15:21:16,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 172 remaining) [2024-01-26 15:21:16,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 172 remaining) [2024-01-26 15:21:16,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 172 remaining) [2024-01-26 15:21:16,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 172 remaining) [2024-01-26 15:21:16,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 172 remaining) [2024-01-26 15:21:16,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 172 remaining) [2024-01-26 15:21:16,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 172 remaining) [2024-01-26 15:21:16,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 172 remaining) [2024-01-26 15:21:16,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 172 remaining) [2024-01-26 15:21:16,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 172 remaining) [2024-01-26 15:21:16,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 172 remaining) [2024-01-26 15:21:16,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 172 remaining) [2024-01-26 15:21:16,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 172 remaining) [2024-01-26 15:21:16,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 172 remaining) [2024-01-26 15:21:16,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 172 remaining) [2024-01-26 15:21:16,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 172 remaining) [2024-01-26 15:21:16,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 172 remaining) [2024-01-26 15:21:16,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 172 remaining) [2024-01-26 15:21:16,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 172 remaining) [2024-01-26 15:21:16,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 172 remaining) [2024-01-26 15:21:16,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 172 remaining) [2024-01-26 15:21:16,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 172 remaining) [2024-01-26 15:21:16,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 172 remaining) [2024-01-26 15:21:16,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 172 remaining) [2024-01-26 15:21:16,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 172 remaining) [2024-01-26 15:21:16,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 172 remaining) [2024-01-26 15:21:16,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 172 remaining) [2024-01-26 15:21:16,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 172 remaining) [2024-01-26 15:21:16,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 172 remaining) [2024-01-26 15:21:16,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 172 remaining) [2024-01-26 15:21:16,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 172 remaining) [2024-01-26 15:21:16,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 172 remaining) [2024-01-26 15:21:16,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 172 remaining) [2024-01-26 15:21:16,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 172 remaining) [2024-01-26 15:21:16,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 172 remaining) [2024-01-26 15:21:16,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 172 remaining) [2024-01-26 15:21:16,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 172 remaining) [2024-01-26 15:21:16,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 172 remaining) [2024-01-26 15:21:16,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 172 remaining) [2024-01-26 15:21:16,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 172 remaining) [2024-01-26 15:21:16,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 172 remaining) [2024-01-26 15:21:16,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 172 remaining) [2024-01-26 15:21:16,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 172 remaining) [2024-01-26 15:21:16,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 172 remaining) [2024-01-26 15:21:16,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 172 remaining) [2024-01-26 15:21:16,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 172 remaining) [2024-01-26 15:21:16,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 172 remaining) [2024-01-26 15:21:16,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 172 remaining) [2024-01-26 15:21:16,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 172 remaining) [2024-01-26 15:21:16,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 172 remaining) [2024-01-26 15:21:16,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 172 remaining) [2024-01-26 15:21:16,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 172 remaining) [2024-01-26 15:21:16,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 172 remaining) [2024-01-26 15:21:16,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 172 remaining) [2024-01-26 15:21:16,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 172 remaining) [2024-01-26 15:21:16,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 172 remaining) [2024-01-26 15:21:16,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 172 remaining) [2024-01-26 15:21:16,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 172 remaining) [2024-01-26 15:21:16,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 172 remaining) [2024-01-26 15:21:16,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 172 remaining) [2024-01-26 15:21:16,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 172 remaining) [2024-01-26 15:21:16,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 172 remaining) [2024-01-26 15:21:16,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 172 remaining) [2024-01-26 15:21:16,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 172 remaining) [2024-01-26 15:21:16,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 172 remaining) [2024-01-26 15:21:16,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION (52 of 172 remaining) [2024-01-26 15:21:16,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 172 remaining) [2024-01-26 15:21:16,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 172 remaining) [2024-01-26 15:21:16,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 172 remaining) [2024-01-26 15:21:16,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 172 remaining) [2024-01-26 15:21:16,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 172 remaining) [2024-01-26 15:21:16,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 172 remaining) [2024-01-26 15:21:16,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 172 remaining) [2024-01-26 15:21:16,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 172 remaining) [2024-01-26 15:21:16,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 172 remaining) [2024-01-26 15:21:16,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 172 remaining) [2024-01-26 15:21:16,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 172 remaining) [2024-01-26 15:21:16,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 172 remaining) [2024-01-26 15:21:16,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 172 remaining) [2024-01-26 15:21:16,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 172 remaining) [2024-01-26 15:21:16,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 172 remaining) [2024-01-26 15:21:16,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 172 remaining) [2024-01-26 15:21:16,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 172 remaining) [2024-01-26 15:21:16,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 172 remaining) [2024-01-26 15:21:16,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 172 remaining) [2024-01-26 15:21:16,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 172 remaining) [2024-01-26 15:21:16,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 172 remaining) [2024-01-26 15:21:16,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 172 remaining) [2024-01-26 15:21:16,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 172 remaining) [2024-01-26 15:21:16,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 172 remaining) [2024-01-26 15:21:16,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 172 remaining) [2024-01-26 15:21:16,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 172 remaining) [2024-01-26 15:21:16,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 172 remaining) [2024-01-26 15:21:16,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 172 remaining) [2024-01-26 15:21:16,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 172 remaining) [2024-01-26 15:21:16,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 172 remaining) [2024-01-26 15:21:16,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 172 remaining) [2024-01-26 15:21:16,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 172 remaining) [2024-01-26 15:21:16,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 172 remaining) [2024-01-26 15:21:16,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 172 remaining) [2024-01-26 15:21:16,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 172 remaining) [2024-01-26 15:21:16,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 172 remaining) [2024-01-26 15:21:16,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 172 remaining) [2024-01-26 15:21:16,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 172 remaining) [2024-01-26 15:21:16,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 172 remaining) [2024-01-26 15:21:16,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 172 remaining) [2024-01-26 15:21:16,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 172 remaining) [2024-01-26 15:21:16,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 172 remaining) [2024-01-26 15:21:16,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 172 remaining) [2024-01-26 15:21:16,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 172 remaining) [2024-01-26 15:21:16,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 172 remaining) [2024-01-26 15:21:16,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 172 remaining) [2024-01-26 15:21:16,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 172 remaining) [2024-01-26 15:21:16,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 172 remaining) [2024-01-26 15:21:16,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 172 remaining) [2024-01-26 15:21:16,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 172 remaining) [2024-01-26 15:21:16,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 172 remaining) [2024-01-26 15:21:16,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 172 remaining) [2024-01-26 15:21:16,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-26 15:21:16,099 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:21:16,106 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 15:21:16,106 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 15:21:16,162 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-26 15:21:16,176 INFO L503 ceAbstractionStarter]: Automizer considered 119 witness invariants [2024-01-26 15:21:16,176 INFO L504 ceAbstractionStarter]: WitnessConsidered=119 [2024-01-26 15:21:16,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 03:21:16 BasicIcfg [2024-01-26 15:21:16,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 15:21:16,177 INFO L158 Benchmark]: Toolchain (without parser) took 19062.94ms. Allocated memory was 176.2MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 95.2MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 615.6MB. Max. memory is 16.1GB. [2024-01-26 15:21:16,177 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-26 15:21:16,177 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-26 15:21:16,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.26ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 95.0MB in the beginning and 201.1MB in the end (delta: -106.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-01-26 15:21:16,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.88ms. Allocated memory is still 239.1MB. Free memory was 201.1MB in the beginning and 198.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-26 15:21:16,179 INFO L158 Benchmark]: Boogie Preprocessor took 85.32ms. Allocated memory is still 239.1MB. Free memory was 198.0MB in the beginning and 193.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-26 15:21:16,179 INFO L158 Benchmark]: RCFGBuilder took 974.70ms. Allocated memory is still 239.1MB. Free memory was 193.8MB in the beginning and 84.7MB in the end (delta: 109.1MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2024-01-26 15:21:16,180 INFO L158 Benchmark]: TraceAbstraction took 17452.50ms. Allocated memory was 239.1MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 84.7MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 539.2MB. Max. memory is 16.1GB. [2024-01-26 15:21:16,181 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 176.2MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.26ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 95.0MB in the beginning and 201.1MB in the end (delta: -106.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.88ms. Allocated memory is still 239.1MB. Free memory was 201.1MB in the beginning and 198.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.32ms. Allocated memory is still 239.1MB. Free memory was 198.0MB in the beginning and 193.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 974.70ms. Allocated memory is still 239.1MB. Free memory was 193.8MB in the beginning and 84.7MB in the end (delta: 109.1MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. * TraceAbstraction took 17452.50ms. Allocated memory was 239.1MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 84.7MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 539.2MB. 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[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[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[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[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[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[bag1],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[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[A],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[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[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[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[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[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[N],IntegerLiteral[0]]]] [L84] bag2 = __VERIFIER_nondet_int() [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[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[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[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}] [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[j],IntegerLiteral[0]]]] [L85] cap1 = __VERIFIER_nondet_int() [L86] 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}] [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[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[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[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[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[sum1],IntegerLiteral[0]]]] [L86] cap2 = __VERIFIER_nondet_int() [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[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[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[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}] [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[A],IntegerLiteral[0]]]] [L87] sum1 = __VERIFIER_nondet_int() [L88] 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}] [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[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[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[i],IntegerLiteral[0]]]] [L88] sum2 = __VERIFIER_nondet_int() [L89] 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}] [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[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]]]] [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[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}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],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[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] 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] 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: 17.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 566 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 397 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1525 IncrementalHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 44 mSDtfsCounter, 1525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=543occurred in iteration=1, InterpolantAutomatonStates: 37, 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, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-26 15:21:16,232 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