./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 3d25acf6 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-3d25acf-m [2024-01-30 14:39:37,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-30 14:39:37,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-30 14:39:37,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-30 14:39:37,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-30 14:39:37,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-30 14:39:37,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-30 14:39:37,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-30 14:39:37,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-30 14:39:37,736 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-30 14:39:37,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-30 14:39:37,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-30 14:39:37,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-30 14:39:37,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-30 14:39:37,739 INFO L153 SettingsManager]: * Use SBE=true [2024-01-30 14:39:37,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-30 14:39:37,739 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-30 14:39:37,739 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-30 14:39:37,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-30 14:39:37,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-30 14:39:37,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-30 14:39:37,740 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-30 14:39:37,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-30 14:39:37,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-30 14:39:37,741 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-30 14:39:37,741 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-30 14:39:37,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-30 14:39:37,741 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-30 14:39:37,742 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-30 14:39:37,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-30 14:39:37,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-30 14:39:37,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-30 14:39:37,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:39:37,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-30 14:39:37,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-30 14:39:37,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-30 14:39:37,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-30 14:39:37,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-30 14:39:37,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-30 14:39:37,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-30 14:39:37,745 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-30 14:39:37,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-30 14:39:37,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-30 14:39:37,745 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-30 14:39:37,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-30 14:39:37,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-30 14:39:37,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-30 14:39:37,979 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-30 14:39:37,980 INFO L274 PluginConnector]: CDTParser initialized [2024-01-30 14:39:37,981 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-01-30 14:39:39,066 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-30 14:39:39,080 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-01-30 14:39:39,342 INFO L384 CDTParser]: Found 1 translation units. [2024-01-30 14:39:39,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_3-join.i [2024-01-30 14:39:39,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14dd5de96/e880492d3fa74560a1e3c9dbb3f5c42e/FLAG338b176a9 [2024-01-30 14:39:39,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14dd5de96/e880492d3fa74560a1e3c9dbb3f5c42e [2024-01-30 14:39:39,401 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-30 14:39:39,401 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-30 14:39:39,402 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-01-30 14:39:39,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-30 14:39:39,479 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-30 14:39:39,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-30 14:39:39,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-30 14:39:39,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-30 14:39:39,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:39:39" (1/2) ... [2024-01-30 14:39:39,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3c8a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:39:39, skipping insertion in model container [2024-01-30 14:39:39,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:39:39" (1/2) ... [2024-01-30 14:39:39,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@ec24417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:39:39, skipping insertion in model container [2024-01-30 14:39:39,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:39:39" (2/2) ... [2024-01-30 14:39:39,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3c8a98 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:39:39, skipping insertion in model container [2024-01-30 14:39:39,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:39:39" (2/2) ... [2024-01-30 14:39:39,499 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-30 14:39:39,591 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-30 14:39:39,592 INFO L98 nessWitnessExtractor]: Location invariant before [L1710-L1710] pdev == 1 [2024-01-30 14:39:39,592 INFO L98 nessWitnessExtractor]: Location invariant after [L1720-L1732] (unsigned long )status == 0UL [2024-01-30 14:39:39,592 INFO L98 nessWitnessExtractor]: Location invariant before [L1709-L1709] pdev == 0 [2024-01-30 14:39:39,592 INFO L98 nessWitnessExtractor]: Location invariant before [L1705-L1705] (unsigned long )arg == 0UL [2024-01-30 14:39:39,593 INFO L98 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-01-30 14:39:39,593 INFO L98 nessWitnessExtractor]: Location invariant before [L1729-L1729] (unsigned long )status == 0UL [2024-01-30 14:39:39,593 INFO L98 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-01-30 14:39:39,593 INFO L98 nessWitnessExtractor]: Location invariant before [L1718-L1718] pdev == 3 [2024-01-30 14:39:39,593 INFO L98 nessWitnessExtractor]: Location invariant before [L1708-L1708] pdev == 0 [2024-01-30 14:39:39,593 INFO L98 nessWitnessExtractor]: Location invariant before [L1731-L1731] (unsigned long )status == 0UL [2024-01-30 14:39:39,593 INFO L98 nessWitnessExtractor]: Location invariant before [L1730-L1730] (unsigned long )status == 0UL [2024-01-30 14:39:39,594 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L22] pdev == 1 [2024-01-30 14:39:39,594 INFO L98 nessWitnessExtractor]: Location invariant before [L1712-L1712] pdev == 1 [2024-01-30 14:39:39,594 INFO L98 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-01-30 14:39:39,594 INFO L98 nessWitnessExtractor]: Location invariant before [L1700-L1700] (unsigned long )arg == 0UL [2024-01-30 14:39:39,594 INFO L98 nessWitnessExtractor]: Location invariant before [L1704-L1704] (unsigned long )arg == 0UL [2024-01-30 14:39:39,594 INFO L98 nessWitnessExtractor]: Location invariant before [L1716-L1716] pdev == 3 [2024-01-30 14:39:39,594 INFO L98 nessWitnessExtractor]: Location invariant before [L1717-L1717] pdev == 3 [2024-01-30 14:39:39,594 INFO L98 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-01-30 14:39:39,595 INFO L98 nessWitnessExtractor]: Location invariant before [L1711-L1714] pdev == 1 [2024-01-30 14:39:39,595 INFO L98 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-01-30 14:39:39,595 INFO L98 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-01-30 14:39:39,596 INFO L98 nessWitnessExtractor]: Location invariant before [L1701-L1701] (unsigned long )arg == 0UL [2024-01-30 14:39:39,596 INFO L98 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-01-30 14:39:39,596 INFO L98 nessWitnessExtractor]: Location invariant before [L1715-L1715] pdev == 1 [2024-01-30 14:39:39,650 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-30 14:39:40,161 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-01-30 14:39:40,183 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:39:40,209 INFO L202 MainTranslator]: Completed pre-run [2024-01-30 14:39:40,216 WARN L424 MainDispatcher]: Unable to annotate typedef unsigned int __mode_t; with a witness entry [2024-01-30 14:39:40,250 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-01-30 14:39:40,251 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-01-30 14:39:40,295 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-01-30 14:39:40,296 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:39:40,367 INFO L206 MainTranslator]: Completed translation [2024-01-30 14:39:40,368 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:39:40 WrapperNode [2024-01-30 14:39:40,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-30 14:39:40,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-30 14:39:40,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-30 14:39:40,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-30 14:39:40,374 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 30.01 02:39:40" (1/1) ... [2024-01-30 14:39:40,407 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 30.01 02:39:40" (1/1) ... [2024-01-30 14:39:40,439 INFO L138 Inliner]: procedures = 483, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-01-30 14:39:40,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-30 14:39:40,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-30 14:39:40,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-30 14:39:40,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-30 14:39:40,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:39:40" (1/1) ... [2024-01-30 14:39:40,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:39:40" (1/1) ... [2024-01-30 14:39:40,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:39:40" (1/1) ... [2024-01-30 14:39:40,467 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-01-30 14:39:40,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:39:40" (1/1) ... [2024-01-30 14:39:40,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:39:40" (1/1) ... [2024-01-30 14:39:40,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:39:40" (1/1) ... [2024-01-30 14:39:40,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:39:40" (1/1) ... [2024-01-30 14:39:40,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:39:40" (1/1) ... [2024-01-30 14:39:40,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:39:40" (1/1) ... [2024-01-30 14:39:40,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-30 14:39:40,493 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-30 14:39:40,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-30 14:39:40,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-30 14:39:40,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:39:40" (1/1) ... [2024-01-30 14:39:40,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:39:40,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:39:40,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-30 14:39:40,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-30 14:39:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-30 14:39:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-30 14:39:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-30 14:39:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-30 14:39:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-30 14:39:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-30 14:39:40,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-30 14:39:40,589 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-30 14:39:40,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-30 14:39:40,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-01-30 14:39:40,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-01-30 14:39:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-01-30 14:39:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-01-30 14:39:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-30 14:39:40,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-30 14:39:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-30 14:39:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-01-30 14:39:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-01-30 14:39:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-01-30 14:39:40,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-01-30 14:39:40,592 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-30 14:39:40,592 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-30 14:39:40,592 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-30 14:39:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-30 14:39:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-30 14:39:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-30 14:39:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-30 14:39:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-30 14:39:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-30 14:39:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-30 14:39:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-30 14:39:40,595 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-30 14:39:40,874 INFO L244 CfgBuilder]: Building ICFG [2024-01-30 14:39:40,876 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-30 14:39:41,054 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-30 14:39:41,054 INFO L293 CfgBuilder]: Performing block encoding [2024-01-30 14:39:41,136 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-30 14:39:41,136 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-30 14:39:41,137 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:39:41 BoogieIcfgContainer [2024-01-30 14:39:41,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-30 14:39:41,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-30 14:39:41,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-30 14:39:41,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-30 14:39:41,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:39:39" (1/4) ... [2024-01-30 14:39:41,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be007dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:39:41, skipping insertion in model container [2024-01-30 14:39:41,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:39:39" (2/4) ... [2024-01-30 14:39:41,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be007dc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:39:41, skipping insertion in model container [2024-01-30 14:39:41,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:39:40" (3/4) ... [2024-01-30 14:39:41,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be007dc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:39:41, skipping insertion in model container [2024-01-30 14:39:41,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:39:41" (4/4) ... [2024-01-30 14:39:41,143 INFO L112 eAbstractionObserver]: Analyzing ICFG race-1_3-join.i [2024-01-30 14:39:41,156 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-30 14:39:41,156 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-01-30 14:39:41,156 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-30 14:39:41,188 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-30 14:39:41,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 75 transitions, 157 flow [2024-01-30 14:39:41,249 INFO L124 PetriNetUnfolderBase]: 4/86 cut-off events. [2024-01-30 14:39:41,250 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-30 14:39:41,252 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-01-30 14:39:41,252 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 75 transitions, 157 flow [2024-01-30 14:39:41,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 71 transitions, 148 flow [2024-01-30 14:39:41,268 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-30 14:39:41,275 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;@79c8f040, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-30 14:39:41,276 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2024-01-30 14:39:41,278 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-30 14:39:41,278 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-30 14:39:41,278 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:39:41,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:41,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-30 14:39:41,280 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-01-30 14:39:41,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:41,284 INFO L85 PathProgramCache]: Analyzing trace with hash 12183, now seen corresponding path program 1 times [2024-01-30 14:39:41,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:41,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237023125] [2024-01-30 14:39:41,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:41,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:39:41,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:41,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237023125] [2024-01-30 14:39:41,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237023125] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:41,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:41,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:39:41,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780947274] [2024-01-30 14:39:41,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:41,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:39:41,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:41,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:39:41,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:39:41,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2024-01-30 14:39:41,682 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-01-30 14:39:41,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:41,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2024-01-30 14:39:41,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:41,789 INFO L124 PetriNetUnfolderBase]: 50/179 cut-off events. [2024-01-30 14:39:41,789 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-30 14:39:41,791 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-01-30 14:39:41,793 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 33 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-01-30 14:39:41,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 204 flow [2024-01-30 14:39:41,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:39:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:39:41,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2024-01-30 14:39:41,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-01-30 14:39:41,806 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 148 flow. Second operand 3 states and 135 transitions. [2024-01-30 14:39:41,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 204 flow [2024-01-30 14:39:41,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:39:41,814 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 134 flow [2024-01-30 14:39:41,816 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-01-30 14:39:41,819 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2024-01-30 14:39:41,819 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 134 flow [2024-01-30 14:39:41,819 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-01-30 14:39:41,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:41,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-30 14:39:41,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-30 14:39:41,823 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-01-30 14:39:41,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:41,824 INFO L85 PathProgramCache]: Analyzing trace with hash 11719868, now seen corresponding path program 1 times [2024-01-30 14:39:41,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:41,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371261505] [2024-01-30 14:39:41,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:41,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:39:41,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:41,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371261505] [2024-01-30 14:39:41,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371261505] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:41,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:41,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:39:41,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154128078] [2024-01-30 14:39:41,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:41,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:39:41,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:41,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:39:41,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:39:41,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2024-01-30 14:39:41,917 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-01-30 14:39:41,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:41,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2024-01-30 14:39:41,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:42,012 INFO L124 PetriNetUnfolderBase]: 47/202 cut-off events. [2024-01-30 14:39:42,013 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:39:42,014 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-01-30 14:39:42,015 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 40 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2024-01-30 14:39:42,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 69 transitions, 232 flow [2024-01-30 14:39:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:39:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:39:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2024-01-30 14:39:42,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6044444444444445 [2024-01-30 14:39:42,021 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 134 flow. Second operand 3 states and 136 transitions. [2024-01-30 14:39:42,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 69 transitions, 232 flow [2024-01-30 14:39:42,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:39:42,023 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 144 flow [2024-01-30 14:39:42,023 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-01-30 14:39:42,024 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2024-01-30 14:39:42,024 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 144 flow [2024-01-30 14:39:42,024 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-01-30 14:39:42,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:42,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-30 14:39:42,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-30 14:39:42,025 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-01-30 14:39:42,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:42,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1622097690, now seen corresponding path program 1 times [2024-01-30 14:39:42,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:42,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928267637] [2024-01-30 14:39:42,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:42,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:39:42,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:42,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928267637] [2024-01-30 14:39:42,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928267637] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:42,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:42,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:39:42,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36176170] [2024-01-30 14:39:42,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:42,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:39:42,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:42,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:39:42,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:39:42,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 75 [2024-01-30 14:39:42,130 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-01-30 14:39:42,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:42,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 75 [2024-01-30 14:39:42,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:42,259 INFO L124 PetriNetUnfolderBase]: 47/198 cut-off events. [2024-01-30 14:39:42,260 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-30 14:39:42,261 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-01-30 14:39:42,263 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 39 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2024-01-30 14:39:42,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 65 transitions, 244 flow [2024-01-30 14:39:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:39:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:39:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2024-01-30 14:39:42,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43733333333333335 [2024-01-30 14:39:42,265 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 144 flow. Second operand 5 states and 164 transitions. [2024-01-30 14:39:42,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 65 transitions, 244 flow [2024-01-30 14:39:42,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:39:42,268 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 148 flow [2024-01-30 14:39:42,268 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-01-30 14:39:42,269 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2024-01-30 14:39:42,269 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 148 flow [2024-01-30 14:39:42,269 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-01-30 14:39:42,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:42,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:39:42,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-30 14:39:42,270 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-01-30 14:39:42,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash 430147735, now seen corresponding path program 1 times [2024-01-30 14:39:42,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:42,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360884838] [2024-01-30 14:39:42,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:42,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:39:42,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:42,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360884838] [2024-01-30 14:39:42,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360884838] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:42,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:42,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:39:42,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397580213] [2024-01-30 14:39:42,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:42,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:39:42,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:42,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:39:42,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:39:42,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 75 [2024-01-30 14:39:42,344 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-01-30 14:39:42,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:42,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 75 [2024-01-30 14:39:42,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:42,409 INFO L124 PetriNetUnfolderBase]: 47/170 cut-off events. [2024-01-30 14:39:42,409 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-01-30 14:39:42,410 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-01-30 14:39:42,410 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 39 selfloop transitions, 1 changer transitions 2/60 dead transitions. [2024-01-30 14:39:42,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 60 transitions, 238 flow [2024-01-30 14:39:42,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:39:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:39:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2024-01-30 14:39:42,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5955555555555555 [2024-01-30 14:39:42,412 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 148 flow. Second operand 3 states and 134 transitions. [2024-01-30 14:39:42,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 60 transitions, 238 flow [2024-01-30 14:39:42,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 60 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-30 14:39:42,414 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 133 flow [2024-01-30 14:39:42,414 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-01-30 14:39:42,414 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2024-01-30 14:39:42,415 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 133 flow [2024-01-30 14:39:42,415 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-01-30 14:39:42,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:42,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:39:42,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-30 14:39:42,415 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-01-30 14:39:42,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:42,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1053747166, now seen corresponding path program 1 times [2024-01-30 14:39:42,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:42,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908476514] [2024-01-30 14:39:42,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:42,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:42,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:39:42,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:42,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908476514] [2024-01-30 14:39:42,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908476514] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:42,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:42,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:39:42,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509014449] [2024-01-30 14:39:42,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:42,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:39:42,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:42,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:39:42,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:39:42,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2024-01-30 14:39:42,533 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-01-30 14:39:42,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:42,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2024-01-30 14:39:42,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:42,614 INFO L124 PetriNetUnfolderBase]: 56/211 cut-off events. [2024-01-30 14:39:42,614 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-01-30 14:39:42,615 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-01-30 14:39:42,616 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 47 selfloop transitions, 2 changer transitions 2/65 dead transitions. [2024-01-30 14:39:42,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 259 flow [2024-01-30 14:39:42,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:39:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:39:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2024-01-30 14:39:42,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5633333333333334 [2024-01-30 14:39:42,617 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 133 flow. Second operand 4 states and 169 transitions. [2024-01-30 14:39:42,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 259 flow [2024-01-30 14:39:42,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:39:42,619 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 128 flow [2024-01-30 14:39:42,619 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-01-30 14:39:42,620 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2024-01-30 14:39:42,620 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 128 flow [2024-01-30 14:39:42,620 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-01-30 14:39:42,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:42,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:39:42,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-30 14:39:42,621 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-01-30 14:39:42,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash 224246094, now seen corresponding path program 1 times [2024-01-30 14:39:42,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:42,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699129276] [2024-01-30 14:39:42,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:42,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:39:42,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:42,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699129276] [2024-01-30 14:39:42,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699129276] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:42,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:42,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:39:42,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859161572] [2024-01-30 14:39:42,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:42,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:39:42,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:42,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:39:42,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:39:42,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2024-01-30 14:39:42,713 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-01-30 14:39:42,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:42,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2024-01-30 14:39:42,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:42,774 INFO L124 PetriNetUnfolderBase]: 43/158 cut-off events. [2024-01-30 14:39:42,775 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-30 14:39:42,775 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-01-30 14:39:42,776 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 41 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2024-01-30 14:39:42,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 239 flow [2024-01-30 14:39:42,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:39:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:39:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-01-30 14:39:42,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6488888888888888 [2024-01-30 14:39:42,781 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 128 flow. Second operand 3 states and 146 transitions. [2024-01-30 14:39:42,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 239 flow [2024-01-30 14:39:42,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:39:42,783 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 157 flow [2024-01-30 14:39:42,783 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-01-30 14:39:42,784 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2024-01-30 14:39:42,784 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 157 flow [2024-01-30 14:39:42,800 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-01-30 14:39:42,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:42,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:39:42,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-30 14:39:42,801 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-01-30 14:39:42,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:42,801 INFO L85 PathProgramCache]: Analyzing trace with hash -335534719, now seen corresponding path program 1 times [2024-01-30 14:39:42,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:42,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560174695] [2024-01-30 14:39:42,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:42,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:39:42,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:42,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560174695] [2024-01-30 14:39:42,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560174695] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:42,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:42,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:39:42,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232512123] [2024-01-30 14:39:42,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:42,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:39:42,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:42,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:39:42,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:39:42,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2024-01-30 14:39:42,907 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-01-30 14:39:42,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:42,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2024-01-30 14:39:42,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:42,972 INFO L124 PetriNetUnfolderBase]: 69/223 cut-off events. [2024-01-30 14:39:42,972 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2024-01-30 14:39:42,973 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-01-30 14:39:42,973 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 46 selfloop transitions, 6 changer transitions 6/68 dead transitions. [2024-01-30 14:39:42,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 310 flow [2024-01-30 14:39:42,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:39:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:39:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-01-30 14:39:42,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2024-01-30 14:39:42,976 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 157 flow. Second operand 4 states and 141 transitions. [2024-01-30 14:39:42,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 310 flow [2024-01-30 14:39:42,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 296 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-30 14:39:42,978 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 172 flow [2024-01-30 14:39:42,978 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-01-30 14:39:42,979 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2024-01-30 14:39:42,979 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 172 flow [2024-01-30 14:39:42,979 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-01-30 14:39:42,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:42,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:39:42,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-30 14:39:42,980 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-01-30 14:39:42,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:42,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2062300200, now seen corresponding path program 1 times [2024-01-30 14:39:42,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:42,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584640480] [2024-01-30 14:39:42,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:42,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:39:43,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:43,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584640480] [2024-01-30 14:39:43,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584640480] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:43,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:43,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:39:43,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511044913] [2024-01-30 14:39:43,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:43,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:39:43,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:43,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:39:43,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:39:43,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2024-01-30 14:39:43,028 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-01-30 14:39:43,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:43,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2024-01-30 14:39:43,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:43,086 INFO L124 PetriNetUnfolderBase]: 30/127 cut-off events. [2024-01-30 14:39:43,086 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-01-30 14:39:43,087 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-01-30 14:39:43,087 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 32 selfloop transitions, 0 changer transitions 8/54 dead transitions. [2024-01-30 14:39:43,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 54 transitions, 250 flow [2024-01-30 14:39:43,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:39:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:39:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2024-01-30 14:39:43,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-01-30 14:39:43,089 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 172 flow. Second operand 4 states and 170 transitions. [2024-01-30 14:39:43,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 54 transitions, 250 flow [2024-01-30 14:39:43,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 54 transitions, 242 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-30 14:39:43,090 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 149 flow [2024-01-30 14:39:43,091 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-01-30 14:39:43,091 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2024-01-30 14:39:43,091 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 149 flow [2024-01-30 14:39:43,091 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-01-30 14:39:43,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:43,092 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-01-30 14:39:43,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-30 14:39:43,092 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-01-30 14:39:43,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:43,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1151142860, now seen corresponding path program 1 times [2024-01-30 14:39:43,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:43,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177274992] [2024-01-30 14:39:43,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:43,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:39:43,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:43,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177274992] [2024-01-30 14:39:43,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177274992] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:43,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:43,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:39:43,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944250222] [2024-01-30 14:39:43,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:43,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:39:43,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:43,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:39:43,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:39:43,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-01-30 14:39:43,221 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-01-30 14:39:43,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:43,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-01-30 14:39:43,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:43,289 INFO L124 PetriNetUnfolderBase]: 55/184 cut-off events. [2024-01-30 14:39:43,289 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-01-30 14:39:43,289 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-01-30 14:39:43,290 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 43 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2024-01-30 14:39:43,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 290 flow [2024-01-30 14:39:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:39:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:39:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2024-01-30 14:39:43,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2024-01-30 14:39:43,292 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 149 flow. Second operand 4 states and 148 transitions. [2024-01-30 14:39:43,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 290 flow [2024-01-30 14:39:43,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 282 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-01-30 14:39:43,293 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 189 flow [2024-01-30 14:39:43,294 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-01-30 14:39:43,294 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2024-01-30 14:39:43,294 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 189 flow [2024-01-30 14:39:43,295 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-01-30 14:39:43,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:43,295 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-01-30 14:39:43,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-30 14:39:43,295 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-01-30 14:39:43,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:43,296 INFO L85 PathProgramCache]: Analyzing trace with hash 130224922, now seen corresponding path program 1 times [2024-01-30 14:39:43,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:43,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125625609] [2024-01-30 14:39:43,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:43,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:39:43,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:43,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125625609] [2024-01-30 14:39:43,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125625609] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:43,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:43,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:39:43,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903384799] [2024-01-30 14:39:43,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:43,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:39:43,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:43,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:39:43,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:39:43,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2024-01-30 14:39:43,362 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-01-30 14:39:43,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:43,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2024-01-30 14:39:43,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:43,404 INFO L124 PetriNetUnfolderBase]: 25/124 cut-off events. [2024-01-30 14:39:43,405 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2024-01-30 14:39:43,405 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-01-30 14:39:43,406 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 34 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2024-01-30 14:39:43,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 268 flow [2024-01-30 14:39:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:39:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:39:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2024-01-30 14:39:43,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6088888888888889 [2024-01-30 14:39:43,407 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 189 flow. Second operand 3 states and 137 transitions. [2024-01-30 14:39:43,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 268 flow [2024-01-30 14:39:43,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 53 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:39:43,408 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 181 flow [2024-01-30 14:39:43,409 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-01-30 14:39:43,409 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -16 predicate places. [2024-01-30 14:39:43,409 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 181 flow [2024-01-30 14:39:43,410 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-01-30 14:39:43,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:43,410 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-01-30 14:39:43,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-30 14:39:43,410 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-01-30 14:39:43,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:43,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1929545234, now seen corresponding path program 2 times [2024-01-30 14:39:43,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:43,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397551707] [2024-01-30 14:39:43,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:43,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:39:43,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:43,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397551707] [2024-01-30 14:39:43,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397551707] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:43,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:43,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:39:43,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290927251] [2024-01-30 14:39:43,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:43,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:39:43,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:43,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:39:43,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:39:43,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-01-30 14:39:43,527 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-01-30 14:39:43,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:43,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-01-30 14:39:43,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:43,600 INFO L124 PetriNetUnfolderBase]: 48/184 cut-off events. [2024-01-30 14:39:43,601 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2024-01-30 14:39:43,601 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-01-30 14:39:43,602 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 42 selfloop transitions, 12 changer transitions 0/63 dead transitions. [2024-01-30 14:39:43,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 342 flow [2024-01-30 14:39:43,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:39:43,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:39:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2024-01-30 14:39:43,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033333333333333 [2024-01-30 14:39:43,603 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 181 flow. Second operand 4 states and 151 transitions. [2024-01-30 14:39:43,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 342 flow [2024-01-30 14:39:43,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 327 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-01-30 14:39:43,605 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 223 flow [2024-01-30 14:39:43,605 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-01-30 14:39:43,606 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -16 predicate places. [2024-01-30 14:39:43,606 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 223 flow [2024-01-30 14:39:43,620 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-01-30 14:39:43,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:43,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:39:43,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-30 14:39:43,621 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-01-30 14:39:43,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:43,621 INFO L85 PathProgramCache]: Analyzing trace with hash -442346690, now seen corresponding path program 1 times [2024-01-30 14:39:43,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:43,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694115249] [2024-01-30 14:39:43,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:43,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:39:43,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-30 14:39:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:39:43,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-30 14:39:43,704 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-30 14:39:43,705 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (32 of 33 remaining) [2024-01-30 14:39:43,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 33 remaining) [2024-01-30 14:39:43,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 33 remaining) [2024-01-30 14:39:43,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 33 remaining) [2024-01-30 14:39:43,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 33 remaining) [2024-01-30 14:39:43,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 33 remaining) [2024-01-30 14:39:43,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 33 remaining) [2024-01-30 14:39:43,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 33 remaining) [2024-01-30 14:39:43,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 33 remaining) [2024-01-30 14:39:43,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 33 remaining) [2024-01-30 14:39:43,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (22 of 33 remaining) [2024-01-30 14:39:43,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 33 remaining) [2024-01-30 14:39:43,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 33 remaining) [2024-01-30 14:39:43,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 33 remaining) [2024-01-30 14:39:43,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 33 remaining) [2024-01-30 14:39:43,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (17 of 33 remaining) [2024-01-30 14:39:43,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 33 remaining) [2024-01-30 14:39:43,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 33 remaining) [2024-01-30 14:39:43,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 33 remaining) [2024-01-30 14:39:43,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 33 remaining) [2024-01-30 14:39:43,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 33 remaining) [2024-01-30 14:39:43,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 33 remaining) [2024-01-30 14:39:43,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 33 remaining) [2024-01-30 14:39:43,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 33 remaining) [2024-01-30 14:39:43,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 33 remaining) [2024-01-30 14:39:43,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (7 of 33 remaining) [2024-01-30 14:39:43,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 33 remaining) [2024-01-30 14:39:43,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 33 remaining) [2024-01-30 14:39:43,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 33 remaining) [2024-01-30 14:39:43,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 33 remaining) [2024-01-30 14:39:43,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 33 remaining) [2024-01-30 14:39:43,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 33 remaining) [2024-01-30 14:39:43,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 33 remaining) [2024-01-30 14:39:43,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-30 14:39:43,711 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:39:43,716 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-30 14:39:43,732 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-30 14:39:43,752 INFO L503 ceAbstractionStarter]: Automizer considered 22 witness invariants [2024-01-30 14:39:43,768 INFO L504 ceAbstractionStarter]: WitnessConsidered=22 [2024-01-30 14:39:43,769 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:39:43 BasicIcfg [2024-01-30 14:39:43,769 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-30 14:39:43,769 INFO L158 Benchmark]: Toolchain (without parser) took 4290.79ms. Allocated memory was 153.1MB in the beginning and 203.4MB in the end (delta: 50.3MB). Free memory was 121.5MB in the beginning and 129.2MB in the end (delta: -7.7MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2024-01-30 14:39:43,770 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 102.8MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:39:43,770 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 153.1MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:39:43,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 888.45ms. Allocated memory is still 153.1MB. Free memory was 121.0MB in the beginning and 59.1MB in the end (delta: 61.9MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-01-30 14:39:43,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.49ms. Allocated memory is still 153.1MB. Free memory was 59.1MB in the beginning and 55.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-30 14:39:43,771 INFO L158 Benchmark]: Boogie Preprocessor took 51.61ms. Allocated memory is still 153.1MB. Free memory was 55.3MB in the beginning and 51.3MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-30 14:39:43,771 INFO L158 Benchmark]: RCFGBuilder took 643.99ms. Allocated memory is still 153.1MB. Free memory was 51.3MB in the beginning and 81.3MB in the end (delta: -30.0MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-01-30 14:39:43,771 INFO L158 Benchmark]: TraceAbstraction took 2630.86ms. Allocated memory was 153.1MB in the beginning and 203.4MB in the end (delta: 50.3MB). Free memory was 80.8MB in the beginning and 129.2MB in the end (delta: -48.4MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2024-01-30 14:39:43,772 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 102.8MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 153.1MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 888.45ms. Allocated memory is still 153.1MB. Free memory was 121.0MB in the beginning and 59.1MB in the end (delta: 61.9MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.49ms. Allocated memory is still 153.1MB. Free memory was 59.1MB in the beginning and 55.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.61ms. Allocated memory is still 153.1MB. Free memory was 55.3MB in the beginning and 51.3MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 643.99ms. Allocated memory is still 153.1MB. Free memory was 51.3MB in the beginning and 81.3MB in the end (delta: -30.0MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2630.86ms. Allocated memory was 153.1MB in the beginning and 203.4MB in the end (delta: 50.3MB). Free memory was 80.8MB in the beginning and 129.2MB in the end (delta: -48.4MB). Peak memory consumption was 3.0MB. 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.5s, 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-01-30 14:39:43,809 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