./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 59af5db6 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/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-59af5db-m [2024-02-02 09:19:55,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 09:19:55,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 09:19:55,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 09:19:55,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 09:19:55,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 09:19:55,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 09:19:55,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 09:19:55,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 09:19:55,459 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 09:19:55,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 09:19:55,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 09:19:55,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 09:19:55,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 09:19:55,461 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 09:19:55,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 09:19:55,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 09:19:55,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 09:19:55,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 09:19:55,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 09:19:55,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 09:19:55,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 09:19:55,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 09:19:55,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 09:19:55,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 09:19:55,464 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 09:19:55,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 09:19:55,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 09:19:55,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 09:19:55,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 09:19:55,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 09:19:55,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 09:19:55,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:19:55,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 09:19:55,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 09:19:55,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 09:19:55,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 09:19:55,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 09:19:55,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 09:19:55,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 09:19:55,468 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 09:19:55,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 09:19:55,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 09:19:55,469 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-02 09:19:55,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 09:19:55,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 09:19:55,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 09:19:55,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 09:19:55,751 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 09:19:55,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/clever.wvr.c [2024-02-02 09:19:56,891 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 09:19:57,063 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 09:19:57,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c [2024-02-02 09:19:57,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a24435eb/4fee70966a1e49e0bfe9ade887f5defd/FLAGb17a726be [2024-02-02 09:19:57,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a24435eb/4fee70966a1e49e0bfe9ade887f5defd [2024-02-02 09:19:57,082 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 09:19:57,082 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 09:19:57,083 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-02-02 09:19:57,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 09:19:57,191 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 09:19:57,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 09:19:57,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 09:19:57,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 09:19:57,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:19:57" (1/2) ... [2024-02-02 09:19:57,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a10fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:57, skipping insertion in model container [2024-02-02 09:19:57,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:19:57" (1/2) ... [2024-02-02 09:19:57,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@59808cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:19:57, skipping insertion in model container [2024-02-02 09:19:57,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:19:57" (2/2) ... [2024-02-02 09:19:57,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a10fb2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:57, skipping insertion in model container [2024-02-02 09:19:57,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:19:57" (2/2) ... [2024-02-02 09:19:57,200 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 09:19:57,216 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 09:19:57,217 INFO L101 nessWitnessExtractor]: Location invariant before [L68-L68] (k1 == 0U) && (k2 == 0U) [2024-02-02 09:19:57,217 INFO L101 nessWitnessExtractor]: Loop invariant at [L51-L54] (unsigned long )_argptr == 0UL [2024-02-02 09:19:57,217 INFO L101 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-02-02 09:19:57,217 INFO L101 nessWitnessExtractor]: Loop invariant at [L40-L45] (unsigned long )_argptr == 0UL [2024-02-02 09:19:57,217 INFO L101 nessWitnessExtractor]: Location invariant before [L67-L67] ((j1 == 0) && (k1 == 0U)) && (k2 == 0U) [2024-02-02 09:19:57,218 INFO L101 nessWitnessExtractor]: Location invariant before [L65-L65] (((((((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL)) && ((long long )i2 - (long long )j1 >= 0LL)) && (i1 == 0)) && (i2 == 0)) && (j1 == 0)) && (k1 == 0U)) && (k2 == 0U) [2024-02-02 09:19:57,218 INFO L101 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-02-02 09:19:57,218 INFO L101 nessWitnessExtractor]: Location invariant before [L66-L66] ((((((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL)) && ((long long )i2 - (long long )j1 >= 0LL)) && (i2 == 0)) && (j1 == 0)) && (k1 == 0U)) && (k2 == 0U) [2024-02-02 09:19:57,218 INFO L101 nessWitnessExtractor]: Location invariant before [L69-L69] k2 == 0U [2024-02-02 09:19:57,218 INFO L101 nessWitnessExtractor]: Loop invariant at [L41-L43] (unsigned long )_argptr == 0UL [2024-02-02 09:19:57,218 INFO L101 nessWitnessExtractor]: Location invariant after [L41-L43] k2 == 0U [2024-02-02 09:19:57,218 INFO L101 nessWitnessExtractor]: Location invariant before [L42-L42] (unsigned long )_argptr == 0UL [2024-02-02 09:19:57,218 INFO L101 nessWitnessExtractor]: Location invariant before [L64-L64] ((((((((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL)) && ((long long )i2 - (long long )j1 >= 0LL)) && (m == 0)) && (i1 == 0)) && (i2 == 0)) && (j1 == 0)) && (k1 == 0U)) && (k2 == 0U) [2024-02-02 09:19:57,219 INFO L101 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-02-02 09:19:57,219 INFO L101 nessWitnessExtractor]: Location invariant before [L22-L25] ((j1 == 0) && (k1 == 0U)) && (k2 == 0U) [2024-02-02 09:19:57,219 INFO L101 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-02-02 09:19:57,219 INFO L101 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-02-02 09:19:57,219 INFO L101 nessWitnessExtractor]: Location invariant before [L63-L63] (((((((((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL)) && ((long long )i2 - (long long )j1 >= 0LL)) && (n == 0)) && (m == 0)) && (i1 == 0)) && (i2 == 0)) && (j1 == 0)) && (k1 == 0U)) && (k2 == 0U) [2024-02-02 09:19:57,235 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-02 09:19:57,380 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-02-02 09:19:57,383 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:19:57,389 INFO L202 MainTranslator]: Completed pre-run [2024-02-02 09:19:57,405 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 [2024-02-02 09:19:57,445 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-02-02 09:19:57,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:19:57,457 INFO L206 MainTranslator]: Completed translation [2024-02-02 09:19:57,457 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:57 WrapperNode [2024-02-02 09:19:57,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 09:19:57,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 09:19:57,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 09:19:57,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 09:19:57,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:57" (1/1) ... [2024-02-02 09:19:57,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:57" (1/1) ... [2024-02-02 09:19:57,500 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 91 [2024-02-02 09:19:57,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 09:19:57,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 09:19:57,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 09:19:57,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 09:19:57,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:57" (1/1) ... [2024-02-02 09:19:57,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:57" (1/1) ... [2024-02-02 09:19:57,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:57" (1/1) ... [2024-02-02 09:19:57,543 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-02 09:19:57,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:57" (1/1) ... [2024-02-02 09:19:57,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:57" (1/1) ... [2024-02-02 09:19:57,549 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:57" (1/1) ... [2024-02-02 09:19:57,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:57" (1/1) ... [2024-02-02 09:19:57,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:57" (1/1) ... [2024-02-02 09:19:57,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:57" (1/1) ... [2024-02-02 09:19:57,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 09:19:57,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 09:19:57,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 09:19:57,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 09:19:57,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:57" (1/1) ... [2024-02-02 09:19:57,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:19:57,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:19:57,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-02 09:19:57,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-02 09:19:57,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 09:19:57,680 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-02 09:19:57,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-02 09:19:57,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-02 09:19:57,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-02 09:19:57,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 09:19:57,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 09:19:57,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 09:19:57,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 09:19:57,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 09:19:57,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 09:19:57,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 09:19:57,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 09:19:57,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 09:19:57,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 09:19:57,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 09:19:57,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 09:19:57,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 09:19:57,686 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-02 09:19:57,844 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 09:19:57,847 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 09:19:58,150 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 09:19:58,151 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 09:19:58,286 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 09:19:58,286 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-02-02 09:19:58,287 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:19:58 BoogieIcfgContainer [2024-02-02 09:19:58,287 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 09:19:58,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 09:19:58,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 09:19:58,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 09:19:58,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:19:57" (1/4) ... [2024-02-02 09:19:58,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2363c15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:19:58, skipping insertion in model container [2024-02-02 09:19:58,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:19:57" (2/4) ... [2024-02-02 09:19:58,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2363c15b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:19:58, skipping insertion in model container [2024-02-02 09:19:58,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:19:57" (3/4) ... [2024-02-02 09:19:58,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2363c15b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:19:58, skipping insertion in model container [2024-02-02 09:19:58,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:19:58" (4/4) ... [2024-02-02 09:19:58,298 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2024-02-02 09:19:58,313 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 09:19:58,313 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-02-02 09:19:58,313 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 09:19:58,374 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-02 09:19:58,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 61 transitions, 136 flow [2024-02-02 09:19:58,438 INFO L124 PetriNetUnfolderBase]: 3/59 cut-off events. [2024-02-02 09:19:58,439 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:19:58,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 59 events. 3/59 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2024-02-02 09:19:58,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 61 transitions, 136 flow [2024-02-02 09:19:58,444 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 58 transitions, 128 flow [2024-02-02 09:19:58,451 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 09:19:58,457 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;@1a5003fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 09:19:58,457 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-02-02 09:19:58,459 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 09:19:58,459 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 09:19:58,459 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:19:58,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:58,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 09:19:58,460 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:19:58,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:58,465 INFO L85 PathProgramCache]: Analyzing trace with hash 11643, now seen corresponding path program 1 times [2024-02-02 09:19:58,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:58,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370415594] [2024-02-02 09:19:58,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:58,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:58,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:58,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370415594] [2024-02-02 09:19:58,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370415594] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:58,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:58,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:19:58,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567009592] [2024-02-02 09:19:58,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:58,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:19:58,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:58,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:19:58,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:19:58,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 61 [2024-02-02 09:19:58,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:58,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:58,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 61 [2024-02-02 09:19:58,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:59,149 INFO L124 PetriNetUnfolderBase]: 221/479 cut-off events. [2024-02-02 09:19:59,150 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-02-02 09:19:59,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 479 events. 221/479 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2573 event pairs, 159 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 777. Up to 367 conditions per place. [2024-02-02 09:19:59,155 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 33 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2024-02-02 09:19:59,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 57 transitions, 196 flow [2024-02-02 09:19:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-02-02 09:19:59,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5901639344262295 [2024-02-02 09:19:59,168 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 128 flow. Second operand 3 states and 108 transitions. [2024-02-02 09:19:59,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 57 transitions, 196 flow [2024-02-02 09:19:59,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 57 transitions, 188 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-02 09:19:59,177 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 122 flow [2024-02-02 09:19:59,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2024-02-02 09:19:59,182 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2024-02-02 09:19:59,183 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 122 flow [2024-02-02 09:19:59,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:59,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:59,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-02-02 09:19:59,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 09:19:59,184 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:19:59,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:59,186 INFO L85 PathProgramCache]: Analyzing trace with hash 361289, now seen corresponding path program 1 times [2024-02-02 09:19:59,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:59,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922565525] [2024-02-02 09:19:59,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:59,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:59,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:59,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922565525] [2024-02-02 09:19:59,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922565525] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:59,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:59,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:19:59,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639478117] [2024-02-02 09:19:59,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:59,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:19:59,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:59,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:19:59,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:19:59,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 61 [2024-02-02 09:19:59,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:59,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:59,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 61 [2024-02-02 09:19:59,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:59,443 INFO L124 PetriNetUnfolderBase]: 190/445 cut-off events. [2024-02-02 09:19:59,444 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:19:59,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 445 events. 190/445 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2413 event pairs, 132 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 766. Up to 314 conditions per place. [2024-02-02 09:19:59,450 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 31 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2024-02-02 09:19:59,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 186 flow [2024-02-02 09:19:59,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:59,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-02-02 09:19:59,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6120218579234973 [2024-02-02 09:19:59,454 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 122 flow. Second operand 3 states and 112 transitions. [2024-02-02 09:19:59,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 186 flow [2024-02-02 09:19:59,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 56 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:59,456 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 120 flow [2024-02-02 09:19:59,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2024-02-02 09:19:59,457 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-02-02 09:19:59,457 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 120 flow [2024-02-02 09:19:59,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:59,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:59,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-02 09:19:59,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 09:19:59,458 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:19:59,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:59,461 INFO L85 PathProgramCache]: Analyzing trace with hash 11200357, now seen corresponding path program 1 times [2024-02-02 09:19:59,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:59,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7324987] [2024-02-02 09:19:59,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:59,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:59,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:59,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7324987] [2024-02-02 09:19:59,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7324987] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:59,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:59,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:19:59,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162852574] [2024-02-02 09:19:59,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:59,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:19:59,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:59,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:19:59,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:19:59,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 61 [2024-02-02 09:19:59,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:59,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:59,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 61 [2024-02-02 09:19:59,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:59,685 INFO L124 PetriNetUnfolderBase]: 149/370 cut-off events. [2024-02-02 09:19:59,685 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:19:59,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 370 events. 149/370 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2023 event pairs, 117 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 634. Up to 259 conditions per place. [2024-02-02 09:19:59,689 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 29 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2024-02-02 09:19:59,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 180 flow [2024-02-02 09:19:59,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:59,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:59,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-02-02 09:19:59,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6338797814207651 [2024-02-02 09:19:59,693 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 120 flow. Second operand 3 states and 116 transitions. [2024-02-02 09:19:59,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 180 flow [2024-02-02 09:19:59,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:59,696 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 118 flow [2024-02-02 09:19:59,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2024-02-02 09:19:59,697 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2024-02-02 09:19:59,697 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 118 flow [2024-02-02 09:19:59,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:59,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:59,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-02 09:19:59,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-02 09:19:59,699 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:19:59,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash 347211433, now seen corresponding path program 1 times [2024-02-02 09:19:59,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:59,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746102032] [2024-02-02 09:19:59,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:59,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:59,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:59,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:59,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746102032] [2024-02-02 09:19:59,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746102032] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:59,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:59,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:19:59,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58088951] [2024-02-02 09:19:59,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:59,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:19:59,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:59,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:19:59,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:19:59,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 61 [2024-02-02 09:19:59,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:59,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:59,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 61 [2024-02-02 09:19:59,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:19:59,908 INFO L124 PetriNetUnfolderBase]: 149/369 cut-off events. [2024-02-02 09:19:59,908 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:19:59,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 369 events. 149/369 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2020 event pairs, 117 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 630. Up to 257 conditions per place. [2024-02-02 09:19:59,911 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 28 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2024-02-02 09:19:59,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 176 flow [2024-02-02 09:19:59,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:19:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:19:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2024-02-02 09:19:59,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.644808743169399 [2024-02-02 09:19:59,913 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 118 flow. Second operand 3 states and 118 transitions. [2024-02-02 09:19:59,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 176 flow [2024-02-02 09:19:59,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:19:59,914 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 116 flow [2024-02-02 09:19:59,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2024-02-02 09:19:59,915 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2024-02-02 09:19:59,915 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 116 flow [2024-02-02 09:19:59,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:59,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:19:59,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-02 09:19:59,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-02 09:19:59,917 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:19:59,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:19:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2121347085, now seen corresponding path program 1 times [2024-02-02 09:19:59,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:19:59,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358490146] [2024-02-02 09:19:59,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:19:59,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:19:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:19:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:19:59,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:19:59,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358490146] [2024-02-02 09:19:59,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358490146] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:19:59,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:19:59,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:19:59,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792623071] [2024-02-02 09:19:59,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:19:59,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:19:59,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:19:59,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:19:59,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:19:59,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-02-02 09:19:59,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:19:59,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:19:59,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-02-02 09:19:59,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:00,091 INFO L124 PetriNetUnfolderBase]: 266/645 cut-off events. [2024-02-02 09:20:00,092 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-02 09:20:00,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 645 events. 266/645 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3871 event pairs, 102 based on Foata normal form. 0/551 useless extension candidates. Maximal degree in co-relation 1099. Up to 236 conditions per place. [2024-02-02 09:20:00,095 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 43 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2024-02-02 09:20:00,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 247 flow [2024-02-02 09:20:00,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:20:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:20:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2024-02-02 09:20:00,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2024-02-02 09:20:00,096 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 116 flow. Second operand 4 states and 168 transitions. [2024-02-02 09:20:00,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 247 flow [2024-02-02 09:20:00,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:20:00,099 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 132 flow [2024-02-02 09:20:00,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2024-02-02 09:20:00,101 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-02-02 09:20:00,101 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 132 flow [2024-02-02 09:20:00,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:20:00,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:00,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:00,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-02 09:20:00,102 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:20:00,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:00,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1337249807, now seen corresponding path program 1 times [2024-02-02 09:20:00,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:00,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461729488] [2024-02-02 09:20:00,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:00,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:00,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:00,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461729488] [2024-02-02 09:20:00,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461729488] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:00,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:00,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:20:00,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886619175] [2024-02-02 09:20:00,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:00,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:20:00,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:00,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:20:00,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:20:00,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 61 [2024-02-02 09:20:00,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:20:00,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:00,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 61 [2024-02-02 09:20:00,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:00,241 INFO L124 PetriNetUnfolderBase]: 405/971 cut-off events. [2024-02-02 09:20:00,241 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2024-02-02 09:20:00,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1795 conditions, 971 events. 405/971 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6153 event pairs, 91 based on Foata normal form. 10/892 useless extension candidates. Maximal degree in co-relation 619. Up to 503 conditions per place. [2024-02-02 09:20:00,246 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 40 selfloop transitions, 5 changer transitions 1/70 dead transitions. [2024-02-02 09:20:00,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 267 flow [2024-02-02 09:20:00,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:20:00,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:20:00,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2024-02-02 09:20:00,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7595628415300546 [2024-02-02 09:20:00,247 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 132 flow. Second operand 3 states and 139 transitions. [2024-02-02 09:20:00,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 267 flow [2024-02-02 09:20:00,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 265 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:20:00,251 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 159 flow [2024-02-02 09:20:00,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2024-02-02 09:20:00,253 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2024-02-02 09:20:00,253 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 159 flow [2024-02-02 09:20:00,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:20:00,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:00,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:00,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-02 09:20:00,254 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:20:00,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:00,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1494929295, now seen corresponding path program 1 times [2024-02-02 09:20:00,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:00,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991705906] [2024-02-02 09:20:00,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:00,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:00,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:00,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:00,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991705906] [2024-02-02 09:20:00,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991705906] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:00,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:00,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:20:00,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357861958] [2024-02-02 09:20:00,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:00,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:20:00,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:00,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:20:00,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:20:00,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 61 [2024-02-02 09:20:00,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:20:00,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:00,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 61 [2024-02-02 09:20:00,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:00,416 INFO L124 PetriNetUnfolderBase]: 616/1432 cut-off events. [2024-02-02 09:20:00,416 INFO L125 PetriNetUnfolderBase]: For 456/468 co-relation queries the response was YES. [2024-02-02 09:20:00,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 1432 events. 616/1432 cut-off events. For 456/468 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9836 event pairs, 230 based on Foata normal form. 25/1333 useless extension candidates. Maximal degree in co-relation 1122. Up to 596 conditions per place. [2024-02-02 09:20:00,423 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 46 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2024-02-02 09:20:00,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 313 flow [2024-02-02 09:20:00,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:20:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:20:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2024-02-02 09:20:00,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7595628415300546 [2024-02-02 09:20:00,425 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 159 flow. Second operand 3 states and 139 transitions. [2024-02-02 09:20:00,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 313 flow [2024-02-02 09:20:00,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:20:00,428 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 180 flow [2024-02-02 09:20:00,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2024-02-02 09:20:00,430 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2024-02-02 09:20:00,430 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 180 flow [2024-02-02 09:20:00,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:20:00,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:00,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:00,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 09:20:00,430 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:20:00,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:00,431 INFO L85 PathProgramCache]: Analyzing trace with hash 923164965, now seen corresponding path program 1 times [2024-02-02 09:20:00,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:00,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036725052] [2024-02-02 09:20:00,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:00,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:00,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:00,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036725052] [2024-02-02 09:20:00,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036725052] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:00,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:00,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:20:00,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753832738] [2024-02-02 09:20:00,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:00,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:20:00,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:00,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:20:00,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:20:00,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 61 [2024-02-02 09:20:00,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:20:00,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:00,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 61 [2024-02-02 09:20:00,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:00,652 INFO L124 PetriNetUnfolderBase]: 582/1274 cut-off events. [2024-02-02 09:20:00,652 INFO L125 PetriNetUnfolderBase]: For 936/942 co-relation queries the response was YES. [2024-02-02 09:20:00,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2860 conditions, 1274 events. 582/1274 cut-off events. For 936/942 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8020 event pairs, 58 based on Foata normal form. 160/1387 useless extension candidates. Maximal degree in co-relation 1023. Up to 906 conditions per place. [2024-02-02 09:20:00,657 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 38 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2024-02-02 09:20:00,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 273 flow [2024-02-02 09:20:00,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:20:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:20:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2024-02-02 09:20:00,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5942622950819673 [2024-02-02 09:20:00,658 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 180 flow. Second operand 4 states and 145 transitions. [2024-02-02 09:20:00,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 273 flow [2024-02-02 09:20:00,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 58 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:20:00,663 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 162 flow [2024-02-02 09:20:00,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-02-02 09:20:00,666 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2024-02-02 09:20:00,666 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 162 flow [2024-02-02 09:20:00,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:20:00,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:00,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:00,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-02 09:20:00,667 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:20:00,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:00,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1897277441, now seen corresponding path program 1 times [2024-02-02 09:20:00,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:00,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099939112] [2024-02-02 09:20:00,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:00,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:00,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:00,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099939112] [2024-02-02 09:20:00,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099939112] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:00,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:00,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:20:00,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080398567] [2024-02-02 09:20:00,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:00,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:20:00,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:00,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:20:00,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:20:00,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 61 [2024-02-02 09:20:00,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:20:00,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:00,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 61 [2024-02-02 09:20:00,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:00,919 INFO L124 PetriNetUnfolderBase]: 597/1185 cut-off events. [2024-02-02 09:20:00,919 INFO L125 PetriNetUnfolderBase]: For 662/674 co-relation queries the response was YES. [2024-02-02 09:20:00,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2623 conditions, 1185 events. 597/1185 cut-off events. For 662/674 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6856 event pairs, 58 based on Foata normal form. 173/1314 useless extension candidates. Maximal degree in co-relation 2588. Up to 816 conditions per place. [2024-02-02 09:20:00,923 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 51 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-02-02 09:20:00,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 341 flow [2024-02-02 09:20:00,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:20:00,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:20:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-02-02 09:20:00,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6516393442622951 [2024-02-02 09:20:00,924 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 162 flow. Second operand 4 states and 159 transitions. [2024-02-02 09:20:00,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 341 flow [2024-02-02 09:20:00,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:20:00,926 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 153 flow [2024-02-02 09:20:00,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-02-02 09:20:00,926 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -11 predicate places. [2024-02-02 09:20:00,926 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 153 flow [2024-02-02 09:20:00,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:20:00,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:00,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:00,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-02 09:20:00,927 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:20:00,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:00,927 INFO L85 PathProgramCache]: Analyzing trace with hash 310386829, now seen corresponding path program 1 times [2024-02-02 09:20:00,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:00,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416756283] [2024-02-02 09:20:00,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:00,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:01,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:01,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416756283] [2024-02-02 09:20:01,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416756283] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:01,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:01,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-02 09:20:01,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497952355] [2024-02-02 09:20:01,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:01,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 09:20:01,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:01,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 09:20:01,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-02-02 09:20:01,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 61 [2024-02-02 09:20:01,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:20:01,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:01,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 61 [2024-02-02 09:20:01,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:01,551 INFO L124 PetriNetUnfolderBase]: 1362/2614 cut-off events. [2024-02-02 09:20:01,552 INFO L125 PetriNetUnfolderBase]: For 1524/1560 co-relation queries the response was YES. [2024-02-02 09:20:01,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6041 conditions, 2614 events. 1362/2614 cut-off events. For 1524/1560 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 15892 event pairs, 173 based on Foata normal form. 36/2615 useless extension candidates. Maximal degree in co-relation 6007. Up to 760 conditions per place. [2024-02-02 09:20:01,563 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 113 selfloop transitions, 15 changer transitions 1/140 dead transitions. [2024-02-02 09:20:01,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 140 transitions, 732 flow [2024-02-02 09:20:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-02 09:20:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-02 09:20:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 364 transitions. [2024-02-02 09:20:01,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7459016393442623 [2024-02-02 09:20:01,565 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 153 flow. Second operand 8 states and 364 transitions. [2024-02-02 09:20:01,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 140 transitions, 732 flow [2024-02-02 09:20:01,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 140 transitions, 719 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:20:01,568 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 292 flow [2024-02-02 09:20:01,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=292, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2024-02-02 09:20:01,569 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2024-02-02 09:20:01,569 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 292 flow [2024-02-02 09:20:01,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:20:01,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:01,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:01,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-02 09:20:01,570 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:20:01,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:01,570 INFO L85 PathProgramCache]: Analyzing trace with hash -557027583, now seen corresponding path program 2 times [2024-02-02 09:20:01,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:01,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653480738] [2024-02-02 09:20:01,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:01,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:01,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:01,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653480738] [2024-02-02 09:20:01,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653480738] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:01,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:01,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-02 09:20:01,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058847208] [2024-02-02 09:20:01,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:01,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 09:20:01,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:01,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 09:20:01,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-02-02 09:20:01,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 61 [2024-02-02 09:20:01,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:20:01,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:01,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 61 [2024-02-02 09:20:01,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:02,138 INFO L124 PetriNetUnfolderBase]: 1698/3238 cut-off events. [2024-02-02 09:20:02,138 INFO L125 PetriNetUnfolderBase]: For 4755/4869 co-relation queries the response was YES. [2024-02-02 09:20:02,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8678 conditions, 3238 events. 1698/3238 cut-off events. For 4755/4869 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 20487 event pairs, 165 based on Foata normal form. 52/3253 useless extension candidates. Maximal degree in co-relation 8632. Up to 1005 conditions per place. [2024-02-02 09:20:02,153 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 106 selfloop transitions, 30 changer transitions 2/149 dead transitions. [2024-02-02 09:20:02,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 149 transitions, 924 flow [2024-02-02 09:20:02,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-02 09:20:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-02 09:20:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 369 transitions. [2024-02-02 09:20:02,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7561475409836066 [2024-02-02 09:20:02,154 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 292 flow. Second operand 8 states and 369 transitions. [2024-02-02 09:20:02,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 149 transitions, 924 flow [2024-02-02 09:20:02,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 149 transitions, 924 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-02 09:20:02,163 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 551 flow [2024-02-02 09:20:02,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=551, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2024-02-02 09:20:02,164 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2024-02-02 09:20:02,164 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 551 flow [2024-02-02 09:20:02,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:20:02,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:02,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:02,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-02 09:20:02,165 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:20:02,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:02,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1740487829, now seen corresponding path program 3 times [2024-02-02 09:20:02,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:02,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384625883] [2024-02-02 09:20:02,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:02,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:20:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:20:02,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:20:02,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384625883] [2024-02-02 09:20:02,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384625883] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:20:02,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:20:02,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-02 09:20:02,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123133155] [2024-02-02 09:20:02,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:20:02,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-02 09:20:02,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:20:02,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-02 09:20:02,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-02 09:20:02,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 61 [2024-02-02 09:20:02,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 551 flow. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:20:02,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:20:02,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 61 [2024-02-02 09:20:02,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:20:02,773 INFO L124 PetriNetUnfolderBase]: 2070/3968 cut-off events. [2024-02-02 09:20:02,774 INFO L125 PetriNetUnfolderBase]: For 11483/11613 co-relation queries the response was YES. [2024-02-02 09:20:02,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12011 conditions, 3968 events. 2070/3968 cut-off events. For 11483/11613 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 26675 event pairs, 259 based on Foata normal form. 68/3997 useless extension candidates. Maximal degree in co-relation 11952. Up to 1181 conditions per place. [2024-02-02 09:20:02,797 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 112 selfloop transitions, 43 changer transitions 1/167 dead transitions. [2024-02-02 09:20:02,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 167 transitions, 1304 flow [2024-02-02 09:20:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-02 09:20:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-02 09:20:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 370 transitions. [2024-02-02 09:20:02,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7581967213114754 [2024-02-02 09:20:02,800 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 551 flow. Second operand 8 states and 370 transitions. [2024-02-02 09:20:02,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 167 transitions, 1304 flow [2024-02-02 09:20:02,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 167 transitions, 1288 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-02-02 09:20:02,816 INFO L231 Difference]: Finished difference. Result has 86 places, 91 transitions, 910 flow [2024-02-02 09:20:02,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=910, PETRI_PLACES=86, PETRI_TRANSITIONS=91} [2024-02-02 09:20:02,817 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 24 predicate places. [2024-02-02 09:20:02,817 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 910 flow [2024-02-02 09:20:02,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-02 09:20:02,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:20:02,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:02,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-02 09:20:02,818 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-02-02 09:20:02,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:20:02,819 INFO L85 PathProgramCache]: Analyzing trace with hash 854038073, now seen corresponding path program 1 times [2024-02-02 09:20:02,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:20:02,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004090180] [2024-02-02 09:20:02,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:20:02,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:20:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:20:02,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 09:20:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:20:02,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 09:20:02,864 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 09:20:02,865 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 36 remaining) [2024-02-02 09:20:02,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 36 remaining) [2024-02-02 09:20:02,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 36 remaining) [2024-02-02 09:20:02,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 36 remaining) [2024-02-02 09:20:02,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 36 remaining) [2024-02-02 09:20:02,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 36 remaining) [2024-02-02 09:20:02,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 36 remaining) [2024-02-02 09:20:02,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 36 remaining) [2024-02-02 09:20:02,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 36 remaining) [2024-02-02 09:20:02,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 36 remaining) [2024-02-02 09:20:02,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 36 remaining) [2024-02-02 09:20:02,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 36 remaining) [2024-02-02 09:20:02,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 36 remaining) [2024-02-02 09:20:02,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 36 remaining) [2024-02-02 09:20:02,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 36 remaining) [2024-02-02 09:20:02,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 36 remaining) [2024-02-02 09:20:02,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 36 remaining) [2024-02-02 09:20:02,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 36 remaining) [2024-02-02 09:20:02,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 36 remaining) [2024-02-02 09:20:02,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 36 remaining) [2024-02-02 09:20:02,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 36 remaining) [2024-02-02 09:20:02,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (14 of 36 remaining) [2024-02-02 09:20:02,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 36 remaining) [2024-02-02 09:20:02,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 36 remaining) [2024-02-02 09:20:02,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 36 remaining) [2024-02-02 09:20:02,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 36 remaining) [2024-02-02 09:20:02,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 36 remaining) [2024-02-02 09:20:02,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 36 remaining) [2024-02-02 09:20:02,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 36 remaining) [2024-02-02 09:20:02,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 36 remaining) [2024-02-02 09:20:02,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 36 remaining) [2024-02-02 09:20:02,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 36 remaining) [2024-02-02 09:20:02,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 36 remaining) [2024-02-02 09:20:02,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 36 remaining) [2024-02-02 09:20:02,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 36 remaining) [2024-02-02 09:20:02,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 36 remaining) [2024-02-02 09:20:02,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-02 09:20:02,871 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:20:02,875 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 09:20:02,875 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 09:20:02,916 INFO L503 ceAbstractionStarter]: Automizer considered 20 witness invariants [2024-02-02 09:20:02,917 INFO L504 ceAbstractionStarter]: WitnessConsidered=20 [2024-02-02 09:20:02,918 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:20:02 BasicIcfg [2024-02-02 09:20:02,918 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 09:20:02,919 INFO L158 Benchmark]: Toolchain (without parser) took 5728.19ms. Allocated memory was 155.2MB in the beginning and 329.3MB in the end (delta: 174.1MB). Free memory was 79.6MB in the beginning and 210.8MB in the end (delta: -131.1MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2024-02-02 09:20:02,919 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:20:02,919 INFO L158 Benchmark]: Witness Parser took 4.69ms. Allocated memory is still 155.2MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:20:02,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.91ms. Allocated memory is still 155.2MB. Free memory was 79.4MB in the beginning and 64.1MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-02-02 09:20:02,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.02ms. Allocated memory is still 155.2MB. Free memory was 64.1MB in the beginning and 62.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:20:02,920 INFO L158 Benchmark]: Boogie Preprocessor took 58.54ms. Allocated memory is still 155.2MB. Free memory was 62.3MB in the beginning and 124.1MB in the end (delta: -61.8MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-02-02 09:20:02,920 INFO L158 Benchmark]: RCFGBuilder took 722.70ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 124.0MB in the beginning and 156.4MB in the end (delta: -32.4MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2024-02-02 09:20:02,920 INFO L158 Benchmark]: TraceAbstraction took 4629.88ms. Allocated memory was 224.4MB in the beginning and 329.3MB in the end (delta: 104.9MB). Free memory was 155.3MB in the beginning and 210.8MB in the end (delta: -55.4MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2024-02-02 09:20:02,923 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 4.69ms. Allocated memory is still 155.2MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.91ms. Allocated memory is still 155.2MB. Free memory was 79.4MB in the beginning and 64.1MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.02ms. Allocated memory is still 155.2MB. Free memory was 64.1MB in the beginning and 62.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.54ms. Allocated memory is still 155.2MB. Free memory was 62.3MB in the beginning and 124.1MB in the end (delta: -61.8MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * RCFGBuilder took 722.70ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 124.0MB in the beginning and 156.4MB in the end (delta: -32.4MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4629.88ms. Allocated memory was 224.4MB in the beginning and 329.3MB in the end (delta: 104.9MB). Free memory was 155.3MB in the beginning and 210.8MB in the end (delta: -55.4MB). Peak memory consumption was 49.4MB. 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[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[m],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]]] [L63] 0 n = __VERIFIER_nondet_int() [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[m],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]]] [L64] 0 m = __VERIFIER_nondet_int() [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]]] [L65] 0 i1 = __VERIFIER_nondet_int() [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]]] [L66] 0 i2 = __VERIFIER_nondet_int() [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]]] [L67] 0 j1 = __VERIFIER_nondet_int() [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]],BinaryExpression[COMPEQ,IdentifierExpression[k2],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}] [L40] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_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}, i1=0, i2=0, j1=0, k1=0, k2=0, 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}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L41] COND TRUE 1 j1 < m VAL [_argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, 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}, i1=0, i2=0, j1=1, k1=1, k2=0, 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}, i1=0, i2=0, j1=1, k1=1, k2=0, m=1, n=1] [L41] COND FALSE 1 !(j1 < m) VAL [_argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=0, m=1, n=1] [L76] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, 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}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=0, m=1, n=1] [L51] COND TRUE 2 i2 < n VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, 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=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: 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: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 94 locations, 36 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: 4.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 873 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 706 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1497 IncrementalHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 30 mSDtfsCounter, 1497 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=910occurred in iteration=12, InterpolantAutomatonStates: 54, 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.1s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 1318 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-02-02 09:20:02,968 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