./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-1_3-join.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/race-1_3-join.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/ldv-races/race-1_3-join.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/race-1_3-join.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:35:34,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-02 09:35:34,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-02 09:35:34,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-02 09:35:34,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-02 09:35:34,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-02 09:35:34,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-02 09:35:34,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-02 09:35:34,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-02 09:35:34,289 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-02 09:35:34,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-02 09:35:34,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-02 09:35:34,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-02 09:35:34,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-02 09:35:34,292 INFO L153 SettingsManager]: * Use SBE=true [2024-02-02 09:35:34,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-02 09:35:34,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-02 09:35:34,293 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-02 09:35:34,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-02 09:35:34,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-02 09:35:34,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-02 09:35:34,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-02 09:35:34,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-02 09:35:34,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-02 09:35:34,294 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-02 09:35:34,294 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-02 09:35:34,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-02 09:35:34,295 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-02 09:35:34,295 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-02 09:35:34,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-02 09:35:34,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-02 09:35:34,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-02 09:35:34,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:35:34,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-02 09:35:34,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-02 09:35:34,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-02 09:35:34,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-02 09:35:34,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-02 09:35:34,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-02 09:35:34,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-02 09:35:34,298 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-02 09:35:34,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-02 09:35:34,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-02 09:35:34,299 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:35:34,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-02 09:35:34,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-02 09:35:34,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-02 09:35:34,557 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-02 09:35:34,558 INFO L274 PluginConnector]: CDTParser initialized [2024-02-02 09:35:34,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-1_3-join.i [2024-02-02 09:35:35,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-02 09:35:35,891 INFO L384 CDTParser]: Found 1 translation units. [2024-02-02 09:35:35,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_3-join.i [2024-02-02 09:35:35,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58c4c8197/0f9cd551d57243feb1e640ecac81757f/FLAG2fb31fa47 [2024-02-02 09:35:35,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58c4c8197/0f9cd551d57243feb1e640ecac81757f [2024-02-02 09:35:35,961 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-02 09:35:35,961 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-02 09:35:35,964 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/race-1_3-join.yml/witness.yml [2024-02-02 09:35:36,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-02 09:35:36,075 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-02 09:35:36,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-02 09:35:36,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-02 09:35:36,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-02 09:35:36,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:35:35" (1/2) ... [2024-02-02 09:35:36,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153b472a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:35:36, skipping insertion in model container [2024-02-02 09:35:36,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:35:35" (1/2) ... [2024-02-02 09:35:36,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7ff24a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:35:36, skipping insertion in model container [2024-02-02 09:35:36,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:35:36" (2/2) ... [2024-02-02 09:35:36,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153b472a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:35:36, skipping insertion in model container [2024-02-02 09:35:36,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:35:36" (2/2) ... [2024-02-02 09:35:36,087 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-02 09:35:36,193 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-02 09:35:36,195 INFO L101 nessWitnessExtractor]: Location invariant before [L1705-L1705] (unsigned long )arg == 0UL [2024-02-02 09:35:36,195 INFO L101 nessWitnessExtractor]: Location invariant before [L1709-L1709] pdev == 0 [2024-02-02 09:35:36,195 INFO L101 nessWitnessExtractor]: Location invariant before [L1717-L1717] pdev == 3 [2024-02-02 09:35:36,195 INFO L101 nessWitnessExtractor]: Location invariant before [L1716-L1716] pdev == 3 [2024-02-02 09:35:36,196 INFO L101 nessWitnessExtractor]: Location invariant before [L1712-L1712] pdev == 1 [2024-02-02 09:35:36,196 INFO L101 nessWitnessExtractor]: Location invariant after [L1720-L1732] (unsigned long )status == 0UL [2024-02-02 09:35:36,197 INFO L101 nessWitnessExtractor]: Location invariant before [L1723-L1723] (((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && (pdev != 0)) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6) [2024-02-02 09:35:36,197 INFO L101 nessWitnessExtractor]: Location invariant before [L1726-L1726] (((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && (pdev != 0)) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6) [2024-02-02 09:35:36,197 INFO L101 nessWitnessExtractor]: Location invariant before [L1730-L1730] (unsigned long )status == 0UL [2024-02-02 09:35:36,197 INFO L101 nessWitnessExtractor]: Location invariant before [L1718-L1718] pdev == 3 [2024-02-02 09:35:36,197 INFO L101 nessWitnessExtractor]: Location invariant before [L1708-L1708] pdev == 0 [2024-02-02 09:35:36,197 INFO L101 nessWitnessExtractor]: Location invariant before [L1703-L1703] ((((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && ((unsigned long )arg == 0UL)) && (pdev != 0)) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6) [2024-02-02 09:35:36,198 INFO L101 nessWitnessExtractor]: Location invariant before [L1727-L1727] (((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && (pdev != 0)) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6) [2024-02-02 09:35:36,198 INFO L101 nessWitnessExtractor]: Location invariant before [L1702-L1702] ((((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && ((unsigned long )arg == 0UL)) && (pdev != 0)) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6) [2024-02-02 09:35:36,198 INFO L101 nessWitnessExtractor]: Location invariant before [L1731-L1731] (unsigned long )status == 0UL [2024-02-02 09:35:36,198 INFO L101 nessWitnessExtractor]: Location invariant before [L1700-L1700] (unsigned long )arg == 0UL [2024-02-02 09:35:36,198 INFO L101 nessWitnessExtractor]: Location invariant before [L22-L22] pdev == 1 [2024-02-02 09:35:36,198 INFO L101 nessWitnessExtractor]: Location invariant before [L1711-L1714] pdev == 1 [2024-02-02 09:35:36,198 INFO L101 nessWitnessExtractor]: Location invariant before [L1715-L1715] pdev == 1 [2024-02-02 09:35:36,199 INFO L101 nessWitnessExtractor]: Location invariant before [L1695-L1695] ((expression == 1) && (((((((((0 <= pdev && 1 <= pdev) && pdev <= 3) && pdev <= 127) && expression == 1) && pdev % 2 == 1) && pdev != 0) && (pdev == 1 || pdev == 3)) || ((0 <= expression && expression <= 1) && (expression == 0 || expression == 1))) || ((((((((0 <= expression && 0 <= pdev) && 1 <= pdev) && expression <= 1) && pdev <= 6) && pdev <= 127) && pdev != 0) && (expression == 0 || expression == 1)) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6)))) && (expression == 0) [2024-02-02 09:35:36,199 INFO L101 nessWitnessExtractor]: Location invariant before [L1729-L1729] (unsigned long )status == 0UL [2024-02-02 09:35:36,199 INFO L101 nessWitnessExtractor]: Location invariant before [L1701-L1701] (unsigned long )arg == 0UL [2024-02-02 09:35:36,199 INFO L101 nessWitnessExtractor]: Location invariant before [L1704-L1704] (unsigned long )arg == 0UL [2024-02-02 09:35:36,200 INFO L101 nessWitnessExtractor]: Location invariant before [L1710-L1710] pdev == 1 [2024-02-02 09:35:36,200 INFO L101 nessWitnessExtractor]: Location invariant before [L1724-L1724] (((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && (pdev != 0)) && (((pdev == 1 || pdev == 4) || pdev == 5) || pdev == 6) [2024-02-02 09:35:36,249 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-02 09:35:36,837 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_3-join.i[76153,76166] [2024-02-02 09:35:36,859 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:35:36,870 INFO L202 MainTranslator]: Completed pre-run [2024-02-02 09:35:36,878 WARN L424 MainDispatcher]: Unable to annotate typedef unsigned int __mode_t; with a witness entry [2024-02-02 09:35:36,926 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_3-join.i[76153,76166] [2024-02-02 09:35:36,927 WARN L424 MainDispatcher]: Unable to annotate void ldv_assert(int expression) { if (!expression) { ERROR: {reach_error();abort();}}; return; } with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-02 09:35:36,979 WARN L424 MainDispatcher]: Unable to annotate void module_exit() { void *status; __VERIFIER_atomic_begin(); pdev = 4; __VERIFIER_atomic_end(); __VERIFIER_atomic_begin(); ldv_assert(pdev==4); __VERIFIER_atomic_end(); pthread_join(t1, &status); pthread_mutex_destroy(&mutex); pdev = 5; ldv_assert(pdev==5); } with a witness entry [2024-02-02 09:35:36,980 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-02 09:35:37,069 INFO L206 MainTranslator]: Completed translation [2024-02-02 09:35:37,071 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 02.02 09:35:37 WrapperNode [2024-02-02 09:35:37,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-02 09:35:37,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-02 09:35:37,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-02 09:35:37,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-02 09:35:37,078 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:35:37" (1/1) ... [2024-02-02 09:35:37,112 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:35:37" (1/1) ... [2024-02-02 09:35:37,151 INFO L138 Inliner]: procedures = 483, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-02-02 09:35:37,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-02 09:35:37,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-02 09:35:37,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-02 09:35:37,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-02 09:35:37,161 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:35:37" (1/1) ... [2024-02-02 09:35:37,162 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:35:37" (1/1) ... [2024-02-02 09:35:37,176 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:35:37" (1/1) ... [2024-02-02 09:35:37,199 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 3, 5, 4]. 36 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 1, 5, 0]. The 2 writes are split as follows [0, 1, 0, 1]. [2024-02-02 09:35:37,199 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:35:37" (1/1) ... [2024-02-02 09:35:37,200 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:35:37" (1/1) ... [2024-02-02 09:35:37,213 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:35:37" (1/1) ... [2024-02-02 09:35:37,224 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:35:37" (1/1) ... [2024-02-02 09:35:37,228 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:35:37" (1/1) ... [2024-02-02 09:35:37,233 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:35:37" (1/1) ... [2024-02-02 09:35:37,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-02 09:35:37,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-02 09:35:37,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-02 09:35:37,239 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-02 09:35:37,239 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:35:37" (1/1) ... [2024-02-02 09:35:37,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-02 09:35:37,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-02 09:35:37,271 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:35:37,276 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:35:37,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-02 09:35:37,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-02 09:35:37,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-02 09:35:37,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-02 09:35:37,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-02 09:35:37,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-02 09:35:37,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-02 09:35:37,310 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-02 09:35:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-02 09:35:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-02-02 09:35:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-02-02 09:35:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-02-02 09:35:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-02-02 09:35:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-02 09:35:37,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-02 09:35:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-02 09:35:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-02-02 09:35:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-02-02 09:35:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-02-02 09:35:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-02-02 09:35:37,315 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-02 09:35:37,315 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-02 09:35:37,315 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-02 09:35:37,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-02 09:35:37,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-02 09:35:37,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-02 09:35:37,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-02 09:35:37,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-02 09:35:37,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-02 09:35:37,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-02 09:35:37,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-02 09:35:37,318 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:35:37,568 INFO L244 CfgBuilder]: Building ICFG [2024-02-02 09:35:37,572 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-02 09:35:37,773 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-02 09:35:37,773 INFO L293 CfgBuilder]: Performing block encoding [2024-02-02 09:35:37,851 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-02 09:35:37,851 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-02 09:35:37,852 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:35:37 BoogieIcfgContainer [2024-02-02 09:35:37,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-02 09:35:37,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-02 09:35:37,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-02 09:35:37,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-02 09:35:37,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:35:35" (1/4) ... [2024-02-02 09:35:37,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0b6ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:35:37, skipping insertion in model container [2024-02-02 09:35:37,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 02.02 09:35:36" (2/4) ... [2024-02-02 09:35:37,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0b6ab4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:35:37, skipping insertion in model container [2024-02-02 09:35:37,857 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:35:37" (3/4) ... [2024-02-02 09:35:37,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0b6ab4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 02.02 09:35:37, skipping insertion in model container [2024-02-02 09:35:37,858 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:35:37" (4/4) ... [2024-02-02 09:35:37,859 INFO L112 eAbstractionObserver]: Analyzing ICFG race-1_3-join.i [2024-02-02 09:35:37,872 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-02 09:35:37,872 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-02-02 09:35:37,872 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-02 09:35:37,906 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-02-02 09:35:37,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 75 transitions, 157 flow [2024-02-02 09:35:37,988 INFO L124 PetriNetUnfolderBase]: 4/86 cut-off events. [2024-02-02 09:35:37,988 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-02 09:35:37,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 86 events. 4/86 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 184 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 43. Up to 3 conditions per place. [2024-02-02 09:35:37,990 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 75 transitions, 157 flow [2024-02-02 09:35:37,993 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 71 transitions, 148 flow [2024-02-02 09:35:38,000 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-02 09:35:38,005 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;@1c2ebd5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-02 09:35:38,005 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2024-02-02 09:35:38,007 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-02 09:35:38,007 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-02 09:35:38,008 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:35:38,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:35:38,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-02 09:35:38,009 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:35:38,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:35:38,013 INFO L85 PathProgramCache]: Analyzing trace with hash 12183, now seen corresponding path program 1 times [2024-02-02 09:35:38,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:35:38,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896567601] [2024-02-02 09:35:38,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:35:38,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:35:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:35:38,376 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:35:38,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:35:38,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896567601] [2024-02-02 09:35:38,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896567601] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:35:38,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:35:38,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-02 09:35:38,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638899778] [2024-02-02 09:35:38,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:35:38,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:35:38,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:35:38,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:35:38,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:35:38,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2024-02-02 09:35:38,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:35:38,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:35:38,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2024-02-02 09:35:38,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:35:38,565 INFO L124 PetriNetUnfolderBase]: 50/179 cut-off events. [2024-02-02 09:35:38,565 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-02 09:35:38,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 179 events. 50/179 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 869 event pairs, 50 based on Foata normal form. 2/130 useless extension candidates. Maximal degree in co-relation 246. Up to 143 conditions per place. [2024-02-02 09:35:38,568 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 33 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-02-02 09:35:38,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 204 flow [2024-02-02 09:35:38,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:35:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:35:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2024-02-02 09:35:38,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-02-02 09:35:38,578 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 148 flow. Second operand 3 states and 135 transitions. [2024-02-02 09:35:38,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 204 flow [2024-02-02 09:35:38,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:35:38,582 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 134 flow [2024-02-02 09:35:38,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2024-02-02 09:35:38,586 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2024-02-02 09:35:38,586 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 134 flow [2024-02-02 09:35:38,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:35:38,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:35:38,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-02 09:35:38,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-02 09:35:38,587 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:35:38,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:35:38,587 INFO L85 PathProgramCache]: Analyzing trace with hash 11719868, now seen corresponding path program 1 times [2024-02-02 09:35:38,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:35:38,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649872742] [2024-02-02 09:35:38,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:35:38,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:35:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:35:38,628 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:35:38,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:35:38,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649872742] [2024-02-02 09:35:38,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649872742] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:35:38,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:35:38,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:35:38,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253330372] [2024-02-02 09:35:38,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:35:38,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:35:38,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:35:38,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:35:38,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:35:38,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2024-02-02 09:35:38,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:35:38,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:35:38,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2024-02-02 09:35:38,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:35:38,713 INFO L124 PetriNetUnfolderBase]: 47/202 cut-off events. [2024-02-02 09:35:38,713 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-02 09:35:38,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 202 events. 47/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 954 event pairs, 21 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 335. Up to 104 conditions per place. [2024-02-02 09:35:38,714 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 40 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2024-02-02 09:35:38,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 69 transitions, 232 flow [2024-02-02 09:35:38,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:35:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:35:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2024-02-02 09:35:38,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6044444444444445 [2024-02-02 09:35:38,716 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 134 flow. Second operand 3 states and 136 transitions. [2024-02-02 09:35:38,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 69 transitions, 232 flow [2024-02-02 09:35:38,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:35:38,717 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 144 flow [2024-02-02 09:35:38,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2024-02-02 09:35:38,718 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2024-02-02 09:35:38,718 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 144 flow [2024-02-02 09:35:38,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:35:38,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:35:38,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-02 09:35:38,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-02 09:35:38,719 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:35:38,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:35:38,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1622097690, now seen corresponding path program 1 times [2024-02-02 09:35:38,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:35:38,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595752623] [2024-02-02 09:35:38,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:35:38,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:35:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:35:38,830 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:35:38,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:35:38,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595752623] [2024-02-02 09:35:38,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595752623] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:35:38,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:35:38,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 09:35:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756784124] [2024-02-02 09:35:38,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:35:38,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:35:38,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:35:38,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:35:38,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:35:38,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 75 [2024-02-02 09:35:38,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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:35:38,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:35:38,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 75 [2024-02-02 09:35:38,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:35:38,976 INFO L124 PetriNetUnfolderBase]: 47/198 cut-off events. [2024-02-02 09:35:38,976 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-02-02 09:35:38,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 198 events. 47/198 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 938 event pairs, 21 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 96. Up to 104 conditions per place. [2024-02-02 09:35:38,978 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 39 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2024-02-02 09:35:38,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 65 transitions, 244 flow [2024-02-02 09:35:38,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-02 09:35:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-02 09:35:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2024-02-02 09:35:38,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43733333333333335 [2024-02-02 09:35:38,979 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 144 flow. Second operand 5 states and 164 transitions. [2024-02-02 09:35:38,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 65 transitions, 244 flow [2024-02-02 09:35:38,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:35:38,981 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 148 flow [2024-02-02 09:35:38,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2024-02-02 09:35:38,981 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2024-02-02 09:35:38,981 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 148 flow [2024-02-02 09:35:38,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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:35:38,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:35:38,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:35:38,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-02 09:35:38,982 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:35:38,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:35:38,982 INFO L85 PathProgramCache]: Analyzing trace with hash 430147735, now seen corresponding path program 1 times [2024-02-02 09:35:38,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:35:38,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873639109] [2024-02-02 09:35:38,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:35:38,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:35:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:35:39,022 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:35:39,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:35:39,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873639109] [2024-02-02 09:35:39,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873639109] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:35:39,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:35:39,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:35:39,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141650151] [2024-02-02 09:35:39,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:35:39,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:35:39,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:35:39,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:35:39,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:35:39,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 75 [2024-02-02 09:35:39,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:35:39,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:35:39,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 75 [2024-02-02 09:35:39,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:35:39,090 INFO L124 PetriNetUnfolderBase]: 47/170 cut-off events. [2024-02-02 09:35:39,090 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-02-02 09:35:39,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 170 events. 47/170 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 776 event pairs, 44 based on Foata normal form. 1/133 useless extension candidates. Maximal degree in co-relation 95. Up to 125 conditions per place. [2024-02-02 09:35:39,091 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 39 selfloop transitions, 1 changer transitions 2/60 dead transitions. [2024-02-02 09:35:39,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 60 transitions, 238 flow [2024-02-02 09:35:39,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:35:39,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:35:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2024-02-02 09:35:39,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5955555555555555 [2024-02-02 09:35:39,093 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 148 flow. Second operand 3 states and 134 transitions. [2024-02-02 09:35:39,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 60 transitions, 238 flow [2024-02-02 09:35:39,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 60 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-02 09:35:39,095 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 133 flow [2024-02-02 09:35:39,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2024-02-02 09:35:39,095 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2024-02-02 09:35:39,096 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 133 flow [2024-02-02 09:35:39,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:35:39,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:35:39,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:35:39,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-02 09:35:39,096 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:35:39,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:35:39,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1053747166, now seen corresponding path program 1 times [2024-02-02 09:35:39,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:35:39,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808471627] [2024-02-02 09:35:39,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:35:39,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:35:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:35:39,208 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:35:39,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:35:39,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808471627] [2024-02-02 09:35:39,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808471627] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:35:39,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:35:39,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:35:39,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729958080] [2024-02-02 09:35:39,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:35:39,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:35:39,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:35:39,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:35:39,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:35:39,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2024-02-02 09:35:39,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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:35:39,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:35:39,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2024-02-02 09:35:39,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:35:39,301 INFO L124 PetriNetUnfolderBase]: 56/211 cut-off events. [2024-02-02 09:35:39,301 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-02-02 09:35:39,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 211 events. 56/211 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 851 event pairs, 2 based on Foata normal form. 31/219 useless extension candidates. Maximal degree in co-relation 369. Up to 124 conditions per place. [2024-02-02 09:35:39,303 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 47 selfloop transitions, 2 changer transitions 2/65 dead transitions. [2024-02-02 09:35:39,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 259 flow [2024-02-02 09:35:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:35:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:35:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2024-02-02 09:35:39,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5633333333333334 [2024-02-02 09:35:39,304 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 133 flow. Second operand 4 states and 169 transitions. [2024-02-02 09:35:39,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 259 flow [2024-02-02 09:35:39,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:35:39,306 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 128 flow [2024-02-02 09:35:39,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-02-02 09:35:39,306 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2024-02-02 09:35:39,306 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 128 flow [2024-02-02 09:35:39,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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:35:39,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:35:39,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:35:39,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-02 09:35:39,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:35:39,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:35:39,307 INFO L85 PathProgramCache]: Analyzing trace with hash 224246094, now seen corresponding path program 1 times [2024-02-02 09:35:39,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:35:39,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880003101] [2024-02-02 09:35:39,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:35:39,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:35:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:35:39,373 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:35:39,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:35:39,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880003101] [2024-02-02 09:35:39,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880003101] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:35:39,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:35:39,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:35:39,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946622419] [2024-02-02 09:35:39,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:35:39,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:35:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:35:39,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:35:39,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:35:39,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2024-02-02 09:35:39,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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:35:39,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:35:39,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2024-02-02 09:35:39,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:35:39,444 INFO L124 PetriNetUnfolderBase]: 43/158 cut-off events. [2024-02-02 09:35:39,445 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-02-02 09:35:39,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 158 events. 43/158 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 679 event pairs, 31 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 273. Up to 108 conditions per place. [2024-02-02 09:35:39,446 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 41 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2024-02-02 09:35:39,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 239 flow [2024-02-02 09:35:39,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:35:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:35:39,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-02-02 09:35:39,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6488888888888888 [2024-02-02 09:35:39,447 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 128 flow. Second operand 3 states and 146 transitions. [2024-02-02 09:35:39,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 239 flow [2024-02-02 09:35:39,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-02 09:35:39,448 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 157 flow [2024-02-02 09:35:39,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2024-02-02 09:35:39,449 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2024-02-02 09:35:39,449 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 157 flow [2024-02-02 09:35:39,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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:35:39,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:35:39,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:35:39,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-02 09:35:39,449 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:35:39,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:35:39,450 INFO L85 PathProgramCache]: Analyzing trace with hash -335534719, now seen corresponding path program 1 times [2024-02-02 09:35:39,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:35:39,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015990140] [2024-02-02 09:35:39,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:35:39,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:35:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:35:39,556 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:35:39,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:35:39,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015990140] [2024-02-02 09:35:39,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015990140] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:35:39,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:35:39,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:35:39,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618011499] [2024-02-02 09:35:39,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:35:39,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:35:39,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:35:39,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:35:39,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:35:39,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2024-02-02 09:35:39,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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:35:39,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:35:39,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2024-02-02 09:35:39,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:35:39,646 INFO L124 PetriNetUnfolderBase]: 69/223 cut-off events. [2024-02-02 09:35:39,646 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2024-02-02 09:35:39,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 223 events. 69/223 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 848 event pairs, 21 based on Foata normal form. 6/214 useless extension candidates. Maximal degree in co-relation 415. Up to 134 conditions per place. [2024-02-02 09:35:39,648 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 46 selfloop transitions, 6 changer transitions 6/68 dead transitions. [2024-02-02 09:35:39,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 310 flow [2024-02-02 09:35:39,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:35:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:35:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-02-02 09:35:39,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2024-02-02 09:35:39,649 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 157 flow. Second operand 4 states and 141 transitions. [2024-02-02 09:35:39,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 310 flow [2024-02-02 09:35:39,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 296 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-02-02 09:35:39,651 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 172 flow [2024-02-02 09:35:39,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2024-02-02 09:35:39,651 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2024-02-02 09:35:39,652 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 172 flow [2024-02-02 09:35:39,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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:35:39,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:35:39,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:35:39,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-02 09:35:39,652 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:35:39,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:35:39,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2062300200, now seen corresponding path program 1 times [2024-02-02 09:35:39,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:35:39,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491259927] [2024-02-02 09:35:39,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:35:39,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:35:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:35:39,696 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:35:39,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:35:39,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491259927] [2024-02-02 09:35:39,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491259927] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:35:39,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:35:39,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-02 09:35:39,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506760628] [2024-02-02 09:35:39,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:35:39,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:35:39,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:35:39,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:35:39,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:35:39,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2024-02-02 09:35:39,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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:35:39,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:35:39,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2024-02-02 09:35:39,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:35:39,762 INFO L124 PetriNetUnfolderBase]: 30/127 cut-off events. [2024-02-02 09:35:39,762 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-02-02 09:35:39,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 127 events. 30/127 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 442 event pairs, 25 based on Foata normal form. 1/115 useless extension candidates. Maximal degree in co-relation 254. Up to 99 conditions per place. [2024-02-02 09:35:39,763 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 32 selfloop transitions, 0 changer transitions 8/54 dead transitions. [2024-02-02 09:35:39,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 54 transitions, 250 flow [2024-02-02 09:35:39,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:35:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:35:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2024-02-02 09:35:39,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-02-02 09:35:39,764 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 172 flow. Second operand 4 states and 170 transitions. [2024-02-02 09:35:39,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 54 transitions, 250 flow [2024-02-02 09:35:39,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 54 transitions, 242 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-02-02 09:35:39,765 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 149 flow [2024-02-02 09:35:39,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2024-02-02 09:35:39,766 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2024-02-02 09:35:39,766 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 149 flow [2024-02-02 09:35:39,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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:35:39,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:35:39,766 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] [2024-02-02 09:35:39,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-02 09:35:39,766 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:35:39,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:35:39,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1151142860, now seen corresponding path program 1 times [2024-02-02 09:35:39,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:35:39,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689884025] [2024-02-02 09:35:39,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:35:39,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:35:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:35:39,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:35:39,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:35:39,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689884025] [2024-02-02 09:35:39,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689884025] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:35:39,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:35:39,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:35:39,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131590065] [2024-02-02 09:35:39,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:35:39,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:35:39,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:35:39,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:35:39,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:35:39,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-02-02 09:35:39,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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:35:39,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:35:39,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-02-02 09:35:39,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:35:39,943 INFO L124 PetriNetUnfolderBase]: 55/184 cut-off events. [2024-02-02 09:35:39,944 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-02-02 09:35:39,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 184 events. 55/184 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 641 event pairs, 14 based on Foata normal form. 2/178 useless extension candidates. Maximal degree in co-relation 444. Up to 94 conditions per place. [2024-02-02 09:35:39,945 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 43 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2024-02-02 09:35:39,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 290 flow [2024-02-02 09:35:39,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:35:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:35:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2024-02-02 09:35:39,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2024-02-02 09:35:39,946 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 149 flow. Second operand 4 states and 148 transitions. [2024-02-02 09:35:39,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 290 flow [2024-02-02 09:35:39,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 282 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-02-02 09:35:39,947 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 189 flow [2024-02-02 09:35:39,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-02-02 09:35:39,948 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2024-02-02 09:35:39,948 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 189 flow [2024-02-02 09:35:39,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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:35:39,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:35:39,948 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] [2024-02-02 09:35:39,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-02 09:35:39,948 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:35:39,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:35:39,949 INFO L85 PathProgramCache]: Analyzing trace with hash 130224922, now seen corresponding path program 1 times [2024-02-02 09:35:39,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:35:39,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20216283] [2024-02-02 09:35:39,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:35:39,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:35:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:35:40,009 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:35:40,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:35:40,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20216283] [2024-02-02 09:35:40,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20216283] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:35:40,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:35:40,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-02 09:35:40,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323477220] [2024-02-02 09:35:40,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:35:40,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-02 09:35:40,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:35:40,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-02 09:35:40,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-02 09:35:40,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2024-02-02 09:35:40,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:35:40,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:35:40,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2024-02-02 09:35:40,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:35:40,065 INFO L124 PetriNetUnfolderBase]: 25/124 cut-off events. [2024-02-02 09:35:40,065 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2024-02-02 09:35:40,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 124 events. 25/124 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 421 event pairs, 7 based on Foata normal form. 6/126 useless extension candidates. Maximal degree in co-relation 298. Up to 51 conditions per place. [2024-02-02 09:35:40,066 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 34 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2024-02-02 09:35:40,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 268 flow [2024-02-02 09:35:40,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-02 09:35:40,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-02 09:35:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2024-02-02 09:35:40,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6088888888888889 [2024-02-02 09:35:40,067 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 189 flow. Second operand 3 states and 137 transitions. [2024-02-02 09:35:40,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 268 flow [2024-02-02 09:35:40,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 53 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-02 09:35:40,069 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 181 flow [2024-02-02 09:35:40,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-02-02 09:35:40,070 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -16 predicate places. [2024-02-02 09:35:40,070 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 181 flow [2024-02-02 09:35:40,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:35:40,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:35:40,070 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] [2024-02-02 09:35:40,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-02 09:35:40,070 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:35:40,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:35:40,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1929545234, now seen corresponding path program 2 times [2024-02-02 09:35:40,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:35:40,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63755316] [2024-02-02 09:35:40,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:35:40,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:35:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-02 09:35:40,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-02 09:35:40,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-02 09:35:40,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63755316] [2024-02-02 09:35:40,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63755316] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-02 09:35:40,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-02 09:35:40,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-02 09:35:40,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9240432] [2024-02-02 09:35:40,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-02 09:35:40,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-02 09:35:40,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-02 09:35:40,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-02 09:35:40,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-02 09:35:40,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-02-02 09:35:40,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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:35:40,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-02 09:35:40,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-02-02 09:35:40,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-02 09:35:40,235 INFO L124 PetriNetUnfolderBase]: 48/184 cut-off events. [2024-02-02 09:35:40,235 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2024-02-02 09:35:40,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 184 events. 48/184 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 661 event pairs, 28 based on Foata normal form. 2/186 useless extension candidates. Maximal degree in co-relation 481. Up to 95 conditions per place. [2024-02-02 09:35:40,236 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 42 selfloop transitions, 12 changer transitions 0/63 dead transitions. [2024-02-02 09:35:40,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 342 flow [2024-02-02 09:35:40,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-02 09:35:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-02 09:35:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2024-02-02 09:35:40,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033333333333333 [2024-02-02 09:35:40,238 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 181 flow. Second operand 4 states and 151 transitions. [2024-02-02 09:35:40,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 342 flow [2024-02-02 09:35:40,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 327 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-02-02 09:35:40,239 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 223 flow [2024-02-02 09:35:40,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-02-02 09:35:40,240 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -16 predicate places. [2024-02-02 09:35:40,240 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 223 flow [2024-02-02 09:35:40,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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:35:40,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-02 09:35:40,240 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:35:40,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-02 09:35:40,241 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-02-02 09:35:40,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-02 09:35:40,241 INFO L85 PathProgramCache]: Analyzing trace with hash -442346690, now seen corresponding path program 1 times [2024-02-02 09:35:40,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-02 09:35:40,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438708547] [2024-02-02 09:35:40,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-02 09:35:40,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-02 09:35:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:35:40,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-02 09:35:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-02 09:35:40,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-02 09:35:40,282 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-02 09:35:40,282 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (32 of 33 remaining) [2024-02-02 09:35:40,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 33 remaining) [2024-02-02 09:35:40,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 33 remaining) [2024-02-02 09:35:40,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 33 remaining) [2024-02-02 09:35:40,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 33 remaining) [2024-02-02 09:35:40,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 33 remaining) [2024-02-02 09:35:40,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 33 remaining) [2024-02-02 09:35:40,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 33 remaining) [2024-02-02 09:35:40,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 33 remaining) [2024-02-02 09:35:40,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 33 remaining) [2024-02-02 09:35:40,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (22 of 33 remaining) [2024-02-02 09:35:40,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 33 remaining) [2024-02-02 09:35:40,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 33 remaining) [2024-02-02 09:35:40,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 33 remaining) [2024-02-02 09:35:40,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 33 remaining) [2024-02-02 09:35:40,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (17 of 33 remaining) [2024-02-02 09:35:40,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 33 remaining) [2024-02-02 09:35:40,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 33 remaining) [2024-02-02 09:35:40,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 33 remaining) [2024-02-02 09:35:40,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 33 remaining) [2024-02-02 09:35:40,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 33 remaining) [2024-02-02 09:35:40,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 33 remaining) [2024-02-02 09:35:40,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 33 remaining) [2024-02-02 09:35:40,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 33 remaining) [2024-02-02 09:35:40,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 33 remaining) [2024-02-02 09:35:40,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (7 of 33 remaining) [2024-02-02 09:35:40,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 33 remaining) [2024-02-02 09:35:40,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 33 remaining) [2024-02-02 09:35:40,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 33 remaining) [2024-02-02 09:35:40,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 33 remaining) [2024-02-02 09:35:40,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 33 remaining) [2024-02-02 09:35:40,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 33 remaining) [2024-02-02 09:35:40,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 33 remaining) [2024-02-02 09:35:40,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-02 09:35:40,286 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-02 09:35:40,291 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-02 09:35:40,291 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-02 09:35:40,310 INFO L503 ceAbstractionStarter]: Automizer considered 22 witness invariants [2024-02-02 09:35:40,310 INFO L504 ceAbstractionStarter]: WitnessConsidered=22 [2024-02-02 09:35:40,311 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:35:40 BasicIcfg [2024-02-02 09:35:40,311 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-02 09:35:40,311 INFO L158 Benchmark]: Toolchain (without parser) took 4235.94ms. Allocated memory was 142.6MB in the beginning and 306.2MB in the end (delta: 163.6MB). Free memory was 66.1MB in the beginning and 93.6MB in the end (delta: -27.4MB). Peak memory consumption was 139.5MB. Max. memory is 16.1GB. [2024-02-02 09:35:40,311 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:35:40,311 INFO L158 Benchmark]: Witness Parser took 3.78ms. Allocated memory is still 142.6MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-02 09:35:40,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 993.18ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 66.0MB in the beginning and 121.3MB in the end (delta: -55.4MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-02-02 09:35:40,312 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.50ms. Allocated memory is still 197.1MB. Free memory was 121.3MB in the beginning and 118.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-02 09:35:40,312 INFO L158 Benchmark]: Boogie Preprocessor took 85.54ms. Allocated memory is still 197.1MB. Free memory was 118.3MB in the beginning and 114.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-02 09:35:40,312 INFO L158 Benchmark]: RCFGBuilder took 613.76ms. Allocated memory is still 197.1MB. Free memory was 114.1MB in the beginning and 67.9MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-02-02 09:35:40,312 INFO L158 Benchmark]: TraceAbstraction took 2457.24ms. Allocated memory was 197.1MB in the beginning and 306.2MB in the end (delta: 109.1MB). Free memory was 67.9MB in the beginning and 93.6MB in the end (delta: -25.6MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2024-02-02 09:35:40,313 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 142.6MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 3.78ms. Allocated memory is still 142.6MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 993.18ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 66.0MB in the beginning and 121.3MB in the end (delta: -55.4MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.50ms. Allocated memory is still 197.1MB. Free memory was 121.3MB in the beginning and 118.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.54ms. Allocated memory is still 197.1MB. Free memory was 118.3MB in the beginning and 114.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 613.76ms. Allocated memory is still 197.1MB. Free memory was 114.1MB in the beginning and 67.9MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2457.24ms. Allocated memory was 197.1MB in the beginning and 306.2MB in the end (delta: 109.1MB). Free memory was 67.9MB in the beginning and 93.6MB in the end (delta: -25.6MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1695]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1696] 0 pthread_t t1; [L1696] 0 pthread_t t1; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1697] 0 pthread_mutex_t mutex; [L1698] 0 int pdev; [L1734] CALL, EXPR 0 module_init() [L1708] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[0]]]] [L1709] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[0]]]] [L1709] 0 pdev = 1 VAL [mutex={4:0}, pdev=1, t1={3:0}] [L1710] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]]]] [L1710] CALL 0 ldv_assert(pdev==1) [L1695] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, mutex={4:0}, pdev=1, t1={3:0}] [L1710] RET 0 ldv_assert(pdev==1) [L1711] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]]]] [L1711] COND TRUE 0 __VERIFIER_nondet_int() [L1712] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]]]] [L1712] FCALL, FORK 0 pthread_create(&t1, ((void *)0), thread1, ((void *)0)) VAL [arg={0:0}, mutex={4:0}, pdev=1, t1={3:0}] [L1713] 0 return 0; VAL [\result=0, arg={0:0}, mutex={4:0}, pdev=1, t1={3:0}] [L1734] RET, EXPR 0 module_init() [L1700] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=1, t1={3:0}] [L1734] COND FALSE 0 !(module_init()!=0) [L1735] CALL 0 module_exit() [L1721] 0 void *status; VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=1, status={5:0}, t1={3:0}] [L1701] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=1, t1={3:0}] [L1723] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] [L1723] 0 pdev = 4 [L1724] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=4, status={5:0}, t1={3:0}] [L1702] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] [L1702] 1 pdev = 6 [L1703] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] VAL [arg={0:0}, arg={0:0}, mutex={4:0}, pdev=6, t1={3:0}] [L1726] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[pdev]],BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[pdev]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[6]]],BinaryExpression[COMPLEQ,IdentifierExpression[pdev],IntegerLiteral[127]]],BinaryExpression[COMPNEQ,IdentifierExpression[pdev],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[1]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] [L1726] CALL 0 ldv_assert(pdev==4) [L1695] COND TRUE 0 !expression [L1695] 0 reach_error() VAL [\old(expression)=0, arg={0:0}, arg={0:0}, expression=0, mutex={4:0}, pdev=6, t1={3:0}] - UnprovableResult [Line: 1700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1701]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1703]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1704]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1705]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1708]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1695]: 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: 1711]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1712]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1716]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1695]: 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: 1717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1723]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1729]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1730]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1731]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1695]: 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: 1712]: 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 3 procedures, 89 locations, 33 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 496 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1048 IncrementalHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 48 mSDtfsCounter, 1048 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=11, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 392 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:35:40,351 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