./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-time-trans.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-trans.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 27552612 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-trans.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-time-trans.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-2755261-m [2024-01-26 15:20:35,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 15:20:35,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-26 15:20:35,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 15:20:35,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 15:20:36,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 15:20:36,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 15:20:36,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 15:20:36,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-26 15:20:36,013 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-26 15:20:36,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 15:20:36,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 15:20:36,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 15:20:36,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 15:20:36,015 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 15:20:36,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 15:20:36,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 15:20:36,016 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 15:20:36,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 15:20:36,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 15:20:36,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 15:20:36,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 15:20:36,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 15:20:36,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 15:20:36,018 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-26 15:20:36,018 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 15:20:36,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 15:20:36,019 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 15:20:36,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 15:20:36,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 15:20:36,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-26 15:20:36,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 15:20:36,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-26 15:20:36,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 15:20:36,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 15:20:36,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-26 15:20:36,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 15:20:36,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 15:20:36,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 15:20:36,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-26 15:20:36,023 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 15:20:36,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-26 15:20:36,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-26 15:20:36,023 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-26 15:20:36,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 15:20:36,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 15:20:36,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 15:20:36,259 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-26 15:20:36,260 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-26 15:20:36,260 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-trans.wvr.yml/witness.yml [2024-01-26 15:20:36,374 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 15:20:36,374 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 15:20:36,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-time-trans.wvr.c [2024-01-26 15:20:37,367 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 15:20:37,570 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 15:20:37,570 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-time-trans.wvr.c [2024-01-26 15:20:37,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f6cedc6/898acab53b3d4892880aea81acee861c/FLAGf29d2d3aa [2024-01-26 15:20:37,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f6cedc6/898acab53b3d4892880aea81acee861c [2024-01-26 15:20:37,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 15:20:37,589 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 15:20:37,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 15:20:37,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 15:20:37,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 15:20:37,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 26.01 03:20:36" (1/2) ... [2024-01-26 15:20:37,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@330613e7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 26.01 03:20:37, skipping insertion in model container [2024-01-26 15:20:37,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 26.01 03:20:36" (1/2) ... [2024-01-26 15:20:37,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3c06aabc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 26.01 03:20:37, skipping insertion in model container [2024-01-26 15:20:37,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 03:20:37" (2/2) ... [2024-01-26 15:20:37,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@330613e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:37, skipping insertion in model container [2024-01-26 15:20:37,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 03:20:37" (2/2) ... [2024-01-26 15:20:37,596 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-26 15:20:37,617 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-26 15:20:37,618 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-01-26 15:20:37,618 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] cmp_8 == 0 [2024-01-26 15:20:37,619 INFO L98 nessWitnessExtractor]: Location invariant before [L100-L100] b != 0 [2024-01-26 15:20:37,619 INFO L98 nessWitnessExtractor]: Location invariant before [L100-L100] b <= -1 [2024-01-26 15:20:37,619 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] volume_totale_1 == 0 [2024-01-26 15:20:37,619 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] cmp_6 == 0 [2024-01-26 15:20:37,619 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] cmp_8 == 0 [2024-01-26 15:20:37,619 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] ora_2 == 0 [2024-01-26 15:20:37,619 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] ora_4 == 0 [2024-01-26 15:20:37,619 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] volume_totale_5 == 0 [2024-01-26 15:20:37,619 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] volume_totale_3 == 0 [2024-01-26 15:20:37,619 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] cmp_7 == 0 [2024-01-26 15:20:37,619 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cmp_8 == 0 [2024-01-26 15:20:37,619 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cmp_7 == 0 [2024-01-26 15:20:37,619 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] cmp_6 == 0 [2024-01-26 15:20:37,620 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cmp_8 == 0 [2024-01-26 15:20:37,620 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cmp_7 == 0 [2024-01-26 15:20:37,620 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] volume_totale_3 == 0 [2024-01-26 15:20:37,620 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] cmp_6 == 0 [2024-01-26 15:20:37,620 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] volume_totale_5 == 0 [2024-01-26 15:20:37,620 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (unsigned long )_argptr == 0UL [2024-01-26 15:20:37,620 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-26 15:20:37,620 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] ora_0 == 0 [2024-01-26 15:20:37,620 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] cmp_6 == 0 [2024-01-26 15:20:37,620 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] cmp_8 == 0 [2024-01-26 15:20:37,620 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] cmp_7 == 0 [2024-01-26 15:20:37,620 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] ora_2 == 0 [2024-01-26 15:20:37,620 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] volume_totale_1 == 0 [2024-01-26 15:20:37,620 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] volume_totale_3 == 0 [2024-01-26 15:20:37,621 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] ora_4 == 0 [2024-01-26 15:20:37,621 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] volume_totale_5 == 0 [2024-01-26 15:20:37,621 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (unsigned long )_argptr == 0UL [2024-01-26 15:20:37,621 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] volume_totale_5 == 0 [2024-01-26 15:20:37,621 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cmp_6 == 0 [2024-01-26 15:20:37,621 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cmp_7 == 0 [2024-01-26 15:20:37,621 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] cmp_8 == 0 [2024-01-26 15:20:37,621 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (unsigned long )_argptr == 0UL [2024-01-26 15:20:37,621 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] cmp_8 == 0 [2024-01-26 15:20:37,621 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-26 15:20:37,621 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-26 15:20:37,621 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] ora_4 == 0 [2024-01-26 15:20:37,621 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] cmp_7 == 0 [2024-01-26 15:20:37,622 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] volume_totale_1 == 0 [2024-01-26 15:20:37,622 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] volume_totale_5 == 0 [2024-01-26 15:20:37,622 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] volume_totale_3 == 0 [2024-01-26 15:20:37,622 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] cmp_8 == 0 [2024-01-26 15:20:37,622 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] cmp_6 == 0 [2024-01-26 15:20:37,622 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cmp_7 == 0 [2024-01-26 15:20:37,622 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] cmp_8 == 0 [2024-01-26 15:20:37,622 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] (unsigned long )_argptr == 0UL [2024-01-26 15:20:37,622 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L49] (unsigned long )_argptr == 0UL [2024-01-26 15:20:37,622 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] cmp_7 == 0 [2024-01-26 15:20:37,622 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] cmp_6 == 0 [2024-01-26 15:20:37,622 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] cmp_8 == 0 [2024-01-26 15:20:37,622 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] volume_totale_1 == 0 [2024-01-26 15:20:37,623 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] volume_totale_3 == 0 [2024-01-26 15:20:37,623 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] volume_totale_5 == 0 [2024-01-26 15:20:37,623 INFO L98 nessWitnessExtractor]: Location invariant before [L99-L99] 1 <= b [2024-01-26 15:20:37,623 INFO L98 nessWitnessExtractor]: Location invariant before [L99-L99] b != 0 [2024-01-26 15:20:37,623 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (unsigned long )_argptr == 0UL [2024-01-26 15:20:37,623 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-01-26 15:20:37,623 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-26 15:20:37,639 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 15:20:37,786 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-trans.wvr.c[2875,2888] [2024-01-26 15:20:37,797 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 15:20:37,806 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 15:20:37,817 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-26 15:20:37,863 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-trans.wvr.c[2875,2888] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-26 15:20:37,866 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 15:20:37,876 INFO L206 MainTranslator]: Completed translation [2024-01-26 15:20:37,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:37 WrapperNode [2024-01-26 15:20:37,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 15:20:37,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 15:20:37,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 15:20:37,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 15:20:37,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:37" (1/1) ... [2024-01-26 15:20:37,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:37" (1/1) ... [2024-01-26 15:20:37,911 INFO L138 Inliner]: procedures = 23, calls = 39, calls flagged for inlining = 11, calls inlined = 21, statements flattened = 306 [2024-01-26 15:20:37,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 15:20:37,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 15:20:37,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 15:20:37,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 15:20:37,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:37" (1/1) ... [2024-01-26 15:20:37,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:37" (1/1) ... [2024-01-26 15:20:37,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:37" (1/1) ... [2024-01-26 15:20:37,941 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-26 15:20:37,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:37" (1/1) ... [2024-01-26 15:20:37,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:37" (1/1) ... [2024-01-26 15:20:37,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:37" (1/1) ... [2024-01-26 15:20:37,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:37" (1/1) ... [2024-01-26 15:20:37,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:37" (1/1) ... [2024-01-26 15:20:37,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:37" (1/1) ... [2024-01-26 15:20:37,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 15:20:37,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 15:20:37,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 15:20:37,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 15:20:37,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:37" (1/1) ... [2024-01-26 15:20:37,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-26 15:20:37,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-26 15:20:38,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-01-26 15:20:38,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-26 15:20:38,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 15:20:38,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 15:20:38,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 15:20:38,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 15:20:38,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 15:20:38,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-26 15:20:38,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-26 15:20:38,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-26 15:20:38,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-26 15:20:38,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-26 15:20:38,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-26 15:20:38,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 15:20:38,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-26 15:20:38,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-26 15:20:38,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-26 15:20:38,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-26 15:20:38,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-26 15:20:38,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-26 15:20:38,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 15:20:38,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 15:20:38,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-26 15:20:38,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-26 15:20:38,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-26 15:20:38,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-26 15:20:38,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 15:20:38,048 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 15:20:38,155 INFO L244 CfgBuilder]: Building ICFG [2024-01-26 15:20:38,157 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 15:20:38,600 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-26 15:20:38,601 INFO L293 CfgBuilder]: Performing block encoding [2024-01-26 15:20:38,918 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 15:20:38,918 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-26 15:20:38,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 03:20:38 BoogieIcfgContainer [2024-01-26 15:20:38,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 15:20:38,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 15:20:38,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 15:20:38,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 15:20:38,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 26.01 03:20:36" (1/4) ... [2024-01-26 15:20:38,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e50d23 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 26.01 03:20:38, skipping insertion in model container [2024-01-26 15:20:38,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 03:20:37" (2/4) ... [2024-01-26 15:20:38,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e50d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 03:20:38, skipping insertion in model container [2024-01-26 15:20:38,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 03:20:37" (3/4) ... [2024-01-26 15:20:38,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e50d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 03:20:38, skipping insertion in model container [2024-01-26 15:20:38,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 03:20:38" (4/4) ... [2024-01-26 15:20:38,925 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-time-trans.wvr.c [2024-01-26 15:20:38,940 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 15:20:38,940 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 82 error locations. [2024-01-26 15:20:38,940 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 15:20:39,030 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-26 15:20:39,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 156 transitions, 333 flow [2024-01-26 15:20:39,137 INFO L124 PetriNetUnfolderBase]: 0/153 cut-off events. [2024-01-26 15:20:39,137 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-26 15:20:39,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 153 events. 0/153 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 293 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-01-26 15:20:39,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 156 transitions, 333 flow [2024-01-26 15:20:39,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 152 transitions, 322 flow [2024-01-26 15:20:39,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-26 15:20:39,179 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;@1a6fb9e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 15:20:39,180 INFO L358 AbstractCegarLoop]: Starting to check reachability of 121 error locations. [2024-01-26 15:20:39,181 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-26 15:20:39,182 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-26 15:20:39,182 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-26 15:20:39,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:39,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-26 15:20:39,183 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 118 more)] === [2024-01-26 15:20:39,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash 32399, now seen corresponding path program 1 times [2024-01-26 15:20:39,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:39,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401304719] [2024-01-26 15:20:39,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:39,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:20:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 15:20:39,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:20:39,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401304719] [2024-01-26 15:20:39,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401304719] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:20:39,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:20:39,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:20:39,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201244920] [2024-01-26 15:20:39,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:20:39,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:20:39,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:20:39,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:20:39,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:20:39,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 156 [2024-01-26 15:20:39,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 152 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:39,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:20:39,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 156 [2024-01-26 15:20:39,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:20:39,682 INFO L124 PetriNetUnfolderBase]: 564/1052 cut-off events. [2024-01-26 15:20:39,682 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-26 15:20:39,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2008 conditions, 1052 events. 564/1052 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 6540 event pairs, 564 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 1899. Up to 879 conditions per place. [2024-01-26 15:20:39,693 INFO L140 encePairwiseOnDemand]: 127/156 looper letters, 31 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2024-01-26 15:20:39,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 112 transitions, 299 flow [2024-01-26 15:20:39,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:20:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:20:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2024-01-26 15:20:39,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2024-01-26 15:20:39,711 INFO L175 Difference]: Start difference. First operand has 162 places, 152 transitions, 322 flow. Second operand 3 states and 318 transitions. [2024-01-26 15:20:39,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 112 transitions, 299 flow [2024-01-26 15:20:39,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 112 transitions, 296 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-26 15:20:39,718 INFO L231 Difference]: Finished difference. Result has 121 places, 112 transitions, 234 flow [2024-01-26 15:20:39,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=121, PETRI_TRANSITIONS=112} [2024-01-26 15:20:39,723 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -41 predicate places. [2024-01-26 15:20:39,723 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 112 transitions, 234 flow [2024-01-26 15:20:39,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:39,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:39,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-26 15:20:39,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 15:20:39,724 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 118 more)] === [2024-01-26 15:20:39,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:39,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1005428, now seen corresponding path program 1 times [2024-01-26 15:20:39,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:39,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112591736] [2024-01-26 15:20:39,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:39,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:20:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 15:20:39,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:20:39,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112591736] [2024-01-26 15:20:39,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112591736] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:20:39,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:20:39,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:20:39,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506306396] [2024-01-26 15:20:39,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:20:39,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:20:39,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:20:39,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:20:39,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:20:39,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 156 [2024-01-26 15:20:39,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 112 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:39,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:20:39,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 156 [2024-01-26 15:20:39,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:20:39,891 INFO L124 PetriNetUnfolderBase]: 524/994 cut-off events. [2024-01-26 15:20:39,891 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-26 15:20:39,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1907 conditions, 994 events. 524/994 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 5960 event pairs, 359 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 1823. Up to 577 conditions per place. [2024-01-26 15:20:39,897 INFO L140 encePairwiseOnDemand]: 145/156 looper letters, 37 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2024-01-26 15:20:39,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 120 transitions, 334 flow [2024-01-26 15:20:39,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:20:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:20:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2024-01-26 15:20:39,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-01-26 15:20:39,899 INFO L175 Difference]: Start difference. First operand has 121 places, 112 transitions, 234 flow. Second operand 3 states and 324 transitions. [2024-01-26 15:20:39,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 120 transitions, 334 flow [2024-01-26 15:20:39,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:20:39,901 INFO L231 Difference]: Finished difference. Result has 120 places, 111 transitions, 256 flow [2024-01-26 15:20:39,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=120, PETRI_TRANSITIONS=111} [2024-01-26 15:20:39,902 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -42 predicate places. [2024-01-26 15:20:39,902 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 111 transitions, 256 flow [2024-01-26 15:20:39,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:39,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:39,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-26 15:20:39,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-26 15:20:39,903 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 118 more)] === [2024-01-26 15:20:39,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:39,904 INFO L85 PathProgramCache]: Analyzing trace with hash 31169359, now seen corresponding path program 1 times [2024-01-26 15:20:39,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:39,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774007252] [2024-01-26 15:20:39,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:39,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:20:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 15:20:39,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:20:39,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774007252] [2024-01-26 15:20:39,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774007252] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:20:39,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:20:39,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:20:39,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428380604] [2024-01-26 15:20:39,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:20:39,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:20:39,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:20:39,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:20:39,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:20:39,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 156 [2024-01-26 15:20:39,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 111 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:39,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:20:39,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 156 [2024-01-26 15:20:39,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:20:40,096 INFO L124 PetriNetUnfolderBase]: 524/1004 cut-off events. [2024-01-26 15:20:40,096 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2024-01-26 15:20:40,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2303 conditions, 1004 events. 524/1004 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 6450 event pairs, 514 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 2199. Up to 840 conditions per place. [2024-01-26 15:20:40,103 INFO L140 encePairwiseOnDemand]: 149/156 looper letters, 33 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2024-01-26 15:20:40,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 106 transitions, 316 flow [2024-01-26 15:20:40,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:20:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:20:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2024-01-26 15:20:40,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-01-26 15:20:40,105 INFO L175 Difference]: Start difference. First operand has 120 places, 111 transitions, 256 flow. Second operand 3 states and 299 transitions. [2024-01-26 15:20:40,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 106 transitions, 316 flow [2024-01-26 15:20:40,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 106 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:20:40,110 INFO L231 Difference]: Finished difference. Result has 115 places, 106 transitions, 242 flow [2024-01-26 15:20:40,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2024-01-26 15:20:40,111 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -47 predicate places. [2024-01-26 15:20:40,112 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 242 flow [2024-01-26 15:20:40,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:40,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:40,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-26 15:20:40,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-26 15:20:40,112 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 118 more)] === [2024-01-26 15:20:40,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:40,113 INFO L85 PathProgramCache]: Analyzing trace with hash 966251222, now seen corresponding path program 1 times [2024-01-26 15:20:40,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:40,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169303544] [2024-01-26 15:20:40,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:40,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:20:40,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 15:20:40,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:20:40,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169303544] [2024-01-26 15:20:40,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169303544] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:20:40,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:20:40,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:20:40,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671036978] [2024-01-26 15:20:40,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:20:40,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:20:40,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:20:40,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:20:40,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:20:40,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 156 [2024-01-26 15:20:40,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:40,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:20:40,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 156 [2024-01-26 15:20:40,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:20:40,306 INFO L124 PetriNetUnfolderBase]: 524/1000 cut-off events. [2024-01-26 15:20:40,306 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2024-01-26 15:20:40,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2207 conditions, 1000 events. 524/1000 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 6452 event pairs, 514 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 2136. Up to 841 conditions per place. [2024-01-26 15:20:40,313 INFO L140 encePairwiseOnDemand]: 150/156 looper letters, 31 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2024-01-26 15:20:40,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 102 transitions, 300 flow [2024-01-26 15:20:40,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:20:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:20:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2024-01-26 15:20:40,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6517094017094017 [2024-01-26 15:20:40,314 INFO L175 Difference]: Start difference. First operand has 115 places, 106 transitions, 242 flow. Second operand 3 states and 305 transitions. [2024-01-26 15:20:40,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 102 transitions, 300 flow [2024-01-26 15:20:40,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 102 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:20:40,316 INFO L231 Difference]: Finished difference. Result has 111 places, 102 transitions, 234 flow [2024-01-26 15:20:40,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=111, PETRI_TRANSITIONS=102} [2024-01-26 15:20:40,317 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -51 predicate places. [2024-01-26 15:20:40,317 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 102 transitions, 234 flow [2024-01-26 15:20:40,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:40,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:40,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-26 15:20:40,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-26 15:20:40,318 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 118 more)] === [2024-01-26 15:20:40,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:40,318 INFO L85 PathProgramCache]: Analyzing trace with hash -110982061, now seen corresponding path program 1 times [2024-01-26 15:20:40,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:40,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142800961] [2024-01-26 15:20:40,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:20:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 15:20:40,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:20:40,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142800961] [2024-01-26 15:20:40,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142800961] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:20:40,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:20:40,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:20:40,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091065654] [2024-01-26 15:20:40,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:20:40,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:20:40,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:20:40,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:20:40,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:20:40,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 156 [2024-01-26 15:20:40,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 102 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:40,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:20:40,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 156 [2024-01-26 15:20:40,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:20:40,473 INFO L124 PetriNetUnfolderBase]: 524/980 cut-off events. [2024-01-26 15:20:40,473 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2024-01-26 15:20:40,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2186 conditions, 980 events. 524/980 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 6011 event pairs, 399 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 2127. Up to 664 conditions per place. [2024-01-26 15:20:40,478 INFO L140 encePairwiseOnDemand]: 151/156 looper letters, 44 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2024-01-26 15:20:40,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 115 transitions, 374 flow [2024-01-26 15:20:40,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:20:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:20:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2024-01-26 15:20:40,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-01-26 15:20:40,480 INFO L175 Difference]: Start difference. First operand has 111 places, 102 transitions, 234 flow. Second operand 3 states and 324 transitions. [2024-01-26 15:20:40,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 115 transitions, 374 flow [2024-01-26 15:20:40,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 115 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:20:40,482 INFO L231 Difference]: Finished difference. Result has 109 places, 100 transitions, 232 flow [2024-01-26 15:20:40,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=109, PETRI_TRANSITIONS=100} [2024-01-26 15:20:40,483 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -53 predicate places. [2024-01-26 15:20:40,483 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 100 transitions, 232 flow [2024-01-26 15:20:40,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:40,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:40,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:20:40,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-26 15:20:40,484 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 118 more)] === [2024-01-26 15:20:40,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:40,484 INFO L85 PathProgramCache]: Analyzing trace with hash 854524466, now seen corresponding path program 1 times [2024-01-26 15:20:40,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:40,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784647731] [2024-01-26 15:20:40,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:40,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:20:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 15:20:40,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:20:40,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784647731] [2024-01-26 15:20:40,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784647731] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:20:40,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:20:40,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:20:40,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67986494] [2024-01-26 15:20:40,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:20:40,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:20:40,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:20:40,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:20:40,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:20:40,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 156 [2024-01-26 15:20:40,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 100 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:40,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:20:40,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 156 [2024-01-26 15:20:40,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:20:40,653 INFO L124 PetriNetUnfolderBase]: 524/990 cut-off events. [2024-01-26 15:20:40,654 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2024-01-26 15:20:40,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2262 conditions, 990 events. 524/990 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 6406 event pairs, 514 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 2171. Up to 837 conditions per place. [2024-01-26 15:20:40,659 INFO L140 encePairwiseOnDemand]: 146/156 looper letters, 34 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2024-01-26 15:20:40,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 92 transitions, 288 flow [2024-01-26 15:20:40,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:20:40,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:20:40,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2024-01-26 15:20:40,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6217948717948718 [2024-01-26 15:20:40,660 INFO L175 Difference]: Start difference. First operand has 109 places, 100 transitions, 232 flow. Second operand 3 states and 291 transitions. [2024-01-26 15:20:40,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 92 transitions, 288 flow [2024-01-26 15:20:40,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 92 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:20:40,662 INFO L231 Difference]: Finished difference. Result has 101 places, 92 transitions, 214 flow [2024-01-26 15:20:40,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=101, PETRI_TRANSITIONS=92} [2024-01-26 15:20:40,665 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -61 predicate places. [2024-01-26 15:20:40,665 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 92 transitions, 214 flow [2024-01-26 15:20:40,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:40,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:40,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:20:40,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-26 15:20:40,666 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 118 more)] === [2024-01-26 15:20:40,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash 720455712, now seen corresponding path program 1 times [2024-01-26 15:20:40,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:40,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931143622] [2024-01-26 15:20:40,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:40,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:20:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 15:20:40,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:20:40,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931143622] [2024-01-26 15:20:40,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931143622] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:20:40,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:20:40,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:20:40,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728827628] [2024-01-26 15:20:40,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:20:40,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:20:40,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:20:40,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:20:40,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:20:40,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 156 [2024-01-26 15:20:40,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 92 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:40,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:20:40,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 156 [2024-01-26 15:20:40,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:20:40,810 INFO L124 PetriNetUnfolderBase]: 524/981 cut-off events. [2024-01-26 15:20:40,810 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-01-26 15:20:40,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2191 conditions, 981 events. 524/981 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 6454 event pairs, 514 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 2115. Up to 836 conditions per place. [2024-01-26 15:20:40,815 INFO L140 encePairwiseOnDemand]: 145/156 looper letters, 34 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-01-26 15:20:40,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 83 transitions, 268 flow [2024-01-26 15:20:40,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:20:40,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:20:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2024-01-26 15:20:40,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6175213675213675 [2024-01-26 15:20:40,817 INFO L175 Difference]: Start difference. First operand has 101 places, 92 transitions, 214 flow. Second operand 3 states and 289 transitions. [2024-01-26 15:20:40,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 83 transitions, 268 flow [2024-01-26 15:20:40,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 83 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:20:40,819 INFO L231 Difference]: Finished difference. Result has 92 places, 83 transitions, 196 flow [2024-01-26 15:20:40,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=92, PETRI_TRANSITIONS=83} [2024-01-26 15:20:40,819 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -70 predicate places. [2024-01-26 15:20:40,819 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 83 transitions, 196 flow [2024-01-26 15:20:40,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:40,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:40,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:20:40,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-26 15:20:40,820 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 118 more)] === [2024-01-26 15:20:40,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:40,821 INFO L85 PathProgramCache]: Analyzing trace with hash 859291606, now seen corresponding path program 1 times [2024-01-26 15:20:40,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:40,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740462039] [2024-01-26 15:20:40,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:40,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:20:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 15:20:40,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:20:40,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740462039] [2024-01-26 15:20:40,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740462039] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:20:40,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:20:40,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:20:40,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048001269] [2024-01-26 15:20:40,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:20:40,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:20:40,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:20:40,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:20:40,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:20:40,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 156 [2024-01-26 15:20:40,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 83 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:40,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:20:40,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 156 [2024-01-26 15:20:40,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:20:40,951 INFO L124 PetriNetUnfolderBase]: 524/974 cut-off events. [2024-01-26 15:20:40,952 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-01-26 15:20:40,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2185 conditions, 974 events. 524/974 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 6392 event pairs, 514 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 2113. Up to 838 conditions per place. [2024-01-26 15:20:40,957 INFO L140 encePairwiseOnDemand]: 147/156 looper letters, 35 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2024-01-26 15:20:40,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 76 transitions, 256 flow [2024-01-26 15:20:40,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:20:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:20:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2024-01-26 15:20:40,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6217948717948718 [2024-01-26 15:20:40,958 INFO L175 Difference]: Start difference. First operand has 92 places, 83 transitions, 196 flow. Second operand 3 states and 291 transitions. [2024-01-26 15:20:40,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 76 transitions, 256 flow [2024-01-26 15:20:40,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 76 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:20:40,961 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 182 flow [2024-01-26 15:20:40,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2024-01-26 15:20:40,963 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -77 predicate places. [2024-01-26 15:20:40,963 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 182 flow [2024-01-26 15:20:40,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:40,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:40,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:20:40,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-26 15:20:40,964 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 118 more)] === [2024-01-26 15:20:40,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:40,964 INFO L85 PathProgramCache]: Analyzing trace with hash 868237042, now seen corresponding path program 1 times [2024-01-26 15:20:40,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:40,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413744313] [2024-01-26 15:20:40,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:40,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:20:40,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 15:20:40,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:20:40,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413744313] [2024-01-26 15:20:40,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413744313] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:20:40,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:20:40,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-26 15:20:40,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582600022] [2024-01-26 15:20:40,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:20:40,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 15:20:40,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:20:40,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 15:20:40,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 15:20:40,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 156 [2024-01-26 15:20:40,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:40,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:20:40,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 156 [2024-01-26 15:20:40,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:20:41,090 INFO L124 PetriNetUnfolderBase]: 524/973 cut-off events. [2024-01-26 15:20:41,090 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2024-01-26 15:20:41,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 973 events. 524/973 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 6403 event pairs, 514 based on Foata normal form. 0/515 useless extension candidates. Maximal degree in co-relation 2118. Up to 844 conditions per place. [2024-01-26 15:20:41,100 INFO L140 encePairwiseOnDemand]: 153/156 looper letters, 28 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2024-01-26 15:20:41,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 75 transitions, 240 flow [2024-01-26 15:20:41,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 15:20:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-26 15:20:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2024-01-26 15:20:41,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6773504273504274 [2024-01-26 15:20:41,101 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 182 flow. Second operand 3 states and 317 transitions. [2024-01-26 15:20:41,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 75 transitions, 240 flow [2024-01-26 15:20:41,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 75 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:20:41,103 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 180 flow [2024-01-26 15:20:41,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=84, PETRI_TRANSITIONS=75} [2024-01-26 15:20:41,105 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -78 predicate places. [2024-01-26 15:20:41,106 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 180 flow [2024-01-26 15:20:41,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:41,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:41,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:20:41,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-26 15:20:41,108 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 118 more)] === [2024-01-26 15:20:41,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:41,108 INFO L85 PathProgramCache]: Analyzing trace with hash 124373065, now seen corresponding path program 1 times [2024-01-26 15:20:41,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:41,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933934243] [2024-01-26 15:20:41,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:41,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 15:20:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 15:20:41,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 15:20:41,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933934243] [2024-01-26 15:20:41,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933934243] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 15:20:41,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 15:20:41,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 15:20:41,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223159129] [2024-01-26 15:20:41,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 15:20:41,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-26 15:20:41,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 15:20:41,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-26 15:20:41,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-26 15:20:41,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 156 [2024-01-26 15:20:41,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 75 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:41,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-26 15:20:41,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 156 [2024-01-26 15:20:41,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-26 15:20:41,375 INFO L124 PetriNetUnfolderBase]: 524/960 cut-off events. [2024-01-26 15:20:41,375 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2024-01-26 15:20:41,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2164 conditions, 960 events. 524/960 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 6268 event pairs, 54 based on Foata normal form. 62/688 useless extension candidates. Maximal degree in co-relation 2145. Up to 716 conditions per place. [2024-01-26 15:20:41,380 INFO L140 encePairwiseOnDemand]: 152/156 looper letters, 43 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2024-01-26 15:20:41,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 88 transitions, 316 flow [2024-01-26 15:20:41,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 15:20:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-26 15:20:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2024-01-26 15:20:41,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6714743589743589 [2024-01-26 15:20:41,381 INFO L175 Difference]: Start difference. First operand has 84 places, 75 transitions, 180 flow. Second operand 4 states and 419 transitions. [2024-01-26 15:20:41,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 88 transitions, 316 flow [2024-01-26 15:20:41,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 88 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-26 15:20:41,383 INFO L231 Difference]: Finished difference. Result has 83 places, 73 transitions, 176 flow [2024-01-26 15:20:41,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=83, PETRI_TRANSITIONS=73} [2024-01-26 15:20:41,384 INFO L281 CegarLoopForPetriNet]: 162 programPoint places, -79 predicate places. [2024-01-26 15:20:41,384 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 73 transitions, 176 flow [2024-01-26 15:20:41,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 15:20:41,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-26 15:20:41,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:20:41,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-26 15:20:41,385 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 118 more)] === [2024-01-26 15:20:41,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 15:20:41,386 INFO L85 PathProgramCache]: Analyzing trace with hash -439401145, now seen corresponding path program 1 times [2024-01-26 15:20:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 15:20:41,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178168468] [2024-01-26 15:20:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 15:20:41,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 15:20:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-26 15:20:41,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-26 15:20:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-26 15:20:41,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-26 15:20:41,438 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-26 15:20:41,438 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 121 remaining) [2024-01-26 15:20:41,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 121 remaining) [2024-01-26 15:20:41,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 121 remaining) [2024-01-26 15:20:41,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 121 remaining) [2024-01-26 15:20:41,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 121 remaining) [2024-01-26 15:20:41,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 121 remaining) [2024-01-26 15:20:41,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 121 remaining) [2024-01-26 15:20:41,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 121 remaining) [2024-01-26 15:20:41,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 121 remaining) [2024-01-26 15:20:41,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 121 remaining) [2024-01-26 15:20:41,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 121 remaining) [2024-01-26 15:20:41,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 121 remaining) [2024-01-26 15:20:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 121 remaining) [2024-01-26 15:20:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 121 remaining) [2024-01-26 15:20:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 121 remaining) [2024-01-26 15:20:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 121 remaining) [2024-01-26 15:20:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 121 remaining) [2024-01-26 15:20:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 121 remaining) [2024-01-26 15:20:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 121 remaining) [2024-01-26 15:20:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 121 remaining) [2024-01-26 15:20:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 121 remaining) [2024-01-26 15:20:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 121 remaining) [2024-01-26 15:20:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 121 remaining) [2024-01-26 15:20:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 121 remaining) [2024-01-26 15:20:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 121 remaining) [2024-01-26 15:20:41,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 121 remaining) [2024-01-26 15:20:41,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 121 remaining) [2024-01-26 15:20:41,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 121 remaining) [2024-01-26 15:20:41,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 121 remaining) [2024-01-26 15:20:41,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 121 remaining) [2024-01-26 15:20:41,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 121 remaining) [2024-01-26 15:20:41,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 121 remaining) [2024-01-26 15:20:41,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 121 remaining) [2024-01-26 15:20:41,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 121 remaining) [2024-01-26 15:20:41,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 121 remaining) [2024-01-26 15:20:41,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 121 remaining) [2024-01-26 15:20:41,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 121 remaining) [2024-01-26 15:20:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 121 remaining) [2024-01-26 15:20:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 121 remaining) [2024-01-26 15:20:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 121 remaining) [2024-01-26 15:20:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 121 remaining) [2024-01-26 15:20:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 121 remaining) [2024-01-26 15:20:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 121 remaining) [2024-01-26 15:20:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 121 remaining) [2024-01-26 15:20:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 121 remaining) [2024-01-26 15:20:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 121 remaining) [2024-01-26 15:20:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 121 remaining) [2024-01-26 15:20:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 121 remaining) [2024-01-26 15:20:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 121 remaining) [2024-01-26 15:20:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 121 remaining) [2024-01-26 15:20:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 121 remaining) [2024-01-26 15:20:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 121 remaining) [2024-01-26 15:20:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 121 remaining) [2024-01-26 15:20:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 121 remaining) [2024-01-26 15:20:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 121 remaining) [2024-01-26 15:20:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 121 remaining) [2024-01-26 15:20:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 121 remaining) [2024-01-26 15:20:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 121 remaining) [2024-01-26 15:20:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 121 remaining) [2024-01-26 15:20:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 121 remaining) [2024-01-26 15:20:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 121 remaining) [2024-01-26 15:20:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 121 remaining) [2024-01-26 15:20:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 121 remaining) [2024-01-26 15:20:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 121 remaining) [2024-01-26 15:20:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 121 remaining) [2024-01-26 15:20:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 121 remaining) [2024-01-26 15:20:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 121 remaining) [2024-01-26 15:20:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 121 remaining) [2024-01-26 15:20:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 121 remaining) [2024-01-26 15:20:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 121 remaining) [2024-01-26 15:20:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 121 remaining) [2024-01-26 15:20:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 121 remaining) [2024-01-26 15:20:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 121 remaining) [2024-01-26 15:20:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 121 remaining) [2024-01-26 15:20:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 121 remaining) [2024-01-26 15:20:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 121 remaining) [2024-01-26 15:20:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 121 remaining) [2024-01-26 15:20:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 121 remaining) [2024-01-26 15:20:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 121 remaining) [2024-01-26 15:20:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 121 remaining) [2024-01-26 15:20:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 121 remaining) [2024-01-26 15:20:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 121 remaining) [2024-01-26 15:20:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION (38 of 121 remaining) [2024-01-26 15:20:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 121 remaining) [2024-01-26 15:20:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 121 remaining) [2024-01-26 15:20:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 121 remaining) [2024-01-26 15:20:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 121 remaining) [2024-01-26 15:20:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 121 remaining) [2024-01-26 15:20:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 121 remaining) [2024-01-26 15:20:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 121 remaining) [2024-01-26 15:20:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 121 remaining) [2024-01-26 15:20:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 121 remaining) [2024-01-26 15:20:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 121 remaining) [2024-01-26 15:20:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 121 remaining) [2024-01-26 15:20:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 121 remaining) [2024-01-26 15:20:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 121 remaining) [2024-01-26 15:20:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 121 remaining) [2024-01-26 15:20:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 121 remaining) [2024-01-26 15:20:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 121 remaining) [2024-01-26 15:20:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 121 remaining) [2024-01-26 15:20:41,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 121 remaining) [2024-01-26 15:20:41,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 121 remaining) [2024-01-26 15:20:41,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 121 remaining) [2024-01-26 15:20:41,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 121 remaining) [2024-01-26 15:20:41,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 121 remaining) [2024-01-26 15:20:41,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 121 remaining) [2024-01-26 15:20:41,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 121 remaining) [2024-01-26 15:20:41,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 121 remaining) [2024-01-26 15:20:41,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 121 remaining) [2024-01-26 15:20:41,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 121 remaining) [2024-01-26 15:20:41,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 121 remaining) [2024-01-26 15:20:41,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 121 remaining) [2024-01-26 15:20:41,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 121 remaining) [2024-01-26 15:20:41,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 121 remaining) [2024-01-26 15:20:41,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 121 remaining) [2024-01-26 15:20:41,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 121 remaining) [2024-01-26 15:20:41,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 121 remaining) [2024-01-26 15:20:41,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 121 remaining) [2024-01-26 15:20:41,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 121 remaining) [2024-01-26 15:20:41,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 121 remaining) [2024-01-26 15:20:41,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 121 remaining) [2024-01-26 15:20:41,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-26 15:20:41,451 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-26 15:20:41,457 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 15:20:41,457 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 15:20:41,519 INFO L503 ceAbstractionStarter]: Automizer considered 81 witness invariants [2024-01-26 15:20:41,519 INFO L504 ceAbstractionStarter]: WitnessConsidered=81 [2024-01-26 15:20:41,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 03:20:41 BasicIcfg [2024-01-26 15:20:41,519 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 15:20:41,520 INFO L158 Benchmark]: Toolchain (without parser) took 3931.06ms. Allocated memory was 148.9MB in the beginning and 272.6MB in the end (delta: 123.7MB). Free memory was 120.5MB in the beginning and 153.9MB in the end (delta: -33.4MB). Peak memory consumption was 91.7MB. Max. memory is 16.1GB. [2024-01-26 15:20:41,520 INFO L158 Benchmark]: Witness Parser took 0.10ms. Allocated memory is still 148.9MB. Free memory was 122.8MB in the beginning and 122.6MB in the end (delta: 176.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-26 15:20:41,520 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 148.9MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-26 15:20:41,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.27ms. Allocated memory is still 148.9MB. Free memory was 120.1MB in the beginning and 101.0MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-01-26 15:20:41,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.45ms. Allocated memory is still 148.9MB. Free memory was 101.0MB in the beginning and 98.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-26 15:20:41,520 INFO L158 Benchmark]: Boogie Preprocessor took 58.26ms. Allocated memory is still 148.9MB. Free memory was 98.0MB in the beginning and 95.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-26 15:20:41,522 INFO L158 Benchmark]: RCFGBuilder took 947.66ms. Allocated memory was 148.9MB in the beginning and 199.2MB in the end (delta: 50.3MB). Free memory was 95.0MB in the beginning and 119.5MB in the end (delta: -24.5MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2024-01-26 15:20:41,522 INFO L158 Benchmark]: TraceAbstraction took 2599.25ms. Allocated memory was 199.2MB in the beginning and 272.6MB in the end (delta: 73.4MB). Free memory was 118.4MB in the beginning and 153.9MB in the end (delta: -35.5MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-01-26 15:20:41,523 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.10ms. Allocated memory is still 148.9MB. Free memory was 122.8MB in the beginning and 122.6MB in the end (delta: 176.3kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 148.9MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.27ms. Allocated memory is still 148.9MB. Free memory was 120.1MB in the beginning and 101.0MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.45ms. Allocated memory is still 148.9MB. Free memory was 101.0MB in the beginning and 98.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.26ms. Allocated memory is still 148.9MB. Free memory was 98.0MB in the beginning and 95.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 947.66ms. Allocated memory was 148.9MB in the beginning and 199.2MB in the end (delta: 50.3MB). Free memory was 95.0MB in the beginning and 119.5MB in the end (delta: -24.5MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2599.25ms. Allocated memory was 199.2MB in the beginning and 272.6MB in the end (delta: 73.4MB). Free memory was 118.4MB in the beginning and 153.9MB in the end (delta: -35.5MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 99]: 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, ora_4; [L39] 0 int volume_totale_1, volume_totale_3, volume_totale_5; [L40] 0 int cmp_6, cmp_7, cmp_8; [L71] 0 pthread_t t1, t2, t3; VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=0, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_5],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=0, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ora_4],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=0, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_3],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=0, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_1],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=0, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ora_2],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=0, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_7],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=0, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_8],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=0, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_6],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=0, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L74] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ora_0],IntegerLiteral[0]]]] [L74] 0 ora_0 = __VERIFIER_nondet_int() [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_7],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=0, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_3],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=0, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_5],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=0, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ora_4],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=0, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ora_2],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=0, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_8],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=0, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_6],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=0, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L75] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_1],IntegerLiteral[0]]]] [L75] 0 ora_2 = __VERIFIER_nondet_int() [L76] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_6],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L76] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_8],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L76] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_3],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L76] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_5],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L76] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_1],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L76] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_7],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L76] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[ora_4],IntegerLiteral[0]]]] [L76] 0 ora_4 = __VERIFIER_nondet_int() [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_5],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_3],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_1],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_8],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_6],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_7],IntegerLiteral[0]]]] [L77] 0 volume_totale_1 = __VERIFIER_nondet_int() [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_5],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_6],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_3],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_7],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_8],IntegerLiteral[0]]]] [L78] 0 volume_totale_3 = __VERIFIER_nondet_int() [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_8],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_7],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_6],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[volume_totale_5],IntegerLiteral[0]]]] [L79] 0 volume_totale_5 = __VERIFIER_nondet_int() [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_6],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_7],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_8],IntegerLiteral[0]]]] [L80] 0 cmp_6 = __VERIFIER_nondet_int() [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_8],IntegerLiteral[0]]]] VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_7],IntegerLiteral[0]]]] [L81] 0 cmp_7 = __VERIFIER_nondet_int() [L82] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[cmp_8],IntegerLiteral[0]]]] [L82] 0 cmp_8 = __VERIFIER_nondet_int() [L85] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, t1={3:0}, t2={6:0}, t3={5:0}, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L44] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, volume_totale_1=0, volume_totale_3=0, volume_totale_5=0] [L45] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] [L45] CALL 1 minus(ora_0, ora_2) [L99] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]] [L99] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]]]] VAL [\old(a)=0, \old(b)=-1, a=0, b=-1, cmp_6=0, cmp_7=0, cmp_8=0, ora_0=0, ora_2=-1, ora_4=0, volume_totale_1=0, volume_totale_3=0, volume_totale_5=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: 99]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 100]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 100]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 100]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 100]: 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: 99]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 100]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 100]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 100]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 100]: 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: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 100]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 100]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 100]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 100]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: 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 invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: 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 invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 93]: 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: 85]: 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: 86]: 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: 87]: 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 7 procedures, 211 locations, 121 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: 2.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 622 IncrementalHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 35 mSDtfsCounter, 622 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred in iteration=0, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 195 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-26 15:20:41,594 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