./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-time-symm.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/chl-time-symm.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/chl-time-symm.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-time-symm.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:19:53,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 09:19:53,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 09:19:53,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 09:19:53,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 09:19:54,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 09:19:54,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 09:19:54,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 09:19:54,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 09:19:54,012 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 09:19:54,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 09:19:54,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 09:19:54,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 09:19:54,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 09:19:54,025 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 09:19:54,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 09:19:54,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 09:19:54,026 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 09:19:54,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 09:19:54,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 09:19:54,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 09:19:54,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 09:19:54,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 09:19:54,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 09:19:54,029 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 09:19:54,029 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 09:19:54,029 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 09:19:54,029 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 09:19:54,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 09:19:54,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 09:19:54,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 09:19:54,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 09:19:54,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:19:54,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 09:19:54,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 09:19:54,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 09:19:54,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 09:19:54,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 09:19:54,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 09:19:54,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 09:19:54,032 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 09:19:54,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 09:19:54,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 09:19:54,033 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:19:54,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 09:19:54,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 09:19:54,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 09:19:54,293 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 09:19:54,293 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 09:19:54,295 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/chl-time-symm.wvr.yml/witness.yml [2024-02-02 09:19:54,432 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 09:19:54,432 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 09:19:54,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-time-symm.wvr.c [2024-02-02 09:19:55,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 09:19:55,611 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 09:19:55,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-time-symm.wvr.c [2024-02-02 09:19:55,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0f9b343/619b75d0d43a4922a3f2c833781e0f17/FLAG2abb85971 [2024-02-02 09:19:55,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0f9b343/619b75d0d43a4922a3f2c833781e0f17 [2024-02-02 09:19:55,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 09:19:55,628 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 09:19:55,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 09:19:55,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 09:19:55,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 09:19:55,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:19:54" (1/2) ... [2024-02-02 09:19:55,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b42d2a0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:55, skipping insertion in model container [2024-02-02 09:19:55,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:19:54" (1/2) ... [2024-02-02 09:19:55,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4f5b3f89 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:55, skipping insertion in model container [2024-02-02 09:19:55,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:19:55" (2/2) ... [2024-02-02 09:19:55,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b42d2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:55, skipping insertion in model container [2024-02-02 09:19:55,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:19:55" (2/2) ... [2024-02-02 09:19:55,636 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 09:19:55,655 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 09:19:55,655 INFO L101 nessWitnessExtractor]: Location invariant before [L45-L45] (unsigned long )_argptr == 0UL [2024-02-02 09:19:55,655 INFO L101 nessWitnessExtractor]: Location invariant before [L71-L71] cmp_5 == 0 [2024-02-02 09:19:55,656 INFO L101 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-02-02 09:19:55,656 INFO L101 nessWitnessExtractor]: Location invariant before [L70-L70] ((((((0LL - (long long )cmp_4) + (long long )cmp_5 >= 0LL) && ((long long )cmp_4 + (long long )cmp_5 >= 0LL)) && ((0LL - (long long )cmp_4) - (long long )cmp_5 >= 0LL)) && ((long long )cmp_4 - (long long )cmp_5 >= 0LL)) && (cmp_4 == 0)) && (cmp_5 == 0) [2024-02-02 09:19:55,656 INFO L101 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-02-02 09:19:55,656 INFO L101 nessWitnessExtractor]: Location invariant before [L22-L25] cmp_5 == 0 [2024-02-02 09:19:55,656 INFO L101 nessWitnessExtractor]: Location invariant before [L86-L86] (1 <= b) && (b != 0) [2024-02-02 09:19:55,656 INFO L101 nessWitnessExtractor]: Location invariant before [L49-L49] (unsigned long )_argptr == 0UL [2024-02-02 09:19:55,656 INFO L101 nessWitnessExtractor]: Location invariant before [L68-L68] ((((((((0LL - (long long )cmp_4) + (long long )cmp_5 >= 0LL) && ((long long )cmp_4 + (long long )cmp_5 >= 0LL)) && ((0LL - (long long )cmp_4) - (long long )cmp_5 >= 0LL)) && ((long long )cmp_4 - (long long )cmp_5 >= 0LL)) && (volume_totale_1 == 0)) && (volume_totale_3 == 0)) && (cmp_4 == 0)) && (cmp_5 == 0) [2024-02-02 09:19:55,656 INFO L101 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-02-02 09:19:55,656 INFO L101 nessWitnessExtractor]: Location invariant before [L87-L87] (b <= -1) && (b != 0) [2024-02-02 09:19:55,656 INFO L101 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-02-02 09:19:55,656 INFO L101 nessWitnessExtractor]: Location invariant before [L69-L69] (((((((0LL - (long long )cmp_4) + (long long )cmp_5 >= 0LL) && ((long long )cmp_4 + (long long )cmp_5 >= 0LL)) && ((0LL - (long long )cmp_4) - (long long )cmp_5 >= 0LL)) && ((long long )cmp_4 - (long long )cmp_5 >= 0LL)) && (volume_totale_3 == 0)) && (cmp_4 == 0)) && (cmp_5 == 0) [2024-02-02 09:19:55,656 INFO L101 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-02-02 09:19:55,656 INFO L101 nessWitnessExtractor]: Location invariant before [L66-L66] ((((((((((0LL - (long long )cmp_4) + (long long )cmp_5 >= 0LL) && ((long long )cmp_4 + (long long )cmp_5 >= 0LL)) && ((0LL - (long long )cmp_4) - (long long )cmp_5 >= 0LL)) && ((long long )cmp_4 - (long long )cmp_5 >= 0LL)) && (ora_0 == 0)) && (ora_2 == 0)) && (volume_totale_1 == 0)) && (volume_totale_3 == 0)) && (cmp_4 == 0)) && (cmp_5 == 0) [2024-02-02 09:19:55,656 INFO L101 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-02-02 09:19:55,657 INFO L101 nessWitnessExtractor]: Location invariant before [L67-L67] (((((((((0LL - (long long )cmp_4) + (long long )cmp_5 >= 0LL) && ((long long )cmp_4 + (long long )cmp_5 >= 0LL)) && ((0LL - (long long )cmp_4) - (long long )cmp_5 >= 0LL)) && ((long long )cmp_4 - (long long )cmp_5 >= 0LL)) && (ora_2 == 0)) && (volume_totale_1 == 0)) && (volume_totale_3 == 0)) && (cmp_4 == 0)) && (cmp_5 == 0) [2024-02-02 09:19:55,677 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-02 09:19:55,790 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/chl-time-symm.wvr.c[2520,2533] [2024-02-02 09:19:55,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:19:55,803 INFO L202 MainTranslator]: Completed pre-run [2024-02-02 09:19:55,811 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 [2024-02-02 09:19:55,859 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/chl-time-symm.wvr.c[2520,2533] Start Parsing Local Start Parsing Local [2024-02-02 09:19:55,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:19:55,873 INFO L206 MainTranslator]: Completed translation [2024-02-02 09:19:55,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:55 WrapperNode [2024-02-02 09:19:55,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 09:19:55,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 09:19:55,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 09:19:55,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 09:19:55,880 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:19:55" (1/1) ... [2024-02-02 09:19:55,886 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:19:55" (1/1) ... [2024-02-02 09:19:55,917 INFO L138 Inliner]: procedures = 22, calls = 29, calls flagged for inlining = 9, calls inlined = 15, statements flattened = 177 [2024-02-02 09:19:55,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 09:19:55,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 09:19:55,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 09:19:55,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 09:19:55,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:55" (1/1) ... [2024-02-02 09:19:55,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:55" (1/1) ... [2024-02-02 09:19:55,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:55" (1/1) ... [2024-02-02 09:19:55,945 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-02 09:19:55,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:55" (1/1) ... [2024-02-02 09:19:55,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:55" (1/1) ... [2024-02-02 09:19:55,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:55" (1/1) ... [2024-02-02 09:19:55,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:55" (1/1) ... [2024-02-02 09:19:55,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:55" (1/1) ... [2024-02-02 09:19:55,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:55" (1/1) ... [2024-02-02 09:19:55,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 09:19:55,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 09:19:55,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 09:19:55,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 09:19:55,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:55" (1/1) ... [2024-02-02 09:19:55,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:19:55,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:19:56,001 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:19:56,007 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:19:56,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 09:19:56,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-02 09:19:56,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-02 09:19:56,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-02 09:19:56,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-02 09:19:56,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 09:19:56,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 09:19:56,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 09:19:56,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 09:19:56,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 09:19:56,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 09:19:56,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 09:19:56,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-02 09:19:56,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-02 09:19:56,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 09:19:56,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 09:19:56,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 09:19:56,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 09:19:56,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 09:19:56,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 09:19:56,032 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:19:56,113 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 09:19:56,114 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 09:19:56,390 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 09:19:56,390 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 09:19:56,692 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 09:19:56,692 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-02 09:19:56,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:19:56 BoogieIcfgContainer [2024-02-02 09:19:56,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 09:19:56,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 09:19:56,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 09:19:56,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 09:19:56,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:19:54" (1/4) ... [2024-02-02 09:19:56,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b01dca and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:19:56, skipping insertion in model container [2024-02-02 09:19:56,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:19:55" (2/4) ... [2024-02-02 09:19:56,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b01dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:19:56, skipping insertion in model container [2024-02-02 09:19:56,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:55" (3/4) ... [2024-02-02 09:19:56,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b01dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:19:56, skipping insertion in model container [2024-02-02 09:19:56,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:19:56" (4/4) ... [2024-02-02 09:19:56,703 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-time-symm.wvr.c [2024-02-02 09:19:56,718 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 09:19:56,719 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-02-02 09:19:56,719 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 09:19:56,782 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-02 09:19:56,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 49 transitions, 112 flow [2024-02-02 09:19:56,863 INFO L124 PetriNetUnfolderBase]: 0/47 cut-off events. [2024-02-02 09:19:56,863 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:19:56,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 47 events. 0/47 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 89 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-02-02 09:19:56,866 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 49 transitions, 112 flow [2024-02-02 09:19:56,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 46 transitions, 104 flow [2024-02-02 09:19:56,881 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 09:19:56,889 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;@34179d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 09:19:56,889 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-02-02 09:19:56,891 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 09:19:56,892 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 09:19:56,892 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:56,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:56,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 09:19:56,893 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-02 09:19:56,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:56,897 INFO L85 PathProgramCache]: Analyzing trace with hash 18868, now seen corresponding path program 1 times [2024-02-02 09:19:56,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:56,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103594574] [2024-02-02 09:19:56,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:56,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:57,216 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:19:57,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:57,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103594574] [2024-02-02 09:19:57,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103594574] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:57,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:57,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:57,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440111629] [2024-02-02 09:19:57,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:57,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:57,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:57,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:57,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:57,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2024-02-02 09:19:57,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:19:57,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:57,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2024-02-02 09:19:57,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:57,342 INFO L124 PetriNetUnfolderBase]: 39/106 cut-off events. [2024-02-02 09:19:57,342 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:57,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 106 events. 39/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 478 event pairs, 39 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 179. Up to 91 conditions per place. [2024-02-02 09:19:57,346 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 20 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2024-02-02 09:19:57,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 106 flow [2024-02-02 09:19:57,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2024-02-02 09:19:57,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43537414965986393 [2024-02-02 09:19:57,359 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 104 flow. Second operand 3 states and 64 transitions. [2024-02-02 09:19:57,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 106 flow [2024-02-02 09:19:57,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:57,363 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 64 flow [2024-02-02 09:19:57,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-02-02 09:19:57,367 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -18 predicate places. [2024-02-02 09:19:57,367 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 64 flow [2024-02-02 09:19:57,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:19:57,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:57,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-02 09:19:57,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 09:19:57,368 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-02 09:19:57,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:57,369 INFO L85 PathProgramCache]: Analyzing trace with hash 585504, now seen corresponding path program 1 times [2024-02-02 09:19:57,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:57,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628759769] [2024-02-02 09:19:57,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:57,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:57,470 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:19:57,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:57,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628759769] [2024-02-02 09:19:57,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628759769] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:57,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:57,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:57,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084700221] [2024-02-02 09:19:57,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:57,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:57,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:57,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:57,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:57,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-02-02 09:19:57,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:19:57,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:57,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-02-02 09:19:57,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:57,537 INFO L124 PetriNetUnfolderBase]: 39/105 cut-off events. [2024-02-02 09:19:57,537 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:57,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 105 events. 39/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 481 event pairs, 39 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 201. Up to 89 conditions per place. [2024-02-02 09:19:57,539 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 19 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2024-02-02 09:19:57,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 104 flow [2024-02-02 09:19:57,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:57,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2024-02-02 09:19:57,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3945578231292517 [2024-02-02 09:19:57,540 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 64 flow. Second operand 3 states and 58 transitions. [2024-02-02 09:19:57,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 104 flow [2024-02-02 09:19:57,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:57,541 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 62 flow [2024-02-02 09:19:57,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-02-02 09:19:57,543 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -19 predicate places. [2024-02-02 09:19:57,543 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 62 flow [2024-02-02 09:19:57,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:19:57,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:57,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-02 09:19:57,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 09:19:57,544 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-02 09:19:57,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:57,544 INFO L85 PathProgramCache]: Analyzing trace with hash 18151223, now seen corresponding path program 1 times [2024-02-02 09:19:57,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:57,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769978744] [2024-02-02 09:19:57,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:57,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:57,602 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:19:57,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:57,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769978744] [2024-02-02 09:19:57,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769978744] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:57,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:57,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:57,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383762528] [2024-02-02 09:19:57,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:57,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:57,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:57,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:57,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:57,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-02-02 09:19:57,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:19:57,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:57,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-02-02 09:19:57,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:57,659 INFO L124 PetriNetUnfolderBase]: 39/104 cut-off events. [2024-02-02 09:19:57,660 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:57,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 104 events. 39/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 479 event pairs, 39 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 197. Up to 87 conditions per place. [2024-02-02 09:19:57,661 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 18 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2024-02-02 09:19:57,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 100 flow [2024-02-02 09:19:57,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:57,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-02-02 09:19:57,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40816326530612246 [2024-02-02 09:19:57,664 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 62 flow. Second operand 3 states and 60 transitions. [2024-02-02 09:19:57,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 100 flow [2024-02-02 09:19:57,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:57,666 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 60 flow [2024-02-02 09:19:57,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2024-02-02 09:19:57,667 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -20 predicate places. [2024-02-02 09:19:57,667 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 60 flow [2024-02-02 09:19:57,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:19:57,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:57,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-02 09:19:57,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-02 09:19:57,669 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-02 09:19:57,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:57,669 INFO L85 PathProgramCache]: Analyzing trace with hash 562688485, now seen corresponding path program 1 times [2024-02-02 09:19:57,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:57,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610543592] [2024-02-02 09:19:57,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:57,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:57,711 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:19:57,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:57,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610543592] [2024-02-02 09:19:57,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610543592] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:57,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:57,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:57,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790089229] [2024-02-02 09:19:57,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:57,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:57,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:57,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:57,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:57,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-02-02 09:19:57,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:19:57,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:57,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-02-02 09:19:57,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:57,777 INFO L124 PetriNetUnfolderBase]: 39/103 cut-off events. [2024-02-02 09:19:57,778 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:57,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 103 events. 39/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 476 event pairs, 39 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 193. Up to 85 conditions per place. [2024-02-02 09:19:57,779 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 17 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2024-02-02 09:19:57,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 96 flow [2024-02-02 09:19:57,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:57,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-02-02 09:19:57,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4217687074829932 [2024-02-02 09:19:57,783 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 60 flow. Second operand 3 states and 62 transitions. [2024-02-02 09:19:57,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 96 flow [2024-02-02 09:19:57,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 25 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:57,784 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 58 flow [2024-02-02 09:19:57,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2024-02-02 09:19:57,786 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -21 predicate places. [2024-02-02 09:19:57,786 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 58 flow [2024-02-02 09:19:57,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:19:57,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:57,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-02 09:19:57,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-02 09:19:57,796 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-02 09:19:57,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:57,797 INFO L85 PathProgramCache]: Analyzing trace with hash 263474459, now seen corresponding path program 1 times [2024-02-02 09:19:57,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:57,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958095104] [2024-02-02 09:19:57,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:57,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:57,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:57,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958095104] [2024-02-02 09:19:57,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958095104] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:57,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:57,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:57,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124671037] [2024-02-02 09:19:57,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:57,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:57,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:57,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:57,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:57,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-02-02 09:19:57,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:19:57,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:57,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-02-02 09:19:57,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:57,889 INFO L124 PetriNetUnfolderBase]: 39/102 cut-off events. [2024-02-02 09:19:57,890 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:57,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 102 events. 39/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 475 event pairs, 39 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 189. Up to 83 conditions per place. [2024-02-02 09:19:57,891 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 16 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2024-02-02 09:19:57,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 24 transitions, 92 flow [2024-02-02 09:19:57,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2024-02-02 09:19:57,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43537414965986393 [2024-02-02 09:19:57,894 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 58 flow. Second operand 3 states and 64 transitions. [2024-02-02 09:19:57,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 24 transitions, 92 flow [2024-02-02 09:19:57,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 24 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:57,896 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 56 flow [2024-02-02 09:19:57,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2024-02-02 09:19:57,896 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -22 predicate places. [2024-02-02 09:19:57,897 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 56 flow [2024-02-02 09:19:57,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:19:57,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:57,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:57,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-02 09:19:57,897 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-02 09:19:57,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash -422225799, now seen corresponding path program 1 times [2024-02-02 09:19:57,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:57,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876638765] [2024-02-02 09:19:57,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:57,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:57,930 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:19:57,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:57,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876638765] [2024-02-02 09:19:57,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876638765] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:57,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:57,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:57,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292951612] [2024-02-02 09:19:57,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:57,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:57,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:57,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:57,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:57,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-02-02 09:19:57,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:19:57,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:57,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-02-02 09:19:57,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:57,986 INFO L124 PetriNetUnfolderBase]: 39/101 cut-off events. [2024-02-02 09:19:57,986 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:57,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 101 events. 39/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 476 event pairs, 39 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 185. Up to 81 conditions per place. [2024-02-02 09:19:57,987 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 15 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2024-02-02 09:19:57,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 23 transitions, 88 flow [2024-02-02 09:19:57,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2024-02-02 09:19:57,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2024-02-02 09:19:57,989 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 56 flow. Second operand 3 states and 66 transitions. [2024-02-02 09:19:57,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 23 transitions, 88 flow [2024-02-02 09:19:57,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 23 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:57,990 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 54 flow [2024-02-02 09:19:57,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2024-02-02 09:19:57,993 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -23 predicate places. [2024-02-02 09:19:57,993 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 54 flow [2024-02-02 09:19:57,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:19:57,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:57,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:57,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-02 09:19:57,994 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-02 09:19:57,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:57,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1431061732, now seen corresponding path program 1 times [2024-02-02 09:19:57,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:57,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778242004] [2024-02-02 09:19:57,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:57,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:58,091 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:19:58,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:58,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778242004] [2024-02-02 09:19:58,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778242004] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:58,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:58,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:19:58,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366153268] [2024-02-02 09:19:58,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:58,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:19:58,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:58,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:19:58,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:19:58,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2024-02-02 09:19:58,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:19:58,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:58,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2024-02-02 09:19:58,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:58,143 INFO L124 PetriNetUnfolderBase]: 39/99 cut-off events. [2024-02-02 09:19:58,144 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:58,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 99 events. 39/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 413 event pairs, 3 based on Foata normal form. 10/80 useless extension candidates. Maximal degree in co-relation 181. Up to 66 conditions per place. [2024-02-02 09:19:58,145 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 21 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2024-02-02 09:19:58,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 110 flow [2024-02-02 09:19:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:19:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:19:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2024-02-02 09:19:58,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.413265306122449 [2024-02-02 09:19:58,146 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 54 flow. Second operand 4 states and 81 transitions. [2024-02-02 09:19:58,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 110 flow [2024-02-02 09:19:58,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:58,147 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 50 flow [2024-02-02 09:19:58,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=50, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2024-02-02 09:19:58,147 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -24 predicate places. [2024-02-02 09:19:58,147 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 50 flow [2024-02-02 09:19:58,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:19:58,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:58,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:58,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 09:19:58,148 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 38 more)] === [2024-02-02 09:19:58,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:58,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1413241348, now seen corresponding path program 1 times [2024-02-02 09:19:58,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:58,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562835196] [2024-02-02 09:19:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:58,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:19:58,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 09:19:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:19:58,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 09:19:58,176 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 09:19:58,177 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 41 remaining) [2024-02-02 09:19:58,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 41 remaining) [2024-02-02 09:19:58,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 41 remaining) [2024-02-02 09:19:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 41 remaining) [2024-02-02 09:19:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 41 remaining) [2024-02-02 09:19:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 41 remaining) [2024-02-02 09:19:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 41 remaining) [2024-02-02 09:19:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 41 remaining) [2024-02-02 09:19:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 41 remaining) [2024-02-02 09:19:58,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 41 remaining) [2024-02-02 09:19:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 41 remaining) [2024-02-02 09:19:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 41 remaining) [2024-02-02 09:19:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 41 remaining) [2024-02-02 09:19:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 41 remaining) [2024-02-02 09:19:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 41 remaining) [2024-02-02 09:19:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 41 remaining) [2024-02-02 09:19:58,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 41 remaining) [2024-02-02 09:19:58,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 41 remaining) [2024-02-02 09:19:58,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 41 remaining) [2024-02-02 09:19:58,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 41 remaining) [2024-02-02 09:19:58,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 41 remaining) [2024-02-02 09:19:58,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 41 remaining) [2024-02-02 09:19:58,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 41 remaining) [2024-02-02 09:19:58,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (17 of 41 remaining) [2024-02-02 09:19:58,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 41 remaining) [2024-02-02 09:19:58,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 41 remaining) [2024-02-02 09:19:58,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 41 remaining) [2024-02-02 09:19:58,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 41 remaining) [2024-02-02 09:19:58,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 41 remaining) [2024-02-02 09:19:58,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 41 remaining) [2024-02-02 09:19:58,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 41 remaining) [2024-02-02 09:19:58,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 41 remaining) [2024-02-02 09:19:58,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 41 remaining) [2024-02-02 09:19:58,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 41 remaining) [2024-02-02 09:19:58,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 41 remaining) [2024-02-02 09:19:58,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 41 remaining) [2024-02-02 09:19:58,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 41 remaining) [2024-02-02 09:19:58,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 41 remaining) [2024-02-02 09:19:58,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 41 remaining) [2024-02-02 09:19:58,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 41 remaining) [2024-02-02 09:19:58,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 41 remaining) [2024-02-02 09:19:58,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-02 09:19:58,190 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:19:58,194 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 09:19:58,195 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 09:19:58,221 INFO L503 ceAbstractionStarter]: Automizer considered 22 witness invariants [2024-02-02 09:19:58,221 INFO L504 ceAbstractionStarter]: WitnessConsidered=22 [2024-02-02 09:19:58,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:19:58 BasicIcfg [2024-02-02 09:19:58,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 09:19:58,222 INFO L158 Benchmark]: Toolchain (without parser) took 2594.19ms. Allocated memory was 186.6MB in the beginning and 243.3MB in the end (delta: 56.6MB). Free memory was 156.2MB in the beginning and 131.7MB in the end (delta: 24.5MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2024-02-02 09:19:58,223 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 134.2MB. Free memory was 100.6MB in the beginning and 100.6MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:19:58,223 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory was 104.9MB in the beginning and 104.8MB in the end (delta: 80.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:19:58,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.57ms. Allocated memory is still 186.6MB. Free memory was 156.2MB in the beginning and 141.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-02-02 09:19:58,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.88ms. Allocated memory is still 186.6MB. Free memory was 141.1MB in the beginning and 138.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-02 09:19:58,225 INFO L158 Benchmark]: Boogie Preprocessor took 51.31ms. Allocated memory is still 186.6MB. Free memory was 138.2MB in the beginning and 136.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:19:58,225 INFO L158 Benchmark]: RCFGBuilder took 723.43ms. Allocated memory is still 186.6MB. Free memory was 136.1MB in the beginning and 115.4MB in the end (delta: 20.7MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. [2024-02-02 09:19:58,225 INFO L158 Benchmark]: TraceAbstraction took 1525.95ms. Allocated memory was 186.6MB in the beginning and 243.3MB in the end (delta: 56.6MB). Free memory was 115.4MB in the beginning and 131.7MB in the end (delta: -16.3MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2024-02-02 09:19:58,229 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 134.2MB. Free memory was 100.6MB in the beginning and 100.6MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory was 104.9MB in the beginning and 104.8MB in the end (delta: 80.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.57ms. Allocated memory is still 186.6MB. Free memory was 156.2MB in the beginning and 141.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.88ms. Allocated memory is still 186.6MB. Free memory was 141.1MB in the beginning and 138.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.31ms. Allocated memory is still 186.6MB. Free memory was 138.2MB in the beginning and 136.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 723.43ms. Allocated memory is still 186.6MB. Free memory was 136.1MB in the beginning and 115.4MB in the end (delta: 20.7MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1525.95ms. Allocated memory was 186.6MB in the beginning and 243.3MB in the end (delta: 56.6MB). Free memory was 115.4MB in the beginning and 131.7MB in the end (delta: -16.3MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 87]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] 0 int ora_0, ora_2; [L39] 0 int volume_totale_1, volume_totale_3; [L40] 0 int cmp_4, cmp_5; [L63] 0 pthread_t t1, t2; VAL [cmp_4=0, cmp_5=0, ora_0=0, ora_2=0, t1={3:0}, t2={5:0}, volume_totale_1=0, volume_totale_3=0] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[ora_0],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[ora_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cmp_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cmp_5],IntegerLiteral[0]]]]] [L66] 0 ora_0 = __VERIFIER_nondet_int() [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[ora_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cmp_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cmp_5],IntegerLiteral[0]]]]] [L67] 0 ora_2 = __VERIFIER_nondet_int() [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cmp_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cmp_5],IntegerLiteral[0]]]]] [L68] 0 volume_totale_1 = __VERIFIER_nondet_int() [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cmp_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cmp_5],IntegerLiteral[0]]]]] [L69] 0 volume_totale_3 = __VERIFIER_nondet_int() [L70] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[cmp_4]],CastExpression[ACSLType[long long],IdentifierExpression[cmp_5]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[cmp_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[cmp_5],IntegerLiteral[0]]]]] [L70] 0 cmp_4 = __VERIFIER_nondet_int() [L71] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_5],IntegerLiteral[0]]]] [L71] 0 cmp_5 = __VERIFIER_nondet_int() [L74] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [cmp_4=0, cmp_5=0, ora_0=0, ora_2=6, t1={3:0}, t2={5:0}, volume_totale_1=0, volume_totale_3=0] [L44] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, cmp_4=0, cmp_5=0, ora_0=0, ora_2=6, volume_totale_1=0, volume_totale_3=0] [L45] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] [L45] CALL 1 minus(ora_0, ora_2) [L86] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] [L86] CALL 1 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L35] COND FALSE 1 !(!cond) [L86] RET 1 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L87] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IdentifierExpression[b],UnaryExpression[MINUS,IntegerLiteral[1]]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] VAL [\old(a)=0, \old(b)=6, a=0, b=6, cmp_4=0, cmp_5=0, ora_0=0, ora_2=6, volume_totale_1=0, volume_totale_3=0] - UnprovableResult [Line: 44]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 49]: 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: 54]: 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: 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: 56]: 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: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: 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: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: 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: 74]: 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: 75]: 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, 78 locations, 41 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: 1.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 286 IncrementalHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 28 mSDtfsCounter, 286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:19:58,277 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