/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:14:27,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:14:27,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:14:27,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:14:27,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:14:27,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:14:27,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:14:27,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:14:27,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:14:27,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:14:27,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:14:27,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:14:27,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:14:27,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:14:27,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:14:27,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:14:27,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:14:27,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:14:27,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:14:27,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:14:27,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:14:27,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:14:27,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:14:27,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:14:27,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:14:27,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:14:27,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:14:27,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:14:27,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:14:27,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:14:27,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:14:27,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:14:27,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:14:27,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:14:27,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:14:27,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:14:27,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:14:27,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:14:27,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:14:27,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:14:27,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:14:27,927 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:14:27,952 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:14:27,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:14:27,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:14:27,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:14:27,954 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:14:27,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:14:27,955 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:14:27,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:14:27,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:14:27,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:14:27,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:14:27,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:14:27,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:14:27,956 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:14:27,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:14:27,957 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:14:27,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:14:27,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:14:27,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:14:27,957 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:14:27,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:14:27,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:14:27,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:14:27,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:14:27,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:14:27,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:14:27,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:14:27,958 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:14:27,958 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-06 04:14:28,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:14:28,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:14:28,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:14:28,247 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:14:28,248 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:14:28,249 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2022-12-06 04:14:29,247 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:14:29,500 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:14:29,500 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2022-12-06 04:14:29,532 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba60eb66a/7fd77441b3ea4810bbf74fa8f2adc452/FLAG6715377c6 [2022-12-06 04:14:29,547 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba60eb66a/7fd77441b3ea4810bbf74fa8f2adc452 [2022-12-06 04:14:29,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:14:29,550 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:14:29,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:14:29,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:14:29,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:14:29,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:14:29" (1/1) ... [2022-12-06 04:14:29,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@540b112f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:29, skipping insertion in model container [2022-12-06 04:14:29,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:14:29" (1/1) ... [2022-12-06 04:14:29,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:14:29,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:14:29,715 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i[956,969] [2022-12-06 04:14:29,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:14:29,873 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:14:29,883 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i[956,969] [2022-12-06 04:14:29,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:14:29,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:14:29,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:14:29,959 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:14:29,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:29 WrapperNode [2022-12-06 04:14:29,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:14:29,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:14:29,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:14:29,960 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:14:29,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:29" (1/1) ... [2022-12-06 04:14:29,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:29" (1/1) ... [2022-12-06 04:14:29,999 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2022-12-06 04:14:30,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:14:30,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:14:30,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:14:30,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:14:30,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:29" (1/1) ... [2022-12-06 04:14:30,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:29" (1/1) ... [2022-12-06 04:14:30,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:29" (1/1) ... [2022-12-06 04:14:30,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:29" (1/1) ... [2022-12-06 04:14:30,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:29" (1/1) ... [2022-12-06 04:14:30,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:29" (1/1) ... [2022-12-06 04:14:30,017 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:29" (1/1) ... [2022-12-06 04:14:30,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:29" (1/1) ... [2022-12-06 04:14:30,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:14:30,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:14:30,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:14:30,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:14:30,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:29" (1/1) ... [2022-12-06 04:14:30,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:14:30,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:14:30,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:14:30,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:14:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:14:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:14:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:14:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:14:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:14:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:14:30,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:14:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:14:30,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:14:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:14:30,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:14:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:14:30,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:14:30,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:14:30,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:14:30,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:14:30,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:14:30,093 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:14:30,259 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:14:30,260 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:14:30,492 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:14:30,584 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:14:30,584 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:14:30,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:14:30 BoogieIcfgContainer [2022-12-06 04:14:30,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:14:30,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:14:30,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:14:30,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:14:30,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:14:29" (1/3) ... [2022-12-06 04:14:30,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539fb8f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:14:30, skipping insertion in model container [2022-12-06 04:14:30,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:29" (2/3) ... [2022-12-06 04:14:30,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539fb8f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:14:30, skipping insertion in model container [2022-12-06 04:14:30,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:14:30" (3/3) ... [2022-12-06 04:14:30,594 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i [2022-12-06 04:14:30,606 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:14:30,607 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:14:30,607 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:14:30,671 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:14:30,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2022-12-06 04:14:30,772 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-06 04:14:30,773 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:30,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-06 04:14:30,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2022-12-06 04:14:30,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2022-12-06 04:14:30,787 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:30,814 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-06 04:14:30,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2022-12-06 04:14:30,866 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-06 04:14:30,866 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:30,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-06 04:14:30,871 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-06 04:14:30,871 INFO L188 LiptonReduction]: Number of co-enabled transitions 2816 [2022-12-06 04:14:35,645 INFO L203 LiptonReduction]: Total number of compositions: 100 [2022-12-06 04:14:35,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:14:35,660 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=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@45c40237, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:14:35,661 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:14:35,664 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-06 04:14:35,664 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:35,664 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:35,665 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:35,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:35,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:35,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1028496597, now seen corresponding path program 1 times [2022-12-06 04:14:35,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:35,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524039917] [2022-12-06 04:14:35,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:35,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:36,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:36,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524039917] [2022-12-06 04:14:36,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524039917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:36,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:36,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:14:36,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050329961] [2022-12-06 04:14:36,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:36,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:14:36,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:36,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:14:36,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:14:36,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-06 04:14:36,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2022-12-06 04:14:36,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:36,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-06 04:14:36,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:36,540 INFO L130 PetriNetUnfolder]: 3113/4513 cut-off events. [2022-12-06 04:14:36,541 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 04:14:36,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8907 conditions, 4513 events. 3113/4513 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 23797 event pairs, 593 based on Foata normal form. 0/4149 useless extension candidates. Maximal degree in co-relation 8895. Up to 3385 conditions per place. [2022-12-06 04:14:36,565 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 30 selfloop transitions, 2 changer transitions 4/39 dead transitions. [2022-12-06 04:14:36,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 162 flow [2022-12-06 04:14:36,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:14:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:14:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 04:14:36,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 04:14:36,575 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 50 transitions. [2022-12-06 04:14:36,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 162 flow [2022-12-06 04:14:36,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:14:36,581 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 62 flow [2022-12-06 04:14:36,582 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-06 04:14:36,585 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2022-12-06 04:14:36,585 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:36,586 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 62 flow [2022-12-06 04:14:36,588 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:36,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:36,588 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 62 flow [2022-12-06 04:14:36,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 62 flow [2022-12-06 04:14:36,594 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-06 04:14:36,595 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:36,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:14:36,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 62 flow [2022-12-06 04:14:36,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 04:14:36,791 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:14:36,792 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 207 [2022-12-06 04:14:36,792 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 60 flow [2022-12-06 04:14:36,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2022-12-06 04:14:36,792 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:36,792 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:36,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:14:36,793 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:36,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:36,793 INFO L85 PathProgramCache]: Analyzing trace with hash -542678027, now seen corresponding path program 1 times [2022-12-06 04:14:36,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:36,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176711980] [2022-12-06 04:14:36,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:36,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:36,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:36,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176711980] [2022-12-06 04:14:36,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176711980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:36,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:36,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:14:36,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135529537] [2022-12-06 04:14:36,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:36,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:14:36,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:36,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:14:36,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:14:36,955 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 04:14:36,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2022-12-06 04:14:36,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:36,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 04:14:36,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:37,157 INFO L130 PetriNetUnfolder]: 1556/2308 cut-off events. [2022-12-06 04:14:37,157 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-12-06 04:14:37,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4711 conditions, 2308 events. 1556/2308 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 11245 event pairs, 440 based on Foata normal form. 36/2340 useless extension candidates. Maximal degree in co-relation 4701. Up to 1621 conditions per place. [2022-12-06 04:14:37,171 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 28 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-06 04:14:37,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 138 flow [2022-12-06 04:14:37,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:14:37,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:14:37,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 04:14:37,173 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 04:14:37,173 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 60 flow. Second operand 3 states and 40 transitions. [2022-12-06 04:14:37,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 138 flow [2022-12-06 04:14:37,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:14:37,175 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 64 flow [2022-12-06 04:14:37,175 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2022-12-06 04:14:37,176 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -6 predicate places. [2022-12-06 04:14:37,176 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:37,176 INFO L89 Accepts]: Start accepts. Operand has 36 places, 24 transitions, 64 flow [2022-12-06 04:14:37,176 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:37,177 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:37,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 24 transitions, 64 flow [2022-12-06 04:14:37,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 24 transitions, 64 flow [2022-12-06 04:14:37,182 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-06 04:14:37,182 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:37,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:14:37,183 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 24 transitions, 64 flow [2022-12-06 04:14:37,183 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 04:14:37,198 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:37,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 04:14:37,200 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 64 flow [2022-12-06 04:14:37,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2022-12-06 04:14:37,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:37,204 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:37,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:14:37,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:37,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:37,205 INFO L85 PathProgramCache]: Analyzing trace with hash 356851479, now seen corresponding path program 1 times [2022-12-06 04:14:37,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:37,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028579747] [2022-12-06 04:14:37,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:37,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:37,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:37,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028579747] [2022-12-06 04:14:37,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028579747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:37,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:37,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:14:37,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717781670] [2022-12-06 04:14:37,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:37,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:14:37,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:37,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:14:37,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:14:37,538 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 04:14:37,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-12-06 04:14:37,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:37,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 04:14:37,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:37,698 INFO L130 PetriNetUnfolder]: 1172/1730 cut-off events. [2022-12-06 04:14:37,698 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-12-06 04:14:37,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3798 conditions, 1730 events. 1172/1730 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7731 event pairs, 284 based on Foata normal form. 36/1763 useless extension candidates. Maximal degree in co-relation 3787. Up to 1542 conditions per place. [2022-12-06 04:14:37,707 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 32 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2022-12-06 04:14:37,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 179 flow [2022-12-06 04:14:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:14:37,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:14:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 04:14:37,710 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2022-12-06 04:14:37,710 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 64 flow. Second operand 3 states and 47 transitions. [2022-12-06 04:14:37,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 179 flow [2022-12-06 04:14:37,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 40 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:14:37,712 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 93 flow [2022-12-06 04:14:37,713 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2022-12-06 04:14:37,713 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2022-12-06 04:14:37,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:37,714 INFO L89 Accepts]: Start accepts. Operand has 37 places, 28 transitions, 93 flow [2022-12-06 04:14:37,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:37,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:37,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 28 transitions, 93 flow [2022-12-06 04:14:37,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 93 flow [2022-12-06 04:14:37,725 INFO L130 PetriNetUnfolder]: 45/120 cut-off events. [2022-12-06 04:14:37,725 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:14:37,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 120 events. 45/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 461 event pairs, 23 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 218. Up to 76 conditions per place. [2022-12-06 04:14:37,726 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 93 flow [2022-12-06 04:14:37,726 INFO L188 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-06 04:14:37,751 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:37,752 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 04:14:37,752 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 93 flow [2022-12-06 04:14:37,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-12-06 04:14:37,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:37,753 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:37,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:14:37,753 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:37,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:37,753 INFO L85 PathProgramCache]: Analyzing trace with hash -298077956, now seen corresponding path program 1 times [2022-12-06 04:14:37,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:37,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357793147] [2022-12-06 04:14:37,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:37,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:37,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:37,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:37,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357793147] [2022-12-06 04:14:37,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357793147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:37,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:37,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:37,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079772602] [2022-12-06 04:14:37,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:37,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:37,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:37,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:37,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:37,872 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 04:14:37,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2022-12-06 04:14:37,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:37,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 04:14:37,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:38,034 INFO L130 PetriNetUnfolder]: 680/1074 cut-off events. [2022-12-06 04:14:38,034 INFO L131 PetriNetUnfolder]: For 152/152 co-relation queries the response was YES. [2022-12-06 04:14:38,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2824 conditions, 1074 events. 680/1074 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4572 event pairs, 135 based on Foata normal form. 60/1131 useless extension candidates. Maximal degree in co-relation 2812. Up to 596 conditions per place. [2022-12-06 04:14:38,042 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 42 selfloop transitions, 9 changer transitions 0/54 dead transitions. [2022-12-06 04:14:38,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 267 flow [2022-12-06 04:14:38,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:14:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:14:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-06 04:14:38,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 04:14:38,044 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 93 flow. Second operand 4 states and 64 transitions. [2022-12-06 04:14:38,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 267 flow [2022-12-06 04:14:38,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:14:38,047 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 140 flow [2022-12-06 04:14:38,047 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2022-12-06 04:14:38,048 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-12-06 04:14:38,048 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:38,048 INFO L89 Accepts]: Start accepts. Operand has 40 places, 32 transitions, 140 flow [2022-12-06 04:14:38,050 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:38,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:38,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 32 transitions, 140 flow [2022-12-06 04:14:38,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 32 transitions, 140 flow [2022-12-06 04:14:38,062 INFO L130 PetriNetUnfolder]: 33/98 cut-off events. [2022-12-06 04:14:38,062 INFO L131 PetriNetUnfolder]: For 19/43 co-relation queries the response was YES. [2022-12-06 04:14:38,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 98 events. 33/98 cut-off events. For 19/43 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 314 event pairs, 7 based on Foata normal form. 3/98 useless extension candidates. Maximal degree in co-relation 244. Up to 60 conditions per place. [2022-12-06 04:14:38,063 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 32 transitions, 140 flow [2022-12-06 04:14:38,063 INFO L188 LiptonReduction]: Number of co-enabled transitions 394 [2022-12-06 04:14:38,067 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:38,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 04:14:38,075 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 140 flow [2022-12-06 04:14:38,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2022-12-06 04:14:38,076 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:38,076 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:38,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:14:38,076 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:38,076 INFO L85 PathProgramCache]: Analyzing trace with hash -508975555, now seen corresponding path program 1 times [2022-12-06 04:14:38,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:38,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062700753] [2022-12-06 04:14:38,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:38,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:38,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:38,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062700753] [2022-12-06 04:14:38,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062700753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:38,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:38,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:38,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484973302] [2022-12-06 04:14:38,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:38,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:38,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:38,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:38,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:38,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:14:38,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 140 flow. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) [2022-12-06 04:14:38,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:38,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:14:38,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:38,510 INFO L130 PetriNetUnfolder]: 1876/2876 cut-off events. [2022-12-06 04:14:38,510 INFO L131 PetriNetUnfolder]: For 2147/2147 co-relation queries the response was YES. [2022-12-06 04:14:38,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8375 conditions, 2876 events. 1876/2876 cut-off events. For 2147/2147 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 13507 event pairs, 231 based on Foata normal form. 39/2915 useless extension candidates. Maximal degree in co-relation 8361. Up to 1809 conditions per place. [2022-12-06 04:14:38,526 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 82 selfloop transitions, 11 changer transitions 0/93 dead transitions. [2022-12-06 04:14:38,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 93 transitions, 573 flow [2022-12-06 04:14:38,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:14:38,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:14:38,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 04:14:38,530 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 04:14:38,530 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 140 flow. Second operand 5 states and 72 transitions. [2022-12-06 04:14:38,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 93 transitions, 573 flow [2022-12-06 04:14:38,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 93 transitions, 527 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 04:14:38,538 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 199 flow [2022-12-06 04:14:38,538 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2022-12-06 04:14:38,540 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2022-12-06 04:14:38,540 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:38,540 INFO L89 Accepts]: Start accepts. Operand has 45 places, 41 transitions, 199 flow [2022-12-06 04:14:38,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:38,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:38,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 41 transitions, 199 flow [2022-12-06 04:14:38,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 199 flow [2022-12-06 04:14:38,580 INFO L130 PetriNetUnfolder]: 222/561 cut-off events. [2022-12-06 04:14:38,581 INFO L131 PetriNetUnfolder]: For 237/360 co-relation queries the response was YES. [2022-12-06 04:14:38,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 561 events. 222/561 cut-off events. For 237/360 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3543 event pairs, 55 based on Foata normal form. 23/552 useless extension candidates. Maximal degree in co-relation 1400. Up to 269 conditions per place. [2022-12-06 04:14:38,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 41 transitions, 199 flow [2022-12-06 04:14:38,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 542 [2022-12-06 04:14:38,589 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:38,591 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 04:14:38,591 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 199 flow [2022-12-06 04:14:38,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) [2022-12-06 04:14:38,591 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:38,591 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:38,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:14:38,591 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:38,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:38,592 INFO L85 PathProgramCache]: Analyzing trace with hash 189358635, now seen corresponding path program 2 times [2022-12-06 04:14:38,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:38,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103084015] [2022-12-06 04:14:38,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:38,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:38,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:38,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:38,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103084015] [2022-12-06 04:14:38,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103084015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:38,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:38,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:14:38,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305925860] [2022-12-06 04:14:38,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:38,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:14:38,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:38,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:14:38,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:14:38,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 04:14:38,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2022-12-06 04:14:38,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:38,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 04:14:38,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:38,915 INFO L130 PetriNetUnfolder]: 950/1556 cut-off events. [2022-12-06 04:14:38,916 INFO L131 PetriNetUnfolder]: For 1720/1841 co-relation queries the response was YES. [2022-12-06 04:14:38,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5000 conditions, 1556 events. 950/1556 cut-off events. For 1720/1841 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7736 event pairs, 153 based on Foata normal form. 166/1678 useless extension candidates. Maximal degree in co-relation 4983. Up to 555 conditions per place. [2022-12-06 04:14:38,924 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 61 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2022-12-06 04:14:38,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 518 flow [2022-12-06 04:14:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:14:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:14:38,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-06 04:14:38,926 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2022-12-06 04:14:38,926 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 199 flow. Second operand 5 states and 79 transitions. [2022-12-06 04:14:38,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 518 flow [2022-12-06 04:14:38,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 81 transitions, 518 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:14:38,928 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 267 flow [2022-12-06 04:14:38,929 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2022-12-06 04:14:38,929 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2022-12-06 04:14:38,929 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:38,929 INFO L89 Accepts]: Start accepts. Operand has 50 places, 45 transitions, 267 flow [2022-12-06 04:14:38,930 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:38,930 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:38,930 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 45 transitions, 267 flow [2022-12-06 04:14:38,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 45 transitions, 267 flow [2022-12-06 04:14:38,954 INFO L130 PetriNetUnfolder]: 145/363 cut-off events. [2022-12-06 04:14:38,954 INFO L131 PetriNetUnfolder]: For 468/619 co-relation queries the response was YES. [2022-12-06 04:14:38,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 363 events. 145/363 cut-off events. For 468/619 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1913 event pairs, 19 based on Foata normal form. 30/372 useless extension candidates. Maximal degree in co-relation 1165. Up to 173 conditions per place. [2022-12-06 04:14:38,957 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 45 transitions, 267 flow [2022-12-06 04:14:38,957 INFO L188 LiptonReduction]: Number of co-enabled transitions 536 [2022-12-06 04:14:38,959 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:38,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 04:14:38,960 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 267 flow [2022-12-06 04:14:38,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2022-12-06 04:14:38,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:38,960 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:38,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:14:38,960 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:38,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:38,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1933187434, now seen corresponding path program 1 times [2022-12-06 04:14:38,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:38,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90683419] [2022-12-06 04:14:38,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:38,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:39,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:39,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90683419] [2022-12-06 04:14:39,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90683419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:39,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:39,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:39,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899642631] [2022-12-06 04:14:39,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:39,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:39,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:39,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:39,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:39,075 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 04:14:39,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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) [2022-12-06 04:14:39,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:39,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 04:14:39,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:39,310 INFO L130 PetriNetUnfolder]: 1466/2370 cut-off events. [2022-12-06 04:14:39,311 INFO L131 PetriNetUnfolder]: For 4377/4438 co-relation queries the response was YES. [2022-12-06 04:14:39,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8793 conditions, 2370 events. 1466/2370 cut-off events. For 4377/4438 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12566 event pairs, 187 based on Foata normal form. 43/2378 useless extension candidates. Maximal degree in co-relation 8773. Up to 1149 conditions per place. [2022-12-06 04:14:39,324 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 61 selfloop transitions, 2 changer transitions 26/94 dead transitions. [2022-12-06 04:14:39,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 94 transitions, 758 flow [2022-12-06 04:14:39,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:14:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:14:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 04:14:39,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 04:14:39,326 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 267 flow. Second operand 4 states and 56 transitions. [2022-12-06 04:14:39,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 94 transitions, 758 flow [2022-12-06 04:14:39,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 94 transitions, 668 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-06 04:14:39,340 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 250 flow [2022-12-06 04:14:39,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2022-12-06 04:14:39,341 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2022-12-06 04:14:39,341 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:39,341 INFO L89 Accepts]: Start accepts. Operand has 52 places, 46 transitions, 250 flow [2022-12-06 04:14:39,342 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:39,342 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:39,342 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 46 transitions, 250 flow [2022-12-06 04:14:39,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 250 flow [2022-12-06 04:14:39,376 INFO L130 PetriNetUnfolder]: 220/549 cut-off events. [2022-12-06 04:14:39,376 INFO L131 PetriNetUnfolder]: For 573/707 co-relation queries the response was YES. [2022-12-06 04:14:39,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1563 conditions, 549 events. 220/549 cut-off events. For 573/707 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3382 event pairs, 28 based on Foata normal form. 44/562 useless extension candidates. Maximal degree in co-relation 1545. Up to 209 conditions per place. [2022-12-06 04:14:39,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 250 flow [2022-12-06 04:14:39,380 INFO L188 LiptonReduction]: Number of co-enabled transitions 534 [2022-12-06 04:14:39,537 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:14:39,538 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 04:14:39,538 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 253 flow [2022-12-06 04:14:39,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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) [2022-12-06 04:14:39,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:39,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:39,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:14:39,538 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:39,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:39,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1478467630, now seen corresponding path program 2 times [2022-12-06 04:14:39,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:39,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933368607] [2022-12-06 04:14:39,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:39,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:39,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:39,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933368607] [2022-12-06 04:14:39,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933368607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:39,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:39,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:14:39,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424439384] [2022-12-06 04:14:39,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:39,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:14:39,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:39,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:14:39,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:14:39,693 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 04:14:39,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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) [2022-12-06 04:14:39,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:39,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 04:14:39,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:39,916 INFO L130 PetriNetUnfolder]: 1224/1967 cut-off events. [2022-12-06 04:14:39,916 INFO L131 PetriNetUnfolder]: For 3085/3325 co-relation queries the response was YES. [2022-12-06 04:14:39,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6799 conditions, 1967 events. 1224/1967 cut-off events. For 3085/3325 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10514 event pairs, 155 based on Foata normal form. 164/2045 useless extension candidates. Maximal degree in co-relation 6778. Up to 721 conditions per place. [2022-12-06 04:14:39,932 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 54 selfloop transitions, 17 changer transitions 4/82 dead transitions. [2022-12-06 04:14:39,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 82 transitions, 557 flow [2022-12-06 04:14:39,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:14:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:14:39,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-12-06 04:14:39,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5533333333333333 [2022-12-06 04:14:39,933 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 253 flow. Second operand 6 states and 83 transitions. [2022-12-06 04:14:39,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 82 transitions, 557 flow [2022-12-06 04:14:39,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 82 transitions, 540 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:14:39,954 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 274 flow [2022-12-06 04:14:39,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=274, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2022-12-06 04:14:39,956 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2022-12-06 04:14:39,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:39,956 INFO L89 Accepts]: Start accepts. Operand has 56 places, 44 transitions, 274 flow [2022-12-06 04:14:39,959 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:39,959 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:39,959 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 44 transitions, 274 flow [2022-12-06 04:14:39,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 44 transitions, 274 flow [2022-12-06 04:14:39,979 INFO L130 PetriNetUnfolder]: 117/294 cut-off events. [2022-12-06 04:14:39,979 INFO L131 PetriNetUnfolder]: For 438/492 co-relation queries the response was YES. [2022-12-06 04:14:39,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 294 events. 117/294 cut-off events. For 438/492 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1554 event pairs, 11 based on Foata normal form. 1/277 useless extension candidates. Maximal degree in co-relation 985. Up to 99 conditions per place. [2022-12-06 04:14:39,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 44 transitions, 274 flow [2022-12-06 04:14:39,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 430 [2022-12-06 04:14:40,743 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:14:40,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 788 [2022-12-06 04:14:40,744 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 270 flow [2022-12-06 04:14:40,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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) [2022-12-06 04:14:40,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:40,745 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:40,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:14:40,745 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:40,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:40,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1864225456, now seen corresponding path program 1 times [2022-12-06 04:14:40,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:40,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047077227] [2022-12-06 04:14:40,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:40,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:40,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:40,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:40,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047077227] [2022-12-06 04:14:40,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047077227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:40,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:40,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:40,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049816473] [2022-12-06 04:14:40,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:40,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:40,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:40,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:40,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:40,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:14:40,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 270 flow. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2022-12-06 04:14:40,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:40,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:14:40,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:41,078 INFO L130 PetriNetUnfolder]: 1013/1625 cut-off events. [2022-12-06 04:14:41,078 INFO L131 PetriNetUnfolder]: For 3944/3944 co-relation queries the response was YES. [2022-12-06 04:14:41,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6601 conditions, 1625 events. 1013/1625 cut-off events. For 3944/3944 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7610 event pairs, 179 based on Foata normal form. 1/1626 useless extension candidates. Maximal degree in co-relation 6580. Up to 1169 conditions per place. [2022-12-06 04:14:41,085 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 72 selfloop transitions, 16 changer transitions 15/103 dead transitions. [2022-12-06 04:14:41,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 103 transitions, 850 flow [2022-12-06 04:14:41,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:14:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:14:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 04:14:41,086 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2022-12-06 04:14:41,086 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 270 flow. Second operand 5 states and 64 transitions. [2022-12-06 04:14:41,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 103 transitions, 850 flow [2022-12-06 04:14:41,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 103 transitions, 735 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-06 04:14:41,099 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 362 flow [2022-12-06 04:14:41,099 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=362, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2022-12-06 04:14:41,100 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-06 04:14:41,100 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:41,100 INFO L89 Accepts]: Start accepts. Operand has 54 places, 52 transitions, 362 flow [2022-12-06 04:14:41,100 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:41,101 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:41,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 52 transitions, 362 flow [2022-12-06 04:14:41,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 52 transitions, 362 flow [2022-12-06 04:14:41,124 INFO L130 PetriNetUnfolder]: 162/394 cut-off events. [2022-12-06 04:14:41,124 INFO L131 PetriNetUnfolder]: For 736/826 co-relation queries the response was YES. [2022-12-06 04:14:41,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 394 events. 162/394 cut-off events. For 736/826 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2288 event pairs, 7 based on Foata normal form. 23/395 useless extension candidates. Maximal degree in co-relation 1258. Up to 124 conditions per place. [2022-12-06 04:14:41,127 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 52 transitions, 362 flow [2022-12-06 04:14:41,127 INFO L188 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-06 04:14:41,144 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:14:41,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 04:14:41,145 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 362 flow [2022-12-06 04:14:41,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2022-12-06 04:14:41,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:41,145 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:41,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:14:41,145 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:41,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:41,146 INFO L85 PathProgramCache]: Analyzing trace with hash -411298542, now seen corresponding path program 2 times [2022-12-06 04:14:41,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:41,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346629931] [2022-12-06 04:14:41,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:41,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:41,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:41,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346629931] [2022-12-06 04:14:41,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346629931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:41,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:41,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:14:41,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773312549] [2022-12-06 04:14:41,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:41,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:14:41,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:41,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:14:41,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:14:41,274 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:14:41,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 362 flow. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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) [2022-12-06 04:14:41,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:41,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:14:41,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:41,499 INFO L130 PetriNetUnfolder]: 1201/1945 cut-off events. [2022-12-06 04:14:41,499 INFO L131 PetriNetUnfolder]: For 5300/5300 co-relation queries the response was YES. [2022-12-06 04:14:41,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8087 conditions, 1945 events. 1201/1945 cut-off events. For 5300/5300 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9613 event pairs, 250 based on Foata normal form. 1/1946 useless extension candidates. Maximal degree in co-relation 8063. Up to 1040 conditions per place. [2022-12-06 04:14:41,508 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 46 selfloop transitions, 5 changer transitions 57/108 dead transitions. [2022-12-06 04:14:41,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 108 transitions, 878 flow [2022-12-06 04:14:41,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:14:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:14:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-06 04:14:41,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:14:41,510 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 362 flow. Second operand 6 states and 66 transitions. [2022-12-06 04:14:41,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 108 transitions, 878 flow [2022-12-06 04:14:41,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 108 transitions, 876 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 04:14:41,530 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 258 flow [2022-12-06 04:14:41,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2022-12-06 04:14:41,530 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2022-12-06 04:14:41,530 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:41,530 INFO L89 Accepts]: Start accepts. Operand has 60 places, 40 transitions, 258 flow [2022-12-06 04:14:41,532 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:41,532 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:41,532 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 40 transitions, 258 flow [2022-12-06 04:14:41,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 40 transitions, 258 flow [2022-12-06 04:14:41,548 INFO L130 PetriNetUnfolder]: 92/243 cut-off events. [2022-12-06 04:14:41,548 INFO L131 PetriNetUnfolder]: For 644/682 co-relation queries the response was YES. [2022-12-06 04:14:41,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 243 events. 92/243 cut-off events. For 644/682 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1282 event pairs, 7 based on Foata normal form. 18/251 useless extension candidates. Maximal degree in co-relation 766. Up to 80 conditions per place. [2022-12-06 04:14:41,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 40 transitions, 258 flow [2022-12-06 04:14:41,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-06 04:14:41,585 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:14:41,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 04:14:41,587 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 261 flow [2022-12-06 04:14:41,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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) [2022-12-06 04:14:41,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:41,588 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:41,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:14:41,588 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:41,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:41,588 INFO L85 PathProgramCache]: Analyzing trace with hash 871706133, now seen corresponding path program 1 times [2022-12-06 04:14:41,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:41,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701760926] [2022-12-06 04:14:41,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:41,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:41,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:41,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:41,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701760926] [2022-12-06 04:14:41,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701760926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:41,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:41,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:14:41,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499638457] [2022-12-06 04:14:41,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:41,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:14:41,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:41,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:14:41,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:14:41,724 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 04:14:41,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2022-12-06 04:14:41,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:41,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 04:14:41,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:41,859 INFO L130 PetriNetUnfolder]: 476/853 cut-off events. [2022-12-06 04:14:41,859 INFO L131 PetriNetUnfolder]: For 3179/3197 co-relation queries the response was YES. [2022-12-06 04:14:41,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3658 conditions, 853 events. 476/853 cut-off events. For 3179/3197 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4249 event pairs, 73 based on Foata normal form. 5/851 useless extension candidates. Maximal degree in co-relation 3632. Up to 482 conditions per place. [2022-12-06 04:14:41,864 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 34 selfloop transitions, 1 changer transitions 40/77 dead transitions. [2022-12-06 04:14:41,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 77 transitions, 603 flow [2022-12-06 04:14:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:14:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:14:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 04:14:41,865 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2022-12-06 04:14:41,865 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 261 flow. Second operand 4 states and 50 transitions. [2022-12-06 04:14:41,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 77 transitions, 603 flow [2022-12-06 04:14:41,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 77 transitions, 589 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 04:14:41,875 INFO L231 Difference]: Finished difference. Result has 57 places, 32 transitions, 189 flow [2022-12-06 04:14:41,875 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=57, PETRI_TRANSITIONS=32} [2022-12-06 04:14:41,875 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2022-12-06 04:14:41,876 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:41,876 INFO L89 Accepts]: Start accepts. Operand has 57 places, 32 transitions, 189 flow [2022-12-06 04:14:41,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:41,876 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:41,876 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 32 transitions, 189 flow [2022-12-06 04:14:41,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 32 transitions, 189 flow [2022-12-06 04:14:41,884 INFO L130 PetriNetUnfolder]: 39/113 cut-off events. [2022-12-06 04:14:41,885 INFO L131 PetriNetUnfolder]: For 383/406 co-relation queries the response was YES. [2022-12-06 04:14:41,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 113 events. 39/113 cut-off events. For 383/406 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 444 event pairs, 5 based on Foata normal form. 10/117 useless extension candidates. Maximal degree in co-relation 354. Up to 36 conditions per place. [2022-12-06 04:14:41,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 32 transitions, 189 flow [2022-12-06 04:14:41,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 04:14:41,902 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:14:41,903 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 04:14:41,903 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 31 transitions, 187 flow [2022-12-06 04:14:41,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2022-12-06 04:14:41,903 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:41,903 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:41,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:14:41,903 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:41,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:41,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2018112473, now seen corresponding path program 1 times [2022-12-06 04:14:41,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:41,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381217751] [2022-12-06 04:14:41,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:41,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:14:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:14:42,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:14:42,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381217751] [2022-12-06 04:14:42,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381217751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:14:42,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:14:42,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:14:42,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782328335] [2022-12-06 04:14:42,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:14:42,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:14:42,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:14:42,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:14:42,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:14:42,185 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:14:42,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 31 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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) [2022-12-06 04:14:42,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:14:42,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:14:42,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:14:42,266 INFO L130 PetriNetUnfolder]: 147/297 cut-off events. [2022-12-06 04:14:42,266 INFO L131 PetriNetUnfolder]: For 1083/1083 co-relation queries the response was YES. [2022-12-06 04:14:42,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1293 conditions, 297 events. 147/297 cut-off events. For 1083/1083 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1266 event pairs, 19 based on Foata normal form. 1/296 useless extension candidates. Maximal degree in co-relation 1267. Up to 122 conditions per place. [2022-12-06 04:14:42,268 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 35 selfloop transitions, 4 changer transitions 20/60 dead transitions. [2022-12-06 04:14:42,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 494 flow [2022-12-06 04:14:42,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:14:42,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:14:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-12-06 04:14:42,269 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3157894736842105 [2022-12-06 04:14:42,269 INFO L175 Difference]: Start difference. First operand has 54 places, 31 transitions, 187 flow. Second operand 6 states and 36 transitions. [2022-12-06 04:14:42,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 494 flow [2022-12-06 04:14:42,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 484 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-06 04:14:42,271 INFO L231 Difference]: Finished difference. Result has 55 places, 31 transitions, 190 flow [2022-12-06 04:14:42,271 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=55, PETRI_TRANSITIONS=31} [2022-12-06 04:14:42,272 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2022-12-06 04:14:42,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:14:42,272 INFO L89 Accepts]: Start accepts. Operand has 55 places, 31 transitions, 190 flow [2022-12-06 04:14:42,272 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:14:42,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:14:42,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 31 transitions, 190 flow [2022-12-06 04:14:42,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 31 transitions, 190 flow [2022-12-06 04:14:42,281 INFO L130 PetriNetUnfolder]: 43/117 cut-off events. [2022-12-06 04:14:42,281 INFO L131 PetriNetUnfolder]: For 342/350 co-relation queries the response was YES. [2022-12-06 04:14:42,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 117 events. 43/117 cut-off events. For 342/350 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 483 event pairs, 5 based on Foata normal form. 4/117 useless extension candidates. Maximal degree in co-relation 386. Up to 40 conditions per place. [2022-12-06 04:14:42,282 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 31 transitions, 190 flow [2022-12-06 04:14:42,282 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 04:14:42,596 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [507] L865-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~z$w_buff0_used~0_284 256) 0))) (.cse0 (not (= (mod v_~z$r_buff1_thd0~0_123 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_121 256) 0)))) (let ((.cse2 (and (not (= (mod v_~z$w_buff0_used~0_285 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~z$w_buff1_used~0_249 256) 0)))) (.cse4 (and .cse5 .cse1))) (and (= v_~z$r_buff1_thd0~0_122 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_248 256) 0)) .cse0) (and (not (= (mod v_~z$r_buff0_thd0~0_120 256) 0)) .cse1)) 0 v_~z$r_buff1_thd0~0_123)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37| (mod v_~main$tmp_guard0~0_70 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_253 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_70) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_79 0) (= 0 v_~__unbuffered_p3_EBX~0_79) (= v_~__unbuffered_p2_EAX~0_105 0) (= v_~__unbuffered_p0_EAX~0_76 0) (= v_~__unbuffered_p3_EAX~0_87 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_62) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_43| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_43| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_61| 0) (= (ite .cse2 v_~z$w_buff0~0_199 (ite .cse3 v_~z$w_buff1~0_160 v_~z~0_219)) v_~z~0_218) (= v_~z$w_buff0_used~0_284 (ite .cse2 0 v_~z$w_buff0_used~0_285)) (= v_~z$r_buff0_thd0~0_120 (ite .cse4 0 v_~z$r_buff0_thd0~0_121)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_51| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_61|) (= (mod v_~main$tmp_guard1~0_62 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_51|) (= v_~z$w_buff1_used~0_248 (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_249))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_285, ~z$w_buff0~0=v_~z$w_buff0~0_199, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_249, ~z$w_buff1~0=v_~z$w_buff1~0_160, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_79, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_121, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_79, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_123, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_87, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_253, ~z~0=v_~z~0_219} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_61|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_284, ~z$w_buff0~0=v_~z$w_buff0~0_199, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_248, ~z$w_buff1~0=v_~z$w_buff1~0_160, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_70, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_59|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_120, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_51|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_79, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_43|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_87, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_253, ~z~0=v_~z~0_218, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [502] $Ultimate##0-->L831: Formula: (and (= v_~a~0_32 v_~__unbuffered_p3_EAX~0_76) (= v_~z$r_buff1_thd4~0_85 v_~z$r_buff0_thd4~0_107) (= v_~a~0_32 1) (= v_~z$w_buff0~0_150 v_~z$w_buff1~0_116) (= v_~z$w_buff0~0_149 1) (= |v_P3Thread1of1ForFork2_~arg#1.offset_21| |v_P3Thread1of1ForFork2_#in~arg#1.offset_21|) (= |v_P3Thread1of1ForFork2_~arg#1.base_21| |v_P3Thread1of1ForFork2_#in~arg#1.base_21|) (= v_~z$r_buff0_thd4~0_106 1) (= v_~z$r_buff0_thd3~0_100 v_~z$r_buff1_thd3~0_114) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_25| 0)) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_219 256) 0)) (not (= (mod v_~z$w_buff1_used~0_190 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_25|) (= v_~z$r_buff0_thd2~0_39 v_~z$r_buff1_thd2~0_45) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_25| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_25|) (= v_~z$w_buff0_used~0_220 v_~z$w_buff1_used~0_190) (= v_~z$r_buff0_thd0~0_96 v_~z$r_buff1_thd0~0_98) (= v_~z$r_buff0_thd1~0_39 v_~z$r_buff1_thd1~0_45) (= v_~z$w_buff0_used~0_219 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_96, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_220, ~z$w_buff0~0=v_~z$w_buff0~0_150, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_21|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_21|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_107, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_39} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_85, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_219, ~z$w_buff0~0=v_~z$w_buff0~0_149, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_114, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_21|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_45, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_190, ~z$w_buff1~0=v_~z$w_buff1~0_116, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_25|, ~a~0=v_~a~0_32, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_25|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_96, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_21|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_21|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_98, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_45, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_21|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_106, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_39} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] [2022-12-06 04:14:42,897 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:14:42,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 625 [2022-12-06 04:14:42,898 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 31 transitions, 219 flow [2022-12-06 04:14:42,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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) [2022-12-06 04:14:42,898 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:14:42,898 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:42,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:14:42,898 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:14:42,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:14:42,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1394587105, now seen corresponding path program 1 times [2022-12-06 04:14:42,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:14:42,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854938800] [2022-12-06 04:14:42,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:14:42,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:14:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:14:42,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:14:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:14:43,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:14:43,003 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:14:43,003 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:14:43,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:14:43,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:14:43,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:14:43,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:14:43,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:14:43,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:14:43,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:14:43,005 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:14:43,009 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:14:43,009 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:14:43,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:14:43 BasicIcfg [2022-12-06 04:14:43,080 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:14:43,080 INFO L158 Benchmark]: Toolchain (without parser) took 13530.01ms. Allocated memory was 188.7MB in the beginning and 374.3MB in the end (delta: 185.6MB). Free memory was 164.0MB in the beginning and 173.8MB in the end (delta: -9.7MB). Peak memory consumption was 177.2MB. Max. memory is 8.0GB. [2022-12-06 04:14:43,080 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory was 165.8MB in the beginning and 165.7MB in the end (delta: 64.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:14:43,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.57ms. Allocated memory is still 188.7MB. Free memory was 163.8MB in the beginning and 136.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:14:43,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.53ms. Allocated memory is still 188.7MB. Free memory was 136.5MB in the beginning and 133.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:14:43,081 INFO L158 Benchmark]: Boogie Preprocessor took 19.76ms. Allocated memory is still 188.7MB. Free memory was 133.9MB in the beginning and 131.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:14:43,081 INFO L158 Benchmark]: RCFGBuilder took 568.37ms. Allocated memory is still 188.7MB. Free memory was 131.8MB in the beginning and 100.1MB in the end (delta: 31.7MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 04:14:43,081 INFO L158 Benchmark]: TraceAbstraction took 12489.32ms. Allocated memory was 188.7MB in the beginning and 374.3MB in the end (delta: 185.6MB). Free memory was 99.3MB in the beginning and 173.8MB in the end (delta: -74.5MB). Peak memory consumption was 112.2MB. Max. memory is 8.0GB. [2022-12-06 04:14:43,082 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory was 165.8MB in the beginning and 165.7MB in the end (delta: 64.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 407.57ms. Allocated memory is still 188.7MB. Free memory was 163.8MB in the beginning and 136.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.53ms. Allocated memory is still 188.7MB. Free memory was 136.5MB in the beginning and 133.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.76ms. Allocated memory is still 188.7MB. Free memory was 133.9MB in the beginning and 131.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 568.37ms. Allocated memory is still 188.7MB. Free memory was 131.8MB in the beginning and 100.1MB in the end (delta: 31.7MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 12489.32ms. Allocated memory was 188.7MB in the beginning and 374.3MB in the end (delta: 185.6MB). Free memory was 99.3MB in the beginning and 173.8MB in the end (delta: -74.5MB). Peak memory consumption was 112.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 138 PlacesBefore, 42 PlacesAfterwards, 127 TransitionsBefore, 30 TransitionsAfterwards, 2816 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 45 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 100 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2206, independent: 2146, independent conditional: 2146, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2206, independent: 2146, independent conditional: 0, independent unconditional: 2146, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2206, independent: 2146, independent conditional: 0, independent unconditional: 2146, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2206, independent: 2146, independent conditional: 0, independent unconditional: 2146, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1758, independent: 1721, independent conditional: 0, independent unconditional: 1721, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1758, independent: 1704, independent conditional: 0, independent unconditional: 1704, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 158, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2206, independent: 425, independent conditional: 0, independent unconditional: 425, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 1758, unknown conditional: 0, unknown unconditional: 1758] , Statistics on independence cache: Total cache size (in pairs): 2784, Positive cache size: 2747, Positive conditional cache size: 0, Positive unconditional cache size: 2747, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 36 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 292, independent: 247, independent conditional: 247, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 292, independent: 247, independent conditional: 10, independent unconditional: 237, dependent: 45, dependent conditional: 4, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 292, independent: 247, independent conditional: 10, independent unconditional: 237, dependent: 45, dependent conditional: 4, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 292, independent: 247, independent conditional: 10, independent unconditional: 237, dependent: 45, dependent conditional: 4, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 139, independent: 121, independent conditional: 7, independent unconditional: 114, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 139, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 85, dependent conditional: 37, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 292, independent: 126, independent conditional: 3, independent unconditional: 123, dependent: 27, dependent conditional: 1, dependent unconditional: 26, unknown: 139, unknown conditional: 10, unknown unconditional: 129] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 121, Positive conditional cache size: 7, Positive unconditional cache size: 114, Negative cache size: 18, Negative conditional cache size: 3, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 132, independent: 112, independent conditional: 112, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 132, independent: 112, independent conditional: 4, independent unconditional: 108, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 132, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 132, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 128, Positive conditional cache size: 7, Positive unconditional cache size: 121, Negative cache size: 20, Negative conditional cache size: 3, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 130, independent: 112, independent conditional: 112, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 130, independent: 112, independent conditional: 18, independent unconditional: 94, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 130, independent: 112, independent conditional: 18, independent unconditional: 94, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 130, independent: 112, independent conditional: 18, independent unconditional: 94, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 4, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 130, independent: 98, independent conditional: 14, independent unconditional: 84, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 16, unknown conditional: 4, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 142, Positive conditional cache size: 11, Positive unconditional cache size: 131, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, independent: 133, independent conditional: 133, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 155, independent: 133, independent conditional: 32, independent unconditional: 101, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 155, independent: 133, independent conditional: 32, independent unconditional: 101, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 155, independent: 133, independent conditional: 32, independent unconditional: 101, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 155, independent: 133, independent conditional: 32, independent unconditional: 101, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 142, Positive conditional cache size: 11, Positive unconditional cache size: 131, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 542 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123, independent: 113, independent conditional: 113, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123, independent: 113, independent conditional: 44, independent unconditional: 69, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 123, independent: 113, independent conditional: 19, independent unconditional: 94, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 123, independent: 113, independent conditional: 19, independent unconditional: 94, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 123, independent: 111, independent conditional: 19, independent unconditional: 92, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 144, Positive conditional cache size: 11, Positive unconditional cache size: 133, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 536 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, independent: 126, independent conditional: 126, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 138, independent: 126, independent conditional: 64, independent unconditional: 62, dependent: 12, dependent conditional: 3, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 138, independent: 126, independent conditional: 33, independent unconditional: 93, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 138, independent: 126, independent conditional: 33, independent unconditional: 93, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, independent: 125, independent conditional: 33, independent unconditional: 92, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 145, Positive conditional cache size: 11, Positive unconditional cache size: 134, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 52 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 534 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 247, independent: 229, independent conditional: 229, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 247, independent: 229, independent conditional: 118, independent unconditional: 111, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 247, independent: 229, independent conditional: 78, independent unconditional: 151, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 247, independent: 229, independent conditional: 78, independent unconditional: 151, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 247, independent: 220, independent conditional: 75, independent unconditional: 145, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 9, unknown conditional: 3, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 164, Positive conditional cache size: 14, Positive unconditional cache size: 150, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 55 PlacesBefore, 52 PlacesAfterwards, 44 TransitionsBefore, 41 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 267, independent: 251, independent conditional: 251, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 267, independent: 251, independent conditional: 135, independent unconditional: 116, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 267, independent: 251, independent conditional: 88, independent unconditional: 163, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 267, independent: 251, independent conditional: 88, independent unconditional: 163, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 267, independent: 249, independent conditional: 86, independent unconditional: 163, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 192, Positive conditional cache size: 16, Positive unconditional cache size: 176, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 47, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 90, independent conditional: 66, independent unconditional: 24, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, independent: 90, independent conditional: 42, independent unconditional: 48, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, independent: 90, independent conditional: 42, independent unconditional: 48, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, independent: 90, independent conditional: 42, independent unconditional: 48, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 192, Positive conditional cache size: 16, Positive unconditional cache size: 176, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 56 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, independent: 100, independent conditional: 100, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 108, independent: 100, independent conditional: 58, independent unconditional: 42, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, independent: 100, independent conditional: 50, independent unconditional: 50, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, independent: 100, independent conditional: 50, independent unconditional: 50, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, independent: 100, independent conditional: 50, independent unconditional: 50, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 230, Positive conditional cache size: 16, Positive unconditional cache size: 214, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 54 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 43, independent: 33, independent conditional: 25, independent unconditional: 8, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, independent: 33, independent conditional: 25, independent unconditional: 8, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, independent: 33, independent conditional: 25, independent unconditional: 8, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, independent: 28, independent conditional: 22, independent unconditional: 6, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 246, Positive conditional cache size: 19, Positive unconditional cache size: 227, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 54 PlacesBefore, 54 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 44, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 256, Positive conditional cache size: 19, Positive unconditional cache size: 237, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L858] 0 pthread_t t949; [L859] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t949, ((void *)0), P0, ((void *)0))=-3, t949={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t950; [L861] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t950, ((void *)0), P1, ((void *)0))=-2, t949={5:0}, t950={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t951; [L863] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t951, ((void *)0), P2, ((void *)0))=-1, t949={5:0}, t950={6:0}, t951={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 pthread_t t952; [L865] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t952, ((void *)0), P3, ((void *)0))=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L818] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L818] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 4 z$r_buff0_thd4 = (_Bool)1 [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 b = 1 [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 x = 1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 y = 1 [L789] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 __unbuffered_p2_EAX = z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 3 return 0; [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L836] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 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: 12.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 347 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 347 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 839 IncrementalHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 16 mSDtfsCounter, 839 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=362occurred in iteration=9, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 848 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:14:43,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...