./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 59af5db6 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-59af5db-m [2024-02-02 09:20:08,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 09:20:08,893 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 09:20:08,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 09:20:08,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 09:20:08,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 09:20:08,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 09:20:08,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 09:20:08,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 09:20:08,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 09:20:08,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 09:20:08,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 09:20:08,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 09:20:08,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 09:20:08,950 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 09:20:08,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 09:20:08,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 09:20:08,951 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 09:20:08,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 09:20:08,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 09:20:08,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 09:20:08,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 09:20:08,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 09:20:08,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 09:20:08,953 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 09:20:08,953 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 09:20:08,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 09:20:08,954 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 09:20:08,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 09:20:08,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 09:20:08,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 09:20:08,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 09:20:08,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:20:08,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 09:20:08,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 09:20:08,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 09:20:08,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 09:20:08,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 09:20:08,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 09:20:08,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 09:20:08,957 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 09:20:08,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 09:20:08,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 09:20:08,958 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-02-02 09:20:09,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 09:20:09,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 09:20:09,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 09:20:09,248 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 09:20:09,249 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 09:20:09,250 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-02-02 09:20:09,400 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 09:20:09,401 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 09:20:09,401 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-02-02 09:20:10,668 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 09:20:10,856 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 09:20:10,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2024-02-02 09:20:10,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8a5e3ce/a3d35d0a1e8143e9a4ab68afa466c1fd/FLAG0a42fcc4e [2024-02-02 09:20:10,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8a5e3ce/a3d35d0a1e8143e9a4ab68afa466c1fd [2024-02-02 09:20:10,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 09:20:10,876 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 09:20:10,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 09:20:10,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 09:20:10,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 09:20:10,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:20:09" (1/2) ... [2024-02-02 09:20:10,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a4b323 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:20:10, skipping insertion in model container [2024-02-02 09:20:10,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:20:09" (1/2) ... [2024-02-02 09:20:10,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@70b19270 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:20:10, skipping insertion in model container [2024-02-02 09:20:10,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:20:10" (2/2) ... [2024-02-02 09:20:10,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a4b323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:20:10, skipping insertion in model container [2024-02-02 09:20:10,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:20:10" (2/2) ... [2024-02-02 09:20:10,889 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 09:20:10,935 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 09:20:10,937 INFO L101 nessWitnessExtractor]: Location invariant before [L65-L65] (unsigned long )_argptr == 0UL [2024-02-02 09:20:10,937 INFO L101 nessWitnessExtractor]: Location invariant before [L22-L25] A == 0 [2024-02-02 09:20:10,937 INFO L101 nessWitnessExtractor]: Location invariant before [L88-L88] ((((A == 0) && (sum2 == 0)) && (i == 0)) && (j == 0)) && (N == 0) [2024-02-02 09:20:10,937 INFO L101 nessWitnessExtractor]: Location invariant before [L87-L87] (((((A == 0) && (sum1 == 0)) && (sum2 == 0)) && (i == 0)) && (j == 0)) && (N == 0) [2024-02-02 09:20:10,938 INFO L101 nessWitnessExtractor]: Location invariant before [L110-L110] A == 0 [2024-02-02 09:20:10,938 INFO L101 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-02-02 09:20:10,938 INFO L101 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-02-02 09:20:10,938 INFO L101 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-02-02 09:20:10,938 INFO L101 nessWitnessExtractor]: Location invariant before [L86-L86] ((((((A == 0) && (cap2 == 0)) && (sum1 == 0)) && (sum2 == 0)) && (i == 0)) && (j == 0)) && (N == 0) [2024-02-02 09:20:10,939 INFO L101 nessWitnessExtractor]: Location invariant before [L76-L76] (unsigned long )_argptr == 0UL [2024-02-02 09:20:10,939 INFO L101 nessWitnessExtractor]: Location invariant before [L69-L69] (unsigned long )_argptr == 0UL [2024-02-02 09:20:10,939 INFO L101 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-02-02 09:20:10,939 INFO L101 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-02-02 09:20:10,939 INFO L101 nessWitnessExtractor]: Location invariant before [L90-L90] ((A == 0) && (j == 0)) && (N == 0) [2024-02-02 09:20:10,939 INFO L101 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-02-02 09:20:10,940 INFO L101 nessWitnessExtractor]: Location invariant before [L89-L89] (((A == 0) && (i == 0)) && (j == 0)) && (N == 0) [2024-02-02 09:20:10,940 INFO L101 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-02-02 09:20:10,940 INFO L101 nessWitnessExtractor]: Location invariant before [L64-L72] (unsigned long )_argptr == 0UL [2024-02-02 09:20:10,940 INFO L101 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-02-02 09:20:10,940 INFO L101 nessWitnessExtractor]: Location invariant before [L121-L121] (1 <= b) && (b != 0) [2024-02-02 09:20:10,941 INFO L101 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-02-02 09:20:10,941 INFO L101 nessWitnessExtractor]: Location invariant before [L59-L59] (unsigned long )_argptr == 0UL [2024-02-02 09:20:10,941 INFO L101 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-02-02 09:20:10,942 INFO L101 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-02-02 09:20:10,942 INFO L101 nessWitnessExtractor]: Loop invariant at [L63-L74] (unsigned long )_argptr == 0UL [2024-02-02 09:20:10,942 INFO L101 nessWitnessExtractor]: Location invariant before [L91-L91] (A == 0) && (N == 0) [2024-02-02 09:20:10,942 INFO L101 nessWitnessExtractor]: Location invariant before [L116-L116] ((0 <= i) && ((long long )i - (long long )size >= 0LL)) && (A == 0) [2024-02-02 09:20:10,942 INFO L101 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-02-02 09:20:10,942 INFO L101 nessWitnessExtractor]: Loop invariant at [L46-L57] (unsigned long )_argptr == 0UL [2024-02-02 09:20:10,943 INFO L101 nessWitnessExtractor]: Location invariant before [L85-L85] (((((((A == 0) && (cap1 == 0)) && (cap2 == 0)) && (sum1 == 0)) && (sum2 == 0)) && (i == 0)) && (j == 0)) && (N == 0) [2024-02-02 09:20:10,943 INFO L101 nessWitnessExtractor]: Location invariant before [L47-L55] (unsigned long )_argptr == 0UL [2024-02-02 09:20:10,943 INFO L101 nessWitnessExtractor]: Location invariant before [L109-L109] A == 0 [2024-02-02 09:20:10,943 INFO L101 nessWitnessExtractor]: Location invariant before [L92-L92] A == 0 [2024-02-02 09:20:10,943 INFO L101 nessWitnessExtractor]: Location invariant before [L112-L112] A == 0 [2024-02-02 09:20:10,944 INFO L101 nessWitnessExtractor]: Location invariant before [L120-L120] (b <= -1) && (b != 0) [2024-02-02 09:20:10,965 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-02 09:20:11,162 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-02-02 09:20:11,174 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:20:11,182 INFO L202 MainTranslator]: Completed pre-run [2024-02-02 09:20:11,191 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-02-02 09:20:11,260 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-02-02 09:20:11,305 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:20:11,319 INFO L206 MainTranslator]: Completed translation [2024-02-02 09:20:11,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:20:11 WrapperNode [2024-02-02 09:20:11,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 09:20:11,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 09:20:11,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 09:20:11,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 09:20:11,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:20:11" (1/1) ... [2024-02-02 09:20:11,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:20:11" (1/1) ... [2024-02-02 09:20:11,404 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 340 [2024-02-02 09:20:11,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 09:20:11,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 09:20:11,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 09:20:11,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 09:20:11,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:20:11" (1/1) ... [2024-02-02 09:20:11,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:20:11" (1/1) ... [2024-02-02 09:20:11,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:20:11" (1/1) ... [2024-02-02 09:20:11,458 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-02-02 09:20:11,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:20:11" (1/1) ... [2024-02-02 09:20:11,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:20:11" (1/1) ... [2024-02-02 09:20:11,474 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:20:11" (1/1) ... [2024-02-02 09:20:11,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:20:11" (1/1) ... [2024-02-02 09:20:11,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:20:11" (1/1) ... [2024-02-02 09:20:11,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:20:11" (1/1) ... [2024-02-02 09:20:11,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 09:20:11,488 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 09:20:11,488 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 09:20:11,488 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 09:20:11,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:20:11" (1/1) ... [2024-02-02 09:20:11,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:20:11,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:20:11,518 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-02-02 09:20:11,549 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-02-02 09:20:11,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 09:20:11,565 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-02 09:20:11,565 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-02 09:20:11,565 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-02 09:20:11,565 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-02 09:20:11,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 09:20:11,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 09:20:11,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 09:20:11,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-02 09:20:11,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 09:20:11,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 09:20:11,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 09:20:11,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 09:20:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-02 09:20:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-02 09:20:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 09:20:11,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 09:20:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 09:20:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 09:20:11,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 09:20:11,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-02 09:20:11,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 09:20:11,570 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-02 09:20:11,678 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 09:20:11,680 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 09:20:12,348 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 09:20:12,349 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 09:20:12,683 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 09:20:12,684 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-02-02 09:20:12,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:20:12 BoogieIcfgContainer [2024-02-02 09:20:12,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 09:20:12,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 09:20:12,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 09:20:12,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 09:20:12,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:20:09" (1/4) ... [2024-02-02 09:20:12,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a3a3f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:20:12, skipping insertion in model container [2024-02-02 09:20:12,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:20:10" (2/4) ... [2024-02-02 09:20:12,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a3a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:20:12, skipping insertion in model container [2024-02-02 09:20:12,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:20:11" (3/4) ... [2024-02-02 09:20:12,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a3a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:20:12, skipping insertion in model container [2024-02-02 09:20:12,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:20:12" (4/4) ... [2024-02-02 09:20:12,696 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2024-02-02 09:20:12,712 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 09:20:12,713 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2024-02-02 09:20:12,713 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 09:20:12,811 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-02 09:20:12,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 127 transitions, 268 flow [2024-02-02 09:20:12,916 INFO L124 PetriNetUnfolderBase]: 5/125 cut-off events. [2024-02-02 09:20:12,917 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:20:12,923 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-02-02 09:20:12,923 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 127 transitions, 268 flow [2024-02-02 09:20:12,929 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 124 transitions, 260 flow [2024-02-02 09:20:12,944 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 09:20:12,951 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;@72e8e04e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 09:20:12,952 INFO L358 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2024-02-02 09:20:12,955 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 09:20:12,955 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 09:20:12,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:20:12,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:12,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 09:20:12,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-02-02 09:20:12,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:12,961 INFO L85 PathProgramCache]: Analyzing trace with hash 34164, now seen corresponding path program 1 times [2024-02-02 09:20:12,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:12,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366024864] [2024-02-02 09:20:12,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:12,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:13,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:13,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:13,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366024864] [2024-02-02 09:20:13,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366024864] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:13,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:13,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:20:13,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647603541] [2024-02-02 09:20:13,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:13,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:20:13,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:13,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:20:13,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:20:13,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 127 [2024-02-02 09:20:13,450 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-02-02 09:20:13,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:13,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 127 [2024-02-02 09:20:13,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:13,968 INFO L124 PetriNetUnfolderBase]: 1317/2903 cut-off events. [2024-02-02 09:20:13,968 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2024-02-02 09:20:13,977 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-02-02 09:20:13,996 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 73 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2024-02-02 09:20:13,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 123 transitions, 408 flow [2024-02-02 09:20:14,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:20:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:20:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2024-02-02 09:20:14,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5931758530183727 [2024-02-02 09:20:14,016 INFO L175 Difference]: Start difference. First operand has 126 places, 124 transitions, 260 flow. Second operand 3 states and 226 transitions. [2024-02-02 09:20:14,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 123 transitions, 408 flow [2024-02-02 09:20:14,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 123 transitions, 400 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-02 09:20:14,027 INFO L231 Difference]: Finished difference. Result has 123 places, 123 transitions, 254 flow [2024-02-02 09:20:14,028 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-02-02 09:20:14,032 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -3 predicate places. [2024-02-02 09:20:14,033 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 123 transitions, 254 flow [2024-02-02 09:20:14,033 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-02-02 09:20:14,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:14,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-02 09:20:14,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 09:20:14,034 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-02-02 09:20:14,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:14,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1060235, now seen corresponding path program 1 times [2024-02-02 09:20:14,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:14,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648917981] [2024-02-02 09:20:14,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:14,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:14,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:14,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648917981] [2024-02-02 09:20:14,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648917981] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:14,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:14,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:20:14,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818548516] [2024-02-02 09:20:14,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:14,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:20:14,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:14,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:20:14,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:20:14,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 127 [2024-02-02 09:20:14,238 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-02-02 09:20:14,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:14,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 127 [2024-02-02 09:20:14,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:14,664 INFO L124 PetriNetUnfolderBase]: 1317/2902 cut-off events. [2024-02-02 09:20:14,664 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-02 09:20:14,669 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-02-02 09:20:14,716 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 72 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2024-02-02 09:20:14,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 122 transitions, 400 flow [2024-02-02 09:20:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:20:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:20:14,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2024-02-02 09:20:14,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5984251968503937 [2024-02-02 09:20:14,723 INFO L175 Difference]: Start difference. First operand has 123 places, 123 transitions, 254 flow. Second operand 3 states and 228 transitions. [2024-02-02 09:20:14,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 122 transitions, 400 flow [2024-02-02 09:20:14,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:20:14,727 INFO L231 Difference]: Finished difference. Result has 122 places, 122 transitions, 252 flow [2024-02-02 09:20:14,727 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-02-02 09:20:14,728 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -4 predicate places. [2024-02-02 09:20:14,729 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 122 transitions, 252 flow [2024-02-02 09:20:14,729 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-02-02 09:20:14,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:14,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-02 09:20:14,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 09:20:14,730 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-02-02 09:20:14,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash 32868357, now seen corresponding path program 1 times [2024-02-02 09:20:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:14,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248278863] [2024-02-02 09:20:14,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:14,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:14,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:14,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:14,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248278863] [2024-02-02 09:20:14,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248278863] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:14,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:14,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:20:14,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641877229] [2024-02-02 09:20:14,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:14,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:20:14,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:14,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:20:14,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:20:14,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 127 [2024-02-02 09:20:14,877 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-02-02 09:20:14,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:14,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 127 [2024-02-02 09:20:14,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:15,228 INFO L124 PetriNetUnfolderBase]: 1317/2901 cut-off events. [2024-02-02 09:20:15,229 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-02 09:20:15,233 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-02-02 09:20:15,246 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 71 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2024-02-02 09:20:15,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 121 transitions, 396 flow [2024-02-02 09:20:15,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:20:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:20:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2024-02-02 09:20:15,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6036745406824147 [2024-02-02 09:20:15,248 INFO L175 Difference]: Start difference. First operand has 122 places, 122 transitions, 252 flow. Second operand 3 states and 230 transitions. [2024-02-02 09:20:15,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 121 transitions, 396 flow [2024-02-02 09:20:15,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 121 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:20:15,251 INFO L231 Difference]: Finished difference. Result has 121 places, 121 transitions, 250 flow [2024-02-02 09:20:15,251 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-02-02 09:20:15,252 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -5 predicate places. [2024-02-02 09:20:15,252 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 121 transitions, 250 flow [2024-02-02 09:20:15,252 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-02-02 09:20:15,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:15,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-02 09:20:15,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-02 09:20:15,253 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-02-02 09:20:15,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:15,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1018920109, now seen corresponding path program 1 times [2024-02-02 09:20:15,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:15,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865201684] [2024-02-02 09:20:15,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:15,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:15,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:15,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865201684] [2024-02-02 09:20:15,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865201684] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:15,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:15,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:20:15,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647801923] [2024-02-02 09:20:15,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:15,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:20:15,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:15,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:20:15,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:20:15,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 127 [2024-02-02 09:20:15,361 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-02-02 09:20:15,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:15,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 127 [2024-02-02 09:20:15,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:15,670 INFO L124 PetriNetUnfolderBase]: 1317/2900 cut-off events. [2024-02-02 09:20:15,671 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-02 09:20:15,676 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-02-02 09:20:15,690 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 70 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2024-02-02 09:20:15,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 120 transitions, 392 flow [2024-02-02 09:20:15,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:20:15,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:20:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2024-02-02 09:20:15,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6089238845144357 [2024-02-02 09:20:15,692 INFO L175 Difference]: Start difference. First operand has 121 places, 121 transitions, 250 flow. Second operand 3 states and 232 transitions. [2024-02-02 09:20:15,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 120 transitions, 392 flow [2024-02-02 09:20:15,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 120 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:20:15,695 INFO L231 Difference]: Finished difference. Result has 120 places, 120 transitions, 248 flow [2024-02-02 09:20:15,695 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-02-02 09:20:15,696 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -6 predicate places. [2024-02-02 09:20:15,696 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 120 transitions, 248 flow [2024-02-02 09:20:15,696 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-02-02 09:20:15,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:15,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-02 09:20:15,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-02 09:20:15,697 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-02-02 09:20:15,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:15,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1521753399, now seen corresponding path program 1 times [2024-02-02 09:20:15,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:15,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835374765] [2024-02-02 09:20:15,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:15,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:15,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:15,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835374765] [2024-02-02 09:20:15,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835374765] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:15,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:15,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:20:15,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904542683] [2024-02-02 09:20:15,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:15,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:20:15,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:15,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:20:15,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:20:15,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 127 [2024-02-02 09:20:15,802 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-02-02 09:20:15,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:15,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 127 [2024-02-02 09:20:15,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:16,075 INFO L124 PetriNetUnfolderBase]: 1317/2899 cut-off events. [2024-02-02 09:20:16,075 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-02 09:20:16,079 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-02-02 09:20:16,091 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 69 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2024-02-02 09:20:16,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 388 flow [2024-02-02 09:20:16,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:20:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:20:16,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2024-02-02 09:20:16,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6141732283464567 [2024-02-02 09:20:16,094 INFO L175 Difference]: Start difference. First operand has 120 places, 120 transitions, 248 flow. Second operand 3 states and 234 transitions. [2024-02-02 09:20:16,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 388 flow [2024-02-02 09:20:16,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 119 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:20:16,097 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 246 flow [2024-02-02 09:20:16,097 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-02-02 09:20:16,098 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -7 predicate places. [2024-02-02 09:20:16,098 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 246 flow [2024-02-02 09:20:16,098 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-02-02 09:20:16,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:16,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:16,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-02 09:20:16,099 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-02-02 09:20:16,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:16,099 INFO L85 PathProgramCache]: Analyzing trace with hash -70283765, now seen corresponding path program 1 times [2024-02-02 09:20:16,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:16,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906566680] [2024-02-02 09:20:16,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:16,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:16,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:16,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906566680] [2024-02-02 09:20:16,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906566680] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:16,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:16,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:20:16,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796681798] [2024-02-02 09:20:16,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:16,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:20:16,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:16,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:20:16,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:20:16,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 127 [2024-02-02 09:20:16,186 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-02-02 09:20:16,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:16,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 127 [2024-02-02 09:20:16,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:16,467 INFO L124 PetriNetUnfolderBase]: 1317/2898 cut-off events. [2024-02-02 09:20:16,467 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-02 09:20:16,472 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-02-02 09:20:16,490 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 68 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2024-02-02 09:20:16,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 384 flow [2024-02-02 09:20:16,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:20:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:20:16,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 236 transitions. [2024-02-02 09:20:16,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6194225721784777 [2024-02-02 09:20:16,492 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 246 flow. Second operand 3 states and 236 transitions. [2024-02-02 09:20:16,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 384 flow [2024-02-02 09:20:16,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 118 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:20:16,495 INFO L231 Difference]: Finished difference. Result has 118 places, 118 transitions, 244 flow [2024-02-02 09:20:16,496 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-02-02 09:20:16,500 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -8 predicate places. [2024-02-02 09:20:16,500 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 118 transitions, 244 flow [2024-02-02 09:20:16,500 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-02-02 09:20:16,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:16,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:16,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-02 09:20:16,500 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-02-02 09:20:16,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2116171683, now seen corresponding path program 1 times [2024-02-02 09:20:16,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:16,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622663749] [2024-02-02 09:20:16,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:16,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:16,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:16,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622663749] [2024-02-02 09:20:16,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622663749] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:16,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:16,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:20:16,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988969389] [2024-02-02 09:20:16,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:16,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:20:16,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:16,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:20:16,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:20:16,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 127 [2024-02-02 09:20:16,579 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-02-02 09:20:16,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:16,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 127 [2024-02-02 09:20:16,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:16,881 INFO L124 PetriNetUnfolderBase]: 1317/2897 cut-off events. [2024-02-02 09:20:16,882 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-02 09:20:16,885 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-02-02 09:20:16,894 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 67 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2024-02-02 09:20:16,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 117 transitions, 380 flow [2024-02-02 09:20:16,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:20:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:20:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2024-02-02 09:20:16,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6246719160104987 [2024-02-02 09:20:16,896 INFO L175 Difference]: Start difference. First operand has 118 places, 118 transitions, 244 flow. Second operand 3 states and 238 transitions. [2024-02-02 09:20:16,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 117 transitions, 380 flow [2024-02-02 09:20:16,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:20:16,899 INFO L231 Difference]: Finished difference. Result has 117 places, 117 transitions, 242 flow [2024-02-02 09:20:16,899 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-02-02 09:20:16,900 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -9 predicate places. [2024-02-02 09:20:16,900 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 242 flow [2024-02-02 09:20:16,900 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-02-02 09:20:16,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:16,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:16,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 09:20:16,901 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-02-02 09:20:16,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:16,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1176813888, now seen corresponding path program 1 times [2024-02-02 09:20:16,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:16,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203173582] [2024-02-02 09:20:16,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:16,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:16,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:16,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203173582] [2024-02-02 09:20:16,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203173582] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:16,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:16,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:20:16,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463469401] [2024-02-02 09:20:16,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:16,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:20:16,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:16,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:20:16,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:20:16,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 127 [2024-02-02 09:20:16,973 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-02-02 09:20:16,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:16,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 127 [2024-02-02 09:20:16,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:17,269 INFO L124 PetriNetUnfolderBase]: 1254/2827 cut-off events. [2024-02-02 09:20:17,270 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-02-02 09:20:17,275 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-02-02 09:20:17,282 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 65 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2024-02-02 09:20:17,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 374 flow [2024-02-02 09:20:17,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:20:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:20:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2024-02-02 09:20:17,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6351706036745407 [2024-02-02 09:20:17,290 INFO L175 Difference]: Start difference. First operand has 117 places, 117 transitions, 242 flow. Second operand 3 states and 242 transitions. [2024-02-02 09:20:17,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 374 flow [2024-02-02 09:20:17,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 116 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:20:17,292 INFO L231 Difference]: Finished difference. Result has 116 places, 116 transitions, 240 flow [2024-02-02 09:20:17,293 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-02-02 09:20:17,295 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -10 predicate places. [2024-02-02 09:20:17,295 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 116 transitions, 240 flow [2024-02-02 09:20:17,296 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-02-02 09:20:17,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:17,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:17,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-02 09:20:17,296 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-02-02 09:20:17,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:17,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2121493218, now seen corresponding path program 1 times [2024-02-02 09:20:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:17,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929202231] [2024-02-02 09:20:17,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:17,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:17,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:17,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929202231] [2024-02-02 09:20:17,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929202231] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:17,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:17,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:20:17,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833534550] [2024-02-02 09:20:17,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:17,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:20:17,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:17,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:20:17,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:20:17,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 127 [2024-02-02 09:20:17,368 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-02-02 09:20:17,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:17,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 127 [2024-02-02 09:20:17,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:17,713 INFO L124 PetriNetUnfolderBase]: 1194/2766 cut-off events. [2024-02-02 09:20:17,713 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-02-02 09:20:17,717 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-02-02 09:20:17,726 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 63 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2024-02-02 09:20:17,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 115 transitions, 368 flow [2024-02-02 09:20:17,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:20:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:20:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2024-02-02 09:20:17,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6456692913385826 [2024-02-02 09:20:17,728 INFO L175 Difference]: Start difference. First operand has 116 places, 116 transitions, 240 flow. Second operand 3 states and 246 transitions. [2024-02-02 09:20:17,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 115 transitions, 368 flow [2024-02-02 09:20:17,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 115 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:20:17,731 INFO L231 Difference]: Finished difference. Result has 115 places, 115 transitions, 238 flow [2024-02-02 09:20:17,731 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-02-02 09:20:17,732 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -11 predicate places. [2024-02-02 09:20:17,732 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 115 transitions, 238 flow [2024-02-02 09:20:17,732 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-02-02 09:20:17,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:17,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:17,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-02 09:20:17,733 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-02-02 09:20:17,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:17,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1341781460, now seen corresponding path program 1 times [2024-02-02 09:20:17,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:17,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708096520] [2024-02-02 09:20:17,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:17,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:17,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:17,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708096520] [2024-02-02 09:20:17,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708096520] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:17,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:17,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:20:17,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851878172] [2024-02-02 09:20:17,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:17,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:20:17,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:17,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:20:17,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:20:17,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 127 [2024-02-02 09:20:17,813 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-02-02 09:20:17,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:17,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 127 [2024-02-02 09:20:17,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:18,093 INFO L124 PetriNetUnfolderBase]: 1194/2762 cut-off events. [2024-02-02 09:20:18,094 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-02-02 09:20:18,098 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-02-02 09:20:18,110 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 61 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-02-02 09:20:18,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 111 transitions, 356 flow [2024-02-02 09:20:18,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:20:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:20:18,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2024-02-02 09:20:18,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6404199475065617 [2024-02-02 09:20:18,112 INFO L175 Difference]: Start difference. First operand has 115 places, 115 transitions, 238 flow. Second operand 3 states and 244 transitions. [2024-02-02 09:20:18,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 111 transitions, 356 flow [2024-02-02 09:20:18,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 111 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:20:18,115 INFO L231 Difference]: Finished difference. Result has 111 places, 111 transitions, 230 flow [2024-02-02 09:20:18,115 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-02-02 09:20:18,115 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -15 predicate places. [2024-02-02 09:20:18,116 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 111 transitions, 230 flow [2024-02-02 09:20:18,116 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-02-02 09:20:18,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:18,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:18,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-02 09:20:18,117 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-02-02 09:20:18,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:18,117 INFO L85 PathProgramCache]: Analyzing trace with hash 901368840, now seen corresponding path program 1 times [2024-02-02 09:20:18,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:18,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434690986] [2024-02-02 09:20:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:18,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:18,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:18,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434690986] [2024-02-02 09:20:18,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434690986] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:18,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:18,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:20:18,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326597919] [2024-02-02 09:20:18,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:18,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:20:18,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:18,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:20:18,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:20:18,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 127 [2024-02-02 09:20:18,233 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-02-02 09:20:18,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:18,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 127 [2024-02-02 09:20:18,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:18,521 INFO L124 PetriNetUnfolderBase]: 1195/2765 cut-off events. [2024-02-02 09:20:18,521 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-02-02 09:20:18,526 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-02-02 09:20:18,537 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 61 selfloop transitions, 5 changer transitions 0/112 dead transitions. [2024-02-02 09:20:18,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 112 transitions, 364 flow [2024-02-02 09:20:18,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:20:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:20:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 295 transitions. [2024-02-02 09:20:18,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5807086614173228 [2024-02-02 09:20:18,539 INFO L175 Difference]: Start difference. First operand has 111 places, 111 transitions, 230 flow. Second operand 4 states and 295 transitions. [2024-02-02 09:20:18,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 112 transitions, 364 flow [2024-02-02 09:20:18,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 112 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:20:18,542 INFO L231 Difference]: Finished difference. Result has 112 places, 112 transitions, 245 flow [2024-02-02 09:20:18,542 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-02-02 09:20:18,542 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -14 predicate places. [2024-02-02 09:20:18,543 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 112 transitions, 245 flow [2024-02-02 09:20:18,543 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-02-02 09:20:18,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:18,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:18,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-02 09:20:18,543 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-02-02 09:20:18,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:18,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1367902649, now seen corresponding path program 1 times [2024-02-02 09:20:18,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:18,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409262017] [2024-02-02 09:20:18,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:18,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:18,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:18,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409262017] [2024-02-02 09:20:18,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409262017] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:18,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:18,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:20:18,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451263791] [2024-02-02 09:20:18,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:18,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-02 09:20:18,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:18,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-02 09:20:18,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-02 09:20:18,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 127 [2024-02-02 09:20:18,718 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-02-02 09:20:18,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:18,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 127 [2024-02-02 09:20:18,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:19,031 INFO L124 PetriNetUnfolderBase]: 1195/2764 cut-off events. [2024-02-02 09:20:19,031 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-02-02 09:20:19,036 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-02-02 09:20:19,046 INFO L140 encePairwiseOnDemand]: 120/127 looper letters, 63 selfloop transitions, 6 changer transitions 0/113 dead transitions. [2024-02-02 09:20:19,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 385 flow [2024-02-02 09:20:19,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:20:19,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:20:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2024-02-02 09:20:19,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5433070866141733 [2024-02-02 09:20:19,048 INFO L175 Difference]: Start difference. First operand has 112 places, 112 transitions, 245 flow. Second operand 5 states and 345 transitions. [2024-02-02 09:20:19,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 385 flow [2024-02-02 09:20:19,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:20:19,052 INFO L231 Difference]: Finished difference. Result has 116 places, 113 transitions, 261 flow [2024-02-02 09:20:19,052 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-02-02 09:20:19,053 INFO L281 CegarLoopForPetriNet]: 126 programPoint places, -10 predicate places. [2024-02-02 09:20:19,053 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 113 transitions, 261 flow [2024-02-02 09:20:19,053 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-02-02 09:20:19,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:19,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:19,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-02 09:20:19,054 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-02-02 09:20:19,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:19,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1367902641, now seen corresponding path program 1 times [2024-02-02 09:20:19,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:19,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111432967] [2024-02-02 09:20:19,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:19,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:20:19,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 09:20:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:20:19,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 09:20:19,128 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 09:20:19,129 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 88 remaining) [2024-02-02 09:20:19,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 88 remaining) [2024-02-02 09:20:19,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 88 remaining) [2024-02-02 09:20:19,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 88 remaining) [2024-02-02 09:20:19,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 88 remaining) [2024-02-02 09:20:19,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 88 remaining) [2024-02-02 09:20:19,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 88 remaining) [2024-02-02 09:20:19,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 88 remaining) [2024-02-02 09:20:19,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 88 remaining) [2024-02-02 09:20:19,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 88 remaining) [2024-02-02 09:20:19,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 88 remaining) [2024-02-02 09:20:19,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 88 remaining) [2024-02-02 09:20:19,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 88 remaining) [2024-02-02 09:20:19,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 88 remaining) [2024-02-02 09:20:19,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 88 remaining) [2024-02-02 09:20:19,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 88 remaining) [2024-02-02 09:20:19,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 88 remaining) [2024-02-02 09:20:19,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 88 remaining) [2024-02-02 09:20:19,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 88 remaining) [2024-02-02 09:20:19,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 88 remaining) [2024-02-02 09:20:19,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 88 remaining) [2024-02-02 09:20:19,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 88 remaining) [2024-02-02 09:20:19,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 88 remaining) [2024-02-02 09:20:19,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 88 remaining) [2024-02-02 09:20:19,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 88 remaining) [2024-02-02 09:20:19,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 88 remaining) [2024-02-02 09:20:19,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 88 remaining) [2024-02-02 09:20:19,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 88 remaining) [2024-02-02 09:20:19,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 88 remaining) [2024-02-02 09:20:19,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 88 remaining) [2024-02-02 09:20:19,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 88 remaining) [2024-02-02 09:20:19,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 88 remaining) [2024-02-02 09:20:19,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 88 remaining) [2024-02-02 09:20:19,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 88 remaining) [2024-02-02 09:20:19,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 88 remaining) [2024-02-02 09:20:19,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 88 remaining) [2024-02-02 09:20:19,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 88 remaining) [2024-02-02 09:20:19,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 88 remaining) [2024-02-02 09:20:19,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 88 remaining) [2024-02-02 09:20:19,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 88 remaining) [2024-02-02 09:20:19,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 88 remaining) [2024-02-02 09:20:19,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 88 remaining) [2024-02-02 09:20:19,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 88 remaining) [2024-02-02 09:20:19,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 88 remaining) [2024-02-02 09:20:19,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 88 remaining) [2024-02-02 09:20:19,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 88 remaining) [2024-02-02 09:20:19,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 88 remaining) [2024-02-02 09:20:19,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 88 remaining) [2024-02-02 09:20:19,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 88 remaining) [2024-02-02 09:20:19,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 88 remaining) [2024-02-02 09:20:19,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 88 remaining) [2024-02-02 09:20:19,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (36 of 88 remaining) [2024-02-02 09:20:19,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 88 remaining) [2024-02-02 09:20:19,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 88 remaining) [2024-02-02 09:20:19,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 88 remaining) [2024-02-02 09:20:19,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 88 remaining) [2024-02-02 09:20:19,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 88 remaining) [2024-02-02 09:20:19,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 88 remaining) [2024-02-02 09:20:19,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 88 remaining) [2024-02-02 09:20:19,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 88 remaining) [2024-02-02 09:20:19,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 88 remaining) [2024-02-02 09:20:19,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 88 remaining) [2024-02-02 09:20:19,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 88 remaining) [2024-02-02 09:20:19,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 88 remaining) [2024-02-02 09:20:19,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 88 remaining) [2024-02-02 09:20:19,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 88 remaining) [2024-02-02 09:20:19,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 88 remaining) [2024-02-02 09:20:19,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 88 remaining) [2024-02-02 09:20:19,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 88 remaining) [2024-02-02 09:20:19,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 88 remaining) [2024-02-02 09:20:19,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 88 remaining) [2024-02-02 09:20:19,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 88 remaining) [2024-02-02 09:20:19,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 88 remaining) [2024-02-02 09:20:19,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 88 remaining) [2024-02-02 09:20:19,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 88 remaining) [2024-02-02 09:20:19,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 88 remaining) [2024-02-02 09:20:19,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 88 remaining) [2024-02-02 09:20:19,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 88 remaining) [2024-02-02 09:20:19,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 88 remaining) [2024-02-02 09:20:19,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 88 remaining) [2024-02-02 09:20:19,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 88 remaining) [2024-02-02 09:20:19,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 88 remaining) [2024-02-02 09:20:19,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 88 remaining) [2024-02-02 09:20:19,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 88 remaining) [2024-02-02 09:20:19,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 88 remaining) [2024-02-02 09:20:19,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 88 remaining) [2024-02-02 09:20:19,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 88 remaining) [2024-02-02 09:20:19,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 88 remaining) [2024-02-02 09:20:19,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-02 09:20:19,145 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:19,153 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 09:20:19,154 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 09:20:19,187 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-02-02 09:20:19,195 INFO L503 ceAbstractionStarter]: Automizer considered 51 witness invariants [2024-02-02 09:20:19,195 INFO L504 ceAbstractionStarter]: WitnessConsidered=51 [2024-02-02 09:20:19,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:20:19 BasicIcfg [2024-02-02 09:20:19,196 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 09:20:19,197 INFO L158 Benchmark]: Toolchain (without parser) took 8320.77ms. Allocated memory was 172.0MB in the beginning and 448.8MB in the end (delta: 276.8MB). Free memory was 111.7MB in the beginning and 180.1MB in the end (delta: -68.5MB). Peak memory consumption was 210.4MB. Max. memory is 16.1GB. [2024-02-02 09:20:19,197 INFO L158 Benchmark]: Witness Parser took 0.19ms. Allocated memory is still 172.0MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:20:19,197 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 172.0MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:20:19,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.95ms. Allocated memory is still 172.0MB. Free memory was 111.7MB in the beginning and 93.4MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-02-02 09:20:19,198 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.40ms. Allocated memory is still 172.0MB. Free memory was 92.8MB in the beginning and 89.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-02 09:20:19,198 INFO L158 Benchmark]: Boogie Preprocessor took 78.61ms. Allocated memory is still 172.0MB. Free memory was 89.2MB in the beginning and 85.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-02 09:20:19,198 INFO L158 Benchmark]: RCFGBuilder took 1197.27ms. Allocated memory was 172.0MB in the beginning and 270.5MB in the end (delta: 98.6MB). Free memory was 85.8MB in the beginning and 169.4MB in the end (delta: -83.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-02-02 09:20:19,199 INFO L158 Benchmark]: TraceAbstraction took 6508.52ms. Allocated memory was 270.5MB in the beginning and 448.8MB in the end (delta: 178.3MB). Free memory was 168.4MB in the beginning and 180.1MB in the end (delta: -11.8MB). Peak memory consumption was 166.5MB. Max. memory is 16.1GB. [2024-02-02 09:20:19,200 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.19ms. Allocated memory is still 172.0MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.26ms. Allocated memory is still 172.0MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.95ms. Allocated memory is still 172.0MB. Free memory was 111.7MB in the beginning and 93.4MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.40ms. Allocated memory is still 172.0MB. Free memory was 92.8MB in the beginning and 89.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.61ms. Allocated memory is still 172.0MB. Free memory was 89.2MB in the beginning and 85.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1197.27ms. Allocated memory was 172.0MB in the beginning and 270.5MB in the end (delta: 98.6MB). Free memory was 85.8MB in the beginning and 169.4MB in the end (delta: -83.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6508.52ms. Allocated memory was 270.5MB in the beginning and 448.8MB in the end (delta: 178.3MB). Free memory was 168.4MB in the beginning and 180.1MB in the end (delta: -11.8MB). Peak memory consumption was 166.5MB. 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.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 661 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 1.3s 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.1s 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, 0.9s 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-02-02 09:20:19,238 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