./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 ab2e0ac4 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-ab2e0ac-m [2024-01-29 14:18:30,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 14:18:30,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 14:18:30,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 14:18:30,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 14:18:30,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 14:18:30,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 14:18:30,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 14:18:30,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 14:18:30,856 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 14:18:30,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 14:18:30,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 14:18:30,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 14:18:30,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 14:18:30,858 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 14:18:30,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 14:18:30,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 14:18:30,872 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 14:18:30,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 14:18:30,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 14:18:30,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 14:18:30,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 14:18:30,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 14:18:30,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 14:18:30,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 14:18:30,874 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 14:18:30,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 14:18:30,874 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 14:18:30,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 14:18:30,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 14:18:30,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 14:18:30,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 14:18:30,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:18:30,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 14:18:30,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 14:18:30,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 14:18:30,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 14:18:30,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 14:18:30,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 14:18:30,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 14:18:30,877 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 14:18:30,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 14:18:30,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 14:18:30,878 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-29 14:18:31,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 14:18:31,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 14:18:31,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 14:18:31,103 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 14:18:31,104 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 14:18:31,104 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-29 14:18:31,281 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 14:18:31,281 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 14:18:31,282 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-29 14:18:32,300 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 14:18:32,475 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 14:18:32,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2024-01-29 14:18:32,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a083dc7/403accc8d0c14f128fad5bce52b204ca/FLAG576db31bb [2024-01-29 14:18:32,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a083dc7/403accc8d0c14f128fad5bce52b204ca [2024-01-29 14:18:32,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 14:18:32,498 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 14:18:32,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 14:18:32,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 14:18:32,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 14:18:32,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:18:31" (1/2) ... [2024-01-29 14:18:32,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337479de and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:32, skipping insertion in model container [2024-01-29 14:18:32,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:18:31" (1/2) ... [2024-01-29 14:18:32,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@776d8d82 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:18:32, skipping insertion in model container [2024-01-29 14:18:32,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:18:32" (2/2) ... [2024-01-29 14:18:32,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337479de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:32, skipping insertion in model container [2024-01-29 14:18:32,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:18:32" (2/2) ... [2024-01-29 14:18:32,509 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 14:18:32,531 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 14:18:32,534 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (unsigned long )_argptr == 0UL [2024-01-29 14:18:32,534 INFO L98 nessWitnessExtractor]: Loop invariant at [L63-L74] (unsigned long )_argptr == 0UL [2024-01-29 14:18:32,534 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-29 14:18:32,534 INFO L98 nessWitnessExtractor]: Location invariant before [L121-L121] 1 <= b [2024-01-29 14:18:32,534 INFO L98 nessWitnessExtractor]: Location invariant before [L121-L121] b != 0 [2024-01-29 14:18:32,535 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (unsigned long )_argptr == 0UL [2024-01-29 14:18:32,535 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] A == 0 [2024-01-29 14:18:32,535 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-29 14:18:32,535 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] A == 0 [2024-01-29 14:18:32,536 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] N == 0 [2024-01-29 14:18:32,536 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] i == 0 [2024-01-29 14:18:32,536 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] j == 0 [2024-01-29 14:18:32,536 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] sum2 == 0 [2024-01-29 14:18:32,536 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] i == 0 [2024-01-29 14:18:32,536 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] N == 0 [2024-01-29 14:18:32,536 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cap2 == 0 [2024-01-29 14:18:32,537 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] A == 0 [2024-01-29 14:18:32,537 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] sum1 == 0 [2024-01-29 14:18:32,537 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] sum2 == 0 [2024-01-29 14:18:32,537 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] bag2 == 0 [2024-01-29 14:18:32,537 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] cap1 == 0 [2024-01-29 14:18:32,538 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] j == 0 [2024-01-29 14:18:32,538 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L55] (unsigned long )_argptr == 0UL [2024-01-29 14:18:32,538 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] N == 0 [2024-01-29 14:18:32,538 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] sum2 == 0 [2024-01-29 14:18:32,538 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] sum1 == 0 [2024-01-29 14:18:32,538 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] i == 0 [2024-01-29 14:18:32,538 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] A == 0 [2024-01-29 14:18:32,539 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] j == 0 [2024-01-29 14:18:32,539 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-29 14:18:32,539 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] A == 0 [2024-01-29 14:18:32,539 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] 0 <= i [2024-01-29 14:18:32,539 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] (long long )i - (long long )size >= 0LL [2024-01-29 14:18:32,539 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cap2 == 0 [2024-01-29 14:18:32,539 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] i == 0 [2024-01-29 14:18:32,540 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] cap1 == 0 [2024-01-29 14:18:32,540 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] N == 0 [2024-01-29 14:18:32,540 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] A == 0 [2024-01-29 14:18:32,541 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] sum1 == 0 [2024-01-29 14:18:32,541 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] j == 0 [2024-01-29 14:18:32,541 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] sum2 == 0 [2024-01-29 14:18:32,541 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] (-1LL - (long long )i) + (long long )size >= 0LL [2024-01-29 14:18:32,541 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] size != 0 [2024-01-29 14:18:32,541 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-29 14:18:32,542 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] A == 0 [2024-01-29 14:18:32,542 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] A == 0 [2024-01-29 14:18:32,542 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] A == 0 [2024-01-29 14:18:32,542 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-01-29 14:18:32,542 INFO L98 nessWitnessExtractor]: Loop invariant at [L46-L57] (unsigned long )_argptr == 0UL [2024-01-29 14:18:32,577 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-29 14:18:32,577 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-29 14:18:32,577 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-29 14:18:32,577 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-29 14:18:32,578 INFO L98 nessWitnessExtractor]: Loop invariant at [L113-L115] A == 0 [2024-01-29 14:18:32,578 INFO L98 nessWitnessExtractor]: Location invariant before [L112-L112] A == 0 [2024-01-29 14:18:32,578 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] cap2 == 0 [2024-01-29 14:18:32,578 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] A == 0 [2024-01-29 14:18:32,579 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] sum2 == 0 [2024-01-29 14:18:32,579 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] j == 0 [2024-01-29 14:18:32,579 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] i == 0 [2024-01-29 14:18:32,579 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] N == 0 [2024-01-29 14:18:32,579 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] sum1 == 0 [2024-01-29 14:18:32,579 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] i == 0 [2024-01-29 14:18:32,579 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] N == 0 [2024-01-29 14:18:32,579 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] A == 0 [2024-01-29 14:18:32,579 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] j == 0 [2024-01-29 14:18:32,579 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-29 14:18:32,580 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L72] (unsigned long )_argptr == 0UL [2024-01-29 14:18:32,580 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] b != 0 [2024-01-29 14:18:32,580 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] b <= -1 [2024-01-29 14:18:32,580 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-29 14:18:32,580 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] bag2 == 0 [2024-01-29 14:18:32,580 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] sum1 == 0 [2024-01-29 14:18:32,580 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] N == 0 [2024-01-29 14:18:32,580 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] A == 0 [2024-01-29 14:18:32,580 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] sum2 == 0 [2024-01-29 14:18:32,581 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] bag1 == 0 [2024-01-29 14:18:32,581 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] i == 0 [2024-01-29 14:18:32,581 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cap1 == 0 [2024-01-29 14:18:32,581 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] cap2 == 0 [2024-01-29 14:18:32,581 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] j == 0 [2024-01-29 14:18:32,581 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] A == 0 [2024-01-29 14:18:32,581 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] j == 0 [2024-01-29 14:18:32,581 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] N == 0 [2024-01-29 14:18:32,581 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-29 14:18:32,581 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] N == 0 [2024-01-29 14:18:32,581 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] A == 0 [2024-01-29 14:18:32,581 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] A == 0 [2024-01-29 14:18:32,606 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 14:18:32,723 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-29 14:18:32,731 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:18:32,739 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 14:18:32,752 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-29 14:18:32,820 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-29 14:18:32,849 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:18:32,861 INFO L206 MainTranslator]: Completed translation [2024-01-29 14:18:32,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:32 WrapperNode [2024-01-29 14:18:32,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 14:18:32,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 14:18:32,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 14:18:32,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 14:18:32,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:32" (1/1) ... [2024-01-29 14:18:32,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:32" (1/1) ... [2024-01-29 14:18:32,922 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 408 [2024-01-29 14:18:32,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 14:18:32,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 14:18:32,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 14:18:32,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 14:18:32,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:32" (1/1) ... [2024-01-29 14:18:32,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:32" (1/1) ... [2024-01-29 14:18:32,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:32" (1/1) ... [2024-01-29 14:18:32,970 INFO L175 MemorySlicer]: Split 13 memory accesses to 4 slices as follows [2, 2, 2, 7]. 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-29 14:18:32,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:32" (1/1) ... [2024-01-29 14:18:32,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:32" (1/1) ... [2024-01-29 14:18:32,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:32" (1/1) ... [2024-01-29 14:18:33,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:32" (1/1) ... [2024-01-29 14:18:33,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:32" (1/1) ... [2024-01-29 14:18:33,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:32" (1/1) ... [2024-01-29 14:18:33,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 14:18:33,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 14:18:33,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 14:18:33,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 14:18:33,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:32" (1/1) ... [2024-01-29 14:18:33,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:18:33,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:18:33,040 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-29 14:18:33,054 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-29 14:18:33,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 14:18:33,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 14:18:33,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 14:18:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 14:18:33,081 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 14:18:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 14:18:33,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 14:18:33,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 14:18:33,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 14:18:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 14:18:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 14:18:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 14:18:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 14:18:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 14:18:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-29 14:18:33,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 14:18:33,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 14:18:33,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 14:18:33,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 14:18:33,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 14:18:33,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 14:18:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 14:18:33,098 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 14:18:33,200 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 14:18:33,202 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 14:18:33,775 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 14:18:33,775 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 14:18:33,969 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 14:18:33,969 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-29 14:18:33,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:18:33 BoogieIcfgContainer [2024-01-29 14:18:33,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 14:18:33,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 14:18:33,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 14:18:33,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 14:18:33,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:18:31" (1/4) ... [2024-01-29 14:18:33,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529ab756 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:18:33, skipping insertion in model container [2024-01-29 14:18:33,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 02:18:32" (2/4) ... [2024-01-29 14:18:33,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529ab756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:18:33, skipping insertion in model container [2024-01-29 14:18:33,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:18:32" (3/4) ... [2024-01-29 14:18:33,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529ab756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:18:33, skipping insertion in model container [2024-01-29 14:18:33,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:18:33" (4/4) ... [2024-01-29 14:18:33,977 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2024-01-29 14:18:33,991 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 14:18:33,991 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 120 error locations. [2024-01-29 14:18:33,991 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 14:18:34,085 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 14:18:34,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 263 transitions, 540 flow [2024-01-29 14:18:34,160 INFO L124 PetriNetUnfolderBase]: 5/261 cut-off events. [2024-01-29 14:18:34,161 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 14:18:34,167 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-29 14:18:34,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 265 places, 263 transitions, 540 flow [2024-01-29 14:18:34,172 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 262 places, 260 transitions, 532 flow [2024-01-29 14:18:34,179 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 14:18:34,183 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;@70a97122, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 14:18:34,183 INFO L358 AbstractCegarLoop]: Starting to check reachability of 172 error locations. [2024-01-29 14:18:34,185 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 14:18:34,185 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 14:18:34,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:18:34,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:34,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 14:18:34,186 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 14:18:34,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:34,190 INFO L85 PathProgramCache]: Analyzing trace with hash 42637, now seen corresponding path program 1 times [2024-01-29 14:18:34,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:34,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409942359] [2024-01-29 14:18:34,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:34,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:34,459 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-29 14:18:34,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:34,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409942359] [2024-01-29 14:18:34,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409942359] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:34,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:34,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:34,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751301741] [2024-01-29 14:18:34,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:34,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:34,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:34,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:34,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:34,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 263 [2024-01-29 14:18:34,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 260 transitions, 532 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-29 14:18:34,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:34,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 263 [2024-01-29 14:18:34,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:35,355 INFO L124 PetriNetUnfolderBase]: 2157/6156 cut-off events. [2024-01-29 14:18:35,356 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2024-01-29 14:18:35,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9746 conditions, 6156 events. 2157/6156 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 55172 event pairs, 915 based on Foata normal form. 0/5234 useless extension candidates. Maximal degree in co-relation 9186. Up to 1760 conditions per place. [2024-01-29 14:18:35,396 INFO L140 encePairwiseOnDemand]: 251/263 looper letters, 106 selfloop transitions, 4 changer transitions 0/293 dead transitions. [2024-01-29 14:18:35,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 293 transitions, 824 flow [2024-01-29 14:18:35,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:35,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2024-01-29 14:18:35,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.85297845373891 [2024-01-29 14:18:35,417 INFO L175 Difference]: Start difference. First operand has 262 places, 260 transitions, 532 flow. Second operand 3 states and 673 transitions. [2024-01-29 14:18:35,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 293 transitions, 824 flow [2024-01-29 14:18:35,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 293 transitions, 812 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 14:18:35,430 INFO L231 Difference]: Finished difference. Result has 253 places, 253 transitions, 524 flow [2024-01-29 14:18:35,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=253, PETRI_TRANSITIONS=253} [2024-01-29 14:18:35,437 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -9 predicate places. [2024-01-29 14:18:35,437 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 253 transitions, 524 flow [2024-01-29 14:18:35,437 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-29 14:18:35,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:35,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 14:18:35,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 14:18:35,438 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 14:18:35,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:35,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1322941, now seen corresponding path program 1 times [2024-01-29 14:18:35,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:35,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997882475] [2024-01-29 14:18:35,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:35,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:35,473 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-29 14:18:35,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:35,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997882475] [2024-01-29 14:18:35,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997882475] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:35,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:35,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:35,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29023901] [2024-01-29 14:18:35,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:35,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:35,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:35,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:35,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:35,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 263 [2024-01-29 14:18:35,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 253 transitions, 524 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-29 14:18:35,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:35,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 263 [2024-01-29 14:18:35,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:36,195 INFO L124 PetriNetUnfolderBase]: 2157/6152 cut-off events. [2024-01-29 14:18:36,196 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-01-29 14:18:36,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9799 conditions, 6152 events. 2157/6152 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 55451 event pairs, 1833 based on Foata normal form. 0/5230 useless extension candidates. Maximal degree in co-relation 4748. Up to 3501 conditions per place. [2024-01-29 14:18:36,223 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 62 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2024-01-29 14:18:36,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 249 transitions, 644 flow [2024-01-29 14:18:36,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:36,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2024-01-29 14:18:36,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.826362484157161 [2024-01-29 14:18:36,225 INFO L175 Difference]: Start difference. First operand has 253 places, 253 transitions, 524 flow. Second operand 3 states and 652 transitions. [2024-01-29 14:18:36,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 249 transitions, 644 flow [2024-01-29 14:18:36,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 249 transitions, 640 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:18:36,229 INFO L231 Difference]: Finished difference. Result has 250 places, 249 transitions, 516 flow [2024-01-29 14:18:36,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=250, PETRI_TRANSITIONS=249} [2024-01-29 14:18:36,230 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -12 predicate places. [2024-01-29 14:18:36,230 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 249 transitions, 516 flow [2024-01-29 14:18:36,230 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-29 14:18:36,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:36,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 14:18:36,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 14:18:36,231 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 14:18:36,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:36,232 INFO L85 PathProgramCache]: Analyzing trace with hash 41012416, now seen corresponding path program 1 times [2024-01-29 14:18:36,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:36,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943687025] [2024-01-29 14:18:36,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:36,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:36,254 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-29 14:18:36,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:36,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943687025] [2024-01-29 14:18:36,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943687025] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:36,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:36,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:36,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532849725] [2024-01-29 14:18:36,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:36,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:36,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:36,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:36,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:36,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 263 [2024-01-29 14:18:36,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 249 transitions, 516 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-29 14:18:36,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:36,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 263 [2024-01-29 14:18:36,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:36,775 INFO L124 PetriNetUnfolderBase]: 2157/6149 cut-off events. [2024-01-29 14:18:36,775 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 14:18:36,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9760 conditions, 6149 events. 2157/6149 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 55560 event pairs, 1833 based on Foata normal form. 0/5230 useless extension candidates. Maximal degree in co-relation 9687. Up to 3502 conditions per place. [2024-01-29 14:18:36,807 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 63 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2024-01-29 14:18:36,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 246 transitions, 640 flow [2024-01-29 14:18:36,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2024-01-29 14:18:36,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.826362484157161 [2024-01-29 14:18:36,809 INFO L175 Difference]: Start difference. First operand has 250 places, 249 transitions, 516 flow. Second operand 3 states and 652 transitions. [2024-01-29 14:18:36,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 246 transitions, 640 flow [2024-01-29 14:18:36,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 246 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:36,812 INFO L231 Difference]: Finished difference. Result has 247 places, 246 transitions, 510 flow [2024-01-29 14:18:36,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=247, PETRI_TRANSITIONS=246} [2024-01-29 14:18:36,814 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -15 predicate places. [2024-01-29 14:18:36,814 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 246 transitions, 510 flow [2024-01-29 14:18:36,814 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-29 14:18:36,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:36,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 14:18:36,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 14:18:36,815 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 14:18:36,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:36,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1271386181, now seen corresponding path program 1 times [2024-01-29 14:18:36,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:36,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749692223] [2024-01-29 14:18:36,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:36,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:36,836 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-29 14:18:36,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:36,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749692223] [2024-01-29 14:18:36,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749692223] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:36,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:36,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:36,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988217588] [2024-01-29 14:18:36,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:36,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:36,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:36,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:36,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:36,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 263 [2024-01-29 14:18:36,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 246 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 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-29 14:18:36,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:36,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 263 [2024-01-29 14:18:36,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:37,778 INFO L124 PetriNetUnfolderBase]: 3958/11308 cut-off events. [2024-01-29 14:18:37,779 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2024-01-29 14:18:37,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18000 conditions, 11308 events. 3958/11308 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 111322 event pairs, 1731 based on Foata normal form. 0/9683 useless extension candidates. Maximal degree in co-relation 17944. Up to 3321 conditions per place. [2024-01-29 14:18:37,931 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 108 selfloop transitions, 4 changer transitions 0/283 dead transitions. [2024-01-29 14:18:37,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 283 transitions, 815 flow [2024-01-29 14:18:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 681 transitions. [2024-01-29 14:18:37,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8631178707224335 [2024-01-29 14:18:37,933 INFO L175 Difference]: Start difference. First operand has 247 places, 246 transitions, 510 flow. Second operand 3 states and 681 transitions. [2024-01-29 14:18:37,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 283 transitions, 815 flow [2024-01-29 14:18:37,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 283 transitions, 811 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:37,937 INFO L231 Difference]: Finished difference. Result has 241 places, 240 transitions, 508 flow [2024-01-29 14:18:37,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=241, PETRI_TRANSITIONS=240} [2024-01-29 14:18:37,938 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -21 predicate places. [2024-01-29 14:18:37,938 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 240 transitions, 508 flow [2024-01-29 14:18:37,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 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-29 14:18:37,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:37,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 14:18:37,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 14:18:37,939 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 14:18:37,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:37,939 INFO L85 PathProgramCache]: Analyzing trace with hash 758267242, now seen corresponding path program 1 times [2024-01-29 14:18:37,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:37,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786468577] [2024-01-29 14:18:37,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:37,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:37,958 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-29 14:18:37,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:37,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786468577] [2024-01-29 14:18:37,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786468577] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:37,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:37,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:37,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298739853] [2024-01-29 14:18:37,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:37,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:37,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:37,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:37,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:37,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 263 [2024-01-29 14:18:37,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 240 transitions, 508 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-29 14:18:37,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:37,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 263 [2024-01-29 14:18:37,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:38,817 INFO L124 PetriNetUnfolderBase]: 3958/11259 cut-off events. [2024-01-29 14:18:38,818 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-01-29 14:18:38,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18159 conditions, 11259 events. 3958/11259 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 110320 event pairs, 1629 based on Foata normal form. 0/9660 useless extension candidates. Maximal degree in co-relation 8933. Up to 3574 conditions per place. [2024-01-29 14:18:38,870 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 102 selfloop transitions, 5 changer transitions 0/282 dead transitions. [2024-01-29 14:18:38,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 282 transitions, 813 flow [2024-01-29 14:18:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:38,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2024-01-29 14:18:38,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8897338403041825 [2024-01-29 14:18:38,872 INFO L175 Difference]: Start difference. First operand has 241 places, 240 transitions, 508 flow. Second operand 3 states and 702 transitions. [2024-01-29 14:18:38,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 282 transitions, 813 flow [2024-01-29 14:18:38,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 282 transitions, 809 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:18:38,876 INFO L231 Difference]: Finished difference. Result has 242 places, 241 transitions, 525 flow [2024-01-29 14:18:38,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=239, 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=525, PETRI_PLACES=242, PETRI_TRANSITIONS=241} [2024-01-29 14:18:38,877 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -20 predicate places. [2024-01-29 14:18:38,878 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 241 transitions, 525 flow [2024-01-29 14:18:38,878 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-29 14:18:38,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:38,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:38,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 14:18:38,878 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 14:18:38,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:38,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2031449405, now seen corresponding path program 1 times [2024-01-29 14:18:38,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:38,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423081942] [2024-01-29 14:18:38,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:38,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:38,896 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-29 14:18:38,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:38,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423081942] [2024-01-29 14:18:38,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423081942] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:38,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:38,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:38,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908985524] [2024-01-29 14:18:38,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:38,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:38,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:38,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:38,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:38,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 263 [2024-01-29 14:18:38,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 241 transitions, 525 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:38,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:38,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 263 [2024-01-29 14:18:38,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:40,179 INFO L124 PetriNetUnfolderBase]: 5752/16477 cut-off events. [2024-01-29 14:18:40,179 INFO L125 PetriNetUnfolderBase]: For 636/636 co-relation queries the response was YES. [2024-01-29 14:18:40,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26994 conditions, 16477 events. 5752/16477 cut-off events. For 636/636 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 175279 event pairs, 2907 based on Foata normal form. 0/14128 useless extension candidates. Maximal degree in co-relation 13222. Up to 5250 conditions per place. [2024-01-29 14:18:40,371 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 107 selfloop transitions, 5 changer transitions 0/276 dead transitions. [2024-01-29 14:18:40,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 276 transitions, 838 flow [2024-01-29 14:18:40,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:40,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:40,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 677 transitions. [2024-01-29 14:18:40,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8580481622306717 [2024-01-29 14:18:40,375 INFO L175 Difference]: Start difference. First operand has 242 places, 241 transitions, 525 flow. Second operand 3 states and 677 transitions. [2024-01-29 14:18:40,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 276 transitions, 838 flow [2024-01-29 14:18:40,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 276 transitions, 831 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:18:40,379 INFO L231 Difference]: Finished difference. Result has 238 places, 237 transitions, 531 flow [2024-01-29 14:18:40,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=238, PETRI_TRANSITIONS=237} [2024-01-29 14:18:40,381 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -24 predicate places. [2024-01-29 14:18:40,381 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 237 transitions, 531 flow [2024-01-29 14:18:40,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:40,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:40,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:40,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 14:18:40,382 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 14:18:40,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:40,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1449576677, now seen corresponding path program 1 times [2024-01-29 14:18:40,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:40,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132204528] [2024-01-29 14:18:40,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:40,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:40,442 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-29 14:18:40,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:40,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132204528] [2024-01-29 14:18:40,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132204528] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:40,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:40,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:40,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8213321] [2024-01-29 14:18:40,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:40,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:40,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:40,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:40,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:40,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 263 [2024-01-29 14:18:40,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 237 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:40,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:40,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 263 [2024-01-29 14:18:40,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:41,890 INFO L124 PetriNetUnfolderBase]: 5752/16602 cut-off events. [2024-01-29 14:18:41,892 INFO L125 PetriNetUnfolderBase]: For 1054/1054 co-relation queries the response was YES. [2024-01-29 14:18:41,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27647 conditions, 16602 events. 5752/16602 cut-off events. For 1054/1054 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 178502 event pairs, 5163 based on Foata normal form. 3/14196 useless extension candidates. Maximal degree in co-relation 15343. Up to 9357 conditions per place. [2024-01-29 14:18:41,973 INFO L140 encePairwiseOnDemand]: 244/263 looper letters, 75 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2024-01-29 14:18:41,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 220 transitions, 651 flow [2024-01-29 14:18:41,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 610 transitions. [2024-01-29 14:18:41,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7731305449936628 [2024-01-29 14:18:41,976 INFO L175 Difference]: Start difference. First operand has 238 places, 237 transitions, 531 flow. Second operand 3 states and 610 transitions. [2024-01-29 14:18:41,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 220 transitions, 651 flow [2024-01-29 14:18:41,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 220 transitions, 646 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:18:41,980 INFO L231 Difference]: Finished difference. Result has 222 places, 220 transitions, 496 flow [2024-01-29 14:18:41,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=222, PETRI_TRANSITIONS=220} [2024-01-29 14:18:41,980 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -40 predicate places. [2024-01-29 14:18:41,981 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 220 transitions, 496 flow [2024-01-29 14:18:41,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:41,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:41,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:41,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 14:18:41,982 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 14:18:41,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:41,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1987202594, now seen corresponding path program 1 times [2024-01-29 14:18:41,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:41,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045538709] [2024-01-29 14:18:41,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:41,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:41,998 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-29 14:18:41,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:41,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045538709] [2024-01-29 14:18:41,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045538709] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:41,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:41,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:41,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475429097] [2024-01-29 14:18:41,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:41,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:42,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:42,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:42,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:42,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 263 [2024-01-29 14:18:42,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 220 transitions, 496 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-29 14:18:42,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:42,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 263 [2024-01-29 14:18:42,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:43,402 INFO L124 PetriNetUnfolderBase]: 5752/16593 cut-off events. [2024-01-29 14:18:43,402 INFO L125 PetriNetUnfolderBase]: For 1052/1052 co-relation queries the response was YES. [2024-01-29 14:18:43,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27348 conditions, 16593 events. 5752/16593 cut-off events. For 1052/1052 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 178223 event pairs, 5163 based on Foata normal form. 0/14189 useless extension candidates. Maximal degree in co-relation 27217. Up to 9364 conditions per place. [2024-01-29 14:18:43,459 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 72 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-01-29 14:18:43,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 211 transitions, 626 flow [2024-01-29 14:18:43,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2024-01-29 14:18:43,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8010139416983524 [2024-01-29 14:18:43,466 INFO L175 Difference]: Start difference. First operand has 222 places, 220 transitions, 496 flow. Second operand 3 states and 632 transitions. [2024-01-29 14:18:43,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 211 transitions, 626 flow [2024-01-29 14:18:43,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 211 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:43,476 INFO L231 Difference]: Finished difference. Result has 213 places, 211 transitions, 478 flow [2024-01-29 14:18:43,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=213, PETRI_TRANSITIONS=211} [2024-01-29 14:18:43,479 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -49 predicate places. [2024-01-29 14:18:43,479 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 211 transitions, 478 flow [2024-01-29 14:18:43,479 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-29 14:18:43,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:43,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:43,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 14:18:43,480 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 14:18:43,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:43,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1473736885, now seen corresponding path program 1 times [2024-01-29 14:18:43,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:43,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146562316] [2024-01-29 14:18:43,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:43,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:43,505 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-29 14:18:43,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:43,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146562316] [2024-01-29 14:18:43,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146562316] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:43,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:43,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:43,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837251073] [2024-01-29 14:18:43,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:43,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:43,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:43,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:43,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:43,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 263 [2024-01-29 14:18:43,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 211 transitions, 478 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-29 14:18:43,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:43,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 263 [2024-01-29 14:18:43,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:45,398 INFO L124 PetriNetUnfolderBase]: 8307/23059 cut-off events. [2024-01-29 14:18:45,398 INFO L125 PetriNetUnfolderBase]: For 1284/1284 co-relation queries the response was YES. [2024-01-29 14:18:45,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38482 conditions, 23059 events. 8307/23059 cut-off events. For 1284/1284 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 257258 event pairs, 4073 based on Foata normal form. 0/19890 useless extension candidates. Maximal degree in co-relation 38393. Up to 7208 conditions per place. [2024-01-29 14:18:45,485 INFO L140 encePairwiseOnDemand]: 253/263 looper letters, 108 selfloop transitions, 5 changer transitions 0/247 dead transitions. [2024-01-29 14:18:45,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 247 transitions, 795 flow [2024-01-29 14:18:45,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:45,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 681 transitions. [2024-01-29 14:18:45,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8631178707224335 [2024-01-29 14:18:45,487 INFO L175 Difference]: Start difference. First operand has 213 places, 211 transitions, 478 flow. Second operand 3 states and 681 transitions. [2024-01-29 14:18:45,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 247 transitions, 795 flow [2024-01-29 14:18:45,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 247 transitions, 791 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:18:45,493 INFO L231 Difference]: Finished difference. Result has 209 places, 208 transitions, 487 flow [2024-01-29 14:18:45,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=209, PETRI_TRANSITIONS=208} [2024-01-29 14:18:45,494 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -53 predicate places. [2024-01-29 14:18:45,494 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 208 transitions, 487 flow [2024-01-29 14:18:45,495 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-29 14:18:45,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:45,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:45,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 14:18:45,495 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 14:18:45,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:45,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1558798196, now seen corresponding path program 1 times [2024-01-29 14:18:45,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:45,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786683886] [2024-01-29 14:18:45,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:45,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:45,541 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-29 14:18:45,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:45,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786683886] [2024-01-29 14:18:45,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786683886] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:45,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:45,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:18:45,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458816060] [2024-01-29 14:18:45,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:45,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:45,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:45,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:45,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:45,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 263 [2024-01-29 14:18:45,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 208 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 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-29 14:18:45,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:45,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 263 [2024-01-29 14:18:45,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:47,336 INFO L124 PetriNetUnfolderBase]: 8307/23773 cut-off events. [2024-01-29 14:18:47,336 INFO L125 PetriNetUnfolderBase]: For 2040/2040 co-relation queries the response was YES. [2024-01-29 14:18:47,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40195 conditions, 23773 events. 8307/23773 cut-off events. For 2040/2040 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 270084 event pairs, 2379 based on Foata normal form. 1/20362 useless extension candidates. Maximal degree in co-relation 22608. Up to 9142 conditions per place. [2024-01-29 14:18:47,468 INFO L140 encePairwiseOnDemand]: 256/263 looper letters, 110 selfloop transitions, 5 changer transitions 0/251 dead transitions. [2024-01-29 14:18:47,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 251 transitions, 831 flow [2024-01-29 14:18:47,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2024-01-29 14:18:47,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8846641318124208 [2024-01-29 14:18:47,470 INFO L175 Difference]: Start difference. First operand has 209 places, 208 transitions, 487 flow. Second operand 3 states and 698 transitions. [2024-01-29 14:18:47,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 251 transitions, 831 flow [2024-01-29 14:18:47,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 251 transitions, 824 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:18:47,476 INFO L231 Difference]: Finished difference. Result has 209 places, 208 transitions, 501 flow [2024-01-29 14:18:47,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=209, PETRI_TRANSITIONS=208} [2024-01-29 14:18:47,476 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -53 predicate places. [2024-01-29 14:18:47,477 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 208 transitions, 501 flow [2024-01-29 14:18:47,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 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-29 14:18:47,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:47,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:47,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 14:18:47,478 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 14:18:47,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:47,478 INFO L85 PathProgramCache]: Analyzing trace with hash 62653126, now seen corresponding path program 1 times [2024-01-29 14:18:47,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:47,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922594381] [2024-01-29 14:18:47,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:47,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:18:47,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-29 14:18:47,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:18:47,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922594381] [2024-01-29 14:18:47,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922594381] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:18:47,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:18:47,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 14:18:47,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830833613] [2024-01-29 14:18:47,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:18:47,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:18:47,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:18:47,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:18:47,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:18:47,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 263 [2024-01-29 14:18:47,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 208 transitions, 501 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 14:18:47,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:18:47,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 263 [2024-01-29 14:18:47,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:18:49,449 INFO L124 PetriNetUnfolderBase]: 8308/23777 cut-off events. [2024-01-29 14:18:49,450 INFO L125 PetriNetUnfolderBase]: For 2425/2425 co-relation queries the response was YES. [2024-01-29 14:18:49,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40519 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 271652 event pairs, 7296 based on Foata normal form. 1/20354 useless extension candidates. Maximal degree in co-relation 22712. Up to 13430 conditions per place. [2024-01-29 14:18:49,563 INFO L140 encePairwiseOnDemand]: 259/263 looper letters, 71 selfloop transitions, 3 changer transitions 0/209 dead transitions. [2024-01-29 14:18:49,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 209 transitions, 651 flow [2024-01-29 14:18:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:18:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:18:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2024-01-29 14:18:49,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8390367553865653 [2024-01-29 14:18:49,568 INFO L175 Difference]: Start difference. First operand has 209 places, 208 transitions, 501 flow. Second operand 3 states and 662 transitions. [2024-01-29 14:18:49,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 209 transitions, 651 flow [2024-01-29 14:18:49,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 209 transitions, 646 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:18:49,586 INFO L231 Difference]: Finished difference. Result has 210 places, 209 transitions, 511 flow [2024-01-29 14:18:49,589 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-29 14:18:49,589 INFO L281 CegarLoopForPetriNet]: 262 programPoint places, -52 predicate places. [2024-01-29 14:18:49,604 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 209 transitions, 511 flow [2024-01-29 14:18:49,604 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-29 14:18:49,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:18:49,605 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-29 14:18:49,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 14:18:49,605 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (and 169 more)] === [2024-01-29 14:18:49,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:18:49,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1810148343, now seen corresponding path program 1 times [2024-01-29 14:18:49,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:18:49,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686357416] [2024-01-29 14:18:49,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:18:49,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:18:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:18:49,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 14:18:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:18:49,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 14:18:49,671 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 14:18:49,672 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 172 remaining) [2024-01-29 14:18:49,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 172 remaining) [2024-01-29 14:18:49,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 172 remaining) [2024-01-29 14:18:49,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 172 remaining) [2024-01-29 14:18:49,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 172 remaining) [2024-01-29 14:18:49,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 172 remaining) [2024-01-29 14:18:49,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 172 remaining) [2024-01-29 14:18:49,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 172 remaining) [2024-01-29 14:18:49,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 172 remaining) [2024-01-29 14:18:49,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 172 remaining) [2024-01-29 14:18:49,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 172 remaining) [2024-01-29 14:18:49,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 172 remaining) [2024-01-29 14:18:49,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 172 remaining) [2024-01-29 14:18:49,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 172 remaining) [2024-01-29 14:18:49,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 172 remaining) [2024-01-29 14:18:49,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 172 remaining) [2024-01-29 14:18:49,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 172 remaining) [2024-01-29 14:18:49,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 172 remaining) [2024-01-29 14:18:49,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 172 remaining) [2024-01-29 14:18:49,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 172 remaining) [2024-01-29 14:18:49,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 172 remaining) [2024-01-29 14:18:49,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 172 remaining) [2024-01-29 14:18:49,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 172 remaining) [2024-01-29 14:18:49,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 172 remaining) [2024-01-29 14:18:49,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 172 remaining) [2024-01-29 14:18:49,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 172 remaining) [2024-01-29 14:18:49,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (145 of 172 remaining) [2024-01-29 14:18:49,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 172 remaining) [2024-01-29 14:18:49,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 172 remaining) [2024-01-29 14:18:49,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 172 remaining) [2024-01-29 14:18:49,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 172 remaining) [2024-01-29 14:18:49,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 172 remaining) [2024-01-29 14:18:49,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 172 remaining) [2024-01-29 14:18:49,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 172 remaining) [2024-01-29 14:18:49,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 172 remaining) [2024-01-29 14:18:49,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 172 remaining) [2024-01-29 14:18:49,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 172 remaining) [2024-01-29 14:18:49,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 172 remaining) [2024-01-29 14:18:49,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 172 remaining) [2024-01-29 14:18:49,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 172 remaining) [2024-01-29 14:18:49,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 172 remaining) [2024-01-29 14:18:49,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 172 remaining) [2024-01-29 14:18:49,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 172 remaining) [2024-01-29 14:18:49,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 172 remaining) [2024-01-29 14:18:49,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 172 remaining) [2024-01-29 14:18:49,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 172 remaining) [2024-01-29 14:18:49,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 172 remaining) [2024-01-29 14:18:49,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 172 remaining) [2024-01-29 14:18:49,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 172 remaining) [2024-01-29 14:18:49,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 172 remaining) [2024-01-29 14:18:49,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 172 remaining) [2024-01-29 14:18:49,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 172 remaining) [2024-01-29 14:18:49,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 172 remaining) [2024-01-29 14:18:49,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 172 remaining) [2024-01-29 14:18:49,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 172 remaining) [2024-01-29 14:18:49,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 172 remaining) [2024-01-29 14:18:49,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 172 remaining) [2024-01-29 14:18:49,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 172 remaining) [2024-01-29 14:18:49,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 172 remaining) [2024-01-29 14:18:49,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 172 remaining) [2024-01-29 14:18:49,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 172 remaining) [2024-01-29 14:18:49,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 172 remaining) [2024-01-29 14:18:49,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 172 remaining) [2024-01-29 14:18:49,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 172 remaining) [2024-01-29 14:18:49,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 172 remaining) [2024-01-29 14:18:49,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 172 remaining) [2024-01-29 14:18:49,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 172 remaining) [2024-01-29 14:18:49,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 172 remaining) [2024-01-29 14:18:49,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 172 remaining) [2024-01-29 14:18:49,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 172 remaining) [2024-01-29 14:18:49,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 172 remaining) [2024-01-29 14:18:49,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 172 remaining) [2024-01-29 14:18:49,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 172 remaining) [2024-01-29 14:18:49,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 172 remaining) [2024-01-29 14:18:49,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 172 remaining) [2024-01-29 14:18:49,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 172 remaining) [2024-01-29 14:18:49,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 172 remaining) [2024-01-29 14:18:49,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 172 remaining) [2024-01-29 14:18:49,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 172 remaining) [2024-01-29 14:18:49,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 172 remaining) [2024-01-29 14:18:49,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 172 remaining) [2024-01-29 14:18:49,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 172 remaining) [2024-01-29 14:18:49,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 172 remaining) [2024-01-29 14:18:49,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 172 remaining) [2024-01-29 14:18:49,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 172 remaining) [2024-01-29 14:18:49,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 172 remaining) [2024-01-29 14:18:49,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 172 remaining) [2024-01-29 14:18:49,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 172 remaining) [2024-01-29 14:18:49,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 172 remaining) [2024-01-29 14:18:49,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 172 remaining) [2024-01-29 14:18:49,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 172 remaining) [2024-01-29 14:18:49,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 172 remaining) [2024-01-29 14:18:49,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 172 remaining) [2024-01-29 14:18:49,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 172 remaining) [2024-01-29 14:18:49,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 172 remaining) [2024-01-29 14:18:49,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 172 remaining) [2024-01-29 14:18:49,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 172 remaining) [2024-01-29 14:18:49,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 172 remaining) [2024-01-29 14:18:49,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 172 remaining) [2024-01-29 14:18:49,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 172 remaining) [2024-01-29 14:18:49,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 172 remaining) [2024-01-29 14:18:49,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 172 remaining) [2024-01-29 14:18:49,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 172 remaining) [2024-01-29 14:18:49,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 172 remaining) [2024-01-29 14:18:49,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 172 remaining) [2024-01-29 14:18:49,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 172 remaining) [2024-01-29 14:18:49,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 172 remaining) [2024-01-29 14:18:49,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 172 remaining) [2024-01-29 14:18:49,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 172 remaining) [2024-01-29 14:18:49,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 172 remaining) [2024-01-29 14:18:49,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 172 remaining) [2024-01-29 14:18:49,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 172 remaining) [2024-01-29 14:18:49,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 172 remaining) [2024-01-29 14:18:49,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 172 remaining) [2024-01-29 14:18:49,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 172 remaining) [2024-01-29 14:18:49,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 172 remaining) [2024-01-29 14:18:49,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 172 remaining) [2024-01-29 14:18:49,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 172 remaining) [2024-01-29 14:18:49,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 172 remaining) [2024-01-29 14:18:49,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION (52 of 172 remaining) [2024-01-29 14:18:49,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 172 remaining) [2024-01-29 14:18:49,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 172 remaining) [2024-01-29 14:18:49,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 172 remaining) [2024-01-29 14:18:49,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 172 remaining) [2024-01-29 14:18:49,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 172 remaining) [2024-01-29 14:18:49,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 172 remaining) [2024-01-29 14:18:49,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 172 remaining) [2024-01-29 14:18:49,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 172 remaining) [2024-01-29 14:18:49,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 172 remaining) [2024-01-29 14:18:49,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 172 remaining) [2024-01-29 14:18:49,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 172 remaining) [2024-01-29 14:18:49,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 172 remaining) [2024-01-29 14:18:49,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 172 remaining) [2024-01-29 14:18:49,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 172 remaining) [2024-01-29 14:18:49,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 172 remaining) [2024-01-29 14:18:49,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 172 remaining) [2024-01-29 14:18:49,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 172 remaining) [2024-01-29 14:18:49,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 172 remaining) [2024-01-29 14:18:49,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 172 remaining) [2024-01-29 14:18:49,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 172 remaining) [2024-01-29 14:18:49,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 172 remaining) [2024-01-29 14:18:49,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 172 remaining) [2024-01-29 14:18:49,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 172 remaining) [2024-01-29 14:18:49,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 172 remaining) [2024-01-29 14:18:49,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 172 remaining) [2024-01-29 14:18:49,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 172 remaining) [2024-01-29 14:18:49,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 172 remaining) [2024-01-29 14:18:49,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 172 remaining) [2024-01-29 14:18:49,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 172 remaining) [2024-01-29 14:18:49,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err19ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 172 remaining) [2024-01-29 14:18:49,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 172 remaining) [2024-01-29 14:18:49,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 172 remaining) [2024-01-29 14:18:49,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 172 remaining) [2024-01-29 14:18:49,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 172 remaining) [2024-01-29 14:18:49,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 172 remaining) [2024-01-29 14:18:49,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 172 remaining) [2024-01-29 14:18:49,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 172 remaining) [2024-01-29 14:18:49,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 172 remaining) [2024-01-29 14:18:49,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 172 remaining) [2024-01-29 14:18:49,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 172 remaining) [2024-01-29 14:18:49,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 172 remaining) [2024-01-29 14:18:49,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 172 remaining) [2024-01-29 14:18:49,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 172 remaining) [2024-01-29 14:18:49,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 172 remaining) [2024-01-29 14:18:49,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 172 remaining) [2024-01-29 14:18:49,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 172 remaining) [2024-01-29 14:18:49,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 172 remaining) [2024-01-29 14:18:49,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 172 remaining) [2024-01-29 14:18:49,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 172 remaining) [2024-01-29 14:18:49,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 172 remaining) [2024-01-29 14:18:49,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 172 remaining) [2024-01-29 14:18:49,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 172 remaining) [2024-01-29 14:18:49,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 14:18:49,698 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:18:49,706 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 14:18:49,706 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 14:18:49,752 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-29 14:18:49,760 INFO L503 ceAbstractionStarter]: Automizer considered 119 witness invariants [2024-01-29 14:18:49,760 INFO L504 ceAbstractionStarter]: WitnessConsidered=119 [2024-01-29 14:18:49,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 02:18:49 BasicIcfg [2024-01-29 14:18:49,761 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 14:18:49,761 INFO L158 Benchmark]: Toolchain (without parser) took 17263.23ms. Allocated memory was 174.1MB in the beginning and 9.5GB in the end (delta: 9.3GB). Free memory was 98.3MB in the beginning and 8.1GB in the end (delta: -8.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-01-29 14:18:49,761 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 94.4MB. Free memory is still 54.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:18:49,761 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:18:49,762 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.63ms. Allocated memory is still 174.1MB. Free memory was 98.1MB in the beginning and 127.7MB in the end (delta: -29.6MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-01-29 14:18:49,762 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.35ms. Allocated memory is still 174.1MB. Free memory was 127.7MB in the beginning and 124.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 14:18:49,762 INFO L158 Benchmark]: Boogie Preprocessor took 87.21ms. Allocated memory is still 174.1MB. Free memory was 124.1MB in the beginning and 120.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 14:18:49,762 INFO L158 Benchmark]: RCFGBuilder took 956.58ms. Allocated memory is still 174.1MB. Free memory was 120.5MB in the beginning and 102.2MB in the end (delta: 18.3MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. [2024-01-29 14:18:49,762 INFO L158 Benchmark]: TraceAbstraction took 15789.22ms. Allocated memory was 174.1MB in the beginning and 9.5GB in the end (delta: 9.3GB). Free memory was 101.9MB in the beginning and 8.1GB in the end (delta: -8.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-01-29 14:18:49,763 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 94.4MB. Free memory is still 54.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.63ms. Allocated memory is still 174.1MB. Free memory was 98.1MB in the beginning and 127.7MB in the end (delta: -29.6MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.35ms. Allocated memory is still 174.1MB. Free memory was 127.7MB in the beginning and 124.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.21ms. Allocated memory is still 174.1MB. Free memory was 124.1MB in the beginning and 120.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 956.58ms. Allocated memory is still 174.1MB. Free memory was 120.5MB in the beginning and 102.2MB in the end (delta: 18.3MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15789.22ms. Allocated memory was 174.1MB in the beginning and 9.5GB in the end (delta: 9.3GB). Free memory was 101.9MB in the beginning and 8.1GB in the end (delta: -8.0GB). Peak memory consumption was 1.3GB. 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[j],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[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[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[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[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[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L83] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[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[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[bag2],IntegerLiteral[0]]]] [L83] bag1 = __VERIFIER_nondet_int() [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[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[bag2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L84] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[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[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[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[i],IntegerLiteral[0]]]] [L84] bag2 = __VERIFIER_nondet_int() [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[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[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[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[i],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L85] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]]] [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[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[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[sum2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L86] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cap2],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[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[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[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[sum2],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L87] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] [L87] sum1 = __VERIFIER_nondet_int() [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[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]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L88] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L88] sum2 = __VERIFIER_nondet_int() [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[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[N],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=0, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L89] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]] [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[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, j=0, sum1=0, sum2=0, t1={5:0}, t2={3:0}] [L91] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]] [L91] N = __VERIFIER_nondet_int() [L92] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L92] CALL create_fresh_int_array(N) [L109] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L109] CALL assume_abort_if_not(size >= 0) [L36] COND FALSE !(!cond) [L109] RET assume_abort_if_not(size >= 0) [L110] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L110] CALL assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE !(!cond) [L110] RET assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L112] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] [L112] int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L113] int i = 0; VAL [A={0:0}, N=0, \old(size)=0, arr={-1:0}, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, i=0, j=0, size=0, sum1=0, sum2=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[16LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[7],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[14LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[6],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[12LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[10LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[8LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[6LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[4LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[2LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [A={0:0}, N=0, \old(size)=0, arr={-1:0}, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, i=0, j=0, size=0, sum1=0, sum2=0] [L113] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]] VAL [A={0:0}, N=0, \old(size)=0, arr={-1:0}, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, i=0, j=0, size=0, sum1=0, sum2=0] [L113] COND FALSE !(i < size) [L116] CodeAnnotStmt[Assertion[BinaryExpression[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: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 114]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 103]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 369 locations, 172 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 550 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1364 IncrementalHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 37 mSDtfsCounter, 1364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=532occurred in iteration=0, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 14:18:49,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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