./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-1_2-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_2-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_2-join.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/race-1_2-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:34,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-30 14:39:34,895 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:34,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-30 14:39:34,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-30 14:39:34,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-30 14:39:34,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-30 14:39:34,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-30 14:39:34,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-30 14:39:34,931 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-30 14:39:34,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-30 14:39:34,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-30 14:39:34,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-30 14:39:34,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-30 14:39:34,934 INFO L153 SettingsManager]: * Use SBE=true [2024-01-30 14:39:34,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-30 14:39:34,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-30 14:39:34,935 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-30 14:39:34,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-30 14:39:34,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-30 14:39:34,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-30 14:39:34,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-30 14:39:34,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-30 14:39:34,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-30 14:39:34,936 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-30 14:39:34,937 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-30 14:39:34,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-30 14:39:34,937 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-30 14:39:34,938 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-30 14:39:34,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-30 14:39:34,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-30 14:39:34,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-30 14:39:34,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:39:34,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-30 14:39:34,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-30 14:39:34,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-30 14:39:34,940 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-30 14:39:34,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-30 14:39:34,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-30 14:39:34,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-30 14:39:34,940 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-30 14:39:34,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-30 14:39:34,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-30 14:39:34,941 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:35,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-30 14:39:35,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-30 14:39:35,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-30 14:39:35,178 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-30 14:39:35,178 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-30 14:39:35,179 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_2-join.yml/witness.yml [2024-01-30 14:39:35,311 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-30 14:39:35,312 INFO L274 PluginConnector]: CDTParser initialized [2024-01-30 14:39:35,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-1_2-join.i [2024-01-30 14:39:36,354 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-30 14:39:36,613 INFO L384 CDTParser]: Found 1 translation units. [2024-01-30 14:39:36,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_2-join.i [2024-01-30 14:39:36,635 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72cc57833/75f706855ae84c8889a93e69a5a1cf38/FLAG1f02199d1 [2024-01-30 14:39:36,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72cc57833/75f706855ae84c8889a93e69a5a1cf38 [2024-01-30 14:39:36,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-30 14:39:36,646 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-30 14:39:36,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-30 14:39:36,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-30 14:39:36,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-30 14:39:36,653 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:35" (1/2) ... [2024-01-30 14:39:36,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@344dfe91 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:39:36, skipping insertion in model container [2024-01-30 14:39:36,654 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:35" (1/2) ... [2024-01-30 14:39:36,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@336842cb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:39:36, skipping insertion in model container [2024-01-30 14:39:36,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:39:36" (2/2) ... [2024-01-30 14:39:36,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@344dfe91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:39:36, skipping insertion in model container [2024-01-30 14:39:36,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:39:36" (2/2) ... [2024-01-30 14:39:36,659 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-30 14:39:36,767 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-30 14:39:36,768 INFO L98 nessWitnessExtractor]: Location invariant before [L1708-L1708] pdev == 0 [2024-01-30 14:39:36,769 INFO L98 nessWitnessExtractor]: Location invariant before [L1705-L1705] (unsigned long )arg == 0UL [2024-01-30 14:39:36,769 INFO L98 nessWitnessExtractor]: Location invariant before [L1718-L1718] (((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && (pdev != 0)) && (((pdev == 1 || pdev == 2) || pdev == 5) || pdev == 6) [2024-01-30 14:39:36,769 INFO L98 nessWitnessExtractor]: Location invariant before [L1700-L1700] (unsigned long )arg == 0UL [2024-01-30 14:39:36,769 INFO L98 nessWitnessExtractor]: Location invariant before [L1721-L1721] pdev == 1 [2024-01-30 14:39:36,770 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 == 2) || pdev == 5) || pdev == 6) [2024-01-30 14:39:36,770 INFO L98 nessWitnessExtractor]: Location invariant before [L1701-L1701] (unsigned long )arg == 0UL [2024-01-30 14:39:36,770 INFO L98 nessWitnessExtractor]: Location invariant before [L1710-L1710] pdev == 1 [2024-01-30 14:39:36,770 INFO L98 nessWitnessExtractor]: Location invariant before [L1712-L1712] pdev == 1 [2024-01-30 14:39:36,770 INFO L98 nessWitnessExtractor]: Location invariant before [L1709-L1709] pdev == 0 [2024-01-30 14:39:36,770 INFO L98 nessWitnessExtractor]: Location invariant before [L1729-L1729] (unsigned long )status == 0UL [2024-01-30 14:39:36,771 INFO L98 nessWitnessExtractor]: Location invariant before [L1715-L1715] (((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && (pdev != 0)) && (((pdev == 1 || pdev == 2) || pdev == 5) || pdev == 6) [2024-01-30 14:39:36,771 INFO L98 nessWitnessExtractor]: Location invariant before [L1723-L1723] pdev == 3 [2024-01-30 14:39:36,771 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 == 2) || pdev == 5) || pdev == 6) [2024-01-30 14:39:36,771 INFO L98 nessWitnessExtractor]: Location invariant before [L1695-L1695] ((((((((((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 == 2) || pdev == 5) || pdev == 6))) && (expression == 0)) && (expression == 1) [2024-01-30 14:39:36,771 INFO L98 nessWitnessExtractor]: Location invariant before [L1722-L1722] pdev == 3 [2024-01-30 14:39:36,771 INFO L98 nessWitnessExtractor]: Location invariant before [L1711-L1720] pdev == 1 [2024-01-30 14:39:36,771 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L22] pdev == 1 [2024-01-30 14:39:36,772 INFO L98 nessWitnessExtractor]: Location invariant before [L1717-L1717] (((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && (pdev != 0)) && (((pdev == 1 || pdev == 2) || pdev == 5) || pdev == 6) [2024-01-30 14:39:36,772 INFO L98 nessWitnessExtractor]: Location invariant before [L1724-L1724] pdev == 3 [2024-01-30 14:39:36,772 INFO L98 nessWitnessExtractor]: Location invariant before [L1731-L1731] (unsigned long )status == 0UL [2024-01-30 14:39:36,772 INFO L98 nessWitnessExtractor]: Location invariant before [L1730-L1730] (unsigned long )status == 0UL [2024-01-30 14:39:36,772 INFO L98 nessWitnessExtractor]: Location invariant before [L1714-L1714] (((((0 <= pdev) && (1 <= pdev)) && (pdev <= 6)) && (pdev <= 127)) && (pdev != 0)) && (((pdev == 1 || pdev == 2) || pdev == 5) || pdev == 6) [2024-01-30 14:39:36,773 INFO L98 nessWitnessExtractor]: Location invariant after [L1726-L1732] (unsigned long )status == 0UL [2024-01-30 14:39:36,773 INFO L98 nessWitnessExtractor]: Location invariant before [L1704-L1704] (unsigned long )arg == 0UL [2024-01-30 14:39:36,816 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-30 14:39:37,333 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_2-join.i[76153,76166] [2024-01-30 14:39:37,364 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:39:37,377 INFO L202 MainTranslator]: Completed pre-run [2024-01-30 14:39:37,385 WARN L424 MainDispatcher]: Unable to annotate typedef unsigned int __mode_t; with a witness entry [2024-01-30 14:39:37,426 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_2-join.i[76153,76166] [2024-01-30 14:39:37,427 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:37,490 WARN L424 MainDispatcher]: Unable to annotate void module_exit() { void *status; pthread_join(t1, &status); pthread_mutex_destroy(&mutex); pdev = 5; ldv_assert(pdev==5); } with a witness entry [2024-01-30 14:39:37,490 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:39:37,592 INFO L206 MainTranslator]: Completed translation [2024-01-30 14:39:37,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:39:37 WrapperNode [2024-01-30 14:39:37,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-30 14:39:37,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-30 14:39:37,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-30 14:39:37,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-30 14:39:37,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:39:37" (1/1) ... [2024-01-30 14:39:37,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:39:37" (1/1) ... [2024-01-30 14:39:37,671 INFO L138 Inliner]: procedures = 483, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-01-30 14:39:37,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-30 14:39:37,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-30 14:39:37,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-30 14:39:37,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-30 14:39:37,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:39:37" (1/1) ... [2024-01-30 14:39:37,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:39:37" (1/1) ... [2024-01-30 14:39:37,697 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:39:37" (1/1) ... [2024-01-30 14:39:37,713 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:37,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:39:37" (1/1) ... [2024-01-30 14:39:37,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:39:37" (1/1) ... [2024-01-30 14:39:37,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:39:37" (1/1) ... [2024-01-30 14:39:37,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:39:37" (1/1) ... [2024-01-30 14:39:37,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:39:37" (1/1) ... [2024-01-30 14:39:37,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:39:37" (1/1) ... [2024-01-30 14:39:37,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-30 14:39:37,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-30 14:39:37,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-30 14:39:37,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-30 14:39:37,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:39:37" (1/1) ... [2024-01-30 14:39:37,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:39:37,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:39:37,901 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:37,910 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:37,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-30 14:39:37,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-30 14:39:37,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-30 14:39:37,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-30 14:39:37,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-30 14:39:37,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-30 14:39:37,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-30 14:39:37,937 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-30 14:39:37,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-30 14:39:37,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-01-30 14:39:37,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-01-30 14:39:37,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-01-30 14:39:37,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-01-30 14:39:37,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-30 14:39:37,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-30 14:39:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-30 14:39:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-01-30 14:39:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-01-30 14:39:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-01-30 14:39:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-01-30 14:39:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-30 14:39:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-30 14:39:37,938 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-30 14:39:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-30 14:39:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-30 14:39:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-30 14:39:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-30 14:39:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-30 14:39:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-30 14:39:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-30 14:39:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-30 14:39:37,941 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:38,157 INFO L244 CfgBuilder]: Building ICFG [2024-01-30 14:39:38,160 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-30 14:39:38,379 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-30 14:39:38,379 INFO L293 CfgBuilder]: Performing block encoding [2024-01-30 14:39:38,543 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-30 14:39:38,543 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-30 14:39:38,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:39:38 BoogieIcfgContainer [2024-01-30 14:39:38,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-30 14:39:38,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-30 14:39:38,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-30 14:39:38,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-30 14:39:38,550 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:35" (1/4) ... [2024-01-30 14:39:38,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd3f489 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:39:38, skipping insertion in model container [2024-01-30 14:39:38,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:39:36" (2/4) ... [2024-01-30 14:39:38,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd3f489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:39:38, skipping insertion in model container [2024-01-30 14:39:38,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:39:37" (3/4) ... [2024-01-30 14:39:38,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd3f489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:39:38, skipping insertion in model container [2024-01-30 14:39:38,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:39:38" (4/4) ... [2024-01-30 14:39:38,553 INFO L112 eAbstractionObserver]: Analyzing ICFG race-1_2-join.i [2024-01-30 14:39:38,568 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-30 14:39:38,568 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-01-30 14:39:38,568 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-30 14:39:38,600 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-30 14:39:38,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 75 transitions, 157 flow [2024-01-30 14:39:38,656 INFO L124 PetriNetUnfolderBase]: 4/78 cut-off events. [2024-01-30 14:39:38,657 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-30 14:39:38,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 78 events. 4/78 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 178 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 35. Up to 3 conditions per place. [2024-01-30 14:39:38,659 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 75 transitions, 157 flow [2024-01-30 14:39:38,663 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 70 transitions, 146 flow [2024-01-30 14:39:38,676 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-30 14:39:38,683 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;@172f32e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-30 14:39:38,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2024-01-30 14:39:38,686 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-30 14:39:38,686 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-30 14:39:38,686 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:39:38,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:38,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-30 14:39:38,687 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:38,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:38,692 INFO L85 PathProgramCache]: Analyzing trace with hash 12147, now seen corresponding path program 1 times [2024-01-30 14:39:38,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:38,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455739363] [2024-01-30 14:39:38,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:38,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:39,016 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:39,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:39,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455739363] [2024-01-30 14:39:39,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455739363] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:39,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:39,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:39:39,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147115401] [2024-01-30 14:39:39,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:39,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:39:39,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:39,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:39:39,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:39:39,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2024-01-30 14:39:39,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 146 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:39,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:39,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2024-01-30 14:39:39,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:39,189 INFO L124 PetriNetUnfolderBase]: 50/168 cut-off events. [2024-01-30 14:39:39,189 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-30 14:39:39,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 168 events. 50/168 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 766 event pairs, 50 based on Foata normal form. 2/121 useless extension candidates. Maximal degree in co-relation 246. Up to 133 conditions per place. [2024-01-30 14:39:39,194 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 32 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-01-30 14:39:39,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 63 transitions, 200 flow [2024-01-30 14:39:39,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:39:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:39:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2024-01-30 14:39:39,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5955555555555555 [2024-01-30 14:39:39,207 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 146 flow. Second operand 3 states and 134 transitions. [2024-01-30 14:39:39,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 63 transitions, 200 flow [2024-01-30 14:39:39,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:39:39,213 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 132 flow [2024-01-30 14:39:39,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-01-30 14:39:39,219 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2024-01-30 14:39:39,219 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 132 flow [2024-01-30 14:39:39,219 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:39,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:39,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-30 14:39:39,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-30 14:39:39,220 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:39,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:39,224 INFO L85 PathProgramCache]: Analyzing trace with hash 11685302, now seen corresponding path program 1 times [2024-01-30 14:39:39,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:39,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648938428] [2024-01-30 14:39:39,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:39,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:39,306 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:39,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:39,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648938428] [2024-01-30 14:39:39,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648938428] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:39,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:39,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:39:39,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758047481] [2024-01-30 14:39:39,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:39,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:39:39,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:39,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:39:39,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:39:39,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2024-01-30 14:39:39,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 132 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:39,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:39,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2024-01-30 14:39:39,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:39,430 INFO L124 PetriNetUnfolderBase]: 47/192 cut-off events. [2024-01-30 14:39:39,431 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:39:39,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 192 events. 47/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 824 event pairs, 39 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 315. Up to 114 conditions per place. [2024-01-30 14:39:39,433 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 35 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2024-01-30 14:39:39,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 64 transitions, 212 flow [2024-01-30 14:39:39,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:39:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:39:39,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2024-01-30 14:39:39,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5822222222222222 [2024-01-30 14:39:39,438 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 132 flow. Second operand 3 states and 131 transitions. [2024-01-30 14:39:39,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 64 transitions, 212 flow [2024-01-30 14:39:39,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:39:39,440 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 142 flow [2024-01-30 14:39:39,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2024-01-30 14:39:39,441 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2024-01-30 14:39:39,441 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 142 flow [2024-01-30 14:39:39,441 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:39,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:39,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-30 14:39:39,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-30 14:39:39,442 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:39,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:39,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1655315749, now seen corresponding path program 1 times [2024-01-30 14:39:39,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:39,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652954621] [2024-01-30 14:39:39,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:39,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:39,525 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:39,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:39,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652954621] [2024-01-30 14:39:39,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652954621] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:39,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:39,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:39:39,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490118588] [2024-01-30 14:39:39,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:39,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:39:39,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:39,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:39:39,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:39:39,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 75 [2024-01-30 14:39:39,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 142 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:39,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:39,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 75 [2024-01-30 14:39:39,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:39,621 INFO L124 PetriNetUnfolderBase]: 47/183 cut-off events. [2024-01-30 14:39:39,621 INFO L125 PetriNetUnfolderBase]: For 13/16 co-relation queries the response was YES. [2024-01-30 14:39:39,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 183 events. 47/183 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 806 event pairs, 25 based on Foata normal form. 2/146 useless extension candidates. Maximal degree in co-relation 176. Up to 114 conditions per place. [2024-01-30 14:39:39,623 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 34 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2024-01-30 14:39:39,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 60 transitions, 224 flow [2024-01-30 14:39:39,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:39:39,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:39:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2024-01-30 14:39:39,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.424 [2024-01-30 14:39:39,625 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 142 flow. Second operand 5 states and 159 transitions. [2024-01-30 14:39:39,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 60 transitions, 224 flow [2024-01-30 14:39:39,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:39:39,626 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 146 flow [2024-01-30 14:39:39,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2024-01-30 14:39:39,627 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2024-01-30 14:39:39,627 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 146 flow [2024-01-30 14:39:39,628 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:39,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:39,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:39:39,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-30 14:39:39,628 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-01-30 14:39:39,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:39,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1813892166, now seen corresponding path program 1 times [2024-01-30 14:39:39,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:39,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526251370] [2024-01-30 14:39:39,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:39,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:39,663 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:39,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:39,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526251370] [2024-01-30 14:39:39,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526251370] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:39,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:39,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:39:39,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464735509] [2024-01-30 14:39:39,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:39,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:39:39,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:39,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:39:39,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:39:39,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 75 [2024-01-30 14:39:39,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 146 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:39,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:39,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 75 [2024-01-30 14:39:39,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:39,754 INFO L124 PetriNetUnfolderBase]: 47/176 cut-off events. [2024-01-30 14:39:39,754 INFO L125 PetriNetUnfolderBase]: For 21/24 co-relation queries the response was YES. [2024-01-30 14:39:39,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 176 events. 47/176 cut-off events. For 21/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 769 event pairs, 44 based on Foata normal form. 2/137 useless extension candidates. Maximal degree in co-relation 175. Up to 125 conditions per place. [2024-01-30 14:39:39,756 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 31 selfloop transitions, 0 changer transitions 6/54 dead transitions. [2024-01-30 14:39:39,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 212 flow [2024-01-30 14:39:39,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:39:39,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:39:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2024-01-30 14:39:39,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5644444444444444 [2024-01-30 14:39:39,757 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 146 flow. Second operand 3 states and 127 transitions. [2024-01-30 14:39:39,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 54 transitions, 212 flow [2024-01-30 14:39:39,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 198 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-30 14:39:39,759 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 112 flow [2024-01-30 14:39:39,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2024-01-30 14:39:39,760 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2024-01-30 14:39:39,760 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 112 flow [2024-01-30 14:39:39,760 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:39,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:39,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:39:39,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-30 14:39:39,761 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:39,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:39,761 INFO L85 PathProgramCache]: Analyzing trace with hash -607700066, now seen corresponding path program 1 times [2024-01-30 14:39:39,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:39,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884758087] [2024-01-30 14:39:39,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:39,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:39,863 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:39,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:39,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884758087] [2024-01-30 14:39:39,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884758087] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:39,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:39,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:39:39,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421888850] [2024-01-30 14:39:39,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:39,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:39:39,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:39,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:39:39,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:39:39,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2024-01-30 14:39:39,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 112 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:39,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:39,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2024-01-30 14:39:39,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:39,938 INFO L124 PetriNetUnfolderBase]: 56/179 cut-off events. [2024-01-30 14:39:39,938 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-01-30 14:39:39,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 179 events. 56/179 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 688 event pairs, 22 based on Foata normal form. 31/183 useless extension candidates. Maximal degree in co-relation 344. Up to 124 conditions per place. [2024-01-30 14:39:39,939 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 39 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-01-30 14:39:39,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 206 flow [2024-01-30 14:39:39,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:39:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:39:39,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-01-30 14:39:39,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53 [2024-01-30 14:39:39,941 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 112 flow. Second operand 4 states and 159 transitions. [2024-01-30 14:39:39,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 206 flow [2024-01-30 14:39:39,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 206 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-30 14:39:39,942 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 108 flow [2024-01-30 14:39:39,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2024-01-30 14:39:39,943 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -22 predicate places. [2024-01-30 14:39:39,943 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 108 flow [2024-01-30 14:39:39,943 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:39,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:39,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:39:39,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-30 14:39:39,957 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-01-30 14:39:39,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:39,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1658881191, now seen corresponding path program 1 times [2024-01-30 14:39:39,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:39,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801479202] [2024-01-30 14:39:39,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:39,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:40,024 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:40,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:40,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801479202] [2024-01-30 14:39:40,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801479202] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:40,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:40,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:39:40,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149362944] [2024-01-30 14:39:40,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:40,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:39:40,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:40,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:39:40,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:39:40,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2024-01-30 14:39:40,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:40,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:40,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2024-01-30 14:39:40,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:40,090 INFO L124 PetriNetUnfolderBase]: 51/178 cut-off events. [2024-01-30 14:39:40,090 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-01-30 14:39:40,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 178 events. 51/178 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 748 event pairs, 21 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 342. Up to 77 conditions per place. [2024-01-30 14:39:40,092 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 37 selfloop transitions, 5 changer transitions 2/57 dead transitions. [2024-01-30 14:39:40,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 223 flow [2024-01-30 14:39:40,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:39:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:39:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2024-01-30 14:39:40,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.64 [2024-01-30 14:39:40,093 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 108 flow. Second operand 3 states and 144 transitions. [2024-01-30 14:39:40,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 223 flow [2024-01-30 14:39:40,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:39:40,095 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 137 flow [2024-01-30 14:39:40,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-01-30 14:39:40,096 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -20 predicate places. [2024-01-30 14:39:40,096 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 137 flow [2024-01-30 14:39:40,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:40,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:40,096 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:40,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-30 14:39:40,097 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:40,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:40,097 INFO L85 PathProgramCache]: Analyzing trace with hash -383215295, now seen corresponding path program 1 times [2024-01-30 14:39:40,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:40,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675737113] [2024-01-30 14:39:40,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:40,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:40,181 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:40,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:40,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675737113] [2024-01-30 14:39:40,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675737113] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:40,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:40,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:39:40,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843265025] [2024-01-30 14:39:40,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:40,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:39:40,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:40,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:39:40,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:39:40,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2024-01-30 14:39:40,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 137 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:40,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:40,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2024-01-30 14:39:40,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:40,284 INFO L124 PetriNetUnfolderBase]: 85/244 cut-off events. [2024-01-30 14:39:40,284 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2024-01-30 14:39:40,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 244 events. 85/244 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 953 event pairs, 64 based on Foata normal form. 2/224 useless extension candidates. Maximal degree in co-relation 550. Up to 196 conditions per place. [2024-01-30 14:39:40,286 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 39 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2024-01-30 14:39:40,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 246 flow [2024-01-30 14:39:40,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:39:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:39:40,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-01-30 14:39:40,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42333333333333334 [2024-01-30 14:39:40,287 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 137 flow. Second operand 4 states and 127 transitions. [2024-01-30 14:39:40,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 246 flow [2024-01-30 14:39:40,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 232 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-30 14:39:40,289 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 153 flow [2024-01-30 14:39:40,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2024-01-30 14:39:40,290 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -17 predicate places. [2024-01-30 14:39:40,290 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 153 flow [2024-01-30 14:39:40,290 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:40,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:40,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:39:40,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-30 14:39:40,291 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-01-30 14:39:40,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:40,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1744309958, now seen corresponding path program 1 times [2024-01-30 14:39:40,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:40,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907322679] [2024-01-30 14:39:40,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:40,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:40,372 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:40,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:40,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907322679] [2024-01-30 14:39:40,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907322679] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:40,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:40,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:39:40,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131280844] [2024-01-30 14:39:40,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:40,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:39:40,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:40,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:39:40,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:39:40,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-01-30 14:39:40,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:39:40,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:40,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-01-30 14:39:40,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:40,494 INFO L124 PetriNetUnfolderBase]: 110/321 cut-off events. [2024-01-30 14:39:40,494 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-01-30 14:39:40,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 321 events. 110/321 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1454 event pairs, 22 based on Foata normal form. 6/297 useless extension candidates. Maximal degree in co-relation 709. Up to 109 conditions per place. [2024-01-30 14:39:40,496 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 50 selfloop transitions, 12 changer transitions 4/75 dead transitions. [2024-01-30 14:39:40,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 348 flow [2024-01-30 14:39:40,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:39:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:39:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2024-01-30 14:39:40,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-01-30 14:39:40,497 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 153 flow. Second operand 4 states and 165 transitions. [2024-01-30 14:39:40,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 348 flow [2024-01-30 14:39:40,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:39:40,499 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 211 flow [2024-01-30 14:39:40,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2024-01-30 14:39:40,500 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2024-01-30 14:39:40,500 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 211 flow [2024-01-30 14:39:40,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:39:40,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:40,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:39:40,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-30 14:39:40,501 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:40,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:40,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1948490708, now seen corresponding path program 2 times [2024-01-30 14:39:40,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:40,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820852980] [2024-01-30 14:39:40,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:40,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:40,573 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:40,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:40,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820852980] [2024-01-30 14:39:40,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820852980] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:40,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:40,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:39:40,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151397453] [2024-01-30 14:39:40,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:40,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:39:40,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:40,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:39:40,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:39:40,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-01-30 14:39:40,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 211 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:39:40,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:40,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-01-30 14:39:40,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:40,679 INFO L124 PetriNetUnfolderBase]: 118/342 cut-off events. [2024-01-30 14:39:40,679 INFO L125 PetriNetUnfolderBase]: For 288/296 co-relation queries the response was YES. [2024-01-30 14:39:40,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 342 events. 118/342 cut-off events. For 288/296 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1609 event pairs, 28 based on Foata normal form. 12/326 useless extension candidates. Maximal degree in co-relation 883. Up to 135 conditions per place. [2024-01-30 14:39:40,681 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 46 selfloop transitions, 10 changer transitions 6/71 dead transitions. [2024-01-30 14:39:40,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 381 flow [2024-01-30 14:39:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:39:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:39:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2024-01-30 14:39:40,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2024-01-30 14:39:40,683 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 211 flow. Second operand 4 states and 155 transitions. [2024-01-30 14:39:40,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 381 flow [2024-01-30 14:39:40,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 357 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-01-30 14:39:40,685 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 230 flow [2024-01-30 14:39:40,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2024-01-30 14:39:40,686 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2024-01-30 14:39:40,686 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 230 flow [2024-01-30 14:39:40,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:39:40,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:40,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:39:40,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-30 14:39:40,687 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-01-30 14:39:40,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:40,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1948489868, now seen corresponding path program 1 times [2024-01-30 14:39:40,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:40,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141859295] [2024-01-30 14:39:40,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:40,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:39:40,774 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:40,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:39:40,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141859295] [2024-01-30 14:39:40,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141859295] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:39:40,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:39:40,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:39:40,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63889617] [2024-01-30 14:39:40,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:39:40,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:39:40,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:39:40,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:39:40,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:39:40,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2024-01-30 14:39:40,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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:40,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:39:40,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2024-01-30 14:39:40,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:39:40,837 INFO L124 PetriNetUnfolderBase]: 48/188 cut-off events. [2024-01-30 14:39:40,837 INFO L125 PetriNetUnfolderBase]: For 324/338 co-relation queries the response was YES. [2024-01-30 14:39:40,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 188 events. 48/188 cut-off events. For 324/338 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 749 event pairs, 18 based on Foata normal form. 11/192 useless extension candidates. Maximal degree in co-relation 497. Up to 97 conditions per place. [2024-01-30 14:39:40,839 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 35 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2024-01-30 14:39:40,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 57 transitions, 313 flow [2024-01-30 14:39:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:39:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:39:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2024-01-30 14:39:40,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6044444444444445 [2024-01-30 14:39:40,840 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 230 flow. Second operand 3 states and 136 transitions. [2024-01-30 14:39:40,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 57 transitions, 313 flow [2024-01-30 14:39:40,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:39:40,842 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 222 flow [2024-01-30 14:39:40,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-01-30 14:39:40,843 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -16 predicate places. [2024-01-30 14:39:40,843 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 222 flow [2024-01-30 14:39:40,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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:40,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:39:40,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:39:40,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-30 14:39:40,844 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 30 more)] === [2024-01-30 14:39:40,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:39:40,844 INFO L85 PathProgramCache]: Analyzing trace with hash -831922988, now seen corresponding path program 1 times [2024-01-30 14:39:40,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:39:40,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928647087] [2024-01-30 14:39:40,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:39:40,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:39:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:39:40,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-30 14:39:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:39:40,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-30 14:39:40,888 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-30 14:39:40,889 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (32 of 33 remaining) [2024-01-30 14:39:40,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 33 remaining) [2024-01-30 14:39:40,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 33 remaining) [2024-01-30 14:39:40,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 33 remaining) [2024-01-30 14:39:40,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 33 remaining) [2024-01-30 14:39:40,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 33 remaining) [2024-01-30 14:39:40,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 33 remaining) [2024-01-30 14:39:40,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 33 remaining) [2024-01-30 14:39:40,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 33 remaining) [2024-01-30 14:39:40,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 33 remaining) [2024-01-30 14:39:40,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (22 of 33 remaining) [2024-01-30 14:39:40,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 33 remaining) [2024-01-30 14:39:40,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 33 remaining) [2024-01-30 14:39:40,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 33 remaining) [2024-01-30 14:39:40,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 33 remaining) [2024-01-30 14:39:40,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 33 remaining) [2024-01-30 14:39:40,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 33 remaining) [2024-01-30 14:39:40,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (15 of 33 remaining) [2024-01-30 14:39:40,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 33 remaining) [2024-01-30 14:39:40,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 33 remaining) [2024-01-30 14:39:40,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 33 remaining) [2024-01-30 14:39:40,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 33 remaining) [2024-01-30 14:39:40,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 33 remaining) [2024-01-30 14:39:40,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 33 remaining) [2024-01-30 14:39:40,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 33 remaining) [2024-01-30 14:39:40,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (7 of 33 remaining) [2024-01-30 14:39:40,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 33 remaining) [2024-01-30 14:39:40,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 33 remaining) [2024-01-30 14:39:40,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 33 remaining) [2024-01-30 14:39:40,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 33 remaining) [2024-01-30 14:39:40,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 33 remaining) [2024-01-30 14:39:40,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 33 remaining) [2024-01-30 14:39:40,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 33 remaining) [2024-01-30 14:39:40,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-30 14:39:40,896 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:39:40,901 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-30 14:39:40,902 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-30 14:39:40,920 INFO L503 ceAbstractionStarter]: Automizer considered 22 witness invariants [2024-01-30 14:39:40,920 INFO L504 ceAbstractionStarter]: WitnessConsidered=22 [2024-01-30 14:39:40,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:39:40 BasicIcfg [2024-01-30 14:39:40,921 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-30 14:39:40,921 INFO L158 Benchmark]: Toolchain (without parser) took 4274.95ms. Allocated memory was 174.1MB in the beginning and 253.8MB in the end (delta: 79.7MB). Free memory was 97.4MB in the beginning and 175.5MB in the end (delta: -78.1MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2024-01-30 14:39:40,922 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 174.1MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:39:40,922 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:39:40,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 946.05ms. Allocated memory is still 174.1MB. Free memory was 97.2MB in the beginning and 95.0MB in the end (delta: 2.2MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-01-30 14:39:40,922 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.02ms. Allocated memory is still 174.1MB. Free memory was 95.0MB in the beginning and 91.0MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-30 14:39:40,922 INFO L158 Benchmark]: Boogie Preprocessor took 83.92ms. Allocated memory is still 174.1MB. Free memory was 91.0MB in the beginning and 87.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-30 14:39:40,923 INFO L158 Benchmark]: RCFGBuilder took 787.74ms. Allocated memory is still 174.1MB. Free memory was 86.8MB in the beginning and 129.1MB in the end (delta: -42.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-01-30 14:39:40,923 INFO L158 Benchmark]: TraceAbstraction took 2374.38ms. Allocated memory was 174.1MB in the beginning and 253.8MB in the end (delta: 79.7MB). Free memory was 129.1MB in the beginning and 175.5MB in the end (delta: -46.4MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-01-30 14:39:40,924 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.17ms. Allocated memory is still 174.1MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 946.05ms. Allocated memory is still 174.1MB. Free memory was 97.2MB in the beginning and 95.0MB in the end (delta: 2.2MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.02ms. Allocated memory is still 174.1MB. Free memory was 95.0MB in the beginning and 91.0MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.92ms. Allocated memory is still 174.1MB. Free memory was 91.0MB in the beginning and 87.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 787.74ms. Allocated memory is still 174.1MB. Free memory was 86.8MB in the beginning and 129.1MB in the end (delta: -42.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2374.38ms. Allocated memory was 174.1MB in the beginning and 253.8MB in the end (delta: 79.7MB). Free memory was 129.1MB in the beginning and 175.5MB in the end (delta: -46.4MB). Peak memory consumption was 33.1MB. 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 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}] [L1714] 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[2]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] [L1714] 0 pdev = 2 [L1715] 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[2]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] VAL [arg={0:0}, mutex={4:0}, pdev=2, t1={3:0}] [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=2, 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=2, 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[2]]],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[2]]],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}] [L1717] 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[2]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[pdev],IntegerLiteral[6]]]]]] [L1717] CALL 0 ldv_assert(pdev==2) [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: 1721]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1722]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1714]: 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: 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: 1718]: 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: 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.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 476 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 924 IncrementalHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 62 mSDtfsCounter, 924 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=9, InterpolantAutomatonStates: 36, 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.6s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:40,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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