./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 cb09d658 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/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-cb09d65-m [2024-01-27 23:08:46,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 23:08:46,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 23:08:46,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 23:08:46,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 23:08:46,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 23:08:46,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 23:08:46,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 23:08:46,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 23:08:46,688 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 23:08:46,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 23:08:46,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 23:08:46,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 23:08:46,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 23:08:46,690 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 23:08:46,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 23:08:46,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 23:08:46,691 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 23:08:46,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 23:08:46,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 23:08:46,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 23:08:46,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 23:08:46,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 23:08:46,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 23:08:46,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 23:08:46,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 23:08:46,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 23:08:46,693 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 23:08:46,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 23:08:46,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 23:08:46,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 23:08:46,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 23:08:46,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:08:46,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 23:08:46,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 23:08:46,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 23:08:46,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 23:08:46,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 23:08:46,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 23:08:46,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 23:08:46,696 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 23:08:46,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 23:08:46,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 23:08:46,697 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-27 23:08:46,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 23:08:46,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 23:08:46,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 23:08:46,981 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 23:08:46,981 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 23:08:46,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/parallel-misc-1.wvr.yml/witness.yml [2024-01-27 23:08:47,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 23:08:47,087 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 23:08:47,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2024-01-27 23:08:48,138 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 23:08:48,306 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 23:08:48,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2024-01-27 23:08:48,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0cf289e/3f903df291294672b2774b75854889d0/FLAG58e21697d [2024-01-27 23:08:48,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0cf289e/3f903df291294672b2774b75854889d0 [2024-01-27 23:08:48,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 23:08:48,328 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 23:08:48,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 23:08:48,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 23:08:48,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 23:08:48,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:08:47" (1/2) ... [2024-01-27 23:08:48,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c50a017 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:48, skipping insertion in model container [2024-01-27 23:08:48,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:08:47" (1/2) ... [2024-01-27 23:08:48,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7cf8b7ce and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:48, skipping insertion in model container [2024-01-27 23:08:48,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:08:48" (2/2) ... [2024-01-27 23:08:48,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c50a017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:48, skipping insertion in model container [2024-01-27 23:08:48,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:08:48" (2/2) ... [2024-01-27 23:08:48,337 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 23:08:48,357 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 23:08:48,358 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] sum2 == 0 [2024-01-27 23:08:48,358 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] i == 0 [2024-01-27 23:08:48,358 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] N == 0 [2024-01-27 23:08:48,359 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cap2 == 0 [2024-01-27 23:08:48,359 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] j == 0 [2024-01-27 23:08:48,359 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] A == 0 [2024-01-27 23:08:48,359 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] sum1 == 0 [2024-01-27 23:08:48,359 INFO L98 nessWitnessExtractor]: Loop invariant at [L113-L115] A == 0 [2024-01-27 23:08:48,359 INFO L98 nessWitnessExtractor]: Loop invariant at [L113-L115] (((0LL - (long long )i) + (long long )size >= 0LL && size != 0) && ((((((((((8 <= size && 8 <= i) && (-16LL + (long long )i) + (long long )size >= 0LL) && i != 1) || ((7 <= size && (-14LL + (long long )i) + (long long )size >= 0LL) && i == 7)) || ((6 <= size && (-12LL + (long long )i) + (long long )size >= 0LL) && i == 6)) || ((5 <= size && (-10LL + (long long )i) + (long long )size >= 0LL) && i == 5)) || ((4 <= size && (-8LL + (long long )i) + (long long )size >= 0LL) && i == 4)) || ((3 <= size && (-6LL + (long long )i) + (long long )size >= 0LL) && i == 3)) || ((2 <= size && (-4LL + (long long )i) + (long long )size >= 0LL) && i == 2)) || ((1 <= size && (-2LL + (long long )i) + (long long )size >= 0LL) && i == 1))) || (0 == i && i == 0) [2024-01-27 23:08:48,359 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] A == 0 [2024-01-27 23:08:48,360 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-27 23:08:48,360 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L72] (unsigned long )_argptr == 0UL [2024-01-27 23:08:48,360 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-27 23:08:48,360 INFO L98 nessWitnessExtractor]: Location invariant before [L112-L112] A == 0 [2024-01-27 23:08:48,360 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-27 23:08:48,360 INFO L98 nessWitnessExtractor]: Location invariant before [L121-L121] 1 <= b [2024-01-27 23:08:48,360 INFO L98 nessWitnessExtractor]: Location invariant before [L121-L121] b != 0 [2024-01-27 23:08:48,361 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-27 23:08:48,361 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] (-1LL - (long long )i) + (long long )size >= 0LL [2024-01-27 23:08:48,361 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] ((((((((((((8 <= i && 9 <= size) && i <= 2147483646) && (-17LL + (long long )i) + (long long )size >= 0LL) && i != 0) && i != 1) || ((8 <= size && (-15LL + (long long )i) + (long long )size >= 0LL) && i == 7)) || ((7 <= size && (-13LL + (long long )i) + (long long )size >= 0LL) && i == 6)) || ((6 <= size && (-11LL + (long long )i) + (long long )size >= 0LL) && i == 5)) || ((5 <= size && (-9LL + (long long )i) + (long long )size >= 0LL) && i == 4)) || ((4 <= size && (-7LL + (long long )i) + (long long )size >= 0LL) && i == 3)) || ((3 <= size && (-5LL + (long long )i) + (long long )size >= 0LL) && i == 2)) || ((2 <= size && (-3LL + (long long )i) + (long long )size >= 0LL) && i == 1)) || (((1 <= size && (-1LL + (long long )i) + (long long )size >= 0LL) && 0 == i) && i == 0) [2024-01-27 23:08:48,361 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] A == 0 [2024-01-27 23:08:48,362 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] size != 0 [2024-01-27 23:08:48,362 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] 0 <= i [2024-01-27 23:08:48,362 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] (long long )i - (long long )size >= 0LL [2024-01-27 23:08:48,362 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] A == 0 [2024-01-27 23:08:48,362 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] A == 0 [2024-01-27 23:08:48,362 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L55] (unsigned long )_argptr == 0UL [2024-01-27 23:08:48,362 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (unsigned long )_argptr == 0UL [2024-01-27 23:08:48,363 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-27 23:08:48,363 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-27 23:08:48,363 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] A == 0 [2024-01-27 23:08:48,363 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] bag2 == 0 [2024-01-27 23:08:48,363 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] j == 0 [2024-01-27 23:08:48,363 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] i == 0 [2024-01-27 23:08:48,363 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] sum1 == 0 [2024-01-27 23:08:48,363 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] bag1 == 0 [2024-01-27 23:08:48,364 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cap1 == 0 [2024-01-27 23:08:48,364 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] sum2 == 0 [2024-01-27 23:08:48,365 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] N == 0 [2024-01-27 23:08:48,365 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cap2 == 0 [2024-01-27 23:08:48,365 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-27 23:08:48,365 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] A == 0 [2024-01-27 23:08:48,366 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] i == 0 [2024-01-27 23:08:48,366 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] sum1 == 0 [2024-01-27 23:08:48,366 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] sum2 == 0 [2024-01-27 23:08:48,366 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] N == 0 [2024-01-27 23:08:48,366 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] j == 0 [2024-01-27 23:08:48,366 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] A == 0 [2024-01-27 23:08:48,367 INFO L98 nessWitnessExtractor]: Loop invariant at [L63-L74] (unsigned long )_argptr == 0UL [2024-01-27 23:08:48,367 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] A == 0 [2024-01-27 23:08:48,367 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (unsigned long )_argptr == 0UL [2024-01-27 23:08:48,367 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] i == 0 [2024-01-27 23:08:48,367 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] bag2 == 0 [2024-01-27 23:08:48,368 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] sum1 == 0 [2024-01-27 23:08:48,368 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cap1 == 0 [2024-01-27 23:08:48,368 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] N == 0 [2024-01-27 23:08:48,368 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] j == 0 [2024-01-27 23:08:48,369 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] sum2 == 0 [2024-01-27 23:08:48,369 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cap2 == 0 [2024-01-27 23:08:48,369 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] A == 0 [2024-01-27 23:08:48,369 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] i == 0 [2024-01-27 23:08:48,370 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] j == 0 [2024-01-27 23:08:48,370 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] A == 0 [2024-01-27 23:08:48,370 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] N == 0 [2024-01-27 23:08:48,370 INFO L98 nessWitnessExtractor]: Loop invariant at [L46-L57] (unsigned long )_argptr == 0UL [2024-01-27 23:08:48,370 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] A == 0 [2024-01-27 23:08:48,370 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] N == 0 [2024-01-27 23:08:48,370 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-01-27 23:08:48,370 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-27 23:08:48,371 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] b <= -1 [2024-01-27 23:08:48,371 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] b != 0 [2024-01-27 23:08:48,371 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] A == 0 [2024-01-27 23:08:48,371 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] j == 0 [2024-01-27 23:08:48,371 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] N == 0 [2024-01-27 23:08:48,372 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-27 23:08:48,372 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] i == 0 [2024-01-27 23:08:48,372 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] j == 0 [2024-01-27 23:08:48,372 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] A == 0 [2024-01-27 23:08:48,372 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] sum2 == 0 [2024-01-27 23:08:48,372 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] N == 0 [2024-01-27 23:08:48,372 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] i == 0 [2024-01-27 23:08:48,372 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cap2 == 0 [2024-01-27 23:08:48,373 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] j == 0 [2024-01-27 23:08:48,373 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cap1 == 0 [2024-01-27 23:08:48,373 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] N == 0 [2024-01-27 23:08:48,373 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] A == 0 [2024-01-27 23:08:48,373 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] sum2 == 0 [2024-01-27 23:08:48,373 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] sum1 == 0 [2024-01-27 23:08:48,395 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 23:08:48,567 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c[2781,2794] [2024-01-27 23:08:48,574 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:08:48,580 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 23:08:48,588 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 23:08:48,651 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c[2781,2794] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 23:08:48,674 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:08:48,694 INFO L206 MainTranslator]: Completed translation [2024-01-27 23:08:48,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:48 WrapperNode [2024-01-27 23:08:48,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 23:08:48,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 23:08:48,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 23:08:48,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 23:08:48,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:48" (1/1) ... [2024-01-27 23:08:48,708 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:48" (1/1) ... [2024-01-27 23:08:48,755 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 408 [2024-01-27 23:08:48,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 23:08:48,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 23:08:48,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 23:08:48,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 23:08:48,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:48" (1/1) ... [2024-01-27 23:08:48,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:48" (1/1) ... [2024-01-27 23:08:48,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:48" (1/1) ... [2024-01-27 23:08:48,796 INFO L175 MemorySlicer]: Split 13 memory accesses to 4 slices as follows [2, 7, 2, 2]. 54 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-27 23:08:48,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:48" (1/1) ... [2024-01-27 23:08:48,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:48" (1/1) ... [2024-01-27 23:08:48,820 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:48" (1/1) ... [2024-01-27 23:08:48,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:48" (1/1) ... [2024-01-27 23:08:48,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:48" (1/1) ... [2024-01-27 23:08:48,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:48" (1/1) ... [2024-01-27 23:08:48,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 23:08:48,842 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 23:08:48,842 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 23:08:48,842 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 23:08:48,843 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:48" (1/1) ... [2024-01-27 23:08:48,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:08:48,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 23:08:48,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 23:08:48,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 23:08:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 23:08:48,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 23:08:48,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 23:08:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 23:08:48,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 23:08:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 23:08:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 23:08:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 23:08:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 23:08:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 23:08:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 23:08:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 23:08:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 23:08:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 23:08:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 23:08:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 23:08:48,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 23:08:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 23:08:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 23:08:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 23:08:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 23:08:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 23:08:48,971 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 23:08:49,096 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 23:08:49,098 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 23:08:49,574 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 23:08:49,574 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 23:08:49,899 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 23:08:49,900 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-27 23:08:49,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:08:49 BoogieIcfgContainer [2024-01-27 23:08:49,902 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 23:08:49,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 23:08:49,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 23:08:49,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 23:08:49,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:08:47" (1/4) ... [2024-01-27 23:08:49,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2909bb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:08:49, skipping insertion in model container [2024-01-27 23:08:49,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:08:48" (2/4) ... [2024-01-27 23:08:49,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2909bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:08:49, skipping insertion in model container [2024-01-27 23:08:49,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:48" (3/4) ... [2024-01-27 23:08:49,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2909bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:08:49, skipping insertion in model container [2024-01-27 23:08:49,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:08:49" (4/4) ... [2024-01-27 23:08:49,915 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2024-01-27 23:08:49,929 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 23:08:49,930 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 120 error locations. [2024-01-27 23:08:49,930 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 23:08:50,019 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 23:08:50,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 263 transitions, 540 flow [2024-01-27 23:08:50,141 INFO L124 PetriNetUnfolderBase]: 5/261 cut-off events. [2024-01-27 23:08:50,142 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 23:08:50,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 261 events. 5/261 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 616 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 200. Up to 2 conditions per place. [2024-01-27 23:08:50,148 INFO L82 GeneralOperation]: Start removeDead. Operand has 265 places, 263 transitions, 540 flow [2024-01-27 23:08:50,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 262 places, 260 transitions, 532 flow [2024-01-27 23:08:50,167 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 23:08:50,174 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;@354b5c7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 23:08:50,176 INFO L358 AbstractCegarLoop]: Starting to check reachability of 172 error locations. [2024-01-27 23:08:50,178 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 23:08:50,178 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 23:08:50,178 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:08:50,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:50,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 23:08:50,184 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 23:08:50,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:50,188 INFO L85 PathProgramCache]: Analyzing trace with hash 42637, now seen corresponding path program 1 times [2024-01-27 23:08:50,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:50,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139015233] [2024-01-27 23:08:50,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:50,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:50,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:50,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139015233] [2024-01-27 23:08:50,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139015233] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:50,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:50,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:50,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088070391] [2024-01-27 23:08:50,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:50,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:50,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:50,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:50,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:50,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 263 [2024-01-27 23:08:50,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 260 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:50,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:50,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 263 [2024-01-27 23:08:50,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:50,821 INFO L124 PetriNetUnfolderBase]: 1192/3429 cut-off events. [2024-01-27 23:08:50,821 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-01-27 23:08:50,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5418 conditions, 3429 events. 1192/3429 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 28675 event pairs, 969 based on Foata normal form. 0/2875 useless extension candidates. Maximal degree in co-relation 5068. Up to 1921 conditions per place. [2024-01-27 23:08:50,841 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 63 selfloop transitions, 2 changer transitions 0/256 dead transitions. [2024-01-27 23:08:50,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 256 transitions, 654 flow [2024-01-27 23:08:50,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:50,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2024-01-27 23:08:50,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8212927756653993 [2024-01-27 23:08:50,854 INFO L175 Difference]: Start difference. First operand has 262 places, 260 transitions, 532 flow. Second operand 3 states and 648 transitions. [2024-01-27 23:08:50,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 256 transitions, 654 flow [2024-01-27 23:08:50,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 256 transitions, 646 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 23:08:50,863 INFO L231 Difference]: Finished difference. Result has 256 places, 256 transitions, 520 flow [2024-01-27 23:08:50,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=256, PETRI_TRANSITIONS=256} [2024-01-27 23:08:50,867 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -6 predicate places. [2024-01-27 23:08:50,867 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 256 transitions, 520 flow [2024-01-27 23:08:50,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:50,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:50,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 23:08:50,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 23:08:50,868 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 23:08:50,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:50,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1322941, now seen corresponding path program 1 times [2024-01-27 23:08:50,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:50,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370432435] [2024-01-27 23:08:50,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:50,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:50,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:50,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370432435] [2024-01-27 23:08:50,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370432435] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:50,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:50,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:50,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082032029] [2024-01-27 23:08:50,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:50,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:50,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:50,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:50,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:50,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 263 [2024-01-27 23:08:50,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 256 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:50,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:50,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 263 [2024-01-27 23:08:50,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:51,336 INFO L124 PetriNetUnfolderBase]: 1192/3420 cut-off events. [2024-01-27 23:08:51,336 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-01-27 23:08:51,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5377 conditions, 3420 events. 1192/3420 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 28721 event pairs, 969 based on Foata normal form. 0/2875 useless extension candidates. Maximal degree in co-relation 5302. Up to 1916 conditions per place. [2024-01-27 23:08:51,354 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 68 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2024-01-27 23:08:51,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 247 transitions, 642 flow [2024-01-27 23:08:51,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 628 transitions. [2024-01-27 23:08:51,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7959442332065906 [2024-01-27 23:08:51,356 INFO L175 Difference]: Start difference. First operand has 256 places, 256 transitions, 520 flow. Second operand 3 states and 628 transitions. [2024-01-27 23:08:51,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 247 transitions, 642 flow [2024-01-27 23:08:51,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 247 transitions, 638 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:51,360 INFO L231 Difference]: Finished difference. Result has 247 places, 247 transitions, 502 flow [2024-01-27 23:08:51,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=247, PETRI_TRANSITIONS=247} [2024-01-27 23:08:51,361 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -15 predicate places. [2024-01-27 23:08:51,362 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 247 transitions, 502 flow [2024-01-27 23:08:51,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:51,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:51,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 23:08:51,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 23:08:51,363 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 23:08:51,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:51,363 INFO L85 PathProgramCache]: Analyzing trace with hash 41012416, now seen corresponding path program 1 times [2024-01-27 23:08:51,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:51,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378138127] [2024-01-27 23:08:51,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:51,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:51,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:51,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378138127] [2024-01-27 23:08:51,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378138127] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:51,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:51,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:51,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411430747] [2024-01-27 23:08:51,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:51,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:51,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:51,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:51,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 263 [2024-01-27 23:08:51,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 247 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:51,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:51,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 263 [2024-01-27 23:08:51,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:51,957 INFO L124 PetriNetUnfolderBase]: 2108/6048 cut-off events. [2024-01-27 23:08:51,957 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-01-27 23:08:51,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9449 conditions, 6048 events. 2108/6048 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 54320 event pairs, 807 based on Foata normal form. 0/5120 useless extension candidates. Maximal degree in co-relation 9339. Up to 1793 conditions per place. [2024-01-27 23:08:51,986 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 98 selfloop transitions, 5 changer transitions 0/278 dead transitions. [2024-01-27 23:08:51,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 278 transitions, 771 flow [2024-01-27 23:08:51,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:51,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2024-01-27 23:08:51,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8605830164765526 [2024-01-27 23:08:51,991 INFO L175 Difference]: Start difference. First operand has 247 places, 247 transitions, 502 flow. Second operand 3 states and 679 transitions. [2024-01-27 23:08:51,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 278 transitions, 771 flow [2024-01-27 23:08:51,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 278 transitions, 767 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:51,996 INFO L231 Difference]: Finished difference. Result has 242 places, 243 transitions, 509 flow [2024-01-27 23:08:51,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=486, 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=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=509, PETRI_PLACES=242, PETRI_TRANSITIONS=243} [2024-01-27 23:08:51,998 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -20 predicate places. [2024-01-27 23:08:51,998 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 243 transitions, 509 flow [2024-01-27 23:08:51,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:51,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:51,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 23:08:51,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 23:08:51,999 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 23:08:51,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:51,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1271386181, now seen corresponding path program 1 times [2024-01-27 23:08:51,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:52,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151798053] [2024-01-27 23:08:52,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:52,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:52,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:52,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151798053] [2024-01-27 23:08:52,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151798053] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:52,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:52,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:52,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477609400] [2024-01-27 23:08:52,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:52,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:52,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:52,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:52,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:52,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 263 [2024-01-27 23:08:52,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 243 transitions, 509 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-27 23:08:52,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:52,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 263 [2024-01-27 23:08:52,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:52,509 INFO L124 PetriNetUnfolderBase]: 2108/6075 cut-off events. [2024-01-27 23:08:52,509 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2024-01-27 23:08:52,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9705 conditions, 6075 events. 2108/6075 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 54988 event pairs, 1725 based on Foata normal form. 0/5130 useless extension candidates. Maximal degree in co-relation 4443. Up to 3370 conditions per place. [2024-01-27 23:08:52,536 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 64 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2024-01-27 23:08:52,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 240 transitions, 635 flow [2024-01-27 23:08:52,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2024-01-27 23:08:52,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.826362484157161 [2024-01-27 23:08:52,538 INFO L175 Difference]: Start difference. First operand has 242 places, 243 transitions, 509 flow. Second operand 3 states and 652 transitions. [2024-01-27 23:08:52,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 240 transitions, 635 flow [2024-01-27 23:08:52,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 240 transitions, 630 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:08:52,541 INFO L231 Difference]: Finished difference. Result has 240 places, 240 transitions, 502 flow [2024-01-27 23:08:52,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=240, PETRI_TRANSITIONS=240} [2024-01-27 23:08:52,543 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -22 predicate places. [2024-01-27 23:08:52,543 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 240 transitions, 502 flow [2024-01-27 23:08:52,543 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-27 23:08:52,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:52,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 23:08:52,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 23:08:52,544 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 23:08:52,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:52,544 INFO L85 PathProgramCache]: Analyzing trace with hash 758267242, now seen corresponding path program 1 times [2024-01-27 23:08:52,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:52,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016501357] [2024-01-27 23:08:52,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:52,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:52,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:52,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016501357] [2024-01-27 23:08:52,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016501357] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:52,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:52,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:52,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239085715] [2024-01-27 23:08:52,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:52,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:52,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:52,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:52,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:52,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 263 [2024-01-27 23:08:52,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 240 transitions, 502 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-27 23:08:52,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:52,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 263 [2024-01-27 23:08:52,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:53,467 INFO L124 PetriNetUnfolderBase]: 3771/10703 cut-off events. [2024-01-27 23:08:53,467 INFO L125 PetriNetUnfolderBase]: For 307/307 co-relation queries the response was YES. [2024-01-27 23:08:53,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17119 conditions, 10703 events. 3771/10703 cut-off events. For 307/307 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 104004 event pairs, 1533 based on Foata normal form. 0/9127 useless extension candidates. Maximal degree in co-relation 17065. Up to 3276 conditions per place. [2024-01-27 23:08:53,508 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 103 selfloop transitions, 5 changer transitions 0/283 dead transitions. [2024-01-27 23:08:53,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 283 transitions, 815 flow [2024-01-27 23:08:53,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:53,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2024-01-27 23:08:53,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8897338403041825 [2024-01-27 23:08:53,510 INFO L175 Difference]: Start difference. First operand has 240 places, 240 transitions, 502 flow. Second operand 3 states and 702 transitions. [2024-01-27 23:08:53,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 283 transitions, 815 flow [2024-01-27 23:08:53,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 283 transitions, 811 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:53,515 INFO L231 Difference]: Finished difference. Result has 240 places, 241 transitions, 519 flow [2024-01-27 23:08:53,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=519, PETRI_PLACES=240, PETRI_TRANSITIONS=241} [2024-01-27 23:08:53,518 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -22 predicate places. [2024-01-27 23:08:53,518 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 241 transitions, 519 flow [2024-01-27 23:08:53,518 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-27 23:08:53,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:53,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:53,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 23:08:53,519 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 23:08:53,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:53,519 INFO L85 PathProgramCache]: Analyzing trace with hash 2031449405, now seen corresponding path program 1 times [2024-01-27 23:08:53,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:53,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148813220] [2024-01-27 23:08:53,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:53,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:53,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:53,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148813220] [2024-01-27 23:08:53,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148813220] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:53,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:53,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:53,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692751593] [2024-01-27 23:08:53,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:53,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:53,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:53,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:53,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:53,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 263 [2024-01-27 23:08:53,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 241 transitions, 519 flow. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:53,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:53,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 263 [2024-01-27 23:08:53,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:54,858 INFO L124 PetriNetUnfolderBase]: 5387/15116 cut-off events. [2024-01-27 23:08:54,859 INFO L125 PetriNetUnfolderBase]: For 598/598 co-relation queries the response was YES. [2024-01-27 23:08:54,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24667 conditions, 15116 events. 5387/15116 cut-off events. For 598/598 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 157179 event pairs, 2527 based on Foata normal form. 0/12917 useless extension candidates. Maximal degree in co-relation 11548. Up to 4646 conditions per place. [2024-01-27 23:08:54,946 INFO L140 encePairwiseOnDemand]: 253/263 looper letters, 104 selfloop transitions, 5 changer transitions 0/275 dead transitions. [2024-01-27 23:08:54,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 275 transitions, 816 flow [2024-01-27 23:08:54,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:54,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 681 transitions. [2024-01-27 23:08:54,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8631178707224335 [2024-01-27 23:08:54,948 INFO L175 Difference]: Start difference. First operand has 240 places, 241 transitions, 519 flow. Second operand 3 states and 681 transitions. [2024-01-27 23:08:54,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 275 transitions, 816 flow [2024-01-27 23:08:54,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 275 transitions, 811 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:08:54,953 INFO L231 Difference]: Finished difference. Result has 237 places, 238 transitions, 527 flow [2024-01-27 23:08:54,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=237, PETRI_TRANSITIONS=238} [2024-01-27 23:08:54,955 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -25 predicate places. [2024-01-27 23:08:54,956 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 238 transitions, 527 flow [2024-01-27 23:08:54,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:54,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:54,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:54,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 23:08:54,957 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 23:08:54,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:54,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1449576677, now seen corresponding path program 1 times [2024-01-27 23:08:54,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:54,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761391198] [2024-01-27 23:08:54,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:54,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:55,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:55,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761391198] [2024-01-27 23:08:55,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761391198] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:55,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:55,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:55,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371264430] [2024-01-27 23:08:55,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:55,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:55,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:55,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:55,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:55,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 263 [2024-01-27 23:08:55,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 238 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:55,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:55,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 263 [2024-01-27 23:08:55,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:56,737 INFO L124 PetriNetUnfolderBase]: 5599/15917 cut-off events. [2024-01-27 23:08:56,738 INFO L125 PetriNetUnfolderBase]: For 1086/1086 co-relation queries the response was YES. [2024-01-27 23:08:56,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26361 conditions, 15917 events. 5599/15917 cut-off events. For 1086/1086 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 167552 event pairs, 1725 based on Foata normal form. 1/13574 useless extension candidates. Maximal degree in co-relation 14069. Up to 5811 conditions per place. [2024-01-27 23:08:56,851 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 110 selfloop transitions, 4 changer transitions 0/274 dead transitions. [2024-01-27 23:08:56,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 274 transitions, 844 flow [2024-01-27 23:08:56,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:56,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 685 transitions. [2024-01-27 23:08:56,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8681875792141952 [2024-01-27 23:08:56,853 INFO L175 Difference]: Start difference. First operand has 237 places, 238 transitions, 527 flow. Second operand 3 states and 685 transitions. [2024-01-27 23:08:56,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 274 transitions, 844 flow [2024-01-27 23:08:56,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 274 transitions, 837 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:08:56,862 INFO L231 Difference]: Finished difference. Result has 232 places, 232 transitions, 524 flow [2024-01-27 23:08:56,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=232, PETRI_TRANSITIONS=232} [2024-01-27 23:08:56,864 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -30 predicate places. [2024-01-27 23:08:56,864 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 232 transitions, 524 flow [2024-01-27 23:08:56,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:56,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:56,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:56,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 23:08:56,865 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 23:08:56,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1987202594, now seen corresponding path program 1 times [2024-01-27 23:08:56,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:56,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934799761] [2024-01-27 23:08:56,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:56,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:56,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:56,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934799761] [2024-01-27 23:08:56,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934799761] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:56,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:56,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:56,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124393792] [2024-01-27 23:08:56,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:56,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:56,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:56,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:56,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:56,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 263 [2024-01-27 23:08:56,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 232 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:56,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:56,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 263 [2024-01-27 23:08:56,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:58,621 INFO L124 PetriNetUnfolderBase]: 8307/23858 cut-off events. [2024-01-27 23:08:58,621 INFO L125 PetriNetUnfolderBase]: For 2020/2020 co-relation queries the response was YES. [2024-01-27 23:08:58,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39675 conditions, 23858 events. 8307/23858 cut-off events. For 2020/2020 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 271997 event pairs, 2677 based on Foata normal form. 0/20394 useless extension candidates. Maximal degree in co-relation 22354. Up to 8614 conditions per place. [2024-01-27 23:08:58,739 INFO L140 encePairwiseOnDemand]: 251/263 looper letters, 118 selfloop transitions, 4 changer transitions 0/270 dead transitions. [2024-01-27 23:08:58,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 270 transitions, 871 flow [2024-01-27 23:08:58,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2024-01-27 23:08:58,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.85297845373891 [2024-01-27 23:08:58,741 INFO L175 Difference]: Start difference. First operand has 232 places, 232 transitions, 524 flow. Second operand 3 states and 673 transitions. [2024-01-27 23:08:58,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 270 transitions, 871 flow [2024-01-27 23:08:58,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 270 transitions, 866 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:08:58,746 INFO L231 Difference]: Finished difference. Result has 226 places, 225 transitions, 520 flow [2024-01-27 23:08:58,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=226, PETRI_TRANSITIONS=225} [2024-01-27 23:08:58,748 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -36 predicate places. [2024-01-27 23:08:58,748 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 225 transitions, 520 flow [2024-01-27 23:08:58,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:58,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:58,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:58,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 23:08:58,749 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 23:08:58,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:58,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1473736885, now seen corresponding path program 1 times [2024-01-27 23:08:58,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:58,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403494547] [2024-01-27 23:08:58,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:58,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:08:58,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:58,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403494547] [2024-01-27 23:08:58,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403494547] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:58,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:58,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:58,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006856212] [2024-01-27 23:08:58,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:58,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:58,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:58,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:58,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:58,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 263 [2024-01-27 23:08:58,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 225 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:58,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:58,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 263 [2024-01-27 23:08:58,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:09:00,480 INFO L124 PetriNetUnfolderBase]: 8307/23790 cut-off events. [2024-01-27 23:09:00,480 INFO L125 PetriNetUnfolderBase]: For 2039/2039 co-relation queries the response was YES. [2024-01-27 23:09:00,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40017 conditions, 23790 events. 8307/23790 cut-off events. For 2039/2039 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 270642 event pairs, 2379 based on Foata normal form. 0/20368 useless extension candidates. Maximal degree in co-relation 22478. Up to 9142 conditions per place. [2024-01-27 23:09:00,818 INFO L140 encePairwiseOnDemand]: 256/263 looper letters, 111 selfloop transitions, 5 changer transitions 0/268 dead transitions. [2024-01-27 23:09:00,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 268 transitions, 864 flow [2024-01-27 23:09:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:09:00,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:09:00,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 696 transitions. [2024-01-27 23:09:00,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8821292775665399 [2024-01-27 23:09:00,821 INFO L175 Difference]: Start difference. First operand has 226 places, 225 transitions, 520 flow. Second operand 3 states and 696 transitions. [2024-01-27 23:09:00,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 268 transitions, 864 flow [2024-01-27 23:09:00,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 268 transitions, 860 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:09:00,826 INFO L231 Difference]: Finished difference. Result has 226 places, 225 transitions, 535 flow [2024-01-27 23:09:00,826 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-27 23:09:00,827 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -36 predicate places. [2024-01-27 23:09:00,827 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 225 transitions, 535 flow [2024-01-27 23:09:00,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:09:00,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:09:00,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:09:00,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 23:09:00,828 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 23:09:00,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:09:00,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1558798196, now seen corresponding path program 1 times [2024-01-27 23:09:00,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:09:00,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924427920] [2024-01-27 23:09:00,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:09:00,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:09:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:09:00,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:09:00,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:09:00,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924427920] [2024-01-27 23:09:00,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924427920] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:09:00,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:09:00,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:09:00,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489816076] [2024-01-27 23:09:00,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:09:00,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:09:00,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:09:00,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:09:00,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:09:00,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 263 [2024-01-27 23:09:00,887 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-27 23:09:00,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:09:00,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 263 [2024-01-27 23:09:00,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:09:03,128 INFO L124 PetriNetUnfolderBase]: 8307/23769 cut-off events. [2024-01-27 23:09:03,129 INFO L125 PetriNetUnfolderBase]: For 2425/2425 co-relation queries the response was YES. [2024-01-27 23:09:03,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40517 conditions, 23769 events. 8307/23769 cut-off events. For 2425/2425 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 271552 event pairs, 7296 based on Foata normal form. 3/20349 useless extension candidates. Maximal degree in co-relation 22712. Up to 13412 conditions per place. [2024-01-27 23:09:03,243 INFO L140 encePairwiseOnDemand]: 244/263 looper letters, 78 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2024-01-27 23:09:03,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 208 transitions, 661 flow [2024-01-27 23:09:03,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:09:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:09:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 612 transitions. [2024-01-27 23:09:03,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7756653992395437 [2024-01-27 23:09:03,245 INFO L175 Difference]: Start difference. First operand has 226 places, 225 transitions, 535 flow. Second operand 3 states and 612 transitions. [2024-01-27 23:09:03,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 208 transitions, 661 flow [2024-01-27 23:09:03,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 208 transitions, 656 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:09:03,250 INFO L231 Difference]: Finished difference. Result has 210 places, 208 transitions, 500 flow [2024-01-27 23:09:03,251 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-27 23:09:03,251 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -52 predicate places. [2024-01-27 23:09:03,251 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 208 transitions, 500 flow [2024-01-27 23:09:03,252 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-27 23:09:03,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:09:03,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:09:03,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 23:09:03,252 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 23:09:03,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:09:03,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1942248267, now seen corresponding path program 1 times [2024-01-27 23:09:03,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:09:03,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348467118] [2024-01-27 23:09:03,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:09:03,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:09:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:09:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:09:03,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:09:03,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348467118] [2024-01-27 23:09:03,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348467118] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:09:03,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:09:03,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 23:09:03,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627192193] [2024-01-27 23:09:03,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:09:03,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:09:03,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:09:03,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:09:03,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:09:03,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 263 [2024-01-27 23:09:03,329 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-27 23:09:03,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:09:03,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 263 [2024-01-27 23:09:03,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:09:05,329 INFO L124 PetriNetUnfolderBase]: 8308/23777 cut-off events. [2024-01-27 23:09:05,329 INFO L125 PetriNetUnfolderBase]: For 2425/2425 co-relation queries the response was YES. [2024-01-27 23:09:05,380 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 627. Compared 271723 event pairs, 7296 based on Foata normal form. 1/20355 useless extension candidates. Maximal degree in co-relation 40180. Up to 13430 conditions per place. [2024-01-27 23:09:05,451 INFO L140 encePairwiseOnDemand]: 259/263 looper letters, 71 selfloop transitions, 3 changer transitions 0/209 dead transitions. [2024-01-27 23:09:05,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 209 transitions, 650 flow [2024-01-27 23:09:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:09:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:09:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2024-01-27 23:09:05,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8390367553865653 [2024-01-27 23:09:05,453 INFO L175 Difference]: Start difference. First operand has 210 places, 208 transitions, 500 flow. Second operand 3 states and 662 transitions. [2024-01-27 23:09:05,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 209 transitions, 650 flow [2024-01-27 23:09:05,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 209 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:09:05,458 INFO L231 Difference]: Finished difference. Result has 210 places, 209 transitions, 511 flow [2024-01-27 23:09:05,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=511, PETRI_PLACES=210, PETRI_TRANSITIONS=209} [2024-01-27 23:09:05,459 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -52 predicate places. [2024-01-27 23:09:05,459 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 209 transitions, 511 flow [2024-01-27 23:09:05,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:09:05,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:09:05,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:09:05,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 23:09:05,460 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 23:09:05,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:09:05,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1810148476, now seen corresponding path program 1 times [2024-01-27 23:09:05,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:09:05,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798149839] [2024-01-27 23:09:05,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:09:05,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:09:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:09:05,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 23:09:05,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:09:05,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798149839] [2024-01-27 23:09:05,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798149839] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:09:05,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:09:05,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:09:05,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443864137] [2024-01-27 23:09:05,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:09:05,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:09:05,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:09:05,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:09:05,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:09:05,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 263 [2024-01-27 23:09:05,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 209 transitions, 511 flow. Second operand has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:09:05,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:09:05,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 263 [2024-01-27 23:09:05,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:09:07,482 INFO L124 PetriNetUnfolderBase]: 8308/23780 cut-off events. [2024-01-27 23:09:07,483 INFO L125 PetriNetUnfolderBase]: For 2442/2442 co-relation queries the response was YES. [2024-01-27 23:09:07,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40336 conditions, 23780 events. 8308/23780 cut-off events. For 2442/2442 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 271713 event pairs, 7296 based on Foata normal form. 2/20362 useless extension candidates. Maximal degree in co-relation 40192. Up to 13427 conditions per place. [2024-01-27 23:09:07,598 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 74 selfloop transitions, 5 changer transitions 0/211 dead transitions. [2024-01-27 23:09:07,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 211 transitions, 685 flow [2024-01-27 23:09:07,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 23:09:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 23:09:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1051 transitions. [2024-01-27 23:09:07,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7992395437262357 [2024-01-27 23:09:07,609 INFO L175 Difference]: Start difference. First operand has 210 places, 209 transitions, 511 flow. Second operand 5 states and 1051 transitions. [2024-01-27 23:09:07,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 211 transitions, 685 flow [2024-01-27 23:09:07,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 211 transitions, 682 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:09:07,630 INFO L231 Difference]: Finished difference. Result has 214 places, 210 transitions, 541 flow [2024-01-27 23:09:07,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=541, PETRI_PLACES=214, PETRI_TRANSITIONS=210} [2024-01-27 23:09:07,631 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -48 predicate places. [2024-01-27 23:09:07,632 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 210 transitions, 541 flow [2024-01-27 23:09:07,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:09:07,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:09:07,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:09:07,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 23:09:07,633 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-27 23:09:07,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:09:07,633 INFO L85 PathProgramCache]: Analyzing trace with hash -280022376, now seen corresponding path program 1 times [2024-01-27 23:09:07,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:09:07,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137396411] [2024-01-27 23:09:07,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:09:07,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:09:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:09:07,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 23:09:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:09:07,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 23:09:07,730 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 23:09:07,731 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 172 remaining) [2024-01-27 23:09:07,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 172 remaining) [2024-01-27 23:09:07,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 172 remaining) [2024-01-27 23:09:07,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 172 remaining) [2024-01-27 23:09:07,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 172 remaining) [2024-01-27 23:09:07,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 172 remaining) [2024-01-27 23:09:07,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 172 remaining) [2024-01-27 23:09:07,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 172 remaining) [2024-01-27 23:09:07,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 172 remaining) [2024-01-27 23:09:07,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 172 remaining) [2024-01-27 23:09:07,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 172 remaining) [2024-01-27 23:09:07,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 172 remaining) [2024-01-27 23:09:07,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 172 remaining) [2024-01-27 23:09:07,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 172 remaining) [2024-01-27 23:09:07,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 172 remaining) [2024-01-27 23:09:07,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 172 remaining) [2024-01-27 23:09:07,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 172 remaining) [2024-01-27 23:09:07,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 172 remaining) [2024-01-27 23:09:07,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 172 remaining) [2024-01-27 23:09:07,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 172 remaining) [2024-01-27 23:09:07,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 172 remaining) [2024-01-27 23:09:07,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 172 remaining) [2024-01-27 23:09:07,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 172 remaining) [2024-01-27 23:09:07,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 172 remaining) [2024-01-27 23:09:07,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 172 remaining) [2024-01-27 23:09:07,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 172 remaining) [2024-01-27 23:09:07,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 172 remaining) [2024-01-27 23:09:07,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 172 remaining) [2024-01-27 23:09:07,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 172 remaining) [2024-01-27 23:09:07,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 172 remaining) [2024-01-27 23:09:07,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 172 remaining) [2024-01-27 23:09:07,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 172 remaining) [2024-01-27 23:09:07,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 172 remaining) [2024-01-27 23:09:07,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 172 remaining) [2024-01-27 23:09:07,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 172 remaining) [2024-01-27 23:09:07,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 172 remaining) [2024-01-27 23:09:07,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 172 remaining) [2024-01-27 23:09:07,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 172 remaining) [2024-01-27 23:09:07,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 172 remaining) [2024-01-27 23:09:07,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 172 remaining) [2024-01-27 23:09:07,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 172 remaining) [2024-01-27 23:09:07,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 172 remaining) [2024-01-27 23:09:07,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 172 remaining) [2024-01-27 23:09:07,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 172 remaining) [2024-01-27 23:09:07,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 172 remaining) [2024-01-27 23:09:07,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 172 remaining) [2024-01-27 23:09:07,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 172 remaining) [2024-01-27 23:09:07,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 172 remaining) [2024-01-27 23:09:07,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 172 remaining) [2024-01-27 23:09:07,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 172 remaining) [2024-01-27 23:09:07,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 172 remaining) [2024-01-27 23:09:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 172 remaining) [2024-01-27 23:09:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 172 remaining) [2024-01-27 23:09:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 172 remaining) [2024-01-27 23:09:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 172 remaining) [2024-01-27 23:09:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 172 remaining) [2024-01-27 23:09:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 172 remaining) [2024-01-27 23:09:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 172 remaining) [2024-01-27 23:09:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 172 remaining) [2024-01-27 23:09:07,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 172 remaining) [2024-01-27 23:09:07,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 172 remaining) [2024-01-27 23:09:07,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 172 remaining) [2024-01-27 23:09:07,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 172 remaining) [2024-01-27 23:09:07,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 172 remaining) [2024-01-27 23:09:07,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 172 remaining) [2024-01-27 23:09:07,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 172 remaining) [2024-01-27 23:09:07,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 172 remaining) [2024-01-27 23:09:07,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 172 remaining) [2024-01-27 23:09:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 172 remaining) [2024-01-27 23:09:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 172 remaining) [2024-01-27 23:09:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 172 remaining) [2024-01-27 23:09:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 172 remaining) [2024-01-27 23:09:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 172 remaining) [2024-01-27 23:09:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 172 remaining) [2024-01-27 23:09:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 172 remaining) [2024-01-27 23:09:07,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 172 remaining) [2024-01-27 23:09:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 172 remaining) [2024-01-27 23:09:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 172 remaining) [2024-01-27 23:09:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 172 remaining) [2024-01-27 23:09:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 172 remaining) [2024-01-27 23:09:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 172 remaining) [2024-01-27 23:09:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 172 remaining) [2024-01-27 23:09:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 172 remaining) [2024-01-27 23:09:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 172 remaining) [2024-01-27 23:09:07,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 172 remaining) [2024-01-27 23:09:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 172 remaining) [2024-01-27 23:09:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 172 remaining) [2024-01-27 23:09:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 172 remaining) [2024-01-27 23:09:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 172 remaining) [2024-01-27 23:09:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 172 remaining) [2024-01-27 23:09:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 172 remaining) [2024-01-27 23:09:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 172 remaining) [2024-01-27 23:09:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 172 remaining) [2024-01-27 23:09:07,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 172 remaining) [2024-01-27 23:09:07,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 172 remaining) [2024-01-27 23:09:07,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 172 remaining) [2024-01-27 23:09:07,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 172 remaining) [2024-01-27 23:09:07,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 172 remaining) [2024-01-27 23:09:07,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 172 remaining) [2024-01-27 23:09:07,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 172 remaining) [2024-01-27 23:09:07,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 172 remaining) [2024-01-27 23:09:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 172 remaining) [2024-01-27 23:09:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 172 remaining) [2024-01-27 23:09:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 172 remaining) [2024-01-27 23:09:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 172 remaining) [2024-01-27 23:09:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 172 remaining) [2024-01-27 23:09:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 172 remaining) [2024-01-27 23:09:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 172 remaining) [2024-01-27 23:09:07,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 172 remaining) [2024-01-27 23:09:07,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 172 remaining) [2024-01-27 23:09:07,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 172 remaining) [2024-01-27 23:09:07,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 172 remaining) [2024-01-27 23:09:07,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 172 remaining) [2024-01-27 23:09:07,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 172 remaining) [2024-01-27 23:09:07,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 172 remaining) [2024-01-27 23:09:07,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 172 remaining) [2024-01-27 23:09:07,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 172 remaining) [2024-01-27 23:09:07,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 172 remaining) [2024-01-27 23:09:07,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 172 remaining) [2024-01-27 23:09:07,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION (52 of 172 remaining) [2024-01-27 23:09:07,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 172 remaining) [2024-01-27 23:09:07,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 172 remaining) [2024-01-27 23:09:07,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 172 remaining) [2024-01-27 23:09:07,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 172 remaining) [2024-01-27 23:09:07,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 172 remaining) [2024-01-27 23:09:07,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 172 remaining) [2024-01-27 23:09:07,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 172 remaining) [2024-01-27 23:09:07,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 172 remaining) [2024-01-27 23:09:07,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 172 remaining) [2024-01-27 23:09:07,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 172 remaining) [2024-01-27 23:09:07,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 172 remaining) [2024-01-27 23:09:07,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 172 remaining) [2024-01-27 23:09:07,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 172 remaining) [2024-01-27 23:09:07,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 172 remaining) [2024-01-27 23:09:07,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 172 remaining) [2024-01-27 23:09:07,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 172 remaining) [2024-01-27 23:09:07,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 172 remaining) [2024-01-27 23:09:07,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 172 remaining) [2024-01-27 23:09:07,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 172 remaining) [2024-01-27 23:09:07,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 172 remaining) [2024-01-27 23:09:07,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 172 remaining) [2024-01-27 23:09:07,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 172 remaining) [2024-01-27 23:09:07,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 172 remaining) [2024-01-27 23:09:07,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 172 remaining) [2024-01-27 23:09:07,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 172 remaining) [2024-01-27 23:09:07,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 172 remaining) [2024-01-27 23:09:07,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 172 remaining) [2024-01-27 23:09:07,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 172 remaining) [2024-01-27 23:09:07,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 172 remaining) [2024-01-27 23:09:07,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 172 remaining) [2024-01-27 23:09:07,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 172 remaining) [2024-01-27 23:09:07,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 172 remaining) [2024-01-27 23:09:07,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 172 remaining) [2024-01-27 23:09:07,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 172 remaining) [2024-01-27 23:09:07,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 172 remaining) [2024-01-27 23:09:07,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 172 remaining) [2024-01-27 23:09:07,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 172 remaining) [2024-01-27 23:09:07,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 172 remaining) [2024-01-27 23:09:07,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 172 remaining) [2024-01-27 23:09:07,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 172 remaining) [2024-01-27 23:09:07,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 172 remaining) [2024-01-27 23:09:07,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 172 remaining) [2024-01-27 23:09:07,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 172 remaining) [2024-01-27 23:09:07,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 172 remaining) [2024-01-27 23:09:07,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 172 remaining) [2024-01-27 23:09:07,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 172 remaining) [2024-01-27 23:09:07,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 172 remaining) [2024-01-27 23:09:07,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 172 remaining) [2024-01-27 23:09:07,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 172 remaining) [2024-01-27 23:09:07,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 172 remaining) [2024-01-27 23:09:07,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 172 remaining) [2024-01-27 23:09:07,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 172 remaining) [2024-01-27 23:09:07,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 23:09:07,784 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:09:07,791 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 23:09:07,791 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 23:09:07,877 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-27 23:09:07,907 INFO L503 ceAbstractionStarter]: Automizer considered 119 witness invariants [2024-01-27 23:09:07,908 INFO L504 ceAbstractionStarter]: WitnessConsidered=119 [2024-01-27 23:09:07,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:09:07 BasicIcfg [2024-01-27 23:09:07,908 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 23:09:07,909 INFO L158 Benchmark]: Toolchain (without parser) took 19580.80ms. Allocated memory was 281.0MB in the beginning and 7.1GB in the end (delta: 6.8GB). Free memory was 244.7MB in the beginning and 5.6GB in the end (delta: -5.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-01-27 23:09:07,909 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 140.5MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:09:07,909 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 140.5MB. Free memory is still 97.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:09:07,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.23ms. Allocated memory is still 281.0MB. Free memory was 244.7MB in the beginning and 222.8MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-01-27 23:09:07,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.56ms. Allocated memory is still 281.0MB. Free memory was 222.8MB in the beginning and 218.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 23:09:07,910 INFO L158 Benchmark]: Boogie Preprocessor took 85.91ms. Allocated memory is still 281.0MB. Free memory was 218.6MB in the beginning and 215.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 23:09:07,910 INFO L158 Benchmark]: RCFGBuilder took 1059.87ms. Allocated memory is still 281.0MB. Free memory was 215.4MB in the beginning and 239.3MB in the end (delta: -23.9MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2024-01-27 23:09:07,910 INFO L158 Benchmark]: TraceAbstraction took 18005.12ms. Allocated memory was 281.0MB in the beginning and 7.1GB in the end (delta: 6.8GB). Free memory was 239.3MB in the beginning and 5.6GB in the end (delta: -5.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-01-27 23:09:07,911 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.15ms. Allocated memory is still 140.5MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.09ms. Allocated memory is still 140.5MB. Free memory is still 97.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.23ms. Allocated memory is still 281.0MB. Free memory was 244.7MB in the beginning and 222.8MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.56ms. Allocated memory is still 281.0MB. Free memory was 222.8MB in the beginning and 218.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.91ms. Allocated memory is still 281.0MB. Free memory was 218.6MB in the beginning and 215.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1059.87ms. Allocated memory is still 281.0MB. Free memory was 215.4MB in the beginning and 239.3MB in the end (delta: -23.9MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * TraceAbstraction took 18005.12ms. Allocated memory was 281.0MB in the beginning and 7.1GB in the end (delta: 6.8GB). Free memory was 239.3MB in the beginning and 5.6GB in the end (delta: -5.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 116]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L39] int* A; [L40] int bag1, bag2, cap1, cap2, sum1, sum2, i, j, N; [L80] pthread_t t1, t2; VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[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[N],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cap1],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[bag1],IntegerLiteral[0]]]] 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[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[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[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[A],IntegerLiteral[0]]]] [L83] bag1 = __VERIFIER_nondet_int() [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[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[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[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}] [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[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[i],IntegerLiteral[0]]]] [L84] bag2 = __VERIFIER_nondet_int() [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[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[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[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[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[j],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[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[i],IntegerLiteral[0]]]] [L85] cap1 = __VERIFIER_nondet_int() [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[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[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[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[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[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]]]] [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[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[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[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[A],IntegerLiteral[0]]]] [L87] sum1 = __VERIFIER_nondet_int() [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[sum2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] 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[i],IntegerLiteral[0]]]] [L88] sum2 = __VERIFIER_nondet_int() [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[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[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[i],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[j],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]]]] [L90] j = __VERIFIER_nondet_int() [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L91] N = __VERIFIER_nondet_int() [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L92] CALL create_fresh_int_array(N) [L109] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L109] CALL assume_abort_if_not(size >= 0) [L36] COND FALSE !(!cond) [L109] RET assume_abort_if_not(size >= 0) [L110] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L110] CALL assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE !(!cond) [L110] RET assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L112] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L112] int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L113] int i = 0; VAL [A={0:0}, N=0, \old(size)=0, arr={-1:0}, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, i=0, j=0, size=0, sum1=0, sum2=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=0, arr={-1:0}, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, i=0, j=0, size=0, sum1=0, sum2=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[16LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[7],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[14LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[6],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[12LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[10LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[8LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[6LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[4LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[2LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [A={0:0}, N=0, \old(size)=0, arr={-1:0}, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, i=0, j=0, size=0, sum1=0, sum2=0] [L113] COND FALSE !(i < size) [L116] CodeAnnotStmt[Assertion[BinaryExpression[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, j=0, size=0, sum1=0, sum2=0] [L116] CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]]] 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: 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: 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.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 564 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 392 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1600 IncrementalHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 39 mSDtfsCounter, 1600 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=541occurred in iteration=12, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 339 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-27 23:09:07,966 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