./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 3d25acf6 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-3d25acf-m [2024-01-30 14:23:55,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-30 14:23:55,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-30 14:23:55,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-30 14:23:55,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-30 14:23:55,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-30 14:23:55,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-30 14:23:55,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-30 14:23:55,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-30 14:23:55,542 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-30 14:23:55,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-30 14:23:55,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-30 14:23:55,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-30 14:23:55,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-30 14:23:55,545 INFO L153 SettingsManager]: * Use SBE=true [2024-01-30 14:23:55,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-30 14:23:55,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-30 14:23:55,546 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-30 14:23:55,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-30 14:23:55,547 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-30 14:23:55,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-30 14:23:55,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-30 14:23:55,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-30 14:23:55,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-30 14:23:55,548 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-30 14:23:55,548 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-30 14:23:55,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-30 14:23:55,549 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-30 14:23:55,550 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-30 14:23:55,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-30 14:23:55,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-30 14:23:55,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-30 14:23:55,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:23:55,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-30 14:23:55,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-30 14:23:55,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-30 14:23:55,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-30 14:23:55,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-30 14:23:55,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-30 14:23:55,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-30 14:23:55,553 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-30 14:23:55,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-30 14:23:55,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-30 14:23:55,554 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-30 14:23:55,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-30 14:23:55,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-30 14:23:55,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-30 14:23:55,837 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-30 14:23:55,837 INFO L274 PluginConnector]: CDTParser initialized [2024-01-30 14:23:55,838 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-30 14:23:57,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-30 14:23:57,358 INFO L384 CDTParser]: Found 1 translation units. [2024-01-30 14:23:57,359 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2024-01-30 14:23:57,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62e9d89a/747559f68258471da3e3f5fa07adc835/FLAGf4698da4d [2024-01-30 14:23:57,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62e9d89a/747559f68258471da3e3f5fa07adc835 [2024-01-30 14:23:57,391 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-30 14:23:57,392 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-30 14:23:57,395 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-30 14:23:57,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-30 14:23:57,531 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-30 14:23:57,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-30 14:23:57,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-30 14:23:57,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-30 14:23:57,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:23:57" (1/2) ... [2024-01-30 14:23:57,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46986bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:57, skipping insertion in model container [2024-01-30 14:23:57,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:23:57" (1/2) ... [2024-01-30 14:23:57,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7d4129ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:57, skipping insertion in model container [2024-01-30 14:23:57,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:23:57" (2/2) ... [2024-01-30 14:23:57,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46986bbc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:57, skipping insertion in model container [2024-01-30 14:23:57,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:23:57" (2/2) ... [2024-01-30 14:23:57,543 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-30 14:23:57,589 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-30 14:23:57,590 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (((A == 0) && (i == 0)) && (j == 0)) && (N == 0) [2024-01-30 14:23:57,590 INFO L98 nessWitnessExtractor]: Loop invariant at [L46-L57] (unsigned long )_argptr == 0UL [2024-01-30 14:23:57,590 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-30 14:23:57,591 INFO L98 nessWitnessExtractor]: Location invariant before [L116-L116] ((0 <= i) && ((long long )i - (long long )size >= 0LL)) && (A == 0) [2024-01-30 14:23:57,591 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (((((((A == 0) && (cap1 == 0)) && (cap2 == 0)) && (sum1 == 0)) && (sum2 == 0)) && (i == 0)) && (j == 0)) && (N == 0) [2024-01-30 14:23:57,591 INFO L98 nessWitnessExtractor]: Loop invariant at [L63-L74] (unsigned long )_argptr == 0UL [2024-01-30 14:23:57,591 INFO L98 nessWitnessExtractor]: Location invariant before [L109-L109] A == 0 [2024-01-30 14:23:57,591 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] ((((((((A == 0) && (bag2 == 0)) && (cap1 == 0)) && (cap2 == 0)) && (sum1 == 0)) && (sum2 == 0)) && (i == 0)) && (j == 0)) && (N == 0) [2024-01-30 14:23:57,591 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (unsigned long )_argptr == 0UL [2024-01-30 14:23:57,591 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] A == 0 [2024-01-30 14:23:57,591 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] ((A == 0) && (j == 0)) && (N == 0) [2024-01-30 14:23:57,591 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] A == 0 [2024-01-30 14:23:57,592 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-30 14:23:57,592 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-01-30 14:23:57,592 INFO L98 nessWitnessExtractor]: Location invariant before [L120-L120] (b <= -1) && (b != 0) [2024-01-30 14:23:57,592 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-30 14:23:57,592 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (((((A == 0) && (sum1 == 0)) && (sum2 == 0)) && (i == 0)) && (j == 0)) && (N == 0) [2024-01-30 14:23:57,592 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-30 14:23:57,592 INFO L98 nessWitnessExtractor]: Location invariant before [L121-L121] (1 <= b) && (b != 0) [2024-01-30 14:23:57,592 INFO L98 nessWitnessExtractor]: Loop invariant at [L113-L115] (A == 0) && ((((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-30 14:23:57,592 INFO L98 nessWitnessExtractor]: Location invariant before [L114-L114] ((((-1LL - (long long )i) + (long long )size >= 0LL) && (A == 0)) && (size != 0)) && (((((((((((((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-30 14:23:57,592 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-30 14:23:57,592 INFO L98 nessWitnessExtractor]: Location invariant before [L112-L112] A == 0 [2024-01-30 14:23:57,593 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L55] (unsigned long )_argptr == 0UL [2024-01-30 14:23:57,593 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-30 14:23:57,593 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((((A == 0) && (sum2 == 0)) && (i == 0)) && (j == 0)) && (N == 0) [2024-01-30 14:23:57,593 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-01-30 14:23:57,593 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] ((((((A == 0) && (cap2 == 0)) && (sum1 == 0)) && (sum2 == 0)) && (i == 0)) && (j == 0)) && (N == 0) [2024-01-30 14:23:57,593 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-01-30 14:23:57,593 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (A == 0) && (N == 0) [2024-01-30 14:23:57,593 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] (((((((((A == 0) && (bag1 == 0)) && (bag2 == 0)) && (cap1 == 0)) && (cap2 == 0)) && (sum1 == 0)) && (sum2 == 0)) && (i == 0)) && (j == 0)) && (N == 0) [2024-01-30 14:23:57,593 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L72] (unsigned long )_argptr == 0UL [2024-01-30 14:23:57,593 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] A == 0 [2024-01-30 14:23:57,593 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (unsigned long )_argptr == 0UL [2024-01-30 14:23:57,594 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-30 14:23:57,619 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-30 14:23:57,824 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-30 14:23:57,846 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:23:57,858 INFO L202 MainTranslator]: Completed pre-run [2024-01-30 14:23:57,870 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 [2024-01-30 14:23:57,954 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 [2024-01-30 14:23:57,986 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:23:58,010 INFO L206 MainTranslator]: Completed translation [2024-01-30 14:23:58,011 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:58 WrapperNode [2024-01-30 14:23:58,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-30 14:23:58,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-30 14:23:58,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-30 14:23:58,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-30 14:23:58,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:58" (1/1) ... [2024-01-30 14:23:58,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:58" (1/1) ... [2024-01-30 14:23:58,080 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 340 [2024-01-30 14:23:58,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-30 14:23:58,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-30 14:23:58,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-30 14:23:58,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-30 14:23:58,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:58" (1/1) ... [2024-01-30 14:23:58,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:58" (1/1) ... [2024-01-30 14:23:58,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:58" (1/1) ... [2024-01-30 14:23:58,177 INFO L175 MemorySlicer]: Split 13 memory accesses to 4 slices as follows [2, 7, 2, 2]. 54 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-30 14:23:58,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:58" (1/1) ... [2024-01-30 14:23:58,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:58" (1/1) ... [2024-01-30 14:23:58,204 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:58" (1/1) ... [2024-01-30 14:23:58,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:58" (1/1) ... [2024-01-30 14:23:58,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:58" (1/1) ... [2024-01-30 14:23:58,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:58" (1/1) ... [2024-01-30 14:23:58,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-30 14:23:58,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-30 14:23:58,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-30 14:23:58,230 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-30 14:23:58,230 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:58" (1/1) ... [2024-01-30 14:23:58,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:23:58,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:23:58,274 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-30 14:23:58,276 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-30 14:23:58,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-30 14:23:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-30 14:23:58,304 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-30 14:23:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-30 14:23:58,304 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-30 14:23:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-30 14:23:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-30 14:23:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-30 14:23:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-30 14:23:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-30 14:23:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-30 14:23:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-30 14:23:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-30 14:23:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-30 14:23:58,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-30 14:23:58,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-30 14:23:58,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-30 14:23:58,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-30 14:23:58,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-30 14:23:58,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-30 14:23:58,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-30 14:23:58,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-30 14:23:58,308 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-30 14:23:58,413 INFO L244 CfgBuilder]: Building ICFG [2024-01-30 14:23:58,415 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-30 14:23:59,043 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-30 14:23:59,043 INFO L293 CfgBuilder]: Performing block encoding [2024-01-30 14:23:59,395 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-30 14:23:59,396 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-30 14:23:59,397 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:23:59 BoogieIcfgContainer [2024-01-30 14:23:59,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-30 14:23:59,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-30 14:23:59,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-30 14:23:59,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-30 14:23:59,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:23:57" (1/4) ... [2024-01-30 14:23:59,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb4635c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:23:59, skipping insertion in model container [2024-01-30 14:23:59,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:23:57" (2/4) ... [2024-01-30 14:23:59,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb4635c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:23:59, skipping insertion in model container [2024-01-30 14:23:59,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:58" (3/4) ... [2024-01-30 14:23:59,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb4635c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:23:59, skipping insertion in model container [2024-01-30 14:23:59,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:23:59" (4/4) ... [2024-01-30 14:23:59,407 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2024-01-30 14:23:59,425 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-30 14:23:59,425 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2024-01-30 14:23:59,426 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-30 14:23:59,514 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-30 14:23:59,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 127 transitions, 268 flow [2024-01-30 14:23:59,615 INFO L124 PetriNetUnfolderBase]: 5/125 cut-off events. [2024-01-30 14:23:59,616 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-30 14:23:59,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 125 events. 5/125 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 373 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2024-01-30 14:23:59,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 127 transitions, 268 flow [2024-01-30 14:23:59,628 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 124 transitions, 260 flow [2024-01-30 14:23:59,644 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-30 14:23:59,652 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;@2cc2139a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-30 14:23:59,653 INFO L358 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2024-01-30 14:23:59,660 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-30 14:23:59,661 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-30 14:23:59,661 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:23:59,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:59,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-30 14:23:59,662 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-30 14:23:59,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:59,669 INFO L85 PathProgramCache]: Analyzing trace with hash 34164, now seen corresponding path program 1 times [2024-01-30 14:23:59,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:59,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827270496] [2024-01-30 14:23:59,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:59,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:24:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:24:00,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:24:00,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827270496] [2024-01-30 14:24:00,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827270496] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:24:00,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:24:00,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:24:00,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447861273] [2024-01-30 14:24:00,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:24:00,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:24:00,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:24:00,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:24:00,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:24:00,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 127 [2024-01-30 14:24:00,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 124 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-30 14:24:00,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:24:00,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 127 [2024-01-30 14:24:00,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:24:00,779 INFO L124 PetriNetUnfolderBase]: 1317/2903 cut-off events. [2024-01-30 14:24:00,779 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2024-01-30 14:24:00,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5108 conditions, 2903 events. 1317/2903 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 20881 event pairs, 1080 based on Foata normal form. 0/2569 useless extension candidates. Maximal degree in co-relation 4840. Up to 2141 conditions per place. [2024-01-30 14:24:00,804 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 73 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2024-01-30 14:24:00,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 123 transitions, 408 flow [2024-01-30 14:24:00,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:24:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:24:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2024-01-30 14:24:00,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5931758530183727 [2024-01-30 14:24:00,819 INFO L175 Difference]: Start difference. First operand has 126 places, 124 transitions, 260 flow. Second operand 3 states and 226 transitions. [2024-01-30 14:24:00,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 123 transitions, 408 flow [2024-01-30 14:24:00,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 123 transitions, 400 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-30 14:24:00,827 INFO L231 Difference]: Finished difference. Result has 123 places, 123 transitions, 254 flow [2024-01-30 14:24:00,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=123, PETRI_TRANSITIONS=123} [2024-01-30 14:24:00,832 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -3 predicate places. [2024-01-30 14:24:00,833 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 123 transitions, 254 flow [2024-01-30 14:24:00,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-30 14:24:00,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:24:00,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-30 14:24:00,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-30 14:24:00,834 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-30 14:24:00,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:24:00,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1060235, now seen corresponding path program 1 times [2024-01-30 14:24:00,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:24:00,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211493422] [2024-01-30 14:24:00,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:24:00,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:24:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:24:00,988 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-30 14:24:00,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:24:00,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211493422] [2024-01-30 14:24:00,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211493422] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:24:00,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:24:00,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:24:00,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330678648] [2024-01-30 14:24:00,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:24:00,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:24:00,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:24:00,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:24:00,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:24:01,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 127 [2024-01-30 14:24:01,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 123 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-30 14:24:01,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:24:01,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 127 [2024-01-30 14:24:01,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:24:01,411 INFO L124 PetriNetUnfolderBase]: 1317/2902 cut-off events. [2024-01-30 14:24:01,411 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-30 14:24:01,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5067 conditions, 2902 events. 1317/2902 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 20861 event pairs, 1080 based on Foata normal form. 0/2569 useless extension candidates. Maximal degree in co-relation 5058. Up to 2139 conditions per place. [2024-01-30 14:24:01,431 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 72 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2024-01-30 14:24:01,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 122 transitions, 400 flow [2024-01-30 14:24:01,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:24:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:24:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2024-01-30 14:24:01,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5984251968503937 [2024-01-30 14:24:01,438 INFO L175 Difference]: Start difference. First operand has 123 places, 123 transitions, 254 flow. Second operand 3 states and 228 transitions. [2024-01-30 14:24:01,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 122 transitions, 400 flow [2024-01-30 14:24:01,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:24:01,442 INFO L231 Difference]: Finished difference. Result has 122 places, 122 transitions, 252 flow [2024-01-30 14:24:01,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=122, PETRI_TRANSITIONS=122} [2024-01-30 14:24:01,444 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -4 predicate places. [2024-01-30 14:24:01,444 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 122 transitions, 252 flow [2024-01-30 14:24:01,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-30 14:24:01,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:24:01,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-30 14:24:01,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-30 14:24:01,445 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-30 14:24:01,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:24:01,446 INFO L85 PathProgramCache]: Analyzing trace with hash 32868357, now seen corresponding path program 1 times [2024-01-30 14:24:01,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:24:01,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528411933] [2024-01-30 14:24:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:24:01,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:24:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:24:01,530 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-30 14:24:01,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:24:01,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528411933] [2024-01-30 14:24:01,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528411933] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:24:01,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:24:01,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:24:01,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259007850] [2024-01-30 14:24:01,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:24:01,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:24:01,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:24:01,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:24:01,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:24:01,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 127 [2024-01-30 14:24:01,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 122 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-30 14:24:01,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:24:01,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 127 [2024-01-30 14:24:01,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:24:01,953 INFO L124 PetriNetUnfolderBase]: 1317/2901 cut-off events. [2024-01-30 14:24:01,954 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-30 14:24:01,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5065 conditions, 2901 events. 1317/2901 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 20882 event pairs, 1080 based on Foata normal form. 0/2569 useless extension candidates. Maximal degree in co-relation 5054. Up to 2137 conditions per place. [2024-01-30 14:24:01,971 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 71 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2024-01-30 14:24:01,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 121 transitions, 396 flow [2024-01-30 14:24:01,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:24:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:24:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2024-01-30 14:24:01,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6036745406824147 [2024-01-30 14:24:01,974 INFO L175 Difference]: Start difference. First operand has 122 places, 122 transitions, 252 flow. Second operand 3 states and 230 transitions. [2024-01-30 14:24:01,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 121 transitions, 396 flow [2024-01-30 14:24:01,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 121 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:24:01,979 INFO L231 Difference]: Finished difference. Result has 121 places, 121 transitions, 250 flow [2024-01-30 14:24:01,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=121, PETRI_TRANSITIONS=121} [2024-01-30 14:24:01,981 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -5 predicate places. [2024-01-30 14:24:01,981 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 121 transitions, 250 flow [2024-01-30 14:24:01,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-30 14:24:01,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:24:01,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-30 14:24:01,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-30 14:24:01,982 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-30 14:24:01,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:24:01,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1018920109, now seen corresponding path program 1 times [2024-01-30 14:24:01,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:24:01,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077523419] [2024-01-30 14:24:01,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:24:01,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:24:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:24:02,119 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-30 14:24:02,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:24:02,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077523419] [2024-01-30 14:24:02,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077523419] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:24:02,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:24:02,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:24:02,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908510763] [2024-01-30 14:24:02,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:24:02,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:24:02,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:24:02,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:24:02,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:24:02,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 127 [2024-01-30 14:24:02,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 121 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-30 14:24:02,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:24:02,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 127 [2024-01-30 14:24:02,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:24:02,510 INFO L124 PetriNetUnfolderBase]: 1317/2900 cut-off events. [2024-01-30 14:24:02,510 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-30 14:24:02,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5063 conditions, 2900 events. 1317/2900 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 20856 event pairs, 1080 based on Foata normal form. 0/2569 useless extension candidates. Maximal degree in co-relation 5050. Up to 2135 conditions per place. [2024-01-30 14:24:02,525 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 70 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2024-01-30 14:24:02,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 120 transitions, 392 flow [2024-01-30 14:24:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:24:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:24:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2024-01-30 14:24:02,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6089238845144357 [2024-01-30 14:24:02,527 INFO L175 Difference]: Start difference. First operand has 121 places, 121 transitions, 250 flow. Second operand 3 states and 232 transitions. [2024-01-30 14:24:02,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 120 transitions, 392 flow [2024-01-30 14:24:02,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 120 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:24:02,530 INFO L231 Difference]: Finished difference. Result has 120 places, 120 transitions, 248 flow [2024-01-30 14:24:02,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=120, PETRI_TRANSITIONS=120} [2024-01-30 14:24:02,531 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -6 predicate places. [2024-01-30 14:24:02,531 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 120 transitions, 248 flow [2024-01-30 14:24:02,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-30 14:24:02,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:24:02,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-30 14:24:02,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-30 14:24:02,533 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-30 14:24:02,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:24:02,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1521753399, now seen corresponding path program 1 times [2024-01-30 14:24:02,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:24:02,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868637872] [2024-01-30 14:24:02,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:24:02,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:24:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:24:02,595 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-30 14:24:02,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:24:02,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868637872] [2024-01-30 14:24:02,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868637872] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:24:02,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:24:02,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:24:02,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133157245] [2024-01-30 14:24:02,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:24:02,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:24:02,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:24:02,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:24:02,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:24:02,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 127 [2024-01-30 14:24:02,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 120 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-30 14:24:02,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:24:02,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 127 [2024-01-30 14:24:02,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:24:02,914 INFO L124 PetriNetUnfolderBase]: 1317/2899 cut-off events. [2024-01-30 14:24:02,915 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-30 14:24:02,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5061 conditions, 2899 events. 1317/2899 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 20880 event pairs, 1080 based on Foata normal form. 0/2569 useless extension candidates. Maximal degree in co-relation 5046. Up to 2133 conditions per place. [2024-01-30 14:24:02,934 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 69 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2024-01-30 14:24:02,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 388 flow [2024-01-30 14:24:02,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:24:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:24:02,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2024-01-30 14:24:02,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6141732283464567 [2024-01-30 14:24:02,936 INFO L175 Difference]: Start difference. First operand has 120 places, 120 transitions, 248 flow. Second operand 3 states and 234 transitions. [2024-01-30 14:24:02,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 388 flow [2024-01-30 14:24:02,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 119 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:24:02,939 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 246 flow [2024-01-30 14:24:02,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=119, PETRI_TRANSITIONS=119} [2024-01-30 14:24:02,940 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -7 predicate places. [2024-01-30 14:24:02,940 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 246 flow [2024-01-30 14:24:02,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-30 14:24:02,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:24:02,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:24:02,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-30 14:24:02,941 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-30 14:24:02,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:24:02,942 INFO L85 PathProgramCache]: Analyzing trace with hash -70283765, now seen corresponding path program 1 times [2024-01-30 14:24:02,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:24:02,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940055039] [2024-01-30 14:24:02,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:24:02,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:24:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:24:02,992 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-30 14:24:02,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:24:02,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940055039] [2024-01-30 14:24:02,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940055039] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:24:02,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:24:02,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:24:02,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965398855] [2024-01-30 14:24:02,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:24:02,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:24:02,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:24:02,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:24:02,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:24:03,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 127 [2024-01-30 14:24:03,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-30 14:24:03,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:24:03,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 127 [2024-01-30 14:24:03,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:24:03,300 INFO L124 PetriNetUnfolderBase]: 1317/2898 cut-off events. [2024-01-30 14:24:03,300 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-30 14:24:03,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5059 conditions, 2898 events. 1317/2898 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 20862 event pairs, 1080 based on Foata normal form. 0/2569 useless extension candidates. Maximal degree in co-relation 5042. Up to 2131 conditions per place. [2024-01-30 14:24:03,323 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 68 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2024-01-30 14:24:03,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 384 flow [2024-01-30 14:24:03,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:24:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:24:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 236 transitions. [2024-01-30 14:24:03,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6194225721784777 [2024-01-30 14:24:03,325 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 246 flow. Second operand 3 states and 236 transitions. [2024-01-30 14:24:03,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 384 flow [2024-01-30 14:24:03,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 118 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:24:03,328 INFO L231 Difference]: Finished difference. Result has 118 places, 118 transitions, 244 flow [2024-01-30 14:24:03,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=118, PETRI_TRANSITIONS=118} [2024-01-30 14:24:03,331 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -8 predicate places. [2024-01-30 14:24:03,331 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 118 transitions, 244 flow [2024-01-30 14:24:03,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-30 14:24:03,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:24:03,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:24:03,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-30 14:24:03,333 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-30 14:24:03,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:24:03,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2116171683, now seen corresponding path program 1 times [2024-01-30 14:24:03,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:24:03,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715736837] [2024-01-30 14:24:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:24:03,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:24:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:24:03,398 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-30 14:24:03,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:24:03,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715736837] [2024-01-30 14:24:03,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715736837] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:24:03,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:24:03,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:24:03,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679033836] [2024-01-30 14:24:03,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:24:03,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:24:03,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:24:03,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:24:03,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:24:03,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 127 [2024-01-30 14:24:03,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 118 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-30 14:24:03,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:24:03,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 127 [2024-01-30 14:24:03,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:24:03,729 INFO L124 PetriNetUnfolderBase]: 1317/2897 cut-off events. [2024-01-30 14:24:03,729 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-30 14:24:03,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5057 conditions, 2897 events. 1317/2897 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 20862 event pairs, 1080 based on Foata normal form. 0/2569 useless extension candidates. Maximal degree in co-relation 5038. Up to 2129 conditions per place. [2024-01-30 14:24:03,741 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 67 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2024-01-30 14:24:03,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 117 transitions, 380 flow [2024-01-30 14:24:03,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:24:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:24:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2024-01-30 14:24:03,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6246719160104987 [2024-01-30 14:24:03,745 INFO L175 Difference]: Start difference. First operand has 118 places, 118 transitions, 244 flow. Second operand 3 states and 238 transitions. [2024-01-30 14:24:03,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 117 transitions, 380 flow [2024-01-30 14:24:03,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:24:03,750 INFO L231 Difference]: Finished difference. Result has 117 places, 117 transitions, 242 flow [2024-01-30 14:24:03,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=117, PETRI_TRANSITIONS=117} [2024-01-30 14:24:03,751 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -9 predicate places. [2024-01-30 14:24:03,751 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 242 flow [2024-01-30 14:24:03,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-30 14:24:03,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:24:03,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:24:03,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-30 14:24:03,753 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-30 14:24:03,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:24:03,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1176813888, now seen corresponding path program 1 times [2024-01-30 14:24:03,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:24:03,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348564974] [2024-01-30 14:24:03,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:24:03,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:24:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:24:03,804 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-30 14:24:03,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:24:03,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348564974] [2024-01-30 14:24:03,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348564974] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:24:03,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:24:03,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:24:03,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495267901] [2024-01-30 14:24:03,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:24:03,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:24:03,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:24:03,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:24:03,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:24:03,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 127 [2024-01-30 14:24:03,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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-30 14:24:03,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:24:03,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 127 [2024-01-30 14:24:03,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:24:04,146 INFO L124 PetriNetUnfolderBase]: 1254/2827 cut-off events. [2024-01-30 14:24:04,147 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-30 14:24:04,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4882 conditions, 2827 events. 1254/2827 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 20698 event pairs, 1023 based on Foata normal form. 0/2575 useless extension candidates. Maximal degree in co-relation 4861. Up to 2024 conditions per place. [2024-01-30 14:24:04,157 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 65 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2024-01-30 14:24:04,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 374 flow [2024-01-30 14:24:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:24:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:24:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2024-01-30 14:24:04,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6351706036745407 [2024-01-30 14:24:04,159 INFO L175 Difference]: Start difference. First operand has 117 places, 117 transitions, 242 flow. Second operand 3 states and 242 transitions. [2024-01-30 14:24:04,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 374 flow [2024-01-30 14:24:04,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 116 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:24:04,162 INFO L231 Difference]: Finished difference. Result has 116 places, 116 transitions, 240 flow [2024-01-30 14:24:04,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=116, PETRI_TRANSITIONS=116} [2024-01-30 14:24:04,165 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -10 predicate places. [2024-01-30 14:24:04,165 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 116 transitions, 240 flow [2024-01-30 14:24:04,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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-30 14:24:04,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:24:04,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:24:04,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-30 14:24:04,166 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-30 14:24:04,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:24:04,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2121493218, now seen corresponding path program 1 times [2024-01-30 14:24:04,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:24:04,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283819216] [2024-01-30 14:24:04,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:24:04,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:24:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:24:04,224 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-30 14:24:04,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:24:04,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283819216] [2024-01-30 14:24:04,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283819216] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:24:04,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:24:04,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:24:04,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321516542] [2024-01-30 14:24:04,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:24:04,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:24:04,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:24:04,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:24:04,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:24:04,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 127 [2024-01-30 14:24:04,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 116 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-30 14:24:04,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:24:04,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 127 [2024-01-30 14:24:04,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:24:04,516 INFO L124 PetriNetUnfolderBase]: 1194/2766 cut-off events. [2024-01-30 14:24:04,517 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-30 14:24:04,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4722 conditions, 2766 events. 1194/2766 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 20517 event pairs, 969 based on Foata normal form. 0/2583 useless extension candidates. Maximal degree in co-relation 4699. Up to 1924 conditions per place. [2024-01-30 14:24:04,530 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 63 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2024-01-30 14:24:04,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 115 transitions, 368 flow [2024-01-30 14:24:04,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:24:04,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:24:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2024-01-30 14:24:04,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6456692913385826 [2024-01-30 14:24:04,532 INFO L175 Difference]: Start difference. First operand has 116 places, 116 transitions, 240 flow. Second operand 3 states and 246 transitions. [2024-01-30 14:24:04,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 115 transitions, 368 flow [2024-01-30 14:24:04,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 115 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:24:04,534 INFO L231 Difference]: Finished difference. Result has 115 places, 115 transitions, 238 flow [2024-01-30 14:24:04,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=115, PETRI_TRANSITIONS=115} [2024-01-30 14:24:04,535 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -11 predicate places. [2024-01-30 14:24:04,535 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 115 transitions, 238 flow [2024-01-30 14:24:04,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-30 14:24:04,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:24:04,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:24:04,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-30 14:24:04,536 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-30 14:24:04,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:24:04,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1341781460, now seen corresponding path program 1 times [2024-01-30 14:24:04,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:24:04,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290499666] [2024-01-30 14:24:04,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:24:04,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:24:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:24:04,563 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-30 14:24:04,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:24:04,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290499666] [2024-01-30 14:24:04,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290499666] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:24:04,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:24:04,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:24:04,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866853941] [2024-01-30 14:24:04,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:24:04,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:24:04,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:24:04,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:24:04,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:24:04,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 127 [2024-01-30 14:24:04,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 115 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-30 14:24:04,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:24:04,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 127 [2024-01-30 14:24:04,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:24:04,873 INFO L124 PetriNetUnfolderBase]: 1194/2762 cut-off events. [2024-01-30 14:24:04,873 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-30 14:24:04,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4716 conditions, 2762 events. 1194/2762 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 20526 event pairs, 969 based on Foata normal form. 0/2585 useless extension candidates. Maximal degree in co-relation 4691. Up to 1913 conditions per place. [2024-01-30 14:24:04,887 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 61 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-01-30 14:24:04,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 111 transitions, 356 flow [2024-01-30 14:24:04,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:24:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:24:04,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2024-01-30 14:24:04,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6404199475065617 [2024-01-30 14:24:04,890 INFO L175 Difference]: Start difference. First operand has 115 places, 115 transitions, 238 flow. Second operand 3 states and 244 transitions. [2024-01-30 14:24:04,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 111 transitions, 356 flow [2024-01-30 14:24:04,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 111 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:24:04,892 INFO L231 Difference]: Finished difference. Result has 111 places, 111 transitions, 230 flow [2024-01-30 14:24:04,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=111, PETRI_TRANSITIONS=111} [2024-01-30 14:24:04,893 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -15 predicate places. [2024-01-30 14:24:04,893 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 111 transitions, 230 flow [2024-01-30 14:24:04,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-30 14:24:04,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:24:04,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:24:04,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-30 14:24:04,894 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-30 14:24:04,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:24:04,895 INFO L85 PathProgramCache]: Analyzing trace with hash 901368840, now seen corresponding path program 1 times [2024-01-30 14:24:04,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:24:04,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206194350] [2024-01-30 14:24:04,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:24:04,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:24:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:24:04,962 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-30 14:24:04,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:24:04,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206194350] [2024-01-30 14:24:04,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206194350] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:24:04,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:24:04,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:24:04,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414992479] [2024-01-30 14:24:04,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:24:04,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:24:04,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:24:04,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:24:04,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:24:05,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 127 [2024-01-30 14:24:05,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 111 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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-30 14:24:05,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:24:05,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 127 [2024-01-30 14:24:05,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:24:05,274 INFO L124 PetriNetUnfolderBase]: 1195/2765 cut-off events. [2024-01-30 14:24:05,274 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-30 14:24:05,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4722 conditions, 2765 events. 1195/2765 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 20530 event pairs, 969 based on Foata normal form. 0/2587 useless extension candidates. Maximal degree in co-relation 4668. Up to 1913 conditions per place. [2024-01-30 14:24:05,288 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 61 selfloop transitions, 5 changer transitions 0/112 dead transitions. [2024-01-30 14:24:05,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 112 transitions, 364 flow [2024-01-30 14:24:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:24:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:24:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 295 transitions. [2024-01-30 14:24:05,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5807086614173228 [2024-01-30 14:24:05,290 INFO L175 Difference]: Start difference. First operand has 111 places, 111 transitions, 230 flow. Second operand 4 states and 295 transitions. [2024-01-30 14:24:05,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 112 transitions, 364 flow [2024-01-30 14:24:05,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 112 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:24:05,293 INFO L231 Difference]: Finished difference. Result has 112 places, 112 transitions, 245 flow [2024-01-30 14:24:05,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=245, PETRI_PLACES=112, PETRI_TRANSITIONS=112} [2024-01-30 14:24:05,294 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -14 predicate places. [2024-01-30 14:24:05,294 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 112 transitions, 245 flow [2024-01-30 14:24:05,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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-30 14:24:05,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:24:05,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:24:05,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-30 14:24:05,295 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-30 14:24:05,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:24:05,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1367902649, now seen corresponding path program 1 times [2024-01-30 14:24:05,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:24:05,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498024344] [2024-01-30 14:24:05,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:24:05,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:24:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:24:05,393 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-30 14:24:05,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:24:05,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498024344] [2024-01-30 14:24:05,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498024344] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:24:05,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:24:05,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:24:05,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122420890] [2024-01-30 14:24:05,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:24:05,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-30 14:24:05,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:24:05,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-30 14:24:05,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-30 14:24:05,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 127 [2024-01-30 14:24:05,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 112 transitions, 245 flow. Second operand has 5 states, 5 states have (on average 58.4) internal successors, (292), 5 states have internal predecessors, (292), 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-30 14:24:05,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:24:05,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 127 [2024-01-30 14:24:05,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:24:05,753 INFO L124 PetriNetUnfolderBase]: 1195/2764 cut-off events. [2024-01-30 14:24:05,753 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-01-30 14:24:05,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4732 conditions, 2764 events. 1195/2764 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 20561 event pairs, 969 based on Foata normal form. 1/2583 useless extension candidates. Maximal degree in co-relation 4672. Up to 1913 conditions per place. [2024-01-30 14:24:05,768 INFO L140 encePairwiseOnDemand]: 120/127 looper letters, 63 selfloop transitions, 6 changer transitions 0/113 dead transitions. [2024-01-30 14:24:05,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 385 flow [2024-01-30 14:24:05,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:24:05,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:24:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2024-01-30 14:24:05,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5433070866141733 [2024-01-30 14:24:05,770 INFO L175 Difference]: Start difference. First operand has 112 places, 112 transitions, 245 flow. Second operand 5 states and 345 transitions. [2024-01-30 14:24:05,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 385 flow [2024-01-30 14:24:05,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:24:05,774 INFO L231 Difference]: Finished difference. Result has 116 places, 113 transitions, 261 flow [2024-01-30 14:24:05,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=116, PETRI_TRANSITIONS=113} [2024-01-30 14:24:05,775 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -10 predicate places. [2024-01-30 14:24:05,775 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 113 transitions, 261 flow [2024-01-30 14:24:05,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.4) internal successors, (292), 5 states have internal predecessors, (292), 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-30 14:24:05,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:24:05,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:24:05,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-30 14:24:05,777 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-30 14:24:05,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:24:05,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1367902641, now seen corresponding path program 1 times [2024-01-30 14:24:05,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:24:05,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230463750] [2024-01-30 14:24:05,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:24:05,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:24:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:24:05,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-30 14:24:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:24:05,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-30 14:24:05,840 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-30 14:24:05,841 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 88 remaining) [2024-01-30 14:24:05,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 88 remaining) [2024-01-30 14:24:05,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 88 remaining) [2024-01-30 14:24:05,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 88 remaining) [2024-01-30 14:24:05,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 88 remaining) [2024-01-30 14:24:05,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 88 remaining) [2024-01-30 14:24:05,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 88 remaining) [2024-01-30 14:24:05,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 88 remaining) [2024-01-30 14:24:05,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 88 remaining) [2024-01-30 14:24:05,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 88 remaining) [2024-01-30 14:24:05,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 88 remaining) [2024-01-30 14:24:05,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 88 remaining) [2024-01-30 14:24:05,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 88 remaining) [2024-01-30 14:24:05,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 88 remaining) [2024-01-30 14:24:05,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 88 remaining) [2024-01-30 14:24:05,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 88 remaining) [2024-01-30 14:24:05,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 88 remaining) [2024-01-30 14:24:05,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 88 remaining) [2024-01-30 14:24:05,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 88 remaining) [2024-01-30 14:24:05,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 88 remaining) [2024-01-30 14:24:05,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 88 remaining) [2024-01-30 14:24:05,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 88 remaining) [2024-01-30 14:24:05,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 88 remaining) [2024-01-30 14:24:05,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 88 remaining) [2024-01-30 14:24:05,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 88 remaining) [2024-01-30 14:24:05,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 88 remaining) [2024-01-30 14:24:05,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 88 remaining) [2024-01-30 14:24:05,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 88 remaining) [2024-01-30 14:24:05,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 88 remaining) [2024-01-30 14:24:05,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 88 remaining) [2024-01-30 14:24:05,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 88 remaining) [2024-01-30 14:24:05,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 88 remaining) [2024-01-30 14:24:05,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 88 remaining) [2024-01-30 14:24:05,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 88 remaining) [2024-01-30 14:24:05,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 88 remaining) [2024-01-30 14:24:05,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 88 remaining) [2024-01-30 14:24:05,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 88 remaining) [2024-01-30 14:24:05,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 88 remaining) [2024-01-30 14:24:05,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 88 remaining) [2024-01-30 14:24:05,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 88 remaining) [2024-01-30 14:24:05,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 88 remaining) [2024-01-30 14:24:05,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 88 remaining) [2024-01-30 14:24:05,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 88 remaining) [2024-01-30 14:24:05,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 88 remaining) [2024-01-30 14:24:05,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 88 remaining) [2024-01-30 14:24:05,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 88 remaining) [2024-01-30 14:24:05,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 88 remaining) [2024-01-30 14:24:05,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 88 remaining) [2024-01-30 14:24:05,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 88 remaining) [2024-01-30 14:24:05,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 88 remaining) [2024-01-30 14:24:05,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 88 remaining) [2024-01-30 14:24:05,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (36 of 88 remaining) [2024-01-30 14:24:05,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 88 remaining) [2024-01-30 14:24:05,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 88 remaining) [2024-01-30 14:24:05,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 88 remaining) [2024-01-30 14:24:05,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 88 remaining) [2024-01-30 14:24:05,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 88 remaining) [2024-01-30 14:24:05,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 88 remaining) [2024-01-30 14:24:05,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 88 remaining) [2024-01-30 14:24:05,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 88 remaining) [2024-01-30 14:24:05,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 88 remaining) [2024-01-30 14:24:05,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 88 remaining) [2024-01-30 14:24:05,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 88 remaining) [2024-01-30 14:24:05,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 88 remaining) [2024-01-30 14:24:05,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 88 remaining) [2024-01-30 14:24:05,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 88 remaining) [2024-01-30 14:24:05,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 88 remaining) [2024-01-30 14:24:05,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 88 remaining) [2024-01-30 14:24:05,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 88 remaining) [2024-01-30 14:24:05,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 88 remaining) [2024-01-30 14:24:05,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 88 remaining) [2024-01-30 14:24:05,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 88 remaining) [2024-01-30 14:24:05,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 88 remaining) [2024-01-30 14:24:05,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 88 remaining) [2024-01-30 14:24:05,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 88 remaining) [2024-01-30 14:24:05,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 88 remaining) [2024-01-30 14:24:05,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 88 remaining) [2024-01-30 14:24:05,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 88 remaining) [2024-01-30 14:24:05,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 88 remaining) [2024-01-30 14:24:05,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 88 remaining) [2024-01-30 14:24:05,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 88 remaining) [2024-01-30 14:24:05,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 88 remaining) [2024-01-30 14:24:05,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 88 remaining) [2024-01-30 14:24:05,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 88 remaining) [2024-01-30 14:24:05,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 88 remaining) [2024-01-30 14:24:05,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 88 remaining) [2024-01-30 14:24:05,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 88 remaining) [2024-01-30 14:24:05,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 88 remaining) [2024-01-30 14:24:05,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-30 14:24:05,860 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:24:05,869 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-30 14:24:05,870 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-30 14:24:05,901 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-30 14:24:05,908 INFO L503 ceAbstractionStarter]: Automizer considered 51 witness invariants [2024-01-30 14:24:05,908 INFO L504 ceAbstractionStarter]: WitnessConsidered=51 [2024-01-30 14:24:05,909 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:24:05 BasicIcfg [2024-01-30 14:24:05,909 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-30 14:24:05,910 INFO L158 Benchmark]: Toolchain (without parser) took 8378.83ms. Allocated memory was 155.2MB in the beginning and 518.0MB in the end (delta: 362.8MB). Free memory was 91.9MB in the beginning and 323.0MB in the end (delta: -231.1MB). Peak memory consumption was 133.8MB. Max. memory is 16.1GB. [2024-01-30 14:24:05,910 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:24:05,910 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:24:05,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.96ms. Allocated memory is still 155.2MB. Free memory was 91.6MB in the beginning and 73.2MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-01-30 14:24:05,911 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.13ms. Allocated memory is still 155.2MB. Free memory was 73.2MB in the beginning and 69.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-30 14:24:05,911 INFO L158 Benchmark]: Boogie Preprocessor took 143.81ms. Allocated memory was 155.2MB in the beginning and 251.7MB in the end (delta: 96.5MB). Free memory was 69.8MB in the beginning and 221.3MB in the end (delta: -151.5MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-01-30 14:24:05,911 INFO L158 Benchmark]: RCFGBuilder took 1168.37ms. Allocated memory is still 251.7MB. Free memory was 221.3MB in the beginning and 111.2MB in the end (delta: 110.1MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2024-01-30 14:24:05,912 INFO L158 Benchmark]: TraceAbstraction took 6509.73ms. Allocated memory was 251.7MB in the beginning and 518.0MB in the end (delta: 266.3MB). Free memory was 111.2MB in the beginning and 323.0MB in the end (delta: -211.8MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2024-01-30 14:24:05,913 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.96ms. Allocated memory is still 155.2MB. Free memory was 91.6MB in the beginning and 73.2MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.13ms. Allocated memory is still 155.2MB. Free memory was 73.2MB in the beginning and 69.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 143.81ms. Allocated memory was 155.2MB in the beginning and 251.7MB in the end (delta: 96.5MB). Free memory was 69.8MB in the beginning and 221.3MB in the end (delta: -151.5MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * RCFGBuilder took 1168.37ms. Allocated memory is still 251.7MB. Free memory was 221.3MB in the beginning and 111.2MB in the end (delta: 110.1MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6509.73ms. Allocated memory was 251.7MB in the beginning and 518.0MB in the end (delta: 266.3MB). Free memory was 111.2MB in the beginning and 323.0MB in the end (delta: -211.8MB). Peak memory consumption was 54.6MB. 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[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[bag1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[bag2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cap1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L83] bag1 = __VERIFIER_nondet_int() [L84] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[bag2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cap1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L84] bag2 = __VERIFIER_nondet_int() [L85] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cap1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L85] cap1 = __VERIFIER_nondet_int() [L86] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[cap2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L86] cap2 = __VERIFIER_nondet_int() [L87] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L87] sum1 = __VERIFIER_nondet_int() [L88] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sum2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L88] sum2 = __VERIFIER_nondet_int() [L89] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L89] i = __VERIFIER_nondet_int() [L90] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[j],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[N],IntegerLiteral[0]]]]] [L90] j = __VERIFIER_nondet_int() [L91] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],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[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]],BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]],BinaryExpression[COMPNEQ,IdentifierExpression[size],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[size]],BinaryExpression[COMPLEQ,IntegerLiteral[8],IdentifierExpression[i]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[16LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPNEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[7],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[14LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[7]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[6],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[12LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[10LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[4],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[8LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[3],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[6LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[2],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[4LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[size]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,UnaryExpression[MINUS,IntegerLiteral[2LL]],CastExpression[ACSLType[long long],IdentifierExpression[i]]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]]] VAL [A={0:0}, N=0, \old(size)=0, arr={-1:0}, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, i=0, j=0, size=0, sum1=0, sum2=0] [L113] COND FALSE !(i < size) [L116] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i]],CastExpression[ACSLType[long long],IdentifierExpression[size]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[A],IntegerLiteral[0]]]]] VAL [A={0:0}, N=0, \old(size)=0, arr={-1:0}, bag1=0, bag2=0, cap1=0, cap2=0, i=-1, j=0, size=0, sum1=0, sum2=0] - 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 201 locations, 88 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 661 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1914 IncrementalHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 106 mSDtfsCounter, 1914 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=12, InterpolantAutomatonStates: 39, 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, 1.0s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 1105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-30 14:24:05,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE