./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i --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/13-privatized_18-first-reads_unknown_2_neg.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b 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/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_18-first-reads_unknown_2_neg.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-8857f20-m [2024-01-29 23:21:21,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 23:21:21,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 23:21:21,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 23:21:21,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 23:21:21,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 23:21:21,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 23:21:21,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 23:21:21,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 23:21:21,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 23:21:21,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 23:21:21,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 23:21:21,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 23:21:21,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 23:21:21,816 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 23:21:21,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 23:21:21,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 23:21:21,832 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 23:21:21,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 23:21:21,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 23:21:21,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 23:21:21,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 23:21:21,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 23:21:21,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 23:21:21,834 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 23:21:21,834 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 23:21:21,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 23:21:21,835 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 23:21:21,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 23:21:21,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 23:21:21,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 23:21:21,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 23:21:21,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:21:21,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 23:21:21,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 23:21:21,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 23:21:21,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 23:21:21,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 23:21:21,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 23:21:21,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 23:21:21,838 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 23:21:21,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 23:21:21,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 23:21:21,838 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 23:21:22,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 23:21:22,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 23:21:22,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 23:21:22,131 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 23:21:22,131 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 23:21:22,132 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/13-privatized_18-first-reads_unknown_2_neg.yml/witness.yml [2024-01-29 23:21:22,287 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 23:21:22,288 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 23:21:22,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i [2024-01-29 23:21:23,435 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 23:21:23,614 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 23:21:23,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i [2024-01-29 23:21:23,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cdfa985c/fbda5a2b375647c890d7d70eccc674fb/FLAG113031a1c [2024-01-29 23:21:23,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cdfa985c/fbda5a2b375647c890d7d70eccc674fb [2024-01-29 23:21:23,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 23:21:23,644 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 23:21:23,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 23:21:23,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 23:21:23,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 23:21:23,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:22" (1/2) ... [2024-01-29 23:21:23,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d79bc6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:23, skipping insertion in model container [2024-01-29 23:21:23,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:22" (1/2) ... [2024-01-29 23:21:23,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7cf3e9fb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:23, skipping insertion in model container [2024-01-29 23:21:23,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:21:23" (2/2) ... [2024-01-29 23:21:23,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d79bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:23, skipping insertion in model container [2024-01-29 23:21:23,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:21:23" (2/2) ... [2024-01-29 23:21:23,652 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 23:21:23,695 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 23:21:23,696 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] ((0 <= t) && (t <= 1)) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:23,696 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] (0 <= t) && (t <= 1) [2024-01-29 23:21:23,696 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] 0 <= t [2024-01-29 23:21:23,697 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] ((0 <= t) && (t <= 1)) && (glob1 == 0) [2024-01-29 23:21:23,697 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] (((0 <= t) && (t <= 1)) && ((unsigned long )arg == 0UL)) && (t == 0 || t == 1) [2024-01-29 23:21:23,697 INFO L98 nessWitnessExtractor]: Location invariant before [L685-L685] (unsigned long )arg == 0UL [2024-01-29 23:21:23,697 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (unsigned long )arg == 0UL [2024-01-29 23:21:23,697 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] (0 <= t) && (t == 0 || t == 1) [2024-01-29 23:21:23,697 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] 0 <= t [2024-01-29 23:21:23,697 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] (0 <= t) && (t <= 1) [2024-01-29 23:21:23,698 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] (0 <= t) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:23,698 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] ((0 <= glob1) && (0 <= t)) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:23,698 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] (((0 <= glob1) && (0 <= t)) && (glob1 == 0 || glob1 == 1)) && (t == 0 || t == 1) [2024-01-29 23:21:23,698 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] (0 <= glob1) && (0 <= t) [2024-01-29 23:21:23,698 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] ((0 <= glob1) && (0 <= t)) && (t <= 1) [2024-01-29 23:21:23,698 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] ((0 <= glob1) && (0 <= t)) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:23,698 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] 0 <= glob1 [2024-01-29 23:21:23,699 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] ((0 <= glob1) && (0 <= t)) && (glob1 <= 1) [2024-01-29 23:21:23,699 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] (0 <= glob1) && (0 <= t) [2024-01-29 23:21:23,699 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] ((0 <= glob1) && (0 <= t)) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:23,699 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] 0 <= glob1 [2024-01-29 23:21:23,700 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] ((0 <= glob1) && (0 <= t)) && (t <= 1) [2024-01-29 23:21:23,700 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] ((0 <= glob1) && (0 <= t)) && (glob1 <= 1) [2024-01-29 23:21:23,700 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] ((0 <= glob1) && (0 <= t)) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:23,700 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] ((0 <= glob1) && (0 <= t)) && (t == 0 || t == 1) [2024-01-29 23:21:23,700 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 0 <= glob1 [2024-01-29 23:21:23,700 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= glob1) && (glob1 <= 1) [2024-01-29 23:21:23,701 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= glob1) && (0 <= glob1) [2024-01-29 23:21:23,701 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= glob1) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:23,701 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= glob1) && (glob1 <= 1) [2024-01-29 23:21:23,701 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= glob1) && (glob1 <= 1) [2024-01-29 23:21:23,701 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= glob1) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:23,701 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= glob1) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:23,701 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= glob1) && (0 <= glob1) [2024-01-29 23:21:23,701 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L689] (glob1 == 0) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:23,702 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L689] glob1 == 0 [2024-01-29 23:21:23,702 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] glob1 == 0 [2024-01-29 23:21:23,702 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (0 <= glob1) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:23,703 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] 0 <= glob1 [2024-01-29 23:21:23,704 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] ((0 <= glob1) && ((unsigned long )arg == 0UL)) && (glob1 == 0 || glob1 == 1) [2024-01-29 23:21:23,704 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (0 <= glob1) && (glob1 <= 1) [2024-01-29 23:21:23,704 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] (glob1 == 0) && (t == 42) [2024-01-29 23:21:23,704 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] glob1 == 0 [2024-01-29 23:21:23,704 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] ((glob1 == 0) && (t == 42)) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:23,704 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] glob1 == 0 [2024-01-29 23:21:23,742 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 23:21:23,873 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i[1097,1110] [2024-01-29 23:21:24,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:21:24,040 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 23:21:24,050 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i[1097,1110] [2024-01-29 23:21:24,051 WARN L424 MainDispatcher]: Unable to annotate void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: {reach_error();abort();} } } 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 [2024-01-29 23:21:24,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:21:24,181 INFO L206 MainTranslator]: Completed translation [2024-01-29 23:21:24,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:24 WrapperNode [2024-01-29 23:21:24,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 23:21:24,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 23:21:24,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 23:21:24,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 23:21:24,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:24" (1/1) ... [2024-01-29 23:21:24,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:24" (1/1) ... [2024-01-29 23:21:24,249 INFO L138 Inliner]: procedures = 164, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2024-01-29 23:21:24,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 23:21:24,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 23:21:24,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 23:21:24,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 23:21:24,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:24" (1/1) ... [2024-01-29 23:21:24,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:24" (1/1) ... [2024-01-29 23:21:24,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:24" (1/1) ... [2024-01-29 23:21:24,287 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 5, 2]. 56 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 1 writes are split as follows [0, 0, 1]. [2024-01-29 23:21:24,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:24" (1/1) ... [2024-01-29 23:21:24,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:24" (1/1) ... [2024-01-29 23:21:24,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:24" (1/1) ... [2024-01-29 23:21:24,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:24" (1/1) ... [2024-01-29 23:21:24,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:24" (1/1) ... [2024-01-29 23:21:24,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:24" (1/1) ... [2024-01-29 23:21:24,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 23:21:24,310 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 23:21:24,310 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 23:21:24,310 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 23:21:24,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:24" (1/1) ... [2024-01-29 23:21:24,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:21:24,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 23:21:24,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 23:21:24,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 23:21:24,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 23:21:24,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 23:21:24,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 23:21:24,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 23:21:24,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 23:21:24,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 23:21:24,408 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-29 23:21:24,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 23:21:24,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 23:21:24,409 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-29 23:21:24,409 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-29 23:21:24,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 23:21:24,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 23:21:24,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 23:21:24,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 23:21:24,410 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-29 23:21:24,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 23:21:24,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 23:21:24,412 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 23:21:24,544 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 23:21:24,546 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 23:21:24,765 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 23:21:24,766 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 23:21:24,909 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 23:21:24,909 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 23:21:24,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:21:24 BoogieIcfgContainer [2024-01-29 23:21:24,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 23:21:24,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 23:21:24,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 23:21:24,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 23:21:24,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:22" (1/4) ... [2024-01-29 23:21:24,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668661cc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 11:21:24, skipping insertion in model container [2024-01-29 23:21:24,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:21:23" (2/4) ... [2024-01-29 23:21:24,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668661cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:21:24, skipping insertion in model container [2024-01-29 23:21:24,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:24" (3/4) ... [2024-01-29 23:21:24,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668661cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:21:24, skipping insertion in model container [2024-01-29 23:21:24,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:21:24" (4/4) ... [2024-01-29 23:21:24,915 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_18-first-reads_unknown_2_neg.i [2024-01-29 23:21:24,943 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 23:21:24,956 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-01-29 23:21:24,956 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 23:21:25,071 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-29 23:21:25,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 94 transitions, 195 flow [2024-01-29 23:21:25,209 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2024-01-29 23:21:25,210 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 23:21:25,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 93 events. 2/93 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2024-01-29 23:21:25,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 94 transitions, 195 flow [2024-01-29 23:21:25,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 91 transitions, 185 flow [2024-01-29 23:21:25,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 23:21:25,235 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;@4b19362, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 23:21:25,236 INFO L358 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2024-01-29 23:21:25,240 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 23:21:25,240 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 23:21:25,240 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 23:21:25,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:25,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 23:21:25,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:25,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:25,245 INFO L85 PathProgramCache]: Analyzing trace with hash 8684, now seen corresponding path program 1 times [2024-01-29 23:21:25,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:25,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069770491] [2024-01-29 23:21:25,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:25,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:25,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:25,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069770491] [2024-01-29 23:21:25,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069770491] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:25,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:25,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 23:21:25,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694018226] [2024-01-29 23:21:25,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:25,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:21:25,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:25,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:21:25,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:21:25,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 94 [2024-01-29 23:21:25,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:25,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:25,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 94 [2024-01-29 23:21:25,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:25,770 INFO L124 PetriNetUnfolderBase]: 114/809 cut-off events. [2024-01-29 23:21:25,770 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 23:21:25,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 809 events. 114/809 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5412 event pairs, 72 based on Foata normal form. 37/631 useless extension candidates. Maximal degree in co-relation 1075. Up to 177 conditions per place. [2024-01-29 23:21:25,776 INFO L140 encePairwiseOnDemand]: 81/94 looper letters, 32 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2024-01-29 23:21:25,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 96 transitions, 267 flow [2024-01-29 23:21:25,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:21:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:21:25,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2024-01-29 23:21:25,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8120567375886525 [2024-01-29 23:21:25,790 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 185 flow. Second operand 3 states and 229 transitions. [2024-01-29 23:21:25,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 96 transitions, 267 flow [2024-01-29 23:21:25,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 96 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:21:25,795 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 210 flow [2024-01-29 23:21:25,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2024-01-29 23:21:25,799 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 0 predicate places. [2024-01-29 23:21:25,799 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 210 flow [2024-01-29 23:21:25,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:25,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:25,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 23:21:25,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 23:21:25,800 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:25,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:25,801 INFO L85 PathProgramCache]: Analyzing trace with hash 259105612, now seen corresponding path program 1 times [2024-01-29 23:21:25,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:25,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276288329] [2024-01-29 23:21:25,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:25,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:25,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:25,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276288329] [2024-01-29 23:21:25,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276288329] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:25,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:25,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:25,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998522635] [2024-01-29 23:21:25,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:25,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:25,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:25,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:25,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:25,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 94 [2024-01-29 23:21:25,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:25,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:25,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 94 [2024-01-29 23:21:25,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:26,115 INFO L124 PetriNetUnfolderBase]: 68/707 cut-off events. [2024-01-29 23:21:26,115 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-01-29 23:21:26,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 707 events. 68/707 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4752 event pairs, 5 based on Foata normal form. 5/510 useless extension candidates. Maximal degree in co-relation 930. Up to 144 conditions per place. [2024-01-29 23:21:26,122 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 20 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2024-01-29 23:21:26,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 91 transitions, 258 flow [2024-01-29 23:21:26,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 311 transitions. [2024-01-29 23:21:26,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8271276595744681 [2024-01-29 23:21:26,129 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 210 flow. Second operand 4 states and 311 transitions. [2024-01-29 23:21:26,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 91 transitions, 258 flow [2024-01-29 23:21:26,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 91 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:26,133 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 202 flow [2024-01-29 23:21:26,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2024-01-29 23:21:26,134 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -1 predicate places. [2024-01-29 23:21:26,134 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 202 flow [2024-01-29 23:21:26,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:26,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:26,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:26,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 23:21:26,135 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:26,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:26,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1450981472, now seen corresponding path program 1 times [2024-01-29 23:21:26,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:26,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401804776] [2024-01-29 23:21:26,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:26,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:26,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:26,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401804776] [2024-01-29 23:21:26,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401804776] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:26,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:26,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:21:26,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381048057] [2024-01-29 23:21:26,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:26,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:26,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:26,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:26,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:26,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 94 [2024-01-29 23:21:26,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:26,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:26,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 94 [2024-01-29 23:21:26,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:26,447 INFO L124 PetriNetUnfolderBase]: 207/956 cut-off events. [2024-01-29 23:21:26,448 INFO L125 PetriNetUnfolderBase]: For 64/75 co-relation queries the response was YES. [2024-01-29 23:21:26,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1553 conditions, 956 events. 207/956 cut-off events. For 64/75 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6141 event pairs, 22 based on Foata normal form. 3/774 useless extension candidates. Maximal degree in co-relation 1539. Up to 244 conditions per place. [2024-01-29 23:21:26,452 INFO L140 encePairwiseOnDemand]: 81/94 looper letters, 54 selfloop transitions, 10 changer transitions 0/111 dead transitions. [2024-01-29 23:21:26,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 111 transitions, 382 flow [2024-01-29 23:21:26,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2024-01-29 23:21:26,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6888297872340425 [2024-01-29 23:21:26,453 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 202 flow. Second operand 4 states and 259 transitions. [2024-01-29 23:21:26,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 111 transitions, 382 flow [2024-01-29 23:21:26,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 111 transitions, 379 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:26,457 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 257 flow [2024-01-29 23:21:26,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2024-01-29 23:21:26,458 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 1 predicate places. [2024-01-29 23:21:26,458 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 257 flow [2024-01-29 23:21:26,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:26,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:26,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:26,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 23:21:26,459 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:26,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:26,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1471187363, now seen corresponding path program 1 times [2024-01-29 23:21:26,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:26,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803254058] [2024-01-29 23:21:26,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:26,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:26,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:26,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:26,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803254058] [2024-01-29 23:21:26,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803254058] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:26,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:26,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:26,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505121743] [2024-01-29 23:21:26,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:26,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:21:26,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:26,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:21:26,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:21:26,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 94 [2024-01-29 23:21:26,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:26,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:26,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 94 [2024-01-29 23:21:26,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:26,931 INFO L124 PetriNetUnfolderBase]: 398/1180 cut-off events. [2024-01-29 23:21:26,931 INFO L125 PetriNetUnfolderBase]: For 349/351 co-relation queries the response was YES. [2024-01-29 23:21:26,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2424 conditions, 1180 events. 398/1180 cut-off events. For 349/351 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6965 event pairs, 34 based on Foata normal form. 8/1146 useless extension candidates. Maximal degree in co-relation 2408. Up to 425 conditions per place. [2024-01-29 23:21:26,936 INFO L140 encePairwiseOnDemand]: 81/94 looper letters, 101 selfloop transitions, 11 changer transitions 0/138 dead transitions. [2024-01-29 23:21:26,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 138 transitions, 593 flow [2024-01-29 23:21:26,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 23:21:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 23:21:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 249 transitions. [2024-01-29 23:21:26,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5297872340425532 [2024-01-29 23:21:26,940 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 257 flow. Second operand 5 states and 249 transitions. [2024-01-29 23:21:26,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 138 transitions, 593 flow [2024-01-29 23:21:26,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 138 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:26,947 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 264 flow [2024-01-29 23:21:26,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=264, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2024-01-29 23:21:26,952 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 1 predicate places. [2024-01-29 23:21:26,952 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 264 flow [2024-01-29 23:21:26,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:26,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:26,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:26,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 23:21:26,953 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:26,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:26,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1998183826, now seen corresponding path program 1 times [2024-01-29 23:21:26,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:26,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103071327] [2024-01-29 23:21:26,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:26,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:27,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:27,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:27,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103071327] [2024-01-29 23:21:27,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103071327] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:27,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:27,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:21:27,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909287102] [2024-01-29 23:21:27,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:27,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:21:27,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:27,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:21:27,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:21:27,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 94 [2024-01-29 23:21:27,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:27,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:27,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 94 [2024-01-29 23:21:27,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:27,148 INFO L124 PetriNetUnfolderBase]: 92/729 cut-off events. [2024-01-29 23:21:27,148 INFO L125 PetriNetUnfolderBase]: For 177/183 co-relation queries the response was YES. [2024-01-29 23:21:27,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 729 events. 92/729 cut-off events. For 177/183 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4767 event pairs, 70 based on Foata normal form. 32/608 useless extension candidates. Maximal degree in co-relation 1089. Up to 167 conditions per place. [2024-01-29 23:21:27,151 INFO L140 encePairwiseOnDemand]: 87/94 looper letters, 28 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2024-01-29 23:21:27,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 87 transitions, 288 flow [2024-01-29 23:21:27,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:21:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:21:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2024-01-29 23:21:27,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8156028368794326 [2024-01-29 23:21:27,153 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 264 flow. Second operand 3 states and 230 transitions. [2024-01-29 23:21:27,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 87 transitions, 288 flow [2024-01-29 23:21:27,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 87 transitions, 266 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-01-29 23:21:27,156 INFO L231 Difference]: Finished difference. Result has 88 places, 80 transitions, 196 flow [2024-01-29 23:21:27,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=88, PETRI_TRANSITIONS=80} [2024-01-29 23:21:27,156 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -5 predicate places. [2024-01-29 23:21:27,157 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 80 transitions, 196 flow [2024-01-29 23:21:27,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:27,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:27,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:27,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 23:21:27,157 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:27,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:27,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1783618102, now seen corresponding path program 1 times [2024-01-29 23:21:27,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:27,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949050010] [2024-01-29 23:21:27,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:27,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:27,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:27,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949050010] [2024-01-29 23:21:27,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949050010] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:27,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:27,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:21:27,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063671652] [2024-01-29 23:21:27,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:27,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:27,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:27,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:27,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:27,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 94 [2024-01-29 23:21:27,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 80 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:27,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:27,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 94 [2024-01-29 23:21:27,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:27,429 INFO L124 PetriNetUnfolderBase]: 189/857 cut-off events. [2024-01-29 23:21:27,429 INFO L125 PetriNetUnfolderBase]: For 108/110 co-relation queries the response was YES. [2024-01-29 23:21:27,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 857 events. 189/857 cut-off events. For 108/110 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5162 event pairs, 98 based on Foata normal form. 78/841 useless extension candidates. Maximal degree in co-relation 1416. Up to 205 conditions per place. [2024-01-29 23:21:27,433 INFO L140 encePairwiseOnDemand]: 74/94 looper letters, 51 selfloop transitions, 4 changer transitions 1/95 dead transitions. [2024-01-29 23:21:27,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 95 transitions, 340 flow [2024-01-29 23:21:27,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:27,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 248 transitions. [2024-01-29 23:21:27,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-01-29 23:21:27,434 INFO L175 Difference]: Start difference. First operand has 88 places, 80 transitions, 196 flow. Second operand 4 states and 248 transitions. [2024-01-29 23:21:27,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 95 transitions, 340 flow [2024-01-29 23:21:27,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 95 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:21:27,436 INFO L231 Difference]: Finished difference. Result has 92 places, 81 transitions, 243 flow [2024-01-29 23:21:27,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=243, PETRI_PLACES=92, PETRI_TRANSITIONS=81} [2024-01-29 23:21:27,437 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -1 predicate places. [2024-01-29 23:21:27,437 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 81 transitions, 243 flow [2024-01-29 23:21:27,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:27,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:27,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:27,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 23:21:27,438 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:27,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:27,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1814156117, now seen corresponding path program 1 times [2024-01-29 23:21:27,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:27,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118836842] [2024-01-29 23:21:27,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:27,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:27,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:27,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118836842] [2024-01-29 23:21:27,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118836842] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:27,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:27,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:27,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714243431] [2024-01-29 23:21:27,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:27,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:27,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:27,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:27,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:27,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 94 [2024-01-29 23:21:27,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 81 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:27,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:27,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 94 [2024-01-29 23:21:27,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:27,662 INFO L124 PetriNetUnfolderBase]: 168/824 cut-off events. [2024-01-29 23:21:27,662 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2024-01-29 23:21:27,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 824 events. 168/824 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4893 event pairs, 5 based on Foata normal form. 12/817 useless extension candidates. Maximal degree in co-relation 1443. Up to 304 conditions per place. [2024-01-29 23:21:27,665 INFO L140 encePairwiseOnDemand]: 89/94 looper letters, 44 selfloop transitions, 3 changer transitions 0/93 dead transitions. [2024-01-29 23:21:27,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 93 transitions, 359 flow [2024-01-29 23:21:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2024-01-29 23:21:27,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6914893617021277 [2024-01-29 23:21:27,667 INFO L175 Difference]: Start difference. First operand has 92 places, 81 transitions, 243 flow. Second operand 4 states and 260 transitions. [2024-01-29 23:21:27,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 93 transitions, 359 flow [2024-01-29 23:21:27,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 93 transitions, 353 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:27,669 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 235 flow [2024-01-29 23:21:27,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=91, PETRI_TRANSITIONS=79} [2024-01-29 23:21:27,670 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -2 predicate places. [2024-01-29 23:21:27,670 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 235 flow [2024-01-29 23:21:27,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:27,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:27,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:27,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 23:21:27,671 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:27,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:27,672 INFO L85 PathProgramCache]: Analyzing trace with hash 781913263, now seen corresponding path program 1 times [2024-01-29 23:21:27,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:27,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987045415] [2024-01-29 23:21:27,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:27,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:27,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:27,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987045415] [2024-01-29 23:21:27,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987045415] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:27,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:27,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:27,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032067325] [2024-01-29 23:21:27,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:27,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:21:27,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:27,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:21:27,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:21:27,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 94 [2024-01-29 23:21:27,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:27,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:27,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 94 [2024-01-29 23:21:27,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:27,763 INFO L124 PetriNetUnfolderBase]: 38/429 cut-off events. [2024-01-29 23:21:27,763 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2024-01-29 23:21:27,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 429 events. 38/429 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2354 event pairs, 11 based on Foata normal form. 11/399 useless extension candidates. Maximal degree in co-relation 659. Up to 69 conditions per place. [2024-01-29 23:21:27,765 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 16 selfloop transitions, 4 changer transitions 2/82 dead transitions. [2024-01-29 23:21:27,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 82 transitions, 287 flow [2024-01-29 23:21:27,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:21:27,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:21:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2024-01-29 23:21:27,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2024-01-29 23:21:27,766 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 235 flow. Second operand 3 states and 247 transitions. [2024-01-29 23:21:27,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 82 transitions, 287 flow [2024-01-29 23:21:27,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 82 transitions, 274 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-01-29 23:21:27,769 INFO L231 Difference]: Finished difference. Result has 88 places, 77 transitions, 226 flow [2024-01-29 23:21:27,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=88, PETRI_TRANSITIONS=77} [2024-01-29 23:21:27,771 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -5 predicate places. [2024-01-29 23:21:27,773 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 77 transitions, 226 flow [2024-01-29 23:21:27,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:27,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:27,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:27,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 23:21:27,774 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:27,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:27,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1951049356, now seen corresponding path program 1 times [2024-01-29 23:21:27,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:27,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444209755] [2024-01-29 23:21:27,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:27,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:27,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:27,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444209755] [2024-01-29 23:21:27,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444209755] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:27,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:27,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:27,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483568249] [2024-01-29 23:21:27,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:27,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:27,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:27,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:27,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:27,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 94 [2024-01-29 23:21:27,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 77 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:27,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:27,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 94 [2024-01-29 23:21:27,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:27,989 INFO L124 PetriNetUnfolderBase]: 64/431 cut-off events. [2024-01-29 23:21:27,989 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2024-01-29 23:21:27,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 431 events. 64/431 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2146 event pairs, 56 based on Foata normal form. 40/427 useless extension candidates. Maximal degree in co-relation 716. Up to 161 conditions per place. [2024-01-29 23:21:27,991 INFO L140 encePairwiseOnDemand]: 81/94 looper letters, 32 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2024-01-29 23:21:27,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 73 transitions, 268 flow [2024-01-29 23:21:27,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:27,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2024-01-29 23:21:27,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6409574468085106 [2024-01-29 23:21:27,993 INFO L175 Difference]: Start difference. First operand has 88 places, 77 transitions, 226 flow. Second operand 4 states and 241 transitions. [2024-01-29 23:21:27,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 73 transitions, 268 flow [2024-01-29 23:21:27,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 73 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:21:27,994 INFO L231 Difference]: Finished difference. Result has 79 places, 67 transitions, 188 flow [2024-01-29 23:21:27,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=79, PETRI_TRANSITIONS=67} [2024-01-29 23:21:27,995 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -14 predicate places. [2024-01-29 23:21:27,995 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 67 transitions, 188 flow [2024-01-29 23:21:27,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:27,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:27,996 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] [2024-01-29 23:21:27,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 23:21:27,996 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:27,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:27,997 INFO L85 PathProgramCache]: Analyzing trace with hash 142883229, now seen corresponding path program 1 times [2024-01-29 23:21:27,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:28,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134364689] [2024-01-29 23:21:28,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:28,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:28,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:28,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134364689] [2024-01-29 23:21:28,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134364689] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:28,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:28,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:28,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172036353] [2024-01-29 23:21:28,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:28,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:21:28,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:28,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:21:28,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:21:28,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 94 [2024-01-29 23:21:28,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:28,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:28,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 94 [2024-01-29 23:21:28,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:28,353 INFO L124 PetriNetUnfolderBase]: 119/506 cut-off events. [2024-01-29 23:21:28,353 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-01-29 23:21:28,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 506 events. 119/506 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2252 event pairs, 21 based on Foata normal form. 4/481 useless extension candidates. Maximal degree in co-relation 947. Up to 170 conditions per place. [2024-01-29 23:21:28,355 INFO L140 encePairwiseOnDemand]: 83/94 looper letters, 48 selfloop transitions, 6 changer transitions 11/88 dead transitions. [2024-01-29 23:21:28,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 88 transitions, 365 flow [2024-01-29 23:21:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 23:21:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 23:21:28,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2024-01-29 23:21:28,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425531914893617 [2024-01-29 23:21:28,357 INFO L175 Difference]: Start difference. First operand has 79 places, 67 transitions, 188 flow. Second operand 5 states and 200 transitions. [2024-01-29 23:21:28,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 88 transitions, 365 flow [2024-01-29 23:21:28,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 88 transitions, 355 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-01-29 23:21:28,358 INFO L231 Difference]: Finished difference. Result has 81 places, 65 transitions, 193 flow [2024-01-29 23:21:28,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=81, PETRI_TRANSITIONS=65} [2024-01-29 23:21:28,359 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -12 predicate places. [2024-01-29 23:21:28,359 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 65 transitions, 193 flow [2024-01-29 23:21:28,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:28,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:28,360 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] [2024-01-29 23:21:28,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 23:21:28,360 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:28,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:28,360 INFO L85 PathProgramCache]: Analyzing trace with hash 322047283, now seen corresponding path program 1 times [2024-01-29 23:21:28,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:28,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140517649] [2024-01-29 23:21:28,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:28,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:28,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:28,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140517649] [2024-01-29 23:21:28,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140517649] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:28,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:28,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 23:21:28,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882582173] [2024-01-29 23:21:28,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:28,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:21:28,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:28,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:21:28,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:21:28,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 94 [2024-01-29 23:21:28,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 65 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:28,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:28,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 94 [2024-01-29 23:21:28,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:28,637 INFO L124 PetriNetUnfolderBase]: 65/364 cut-off events. [2024-01-29 23:21:28,637 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-01-29 23:21:28,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 364 events. 65/364 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1530 event pairs, 18 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 660. Up to 81 conditions per place. [2024-01-29 23:21:28,639 INFO L140 encePairwiseOnDemand]: 79/94 looper letters, 28 selfloop transitions, 13 changer transitions 6/81 dead transitions. [2024-01-29 23:21:28,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 81 transitions, 321 flow [2024-01-29 23:21:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-29 23:21:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-29 23:21:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 342 transitions. [2024-01-29 23:21:28,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197568389057751 [2024-01-29 23:21:28,641 INFO L175 Difference]: Start difference. First operand has 81 places, 65 transitions, 193 flow. Second operand 7 states and 342 transitions. [2024-01-29 23:21:28,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 81 transitions, 321 flow [2024-01-29 23:21:28,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 81 transitions, 280 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-01-29 23:21:28,643 INFO L231 Difference]: Finished difference. Result has 82 places, 64 transitions, 184 flow [2024-01-29 23:21:28,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=82, PETRI_TRANSITIONS=64} [2024-01-29 23:21:28,643 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -11 predicate places. [2024-01-29 23:21:28,643 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 64 transitions, 184 flow [2024-01-29 23:21:28,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:28,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:28,644 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] [2024-01-29 23:21:28,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 23:21:28,644 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:28,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:28,645 INFO L85 PathProgramCache]: Analyzing trace with hash 920567859, now seen corresponding path program 1 times [2024-01-29 23:21:28,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:28,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106641254] [2024-01-29 23:21:28,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:28,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 23:21:28,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:28,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106641254] [2024-01-29 23:21:28,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106641254] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:28,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:28,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 23:21:28,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772758024] [2024-01-29 23:21:28,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:28,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:21:28,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:28,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:21:28,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:21:28,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 94 [2024-01-29 23:21:28,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 64 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:28,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:28,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 94 [2024-01-29 23:21:28,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:28,944 INFO L124 PetriNetUnfolderBase]: 87/344 cut-off events. [2024-01-29 23:21:28,944 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-01-29 23:21:28,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 344 events. 87/344 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1205 event pairs, 15 based on Foata normal form. 8/335 useless extension candidates. Maximal degree in co-relation 688. Up to 176 conditions per place. [2024-01-29 23:21:28,946 INFO L140 encePairwiseOnDemand]: 88/94 looper letters, 43 selfloop transitions, 4 changer transitions 1/72 dead transitions. [2024-01-29 23:21:28,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 72 transitions, 294 flow [2024-01-29 23:21:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 23:21:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 23:21:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 210 transitions. [2024-01-29 23:21:28,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2024-01-29 23:21:28,947 INFO L175 Difference]: Start difference. First operand has 82 places, 64 transitions, 184 flow. Second operand 5 states and 210 transitions. [2024-01-29 23:21:28,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 72 transitions, 294 flow [2024-01-29 23:21:28,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 72 transitions, 251 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-01-29 23:21:28,950 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 141 flow [2024-01-29 23:21:28,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2024-01-29 23:21:28,951 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -21 predicate places. [2024-01-29 23:21:28,951 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 141 flow [2024-01-29 23:21:28,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 23:21:28,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:28,951 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] [2024-01-29 23:21:28,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 23:21:28,952 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 70 more)] === [2024-01-29 23:21:28,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:28,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1271264989, now seen corresponding path program 1 times [2024-01-29 23:21:28,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:28,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918299256] [2024-01-29 23:21:28,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:28,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:21:28,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 23:21:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:21:28,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 23:21:28,994 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 23:21:28,995 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr18ASSERT_VIOLATIONERROR_FUNCTION (72 of 73 remaining) [2024-01-29 23:21:28,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 73 remaining) [2024-01-29 23:21:28,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 73 remaining) [2024-01-29 23:21:28,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (69 of 73 remaining) [2024-01-29 23:21:28,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 73 remaining) [2024-01-29 23:21:28,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 73 remaining) [2024-01-29 23:21:28,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 73 remaining) [2024-01-29 23:21:28,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 73 remaining) [2024-01-29 23:21:28,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 73 remaining) [2024-01-29 23:21:28,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 73 remaining) [2024-01-29 23:21:28,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 73 remaining) [2024-01-29 23:21:28,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 73 remaining) [2024-01-29 23:21:28,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 73 remaining) [2024-01-29 23:21:28,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 73 remaining) [2024-01-29 23:21:28,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 73 remaining) [2024-01-29 23:21:28,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 73 remaining) [2024-01-29 23:21:28,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 73 remaining) [2024-01-29 23:21:28,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 73 remaining) [2024-01-29 23:21:28,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 73 remaining) [2024-01-29 23:21:28,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 73 remaining) [2024-01-29 23:21:28,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 73 remaining) [2024-01-29 23:21:28,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 73 remaining) [2024-01-29 23:21:28,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18ASSERT_VIOLATIONERROR_FUNCTION (50 of 73 remaining) [2024-01-29 23:21:28,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 73 remaining) [2024-01-29 23:21:29,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 73 remaining) [2024-01-29 23:21:29,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr21ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 73 remaining) [2024-01-29 23:21:29,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr22ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 73 remaining) [2024-01-29 23:21:29,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr23ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 73 remaining) [2024-01-29 23:21:29,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr24ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 73 remaining) [2024-01-29 23:21:29,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr25ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 73 remaining) [2024-01-29 23:21:29,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr26ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 73 remaining) [2024-01-29 23:21:29,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr27ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 73 remaining) [2024-01-29 23:21:29,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr28ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 73 remaining) [2024-01-29 23:21:29,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr29ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 73 remaining) [2024-01-29 23:21:29,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr30ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 73 remaining) [2024-01-29 23:21:29,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr31ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 73 remaining) [2024-01-29 23:21:29,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr32ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 73 remaining) [2024-01-29 23:21:29,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr33ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 73 remaining) [2024-01-29 23:21:29,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr34ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 73 remaining) [2024-01-29 23:21:29,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 73 remaining) [2024-01-29 23:21:29,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 73 remaining) [2024-01-29 23:21:29,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 73 remaining) [2024-01-29 23:21:29,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 73 remaining) [2024-01-29 23:21:29,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 73 remaining) [2024-01-29 23:21:29,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 73 remaining) [2024-01-29 23:21:29,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 73 remaining) [2024-01-29 23:21:29,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 73 remaining) [2024-01-29 23:21:29,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 73 remaining) [2024-01-29 23:21:29,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 73 remaining) [2024-01-29 23:21:29,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 73 remaining) [2024-01-29 23:21:29,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 73 remaining) [2024-01-29 23:21:29,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 73 remaining) [2024-01-29 23:21:29,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 73 remaining) [2024-01-29 23:21:29,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 73 remaining) [2024-01-29 23:21:29,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 73 remaining) [2024-01-29 23:21:29,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 73 remaining) [2024-01-29 23:21:29,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 73 remaining) [2024-01-29 23:21:29,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 73 remaining) [2024-01-29 23:21:29,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 73 remaining) [2024-01-29 23:21:29,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr21ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 73 remaining) [2024-01-29 23:21:29,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr22ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 73 remaining) [2024-01-29 23:21:29,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr23ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 73 remaining) [2024-01-29 23:21:29,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr24ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 73 remaining) [2024-01-29 23:21:29,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr25ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 73 remaining) [2024-01-29 23:21:29,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr26ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 73 remaining) [2024-01-29 23:21:29,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr27ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 73 remaining) [2024-01-29 23:21:29,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr28ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 73 remaining) [2024-01-29 23:21:29,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr29ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 73 remaining) [2024-01-29 23:21:29,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr30ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 73 remaining) [2024-01-29 23:21:29,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr31ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 73 remaining) [2024-01-29 23:21:29,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr32ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 73 remaining) [2024-01-29 23:21:29,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr33ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 73 remaining) [2024-01-29 23:21:29,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr34ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 73 remaining) [2024-01-29 23:21:29,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 23:21:29,009 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:29,014 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 23:21:29,014 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 23:21:29,052 INFO L503 ceAbstractionStarter]: Automizer considered 36 witness invariants [2024-01-29 23:21:29,053 INFO L504 ceAbstractionStarter]: WitnessConsidered=36 [2024-01-29 23:21:29,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:21:29 BasicIcfg [2024-01-29 23:21:29,053 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 23:21:29,054 INFO L158 Benchmark]: Toolchain (without parser) took 5409.88ms. Allocated memory was 165.7MB in the beginning and 274.7MB in the end (delta: 109.1MB). Free memory was 127.8MB in the beginning and 204.6MB in the end (delta: -76.9MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2024-01-29 23:21:29,054 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:21:29,054 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 125.8MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:21:29,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.62ms. Allocated memory is still 165.7MB. Free memory was 127.1MB in the beginning and 101.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-01-29 23:21:29,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.34ms. Allocated memory is still 165.7MB. Free memory was 101.9MB in the beginning and 99.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 23:21:29,054 INFO L158 Benchmark]: Boogie Preprocessor took 57.89ms. Allocated memory is still 165.7MB. Free memory was 99.8MB in the beginning and 97.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 23:21:29,055 INFO L158 Benchmark]: RCFGBuilder took 599.14ms. Allocated memory is still 165.7MB. Free memory was 97.7MB in the beginning and 124.4MB in the end (delta: -26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-01-29 23:21:29,055 INFO L158 Benchmark]: TraceAbstraction took 4142.60ms. Allocated memory was 165.7MB in the beginning and 274.7MB in the end (delta: 109.1MB). Free memory was 124.4MB in the beginning and 204.6MB in the end (delta: -80.3MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2024-01-29 23:21:29,056 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.14ms. Allocated memory is still 125.8MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 125.8MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.62ms. Allocated memory is still 165.7MB. Free memory was 127.1MB in the beginning and 101.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.34ms. Allocated memory is still 165.7MB. Free memory was 101.9MB in the beginning and 99.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.89ms. Allocated memory is still 165.7MB. Free memory was 99.8MB in the beginning and 97.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 599.14ms. Allocated memory is still 165.7MB. Free memory was 97.7MB in the beginning and 124.4MB in the end (delta: -26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4142.60ms. Allocated memory was 165.7MB in the beginning and 274.7MB in the end (delta: 109.1MB). Free memory was 124.4MB in the beginning and 204.6MB in the end (delta: -80.3MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 int glob1 = 0; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L697] 0 pthread_t id; VAL [glob1=0, id={5:0}, mutex1={3:0}] [L698] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]]]] [L698] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [glob1=0, id={5:0}, mutex1={3:0}] [L685] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] [L685] 1 int t = __VERIFIER_nondet_int(); [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L687] COND TRUE 1 t == 42 VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[42]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[42]]]]] [L688] 1 glob1 = 1 VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=42] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=42] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=42] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=42] [L690] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] [L690] 1 t = glob1 VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[t],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[1]]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPLEQ,IdentifierExpression[t],IntegerLiteral[1]]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[t]]]]] [L691] CALL 1 __VERIFIER_assert(!(t == 1)) [L19] COND TRUE 1 !(cond) VAL [\old(cond)=0, cond=0, glob1=1, mutex1={3:0}] [L19] 1 reach_error() VAL [\old(cond)=0, cond=0, glob1=1, mutex1={3:0}] - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: 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: 685]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 173 locations, 73 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: 3.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2165 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1296 mSDsluCounter, 530 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 316 mSDsCounter, 307 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2186 IncrementalHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 307 mSolverCounterUnsat, 214 mSDtfsCounter, 2186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=4, InterpolantAutomatonStates: 51, 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.8s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 1113 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 23:21:29,107 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