./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/clever.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/clever.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/clever.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/clever.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 14:51:04,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 14:51:04,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 14:51:04,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 14:51:04,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 14:51:04,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 14:51:04,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 14:51:04,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 14:51:04,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 14:51:04,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 14:51:04,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 14:51:04,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 14:51:04,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 14:51:04,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 14:51:04,638 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 14:51:04,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 14:51:04,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 14:51:04,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 14:51:04,638 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 14:51:04,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 14:51:04,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 14:51:04,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 14:51:04,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 14:51:04,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 14:51:04,640 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 14:51:04,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 14:51:04,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 14:51:04,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 14:51:04,641 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 14:51:04,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 14:51:04,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 14:51:04,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 14:51:04,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:51:04,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 14:51:04,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 14:51:04,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 14:51:04,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 14:51:04,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 14:51:04,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 14:51:04,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 14:51:04,644 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 14:51:04,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 14:51:04,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 14:51:04,644 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-27 14:51:04,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 14:51:04,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 14:51:04,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 14:51:04,877 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 14:51:04,877 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 14:51:04,878 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/clever.wvr.yml/witness.yml [2024-01-27 14:51:05,074 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 14:51:05,075 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 14:51:05,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/clever.wvr.c [2024-01-27 14:51:06,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 14:51:06,359 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 14:51:06,359 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c [2024-01-27 14:51:06,365 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34a2ec613/e63d132191e84da3b066873d5f8b1337/FLAG1f8fc6158 [2024-01-27 14:51:06,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34a2ec613/e63d132191e84da3b066873d5f8b1337 [2024-01-27 14:51:06,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 14:51:06,392 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 14:51:06,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 14:51:06,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 14:51:06,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 14:51:06,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:51:05" (1/2) ... [2024-01-27 14:51:06,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a5aa77d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:51:06, skipping insertion in model container [2024-01-27 14:51:06,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:51:05" (1/2) ... [2024-01-27 14:51:06,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@15ccc141 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:51:06, skipping insertion in model container [2024-01-27 14:51:06,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:51:06" (2/2) ... [2024-01-27 14:51:06,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a5aa77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:06, skipping insertion in model container [2024-01-27 14:51:06,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:51:06" (2/2) ... [2024-01-27 14:51:06,402 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 14:51:06,417 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 14:51:06,421 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-27 14:51:06,421 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (long long )i2 + (long long )j1 >= 0LL [2024-01-27 14:51:06,422 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] k2 == 0U [2024-01-27 14:51:06,422 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (long long )i2 - (long long )j1 >= 0LL [2024-01-27 14:51:06,422 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (0LL - (long long )i2) - (long long )j1 >= 0LL [2024-01-27 14:51:06,422 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] i1 == 0 [2024-01-27 14:51:06,422 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] n == 0 [2024-01-27 14:51:06,423 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] k1 == 0U [2024-01-27 14:51:06,423 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] m == 0 [2024-01-27 14:51:06,423 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] j1 == 0 [2024-01-27 14:51:06,423 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (0LL - (long long )i2) + (long long )j1 >= 0LL [2024-01-27 14:51:06,423 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] i2 == 0 [2024-01-27 14:51:06,423 INFO L98 nessWitnessExtractor]: Location invariant after [L41-L43] k2 == 0U [2024-01-27 14:51:06,423 INFO L98 nessWitnessExtractor]: Loop invariant at [L41-L43] (unsigned long )_argptr == 0UL [2024-01-27 14:51:06,424 INFO L98 nessWitnessExtractor]: Loop invariant at [L51-L54] (unsigned long )_argptr == 0UL [2024-01-27 14:51:06,424 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-27 14:51:06,424 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-27 14:51:06,424 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-27 14:51:06,424 INFO L98 nessWitnessExtractor]: Loop invariant at [L40-L45] (unsigned long )_argptr == 0UL [2024-01-27 14:51:06,424 INFO L98 nessWitnessExtractor]: Location invariant before [L42-L42] (unsigned long )_argptr == 0UL [2024-01-27 14:51:06,425 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (0LL - (long long )i2) + (long long )j1 >= 0LL [2024-01-27 14:51:06,425 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (long long )i2 - (long long )j1 >= 0LL [2024-01-27 14:51:06,425 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] k1 == 0U [2024-01-27 14:51:06,425 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] j1 == 0 [2024-01-27 14:51:06,425 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (long long )i2 + (long long )j1 >= 0LL [2024-01-27 14:51:06,425 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] i2 == 0 [2024-01-27 14:51:06,426 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (0LL - (long long )i2) - (long long )j1 >= 0LL [2024-01-27 14:51:06,426 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] k2 == 0U [2024-01-27 14:51:06,426 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-01-27 14:51:06,426 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] k1 == 0U [2024-01-27 14:51:06,426 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] k2 == 0U [2024-01-27 14:51:06,426 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] i1 == 0 [2024-01-27 14:51:06,426 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (long long )i2 + (long long )j1 >= 0LL [2024-01-27 14:51:06,427 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (long long )i2 - (long long )j1 >= 0LL [2024-01-27 14:51:06,427 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] k1 == 0U [2024-01-27 14:51:06,427 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] j1 == 0 [2024-01-27 14:51:06,428 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] i2 == 0 [2024-01-27 14:51:06,428 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (0LL - (long long )i2) + (long long )j1 >= 0LL [2024-01-27 14:51:06,429 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] k2 == 0U [2024-01-27 14:51:06,429 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (0LL - (long long )i2) - (long long )j1 >= 0LL [2024-01-27 14:51:06,429 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] k2 == 0U [2024-01-27 14:51:06,429 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (long long )i2 - (long long )j1 >= 0LL [2024-01-27 14:51:06,430 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (long long )i2 + (long long )j1 >= 0LL [2024-01-27 14:51:06,430 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (0LL - (long long )i2) - (long long )j1 >= 0LL [2024-01-27 14:51:06,430 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] k1 == 0U [2024-01-27 14:51:06,430 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (0LL - (long long )i2) + (long long )j1 >= 0LL [2024-01-27 14:51:06,430 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] m == 0 [2024-01-27 14:51:06,430 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] j1 == 0 [2024-01-27 14:51:06,430 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] i2 == 0 [2024-01-27 14:51:06,431 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] i1 == 0 [2024-01-27 14:51:06,431 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] k2 == 0U [2024-01-27 14:51:06,431 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] k1 == 0U [2024-01-27 14:51:06,431 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] j1 == 0 [2024-01-27 14:51:06,431 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] k2 == 0U [2024-01-27 14:51:06,432 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] k1 == 0U [2024-01-27 14:51:06,432 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] j1 == 0 [2024-01-27 14:51:06,432 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] k2 == 0U [2024-01-27 14:51:06,464 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 14:51:06,577 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c[2159,2172] [2024-01-27 14:51:06,581 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:51:06,588 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 14:51:06,596 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 14:51:06,650 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c[2159,2172] [2024-01-27 14:51:06,651 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:51:06,662 INFO L206 MainTranslator]: Completed translation [2024-01-27 14:51:06,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:06 WrapperNode [2024-01-27 14:51:06,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 14:51:06,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 14:51:06,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 14:51:06,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 14:51:06,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:06" (1/1) ... [2024-01-27 14:51:06,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:06" (1/1) ... [2024-01-27 14:51:06,694 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2024-01-27 14:51:06,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 14:51:06,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 14:51:06,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 14:51:06,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 14:51:06,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:06" (1/1) ... [2024-01-27 14:51:06,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:06" (1/1) ... [2024-01-27 14:51:06,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:06" (1/1) ... [2024-01-27 14:51:06,721 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-01-27 14:51:06,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:06" (1/1) ... [2024-01-27 14:51:06,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:06" (1/1) ... [2024-01-27 14:51:06,726 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:06" (1/1) ... [2024-01-27 14:51:06,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:06" (1/1) ... [2024-01-27 14:51:06,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:06" (1/1) ... [2024-01-27 14:51:06,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:06" (1/1) ... [2024-01-27 14:51:06,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 14:51:06,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 14:51:06,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 14:51:06,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 14:51:06,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:06" (1/1) ... [2024-01-27 14:51:06,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:51:06,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 14:51:06,777 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-27 14:51:06,795 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-27 14:51:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 14:51:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 14:51:06,813 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 14:51:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 14:51:06,814 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 14:51:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 14:51:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 14:51:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 14:51:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 14:51:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 14:51:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 14:51:06,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 14:51:06,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 14:51:06,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 14:51:06,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 14:51:06,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 14:51:06,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 14:51:06,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 14:51:06,816 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 14:51:06,901 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 14:51:06,903 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 14:51:07,198 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 14:51:07,198 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 14:51:07,327 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 14:51:07,327 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-27 14:51:07,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:51:07 BoogieIcfgContainer [2024-01-27 14:51:07,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 14:51:07,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 14:51:07,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 14:51:07,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 14:51:07,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:51:05" (1/4) ... [2024-01-27 14:51:07,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7881b4d1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 02:51:07, skipping insertion in model container [2024-01-27 14:51:07,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 02:51:06" (2/4) ... [2024-01-27 14:51:07,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7881b4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:51:07, skipping insertion in model container [2024-01-27 14:51:07,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:51:06" (3/4) ... [2024-01-27 14:51:07,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7881b4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:51:07, skipping insertion in model container [2024-01-27 14:51:07,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:51:07" (4/4) ... [2024-01-27 14:51:07,339 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2024-01-27 14:51:07,354 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 14:51:07,354 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-01-27 14:51:07,354 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 14:51:07,422 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 14:51:07,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 135 transitions, 284 flow [2024-01-27 14:51:07,532 INFO L124 PetriNetUnfolderBase]: 3/133 cut-off events. [2024-01-27 14:51:07,532 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 14:51:07,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 133 events. 3/133 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 172 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2024-01-27 14:51:07,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 135 transitions, 284 flow [2024-01-27 14:51:07,543 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 132 transitions, 276 flow [2024-01-27 14:51:07,562 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 14:51:07,570 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;@11b8c5c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 14:51:07,571 INFO L358 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2024-01-27 14:51:07,573 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 14:51:07,573 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 14:51:07,573 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:51:07,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:07,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 14:51:07,575 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-27 14:51:07,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:07,580 INFO L85 PathProgramCache]: Analyzing trace with hash 14330, now seen corresponding path program 1 times [2024-01-27 14:51:07,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:07,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175595493] [2024-01-27 14:51:07,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:07,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:07,811 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-27 14:51:07,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:07,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175595493] [2024-01-27 14:51:07,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175595493] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:07,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:07,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357251373] [2024-01-27 14:51:07,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:07,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:07,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:07,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:07,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:07,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 135 [2024-01-27 14:51:07,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-27 14:51:07,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:07,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 135 [2024-01-27 14:51:07,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:08,100 INFO L124 PetriNetUnfolderBase]: 183/567 cut-off events. [2024-01-27 14:51:08,100 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-01-27 14:51:08,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 567 events. 183/567 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3118 event pairs, 81 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 735. Up to 170 conditions per place. [2024-01-27 14:51:08,109 INFO L140 encePairwiseOnDemand]: 127/135 looper letters, 41 selfloop transitions, 4 changer transitions 0/143 dead transitions. [2024-01-27 14:51:08,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 143 transitions, 394 flow [2024-01-27 14:51:08,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2024-01-27 14:51:08,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8617283950617284 [2024-01-27 14:51:08,133 INFO L175 Difference]: Start difference. First operand has 136 places, 132 transitions, 276 flow. Second operand 3 states and 349 transitions. [2024-01-27 14:51:08,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 143 transitions, 394 flow [2024-01-27 14:51:08,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 143 transitions, 382 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 14:51:08,140 INFO L231 Difference]: Finished difference. Result has 131 places, 129 transitions, 276 flow [2024-01-27 14:51:08,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=131, PETRI_TRANSITIONS=129} [2024-01-27 14:51:08,145 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -5 predicate places. [2024-01-27 14:51:08,146 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 276 flow [2024-01-27 14:51:08,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-27 14:51:08,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:08,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 14:51:08,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 14:51:08,147 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-27 14:51:08,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:08,147 INFO L85 PathProgramCache]: Analyzing trace with hash 444645, now seen corresponding path program 1 times [2024-01-27 14:51:08,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:08,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336530930] [2024-01-27 14:51:08,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:08,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:08,209 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-27 14:51:08,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:08,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336530930] [2024-01-27 14:51:08,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336530930] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:08,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:08,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:08,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107079157] [2024-01-27 14:51:08,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:08,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:08,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:08,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:08,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:08,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 135 [2024-01-27 14:51:08,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 129 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:51:08,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:08,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 135 [2024-01-27 14:51:08,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:08,349 INFO L124 PetriNetUnfolderBase]: 183/535 cut-off events. [2024-01-27 14:51:08,350 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-01-27 14:51:08,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 535 events. 183/535 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 165 based on Foata normal form. 19/473 useless extension candidates. Maximal degree in co-relation 388. Up to 333 conditions per place. [2024-01-27 14:51:08,353 INFO L140 encePairwiseOnDemand]: 113/135 looper letters, 26 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2024-01-27 14:51:08,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 109 transitions, 292 flow [2024-01-27 14:51:08,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2024-01-27 14:51:08,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7308641975308642 [2024-01-27 14:51:08,355 INFO L175 Difference]: Start difference. First operand has 131 places, 129 transitions, 276 flow. Second operand 3 states and 296 transitions. [2024-01-27 14:51:08,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 109 transitions, 292 flow [2024-01-27 14:51:08,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 109 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:51:08,357 INFO L231 Difference]: Finished difference. Result has 112 places, 109 transitions, 236 flow [2024-01-27 14:51:08,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=112, PETRI_TRANSITIONS=109} [2024-01-27 14:51:08,358 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -24 predicate places. [2024-01-27 14:51:08,358 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 109 transitions, 236 flow [2024-01-27 14:51:08,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:51:08,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:08,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 14:51:08,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 14:51:08,359 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-27 14:51:08,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:08,360 INFO L85 PathProgramCache]: Analyzing trace with hash 427320310, now seen corresponding path program 1 times [2024-01-27 14:51:08,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:08,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281126749] [2024-01-27 14:51:08,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:08,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:08,381 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-27 14:51:08,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:08,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281126749] [2024-01-27 14:51:08,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281126749] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:08,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:08,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:08,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103373296] [2024-01-27 14:51:08,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:08,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:08,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:08,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:08,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:08,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 135 [2024-01-27 14:51:08,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 109 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-27 14:51:08,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:08,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 135 [2024-01-27 14:51:08,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:08,478 INFO L124 PetriNetUnfolderBase]: 183/533 cut-off events. [2024-01-27 14:51:08,478 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-01-27 14:51:08,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 533 events. 183/533 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 165 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 853. Up to 334 conditions per place. [2024-01-27 14:51:08,481 INFO L140 encePairwiseOnDemand]: 131/135 looper letters, 27 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2024-01-27 14:51:08,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 107 transitions, 290 flow [2024-01-27 14:51:08,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2024-01-27 14:51:08,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2024-01-27 14:51:08,483 INFO L175 Difference]: Start difference. First operand has 112 places, 109 transitions, 236 flow. Second operand 3 states and 342 transitions. [2024-01-27 14:51:08,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 107 transitions, 290 flow [2024-01-27 14:51:08,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 107 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:51:08,485 INFO L231 Difference]: Finished difference. Result has 110 places, 107 transitions, 232 flow [2024-01-27 14:51:08,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=110, PETRI_TRANSITIONS=107} [2024-01-27 14:51:08,486 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -26 predicate places. [2024-01-27 14:51:08,486 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 107 transitions, 232 flow [2024-01-27 14:51:08,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-27 14:51:08,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:08,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 14:51:08,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 14:51:08,487 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-27 14:51:08,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:08,487 INFO L85 PathProgramCache]: Analyzing trace with hash 362028227, now seen corresponding path program 1 times [2024-01-27 14:51:08,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:08,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055045920] [2024-01-27 14:51:08,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:08,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:51:08,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:08,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055045920] [2024-01-27 14:51:08,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055045920] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:08,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:08,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:08,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370105544] [2024-01-27 14:51:08,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:08,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:08,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:08,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:08,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:08,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 135 [2024-01-27 14:51:08,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 107 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-27 14:51:08,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:08,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 135 [2024-01-27 14:51:08,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:08,608 INFO L124 PetriNetUnfolderBase]: 183/527 cut-off events. [2024-01-27 14:51:08,608 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-01-27 14:51:08,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 527 events. 183/527 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 165 based on Foata normal form. 5/457 useless extension candidates. Maximal degree in co-relation 874. Up to 330 conditions per place. [2024-01-27 14:51:08,611 INFO L140 encePairwiseOnDemand]: 127/135 looper letters, 25 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-01-27 14:51:08,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 101 transitions, 274 flow [2024-01-27 14:51:08,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2024-01-27 14:51:08,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8345679012345679 [2024-01-27 14:51:08,613 INFO L175 Difference]: Start difference. First operand has 110 places, 107 transitions, 232 flow. Second operand 3 states and 338 transitions. [2024-01-27 14:51:08,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 101 transitions, 274 flow [2024-01-27 14:51:08,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 101 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:51:08,615 INFO L231 Difference]: Finished difference. Result has 104 places, 101 transitions, 220 flow [2024-01-27 14:51:08,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=104, PETRI_TRANSITIONS=101} [2024-01-27 14:51:08,616 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -32 predicate places. [2024-01-27 14:51:08,616 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 101 transitions, 220 flow [2024-01-27 14:51:08,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-27 14:51:08,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:08,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:08,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 14:51:08,617 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-27 14:51:08,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:08,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1662026362, now seen corresponding path program 1 times [2024-01-27 14:51:08,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:08,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470713763] [2024-01-27 14:51:08,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:08,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:08,636 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-27 14:51:08,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:08,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470713763] [2024-01-27 14:51:08,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470713763] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:08,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:08,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:08,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604034284] [2024-01-27 14:51:08,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:08,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:08,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:08,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:08,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:08,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 135 [2024-01-27 14:51:08,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 101 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-27 14:51:08,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:08,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 135 [2024-01-27 14:51:08,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:08,726 INFO L124 PetriNetUnfolderBase]: 183/526 cut-off events. [2024-01-27 14:51:08,726 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-01-27 14:51:08,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 526 events. 183/526 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2945 event pairs, 165 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 841. Up to 335 conditions per place. [2024-01-27 14:51:08,729 INFO L140 encePairwiseOnDemand]: 132/135 looper letters, 26 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2024-01-27 14:51:08,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 100 transitions, 274 flow [2024-01-27 14:51:08,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:08,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2024-01-27 14:51:08,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.854320987654321 [2024-01-27 14:51:08,730 INFO L175 Difference]: Start difference. First operand has 104 places, 101 transitions, 220 flow. Second operand 3 states and 346 transitions. [2024-01-27 14:51:08,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 100 transitions, 274 flow [2024-01-27 14:51:08,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 100 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:51:08,732 INFO L231 Difference]: Finished difference. Result has 103 places, 100 transitions, 218 flow [2024-01-27 14:51:08,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=103, PETRI_TRANSITIONS=100} [2024-01-27 14:51:08,733 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -33 predicate places. [2024-01-27 14:51:08,733 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 100 transitions, 218 flow [2024-01-27 14:51:08,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-27 14:51:08,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:08,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:08,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 14:51:08,734 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-27 14:51:08,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash 16790827, now seen corresponding path program 1 times [2024-01-27 14:51:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:08,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475444878] [2024-01-27 14:51:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:08,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:08,753 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-27 14:51:08,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:08,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475444878] [2024-01-27 14:51:08,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475444878] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:08,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:08,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:08,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233290155] [2024-01-27 14:51:08,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:08,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:08,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:08,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:08,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:08,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 135 [2024-01-27 14:51:08,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 100 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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-27 14:51:08,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:08,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 135 [2024-01-27 14:51:08,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:08,879 INFO L124 PetriNetUnfolderBase]: 364/994 cut-off events. [2024-01-27 14:51:08,880 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-01-27 14:51:08,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1683 conditions, 994 events. 364/994 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6369 event pairs, 141 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 1660. Up to 323 conditions per place. [2024-01-27 14:51:08,885 INFO L140 encePairwiseOnDemand]: 128/135 looper letters, 43 selfloop transitions, 4 changer transitions 0/115 dead transitions. [2024-01-27 14:51:08,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 115 transitions, 349 flow [2024-01-27 14:51:08,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2024-01-27 14:51:08,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8814814814814815 [2024-01-27 14:51:08,887 INFO L175 Difference]: Start difference. First operand has 103 places, 100 transitions, 218 flow. Second operand 3 states and 357 transitions. [2024-01-27 14:51:08,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 115 transitions, 349 flow [2024-01-27 14:51:08,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 115 transitions, 345 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:51:08,889 INFO L231 Difference]: Finished difference. Result has 101 places, 98 transitions, 224 flow [2024-01-27 14:51:08,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=101, PETRI_TRANSITIONS=98} [2024-01-27 14:51:08,890 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -35 predicate places. [2024-01-27 14:51:08,890 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 98 transitions, 224 flow [2024-01-27 14:51:08,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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-27 14:51:08,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:08,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:08,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 14:51:08,891 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-27 14:51:08,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:08,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1999776076, now seen corresponding path program 1 times [2024-01-27 14:51:08,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:08,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834140836] [2024-01-27 14:51:08,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:08,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:08,971 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-27 14:51:08,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:08,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834140836] [2024-01-27 14:51:08,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834140836] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:08,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:08,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:08,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687377529] [2024-01-27 14:51:08,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:08,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:08,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:08,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:08,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:08,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 135 [2024-01-27 14:51:08,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 98 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-27 14:51:08,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:08,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 135 [2024-01-27 14:51:08,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:09,101 INFO L124 PetriNetUnfolderBase]: 399/1000 cut-off events. [2024-01-27 14:51:09,101 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-01-27 14:51:09,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1000 events. 399/1000 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6358 event pairs, 347 based on Foata normal form. 5/872 useless extension candidates. Maximal degree in co-relation 877. Up to 691 conditions per place. [2024-01-27 14:51:09,107 INFO L140 encePairwiseOnDemand]: 126/135 looper letters, 27 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2024-01-27 14:51:09,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 91 transitions, 268 flow [2024-01-27 14:51:09,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2024-01-27 14:51:09,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8246913580246914 [2024-01-27 14:51:09,108 INFO L175 Difference]: Start difference. First operand has 101 places, 98 transitions, 224 flow. Second operand 3 states and 334 transitions. [2024-01-27 14:51:09,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 91 transitions, 268 flow [2024-01-27 14:51:09,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 91 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:51:09,110 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 210 flow [2024-01-27 14:51:09,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=95, PETRI_TRANSITIONS=91} [2024-01-27 14:51:09,111 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -41 predicate places. [2024-01-27 14:51:09,111 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 210 flow [2024-01-27 14:51:09,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-27 14:51:09,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:09,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:09,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 14:51:09,112 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-27 14:51:09,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:09,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1464371169, now seen corresponding path program 1 times [2024-01-27 14:51:09,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:09,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416541827] [2024-01-27 14:51:09,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:09,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:09,185 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-27 14:51:09,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:09,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416541827] [2024-01-27 14:51:09,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416541827] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:09,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:09,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:51:09,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46236505] [2024-01-27 14:51:09,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:09,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:51:09,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:09,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:51:09,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:51:09,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 135 [2024-01-27 14:51:09,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 91 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-27 14:51:09,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:09,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 135 [2024-01-27 14:51:09,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:09,382 INFO L124 PetriNetUnfolderBase]: 563/1483 cut-off events. [2024-01-27 14:51:09,383 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2024-01-27 14:51:09,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2608 conditions, 1483 events. 563/1483 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10464 event pairs, 251 based on Foata normal form. 0/1265 useless extension candidates. Maximal degree in co-relation 2537. Up to 553 conditions per place. [2024-01-27 14:51:09,392 INFO L140 encePairwiseOnDemand]: 130/135 looper letters, 48 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2024-01-27 14:51:09,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 109 transitions, 361 flow [2024-01-27 14:51:09,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:51:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:51:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2024-01-27 14:51:09,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8469135802469135 [2024-01-27 14:51:09,394 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 210 flow. Second operand 3 states and 343 transitions. [2024-01-27 14:51:09,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 109 transitions, 361 flow [2024-01-27 14:51:09,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 109 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:51:09,397 INFO L231 Difference]: Finished difference. Result has 96 places, 92 transitions, 228 flow [2024-01-27 14:51:09,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=96, PETRI_TRANSITIONS=92} [2024-01-27 14:51:09,400 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -40 predicate places. [2024-01-27 14:51:09,401 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 92 transitions, 228 flow [2024-01-27 14:51:09,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-27 14:51:09,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:09,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:09,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 14:51:09,401 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-27 14:51:09,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:09,402 INFO L85 PathProgramCache]: Analyzing trace with hash 656019219, now seen corresponding path program 1 times [2024-01-27 14:51:09,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:09,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594462714] [2024-01-27 14:51:09,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:09,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:09,562 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-27 14:51:09,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:09,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594462714] [2024-01-27 14:51:09,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594462714] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:09,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:09,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:51:09,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109086938] [2024-01-27 14:51:09,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:09,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:51:09,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:09,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:51:09,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:51:09,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 135 [2024-01-27 14:51:09,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 92 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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-27 14:51:09,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:09,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 135 [2024-01-27 14:51:09,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:09,747 INFO L124 PetriNetUnfolderBase]: 589/1385 cut-off events. [2024-01-27 14:51:09,747 INFO L125 PetriNetUnfolderBase]: For 429/429 co-relation queries the response was YES. [2024-01-27 14:51:09,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 1385 events. 589/1385 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 9123 event pairs, 7 based on Foata normal form. 270/1574 useless extension candidates. Maximal degree in co-relation 1339. Up to 946 conditions per place. [2024-01-27 14:51:09,754 INFO L140 encePairwiseOnDemand]: 126/135 looper letters, 37 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-01-27 14:51:09,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 93 transitions, 313 flow [2024-01-27 14:51:09,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:51:09,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:51:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 441 transitions. [2024-01-27 14:51:09,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2024-01-27 14:51:09,755 INFO L175 Difference]: Start difference. First operand has 96 places, 92 transitions, 228 flow. Second operand 4 states and 441 transitions. [2024-01-27 14:51:09,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 93 transitions, 313 flow [2024-01-27 14:51:09,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 93 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:51:09,759 INFO L231 Difference]: Finished difference. Result has 90 places, 85 transitions, 210 flow [2024-01-27 14:51:09,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=90, PETRI_TRANSITIONS=85} [2024-01-27 14:51:09,759 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -46 predicate places. [2024-01-27 14:51:09,760 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 85 transitions, 210 flow [2024-01-27 14:51:09,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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-27 14:51:09,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:09,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:09,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 14:51:09,760 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-27 14:51:09,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:09,761 INFO L85 PathProgramCache]: Analyzing trace with hash -926475597, now seen corresponding path program 1 times [2024-01-27 14:51:09,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:09,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855696927] [2024-01-27 14:51:09,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:09,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:09,854 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-27 14:51:09,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:09,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855696927] [2024-01-27 14:51:09,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855696927] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:09,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:09,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:51:09,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744753840] [2024-01-27 14:51:09,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:09,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:51:09,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:09,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:51:09,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:51:09,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 135 [2024-01-27 14:51:09,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 85 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 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-27 14:51:09,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:09,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 135 [2024-01-27 14:51:09,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:09,987 INFO L124 PetriNetUnfolderBase]: 628/1265 cut-off events. [2024-01-27 14:51:09,988 INFO L125 PetriNetUnfolderBase]: For 248/248 co-relation queries the response was YES. [2024-01-27 14:51:09,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2641 conditions, 1265 events. 628/1265 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7289 event pairs, 16 based on Foata normal form. 160/1403 useless extension candidates. Maximal degree in co-relation 2568. Up to 892 conditions per place. [2024-01-27 14:51:09,993 INFO L140 encePairwiseOnDemand]: 128/135 looper letters, 50 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-01-27 14:51:09,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 101 transitions, 371 flow [2024-01-27 14:51:09,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:51:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:51:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2024-01-27 14:51:09,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8425925925925926 [2024-01-27 14:51:09,995 INFO L175 Difference]: Start difference. First operand has 90 places, 85 transitions, 210 flow. Second operand 4 states and 455 transitions. [2024-01-27 14:51:09,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 101 transitions, 371 flow [2024-01-27 14:51:09,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 101 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:51:09,997 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 201 flow [2024-01-27 14:51:09,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=83, 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=4, PETRI_FLOW=201, PETRI_PLACES=86, PETRI_TRANSITIONS=80} [2024-01-27 14:51:09,998 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -50 predicate places. [2024-01-27 14:51:09,998 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 201 flow [2024-01-27 14:51:09,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 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-27 14:51:09,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:09,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:09,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 14:51:09,999 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-27 14:51:09,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:09,999 INFO L85 PathProgramCache]: Analyzing trace with hash -544689350, now seen corresponding path program 1 times [2024-01-27 14:51:09,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:10,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717891325] [2024-01-27 14:51:10,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:10,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:10,101 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-27 14:51:10,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:10,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717891325] [2024-01-27 14:51:10,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717891325] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:10,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:10,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:51:10,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511354881] [2024-01-27 14:51:10,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:10,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:51:10,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:10,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:51:10,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:51:10,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 135 [2024-01-27 14:51:10,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 80 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 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-27 14:51:10,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:10,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 135 [2024-01-27 14:51:10,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:10,292 INFO L124 PetriNetUnfolderBase]: 977/1900 cut-off events. [2024-01-27 14:51:10,292 INFO L125 PetriNetUnfolderBase]: For 321/321 co-relation queries the response was YES. [2024-01-27 14:51:10,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4051 conditions, 1900 events. 977/1900 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11424 event pairs, 226 based on Foata normal form. 0/1813 useless extension candidates. Maximal degree in co-relation 3973. Up to 772 conditions per place. [2024-01-27 14:51:10,303 INFO L140 encePairwiseOnDemand]: 129/135 looper letters, 70 selfloop transitions, 6 changer transitions 0/118 dead transitions. [2024-01-27 14:51:10,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 118 transitions, 461 flow [2024-01-27 14:51:10,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:51:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:51:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 439 transitions. [2024-01-27 14:51:10,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.812962962962963 [2024-01-27 14:51:10,305 INFO L175 Difference]: Start difference. First operand has 86 places, 80 transitions, 201 flow. Second operand 4 states and 439 transitions. [2024-01-27 14:51:10,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 118 transitions, 461 flow [2024-01-27 14:51:10,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 118 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:51:10,308 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 236 flow [2024-01-27 14:51:10,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2024-01-27 14:51:10,308 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -46 predicate places. [2024-01-27 14:51:10,308 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 236 flow [2024-01-27 14:51:10,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 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-27 14:51:10,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:10,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:10,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 14:51:10,309 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-27 14:51:10,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:10,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1658948107, now seen corresponding path program 1 times [2024-01-27 14:51:10,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:10,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605783262] [2024-01-27 14:51:10,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:10,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:10,542 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-27 14:51:10,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:10,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605783262] [2024-01-27 14:51:10,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605783262] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:10,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:10,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 14:51:10,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568773903] [2024-01-27 14:51:10,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:10,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 14:51:10,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:10,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 14:51:10,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 14:51:10,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 135 [2024-01-27 14:51:10,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 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-27 14:51:10,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:10,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 135 [2024-01-27 14:51:10,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:11,324 INFO L124 PetriNetUnfolderBase]: 1919/3763 cut-off events. [2024-01-27 14:51:11,324 INFO L125 PetriNetUnfolderBase]: For 1486/1502 co-relation queries the response was YES. [2024-01-27 14:51:11,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8722 conditions, 3763 events. 1919/3763 cut-off events. For 1486/1502 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 25183 event pairs, 275 based on Foata normal form. 40/3765 useless extension candidates. Maximal degree in co-relation 8629. Up to 1028 conditions per place. [2024-01-27 14:51:11,343 INFO L140 encePairwiseOnDemand]: 125/135 looper letters, 136 selfloop transitions, 14 changer transitions 0/185 dead transitions. [2024-01-27 14:51:11,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 185 transitions, 865 flow [2024-01-27 14:51:11,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 14:51:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 14:51:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 778 transitions. [2024-01-27 14:51:11,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7203703703703703 [2024-01-27 14:51:11,346 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 236 flow. Second operand 8 states and 778 transitions. [2024-01-27 14:51:11,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 185 transitions, 865 flow [2024-01-27 14:51:11,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 185 transitions, 865 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 14:51:11,349 INFO L231 Difference]: Finished difference. Result has 104 places, 94 transitions, 372 flow [2024-01-27 14:51:11,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=104, PETRI_TRANSITIONS=94} [2024-01-27 14:51:11,349 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -32 predicate places. [2024-01-27 14:51:11,350 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 94 transitions, 372 flow [2024-01-27 14:51:11,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 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-27 14:51:11,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:11,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:11,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 14:51:11,351 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-27 14:51:11,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:11,351 INFO L85 PathProgramCache]: Analyzing trace with hash 876528555, now seen corresponding path program 2 times [2024-01-27 14:51:11,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:11,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255382699] [2024-01-27 14:51:11,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:11,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:11,545 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-27 14:51:11,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:11,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255382699] [2024-01-27 14:51:11,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255382699] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:11,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:11,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 14:51:11,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871976824] [2024-01-27 14:51:11,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:11,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 14:51:11,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:11,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 14:51:11,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 14:51:11,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 135 [2024-01-27 14:51:11,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 94 transitions, 372 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 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-27 14:51:11,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:11,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 135 [2024-01-27 14:51:11,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:12,524 INFO L124 PetriNetUnfolderBase]: 2264/4404 cut-off events. [2024-01-27 14:51:12,525 INFO L125 PetriNetUnfolderBase]: For 5229/5323 co-relation queries the response was YES. [2024-01-27 14:51:12,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11625 conditions, 4404 events. 2264/4404 cut-off events. For 5229/5323 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 30110 event pairs, 239 based on Foata normal form. 40/4401 useless extension candidates. Maximal degree in co-relation 11519. Up to 1421 conditions per place. [2024-01-27 14:51:12,548 INFO L140 encePairwiseOnDemand]: 124/135 looper letters, 129 selfloop transitions, 33 changer transitions 0/197 dead transitions. [2024-01-27 14:51:12,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 197 transitions, 1110 flow [2024-01-27 14:51:12,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 14:51:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 14:51:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 784 transitions. [2024-01-27 14:51:12,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.725925925925926 [2024-01-27 14:51:12,551 INFO L175 Difference]: Start difference. First operand has 104 places, 94 transitions, 372 flow. Second operand 8 states and 784 transitions. [2024-01-27 14:51:12,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 197 transitions, 1110 flow [2024-01-27 14:51:12,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 197 transitions, 1110 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 14:51:12,559 INFO L231 Difference]: Finished difference. Result has 116 places, 114 transitions, 676 flow [2024-01-27 14:51:12,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=676, PETRI_PLACES=116, PETRI_TRANSITIONS=114} [2024-01-27 14:51:12,560 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -20 predicate places. [2024-01-27 14:51:12,560 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 114 transitions, 676 flow [2024-01-27 14:51:12,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 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-27 14:51:12,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:12,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:12,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 14:51:12,561 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-27 14:51:12,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:12,561 INFO L85 PathProgramCache]: Analyzing trace with hash -989572641, now seen corresponding path program 3 times [2024-01-27 14:51:12,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:12,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206854289] [2024-01-27 14:51:12,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:12,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:12,691 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-27 14:51:12,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:12,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206854289] [2024-01-27 14:51:12,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206854289] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:51:12,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:51:12,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 14:51:12,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653519872] [2024-01-27 14:51:12,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:51:12,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 14:51:12,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:51:12,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 14:51:12,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-27 14:51:12,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 135 [2024-01-27 14:51:12,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 114 transitions, 676 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 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-27 14:51:12,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:51:12,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 135 [2024-01-27 14:51:12,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:13,613 INFO L124 PetriNetUnfolderBase]: 2709/5278 cut-off events. [2024-01-27 14:51:13,613 INFO L125 PetriNetUnfolderBase]: For 13169/13299 co-relation queries the response was YES. [2024-01-27 14:51:13,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15675 conditions, 5278 events. 2709/5278 cut-off events. For 13169/13299 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 37819 event pairs, 373 based on Foata normal form. 84/5301 useless extension candidates. Maximal degree in co-relation 15556. Up to 1561 conditions per place. [2024-01-27 14:51:13,641 INFO L140 encePairwiseOnDemand]: 124/135 looper letters, 133 selfloop transitions, 46 changer transitions 0/214 dead transitions. [2024-01-27 14:51:13,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 214 transitions, 1495 flow [2024-01-27 14:51:13,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 14:51:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 14:51:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 784 transitions. [2024-01-27 14:51:13,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.725925925925926 [2024-01-27 14:51:13,644 INFO L175 Difference]: Start difference. First operand has 116 places, 114 transitions, 676 flow. Second operand 8 states and 784 transitions. [2024-01-27 14:51:13,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 214 transitions, 1495 flow [2024-01-27 14:51:13,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 214 transitions, 1464 flow, removed 13 selfloop flow, removed 1 redundant places. [2024-01-27 14:51:13,670 INFO L231 Difference]: Finished difference. Result has 127 places, 133 transitions, 1023 flow [2024-01-27 14:51:13,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1023, PETRI_PLACES=127, PETRI_TRANSITIONS=133} [2024-01-27 14:51:13,671 INFO L281 CegarLoopForPetriNet]: 136 programPoint places, -9 predicate places. [2024-01-27 14:51:13,671 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 133 transitions, 1023 flow [2024-01-27 14:51:13,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 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-27 14:51:13,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:13,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:13,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-27 14:51:13,672 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 70 more)] === [2024-01-27 14:51:13,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:13,672 INFO L85 PathProgramCache]: Analyzing trace with hash -739401907, now seen corresponding path program 1 times [2024-01-27 14:51:13,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:13,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152375695] [2024-01-27 14:51:13,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:13,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:51:13,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 14:51:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:51:13,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 14:51:13,712 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 14:51:13,713 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 73 remaining) [2024-01-27 14:51:13,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 73 remaining) [2024-01-27 14:51:13,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 73 remaining) [2024-01-27 14:51:13,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 73 remaining) [2024-01-27 14:51:13,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 73 remaining) [2024-01-27 14:51:13,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 73 remaining) [2024-01-27 14:51:13,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 73 remaining) [2024-01-27 14:51:13,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 73 remaining) [2024-01-27 14:51:13,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 73 remaining) [2024-01-27 14:51:13,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 73 remaining) [2024-01-27 14:51:13,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 73 remaining) [2024-01-27 14:51:13,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 73 remaining) [2024-01-27 14:51:13,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 73 remaining) [2024-01-27 14:51:13,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 73 remaining) [2024-01-27 14:51:13,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 73 remaining) [2024-01-27 14:51:13,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 73 remaining) [2024-01-27 14:51:13,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 73 remaining) [2024-01-27 14:51:13,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 73 remaining) [2024-01-27 14:51:13,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 73 remaining) [2024-01-27 14:51:13,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 73 remaining) [2024-01-27 14:51:13,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 73 remaining) [2024-01-27 14:51:13,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 73 remaining) [2024-01-27 14:51:13,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 73 remaining) [2024-01-27 14:51:13,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 73 remaining) [2024-01-27 14:51:13,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 73 remaining) [2024-01-27 14:51:13,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 73 remaining) [2024-01-27 14:51:13,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 73 remaining) [2024-01-27 14:51:13,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 73 remaining) [2024-01-27 14:51:13,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 73 remaining) [2024-01-27 14:51:13,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 73 remaining) [2024-01-27 14:51:13,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 73 remaining) [2024-01-27 14:51:13,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 73 remaining) [2024-01-27 14:51:13,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 73 remaining) [2024-01-27 14:51:13,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 73 remaining) [2024-01-27 14:51:13,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 73 remaining) [2024-01-27 14:51:13,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 73 remaining) [2024-01-27 14:51:13,718 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 73 remaining) [2024-01-27 14:51:13,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 73 remaining) [2024-01-27 14:51:13,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 73 remaining) [2024-01-27 14:51:13,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 73 remaining) [2024-01-27 14:51:13,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 73 remaining) [2024-01-27 14:51:13,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 73 remaining) [2024-01-27 14:51:13,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 73 remaining) [2024-01-27 14:51:13,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 73 remaining) [2024-01-27 14:51:13,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 73 remaining) [2024-01-27 14:51:13,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 73 remaining) [2024-01-27 14:51:13,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 73 remaining) [2024-01-27 14:51:13,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 73 remaining) [2024-01-27 14:51:13,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 73 remaining) [2024-01-27 14:51:13,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 73 remaining) [2024-01-27 14:51:13,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 73 remaining) [2024-01-27 14:51:13,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 73 remaining) [2024-01-27 14:51:13,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 73 remaining) [2024-01-27 14:51:13,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 73 remaining) [2024-01-27 14:51:13,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 73 remaining) [2024-01-27 14:51:13,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 73 remaining) [2024-01-27 14:51:13,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 73 remaining) [2024-01-27 14:51:13,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 73 remaining) [2024-01-27 14:51:13,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION (14 of 73 remaining) [2024-01-27 14:51:13,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 73 remaining) [2024-01-27 14:51:13,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 73 remaining) [2024-01-27 14:51:13,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 73 remaining) [2024-01-27 14:51:13,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 73 remaining) [2024-01-27 14:51:13,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 73 remaining) [2024-01-27 14:51:13,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 73 remaining) [2024-01-27 14:51:13,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 73 remaining) [2024-01-27 14:51:13,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 73 remaining) [2024-01-27 14:51:13,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 73 remaining) [2024-01-27 14:51:13,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 73 remaining) [2024-01-27 14:51:13,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 73 remaining) [2024-01-27 14:51:13,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 73 remaining) [2024-01-27 14:51:13,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 73 remaining) [2024-01-27 14:51:13,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 73 remaining) [2024-01-27 14:51:13,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-27 14:51:13,724 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:13,729 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 14:51:13,729 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 14:51:13,777 INFO L503 ceAbstractionStarter]: Automizer considered 57 witness invariants [2024-01-27 14:51:13,777 INFO L504 ceAbstractionStarter]: WitnessConsidered=57 [2024-01-27 14:51:13,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 02:51:13 BasicIcfg [2024-01-27 14:51:13,778 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 14:51:13,778 INFO L158 Benchmark]: Toolchain (without parser) took 7386.77ms. Allocated memory was 159.4MB in the beginning and 438.3MB in the end (delta: 278.9MB). Free memory was 87.4MB in the beginning and 328.9MB in the end (delta: -241.5MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2024-01-27 14:51:13,778 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:51:13,779 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 159.4MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:51:13,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.80ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 118.4MB in the end (delta: -31.2MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-01-27 14:51:13,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.13ms. Allocated memory is still 159.4MB. Free memory was 118.4MB in the beginning and 116.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 14:51:13,779 INFO L158 Benchmark]: Boogie Preprocessor took 44.58ms. Allocated memory is still 159.4MB. Free memory was 116.9MB in the beginning and 114.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 14:51:13,779 INFO L158 Benchmark]: RCFGBuilder took 588.33ms. Allocated memory is still 159.4MB. Free memory was 114.2MB in the beginning and 77.1MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-01-27 14:51:13,780 INFO L158 Benchmark]: TraceAbstraction took 6447.68ms. Allocated memory was 159.4MB in the beginning and 438.3MB in the end (delta: 278.9MB). Free memory was 76.5MB in the beginning and 328.9MB in the end (delta: -252.4MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2024-01-27 14:51:13,781 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.15ms. Allocated memory is still 104.9MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.08ms. Allocated memory is still 159.4MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.80ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 118.4MB in the end (delta: -31.2MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.13ms. Allocated memory is still 159.4MB. Free memory was 118.4MB in the beginning and 116.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.58ms. Allocated memory is still 159.4MB. Free memory was 116.9MB in the beginning and 114.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 588.33ms. Allocated memory is still 159.4MB. Free memory was 114.2MB in the beginning and 77.1MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6447.68ms. Allocated memory was 159.4MB in the beginning and 438.3MB in the end (delta: 278.9MB). Free memory was 76.5MB in the beginning and 328.9MB in the end (delta: -252.4MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 41]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L36] 0 int n, m, i1, i2, j1; [L37] 0 unsigned int k1, k2; [L60] 0 pthread_t t1, t2; VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[m],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i1],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] [L63] 0 n = __VERIFIER_nondet_int() [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i1],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[m],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=1, t1={3:0}, t2={5:0}] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] [L64] 0 m = __VERIFIER_nondet_int() [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i1],IntegerLiteral[0]]]] [L65] 0 i1 = __VERIFIER_nondet_int() [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]]] [L66] 0 i2 = __VERIFIER_nondet_int() [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] [L67] 0 j1 = __VERIFIER_nondet_int() [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]]] [L68] 0 k1 = __VERIFIER_nondet_uint() [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] [L69] 0 k2 = __VERIFIER_nondet_uint() [L72] CALL 0 assume_abort_if_not( i1 == i2 && i1 == k1 && i1 == k2 && i1 == 0 ) [L33] COND FALSE 0 !(!cond) [L72] RET 0 assume_abort_if_not( i1 == i2 && i1 == k1 && i1 == k2 && i1 == 0 ) [L73] CALL 0 assume_abort_if_not( m >= 0 ) [L33] COND FALSE 0 !(!cond) [L73] RET 0 assume_abort_if_not( m >= 0 ) [L75] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [_argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L76] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [_argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L51] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L51] COND TRUE 2 i2 < n VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L40] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L40] COND TRUE 1 i1 < n [L41] 1 j1 = 0 VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L52] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] [L52] 2 k2 = k2 + m VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=1, m=1, n=1] [L41] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=1, m=1, n=1] [L41] COND TRUE 1 j1 < m VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=1, m=1, n=1] [L42] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] [L42] 1 k1++ [L41] 1 j1++ VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=1, m=1, n=1] [L41] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=1, m=1, n=1] [L41] COND FALSE 1 !(j1 < m) VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=1, m=1, n=1] [L41] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=1, m=1, n=1] - UnprovableResult [Line: 40]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 168 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: 6.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2004 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1379 mSDsluCounter, 1143 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 770 mSDsCounter, 200 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2785 IncrementalHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 200 mSolverCounterUnsat, 373 mSDtfsCounter, 2785 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1023occurred in iteration=14, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 467 NumberOfCodeBlocks, 467 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 392 ConstructedInterpolants, 0 QuantifiedInterpolants, 1486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-27 14:51:13,824 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