/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:16:46,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:16:46,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:16:46,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:16:46,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:16:46,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:16:46,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:16:46,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:16:46,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:16:46,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:16:46,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:16:46,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:16:46,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:16:46,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:16:46,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:16:46,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:16:46,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:16:46,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:16:46,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:16:46,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:16:46,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:16:46,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:16:46,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:16:46,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:16:46,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:16:46,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:16:46,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:16:46,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:16:46,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:16:46,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:16:46,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:16:46,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:16:46,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:16:46,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:16:46,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:16:46,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:16:46,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:16:46,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:16:46,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:16:46,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:16:46,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:16:46,728 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:16:46,758 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:16:46,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:16:46,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:16:46,761 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:16:46,761 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:16:46,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:16:46,762 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:16:46,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:16:46,762 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:16:46,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:16:46,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:16:46,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:16:46,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:16:46,763 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:16:46,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:16:46,763 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:16:46,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:16:46,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:16:46,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:16:46,764 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:16:46,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:16:46,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:16:46,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:16:46,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:16:46,765 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:16:46,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:16:46,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:16:46,765 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:16:46,765 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 06:16:47,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:16:47,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:16:47,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:16:47,064 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:16:47,065 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:16:47,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2022-12-06 06:16:48,086 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:16:48,390 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:16:48,390 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2022-12-06 06:16:48,410 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09268d78f/1c75bd23efc848889a64853bbc3fb919/FLAGb26959551 [2022-12-06 06:16:48,440 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09268d78f/1c75bd23efc848889a64853bbc3fb919 [2022-12-06 06:16:48,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:16:48,443 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:16:48,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:16:48,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:16:48,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:16:48,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:48,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65149aa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48, skipping insertion in model container [2022-12-06 06:16:48,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:48,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:16:48,512 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:16:48,670 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/mix005_tso.oepc.i[949,962] [2022-12-06 06:16:48,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:16:48,894 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:16:48,905 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/mix005_tso.oepc.i[949,962] [2022-12-06 06:16:48,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:16:48,990 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:16:48,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48 WrapperNode [2022-12-06 06:16:48,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:16:48,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:16:48,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:16:48,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:16:49,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:49,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:49,037 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2022-12-06 06:16:49,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:16:49,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:16:49,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:16:49,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:16:49,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:49,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:49,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:49,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:49,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:49,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:49,070 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:49,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:49,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:16:49,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:16:49,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:16:49,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:16:49,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:49,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:16:49,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:16:49,108 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 06:16:49,119 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 06:16:49,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:16:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:16:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:16:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:16:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:16:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:16:49,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:16:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:16:49,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:16:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:16:49,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:16:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:16:49,144 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:16:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:16:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:16:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:16:49,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:16:49,145 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 06:16:49,299 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:16:49,300 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:16:49,632 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:16:49,741 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:16:49,741 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:16:49,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:16:49 BoogieIcfgContainer [2022-12-06 06:16:49,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:16:49,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:16:49,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:16:49,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:16:49,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:16:48" (1/3) ... [2022-12-06 06:16:49,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61051092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:16:49, skipping insertion in model container [2022-12-06 06:16:49,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (2/3) ... [2022-12-06 06:16:49,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61051092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:16:49, skipping insertion in model container [2022-12-06 06:16:49,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:16:49" (3/3) ... [2022-12-06 06:16:49,749 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2022-12-06 06:16:49,763 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:16:49,763 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:16:49,764 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:16:49,847 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:16:49,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-12-06 06:16:49,938 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-06 06:16:49,938 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:49,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 06:16:49,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2022-12-06 06:16:49,945 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2022-12-06 06:16:49,960 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:49,983 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-06 06:16:49,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2022-12-06 06:16:50,032 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-06 06:16:50,032 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:50,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 06:16:50,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-06 06:16:50,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 3272 [2022-12-06 06:16:54,433 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-06 06:16:54,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:16:54,451 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;@49a977cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:16:54,452 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:16:54,455 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 06:16:54,455 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:54,455 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:54,456 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:16:54,456 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:16:54,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash 530054900, now seen corresponding path program 1 times [2022-12-06 06:16:54,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:54,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747617268] [2022-12-06 06:16:54,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:54,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:54,736 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 06:16:54,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:54,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747617268] [2022-12-06 06:16:54,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747617268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:54,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:54,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:16:54,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879832735] [2022-12-06 06:16:54,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:54,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:16:54,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:54,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:16:54,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:16:54,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2022-12-06 06:16:54,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 06:16:54,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:54,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2022-12-06 06:16:54,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:55,745 INFO L130 PetriNetUnfolder]: 5631/7917 cut-off events. [2022-12-06 06:16:55,746 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-06 06:16:55,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15765 conditions, 7917 events. 5631/7917 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 42116 event pairs, 2088 based on Foata normal form. 0/7256 useless extension candidates. Maximal degree in co-relation 15753. Up to 6124 conditions per place. [2022-12-06 06:16:55,840 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 39 selfloop transitions, 2 changer transitions 8/55 dead transitions. [2022-12-06 06:16:55,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 226 flow [2022-12-06 06:16:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-06 06:16:55,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2022-12-06 06:16:55,851 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 86 flow. Second operand 3 states and 72 transitions. [2022-12-06 06:16:55,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 226 flow [2022-12-06 06:16:55,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:16:55,856 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 72 flow [2022-12-06 06:16:55,858 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2022-12-06 06:16:55,861 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2022-12-06 06:16:55,861 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:55,862 INFO L89 Accepts]: Start accepts. Operand has 45 places, 30 transitions, 72 flow [2022-12-06 06:16:55,864 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:55,864 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:55,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 30 transitions, 72 flow [2022-12-06 06:16:55,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 72 flow [2022-12-06 06:16:55,872 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-12-06 06:16:55,873 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:55,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:16:55,873 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 72 flow [2022-12-06 06:16:55,873 INFO L188 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-06 06:16:56,193 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:16:56,196 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 335 [2022-12-06 06:16:56,196 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2022-12-06 06:16:56,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 06:16:56,196 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:56,197 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:56,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:16:56,201 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:16:56,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:56,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1333124522, now seen corresponding path program 1 times [2022-12-06 06:16:56,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:56,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032393175] [2022-12-06 06:16:56,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:56,570 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 06:16:56,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:56,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032393175] [2022-12-06 06:16:56,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032393175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:56,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:56,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:16:56,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52590879] [2022-12-06 06:16:56,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:56,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:16:56,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:56,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:16:56,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:16:56,576 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 06:16:56,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 06:16:56,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:56,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 06:16:56,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:58,086 INFO L130 PetriNetUnfolder]: 10649/14310 cut-off events. [2022-12-06 06:16:58,086 INFO L131 PetriNetUnfolder]: For 727/727 co-relation queries the response was YES. [2022-12-06 06:16:58,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29716 conditions, 14310 events. 10649/14310 cut-off events. For 727/727 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 67652 event pairs, 3089 based on Foata normal form. 300/14610 useless extension candidates. Maximal degree in co-relation 29706. Up to 10611 conditions per place. [2022-12-06 06:16:58,163 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 44 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2022-12-06 06:16:58,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 200 flow [2022-12-06 06:16:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 06:16:58,166 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2022-12-06 06:16:58,166 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 47 transitions. [2022-12-06 06:16:58,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 200 flow [2022-12-06 06:16:58,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:58,170 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 74 flow [2022-12-06 06:16:58,170 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2022-12-06 06:16:58,171 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -8 predicate places. [2022-12-06 06:16:58,171 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:58,171 INFO L89 Accepts]: Start accepts. Operand has 41 places, 29 transitions, 74 flow [2022-12-06 06:16:58,172 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:58,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:58,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 74 flow [2022-12-06 06:16:58,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 74 flow [2022-12-06 06:16:58,176 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-06 06:16:58,176 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:58,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:16:58,178 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 29 transitions, 74 flow [2022-12-06 06:16:58,178 INFO L188 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-06 06:16:58,218 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:16:58,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 06:16:58,220 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 72 flow [2022-12-06 06:16:58,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 06:16:58,222 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:58,226 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:58,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:16:58,226 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:16:58,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:58,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1726575300, now seen corresponding path program 1 times [2022-12-06 06:16:58,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:58,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219039494] [2022-12-06 06:16:58,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:58,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:58,566 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 06:16:58,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:58,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219039494] [2022-12-06 06:16:58,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219039494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:58,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:58,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:16:58,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661004241] [2022-12-06 06:16:58,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:58,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:16:58,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:58,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:16:58,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:16:58,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:16:58,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 72 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 06:16:58,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:58,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:16:58,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:59,809 INFO L130 PetriNetUnfolder]: 8454/11415 cut-off events. [2022-12-06 06:16:59,810 INFO L131 PetriNetUnfolder]: For 940/940 co-relation queries the response was YES. [2022-12-06 06:16:59,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24547 conditions, 11415 events. 8454/11415 cut-off events. For 940/940 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 50910 event pairs, 2914 based on Foata normal form. 200/11615 useless extension candidates. Maximal degree in co-relation 24536. Up to 7741 conditions per place. [2022-12-06 06:16:59,875 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 40 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2022-12-06 06:16:59,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 187 flow [2022-12-06 06:16:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:59,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 06:16:59,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2022-12-06 06:16:59,877 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 72 flow. Second operand 3 states and 43 transitions. [2022-12-06 06:16:59,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 187 flow [2022-12-06 06:16:59,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 181 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:59,880 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 76 flow [2022-12-06 06:16:59,880 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-06 06:16:59,881 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -8 predicate places. [2022-12-06 06:16:59,881 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:59,881 INFO L89 Accepts]: Start accepts. Operand has 41 places, 28 transitions, 76 flow [2022-12-06 06:16:59,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:59,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:59,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 76 flow [2022-12-06 06:16:59,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 28 transitions, 76 flow [2022-12-06 06:16:59,886 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 06:16:59,887 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:16:59,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 28 events. 0/28 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:16:59,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 76 flow [2022-12-06 06:16:59,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-06 06:16:59,918 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:16:59,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 06:16:59,920 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 74 flow [2022-12-06 06:16:59,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 06:16:59,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:59,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:59,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:16:59,920 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:16:59,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:59,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1984288721, now seen corresponding path program 1 times [2022-12-06 06:16:59,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:59,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529439879] [2022-12-06 06:16:59,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:59,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:00,287 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 06:17:00,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:00,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529439879] [2022-12-06 06:17:00,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529439879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:00,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:00,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:17:00,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955589832] [2022-12-06 06:17:00,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:00,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:17:00,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:00,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:17:00,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:17:00,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:17:00,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 06:17:00,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:00,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:17:00,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:00,808 INFO L130 PetriNetUnfolder]: 3506/4945 cut-off events. [2022-12-06 06:17:00,808 INFO L131 PetriNetUnfolder]: For 758/758 co-relation queries the response was YES. [2022-12-06 06:17:00,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11086 conditions, 4945 events. 3506/4945 cut-off events. For 758/758 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 23525 event pairs, 1754 based on Foata normal form. 18/4949 useless extension candidates. Maximal degree in co-relation 11074. Up to 4534 conditions per place. [2022-12-06 06:17:00,839 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 38 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2022-12-06 06:17:00,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 200 flow [2022-12-06 06:17:00,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:17:00,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:17:00,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 06:17:00,842 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-06 06:17:00,842 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 74 flow. Second operand 3 states and 51 transitions. [2022-12-06 06:17:00,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 200 flow [2022-12-06 06:17:00,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:17:00,844 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 89 flow [2022-12-06 06:17:00,845 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2022-12-06 06:17:00,845 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -8 predicate places. [2022-12-06 06:17:00,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:00,845 INFO L89 Accepts]: Start accepts. Operand has 41 places, 29 transitions, 89 flow [2022-12-06 06:17:00,846 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:00,846 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:00,846 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 89 flow [2022-12-06 06:17:00,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 89 flow [2022-12-06 06:17:00,852 INFO L130 PetriNetUnfolder]: 3/39 cut-off events. [2022-12-06 06:17:00,853 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 06:17:00,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 39 events. 3/39 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 62. Up to 10 conditions per place. [2022-12-06 06:17:00,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 29 transitions, 89 flow [2022-12-06 06:17:00,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 430 [2022-12-06 06:17:00,879 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:00,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 06:17:00,881 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 89 flow [2022-12-06 06:17:00,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 06:17:00,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:00,881 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:00,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:17:00,881 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:00,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:00,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1383405917, now seen corresponding path program 1 times [2022-12-06 06:17:00,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:00,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16947706] [2022-12-06 06:17:00,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:00,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:01,363 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 06:17:01,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:01,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16947706] [2022-12-06 06:17:01,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16947706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:01,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:01,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:17:01,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82457182] [2022-12-06 06:17:01,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:01,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:17:01,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:01,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:17:01,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:17:01,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:17:01,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 06:17:01,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:01,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:17:01,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:01,854 INFO L130 PetriNetUnfolder]: 3734/5451 cut-off events. [2022-12-06 06:17:01,854 INFO L131 PetriNetUnfolder]: For 1351/1351 co-relation queries the response was YES. [2022-12-06 06:17:01,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12640 conditions, 5451 events. 3734/5451 cut-off events. For 1351/1351 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 29805 event pairs, 712 based on Foata normal form. 18/5461 useless extension candidates. Maximal degree in co-relation 12627. Up to 4478 conditions per place. [2022-12-06 06:17:01,885 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 49 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2022-12-06 06:17:01,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 277 flow [2022-12-06 06:17:01,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:17:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:17:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 06:17:01,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-06 06:17:01,890 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 89 flow. Second operand 4 states and 69 transitions. [2022-12-06 06:17:01,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 277 flow [2022-12-06 06:17:01,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:17:01,896 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 125 flow [2022-12-06 06:17:01,896 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-12-06 06:17:01,898 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2022-12-06 06:17:01,898 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:01,898 INFO L89 Accepts]: Start accepts. Operand has 44 places, 33 transitions, 125 flow [2022-12-06 06:17:01,899 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:01,899 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:01,899 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 125 flow [2022-12-06 06:17:01,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 125 flow [2022-12-06 06:17:01,915 INFO L130 PetriNetUnfolder]: 64/155 cut-off events. [2022-12-06 06:17:01,915 INFO L131 PetriNetUnfolder]: For 150/169 co-relation queries the response was YES. [2022-12-06 06:17:01,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 155 events. 64/155 cut-off events. For 150/169 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 648 event pairs, 34 based on Foata normal form. 3/144 useless extension candidates. Maximal degree in co-relation 368. Up to 98 conditions per place. [2022-12-06 06:17:01,916 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 125 flow [2022-12-06 06:17:01,916 INFO L188 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-06 06:17:01,972 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:01,974 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 06:17:01,975 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 125 flow [2022-12-06 06:17:01,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 06:17:01,975 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:01,975 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:01,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:17:01,975 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:01,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:01,976 INFO L85 PathProgramCache]: Analyzing trace with hash -897467352, now seen corresponding path program 1 times [2022-12-06 06:17:01,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:01,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295313851] [2022-12-06 06:17:01,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:01,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:02,246 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 06:17:02,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:02,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295313851] [2022-12-06 06:17:02,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295313851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:02,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:02,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:17:02,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604166995] [2022-12-06 06:17:02,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:02,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:17:02,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:02,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:17:02,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:17:02,248 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:17:02,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 06:17:02,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:02,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:17:02,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:02,760 INFO L130 PetriNetUnfolder]: 3864/5664 cut-off events. [2022-12-06 06:17:02,760 INFO L131 PetriNetUnfolder]: For 3321/3369 co-relation queries the response was YES. [2022-12-06 06:17:02,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14796 conditions, 5664 events. 3864/5664 cut-off events. For 3321/3369 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 30936 event pairs, 571 based on Foata normal form. 49/5697 useless extension candidates. Maximal degree in co-relation 14781. Up to 4257 conditions per place. [2022-12-06 06:17:02,789 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 53 selfloop transitions, 9 changer transitions 0/65 dead transitions. [2022-12-06 06:17:02,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 345 flow [2022-12-06 06:17:02,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:17:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:17:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-06 06:17:02,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-06 06:17:02,791 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 125 flow. Second operand 4 states and 70 transitions. [2022-12-06 06:17:02,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 345 flow [2022-12-06 06:17:02,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 334 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:17:02,794 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 164 flow [2022-12-06 06:17:02,794 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-12-06 06:17:02,794 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2022-12-06 06:17:02,794 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:02,794 INFO L89 Accepts]: Start accepts. Operand has 46 places, 38 transitions, 164 flow [2022-12-06 06:17:02,795 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:02,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:02,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 38 transitions, 164 flow [2022-12-06 06:17:02,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 38 transitions, 164 flow [2022-12-06 06:17:02,844 INFO L130 PetriNetUnfolder]: 190/373 cut-off events. [2022-12-06 06:17:02,844 INFO L131 PetriNetUnfolder]: For 414/449 co-relation queries the response was YES. [2022-12-06 06:17:02,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 373 events. 190/373 cut-off events. For 414/449 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1862 event pairs, 104 based on Foata normal form. 3/348 useless extension candidates. Maximal degree in co-relation 1020. Up to 210 conditions per place. [2022-12-06 06:17:02,848 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 38 transitions, 164 flow [2022-12-06 06:17:02,848 INFO L188 LiptonReduction]: Number of co-enabled transitions 550 [2022-12-06 06:17:02,972 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] L755-->L758: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [408] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_138 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5)) (.cse4 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_121 256) 0))))) (and (= v_~x$r_buff0_thd4~0_21 (ite .cse0 0 v_~x$r_buff0_thd4~0_22)) (= (ite .cse1 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_120 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse1 v_~x$w_buff0~0_50 (ite .cse4 v_~x$w_buff1~0_41 v_~x~0_82)) v_~x~0_81) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_121) v_~x$w_buff1_used~0_120)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_121, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_82, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_120, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_81, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-06 06:17:03,107 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] L755-->L758: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [400] L811-->L818: Formula: (let ((.cse2 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_123 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_109 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_124 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_109) v_~x$w_buff1_used~0_108) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_108 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_20)) (= v_~x~0_69 (ite .cse4 v_~x$w_buff0~0_40 (ite .cse1 v_~x$w_buff1~0_33 v_~x~0_70))) (= v_~x$w_buff0_used~0_123 (ite .cse4 0 v_~x$w_buff0_used~0_124))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_33, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_109, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_70, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_33, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_108, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:17:03,180 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] L755-->L758: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [440] $Ultimate##0-->L785: Formula: (and (= v_~x$r_buff0_thd2~0_54 1) (= v_~x$r_buff1_thd4~0_33 v_~x$r_buff0_thd4~0_33) (= v_~x$r_buff1_thd2~0_35 v_~x$r_buff0_thd2~0_55) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_163 256) 0)) (not (= 0 (mod v_~x$w_buff0_used~0_193 256))))) 1 0)) (= v_~x$w_buff0_used~0_194 v_~x$w_buff1_used~0_163) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_11| 0)) (= |v_P1Thread1of1ForFork3_#in~arg#1.offset_7| |v_P1Thread1of1ForFork3_~arg#1.offset_7|) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_11| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_11|) (= v_~x$r_buff1_thd3~0_33 v_~x$r_buff0_thd3~0_37) (= v_~x$r_buff1_thd1~0_39 v_~x$r_buff0_thd1~0_39) (= v_~x$r_buff1_thd0~0_69 v_~x$r_buff0_thd0~0_67) (= |v_P1Thread1of1ForFork3_~arg#1.base_7| |v_P1Thread1of1ForFork3_#in~arg#1.base_7|) (= v_~x$w_buff0_used~0_193 1) (= 2 v_~x$w_buff0~0_94) (= v_~x$w_buff0~0_95 v_~x$w_buff1~0_72)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_55, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_194} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_94, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_72, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_33, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_35, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_163, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_39, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_37, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_69, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_11|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_33, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_193, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_11|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] [2022-12-06 06:17:03,281 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] L755-->L758: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [467] L3-->L876: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_233 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd0~0_88 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_84 256) 0)))) (let ((.cse0 (and .cse5 (not (= 0 (mod v_~x$w_buff0_used~0_234 256))))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_204 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= v_~x$w_buff0_used~0_233 (ite .cse0 0 v_~x$w_buff0_used~0_234)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_11| 0)) (= v_~x$r_buff1_thd0~0_87 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_203 256) 0))) (and (not (= (mod v_~x$r_buff0_thd0~0_83 256) 0)) .cse2)) 0 v_~x$r_buff1_thd0~0_88)) (= (ite .cse0 v_~x$w_buff0~0_114 (ite .cse3 v_~x$w_buff1~0_92 v_~x~0_152)) v_~x~0_151) (= v_~x$r_buff0_thd0~0_83 (ite .cse4 0 v_~x$r_buff0_thd0~0_84)) (= v_~x$w_buff1_used~0_203 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_204))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_114, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_84, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|, ~x$w_buff1~0=v_~x$w_buff1~0_92, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_204, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_88, ~x~0=v_~x~0_152, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_234} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_114, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_83, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|, ~x$w_buff1~0=v_~x$w_buff1~0_92, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_87, ~x~0=v_~x~0_151, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_233} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:17:03,364 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:17:03,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 570 [2022-12-06 06:17:03,365 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 178 flow [2022-12-06 06:17:03,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 06:17:03,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:03,365 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:03,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:17:03,365 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:03,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:03,365 INFO L85 PathProgramCache]: Analyzing trace with hash -167490910, now seen corresponding path program 1 times [2022-12-06 06:17:03,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:03,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998717057] [2022-12-06 06:17:03,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:03,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:03,733 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 06:17:03,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:03,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998717057] [2022-12-06 06:17:03,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998717057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:03,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:03,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:17:03,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133648033] [2022-12-06 06:17:03,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:03,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:17:03,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:03,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:17:03,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:17:03,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2022-12-06 06:17:03,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 178 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 06:17:03,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:03,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2022-12-06 06:17:03,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:04,341 INFO L130 PetriNetUnfolder]: 3703/5395 cut-off events. [2022-12-06 06:17:04,342 INFO L131 PetriNetUnfolder]: For 6394/6543 co-relation queries the response was YES. [2022-12-06 06:17:04,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15769 conditions, 5395 events. 3703/5395 cut-off events. For 6394/6543 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 29063 event pairs, 565 based on Foata normal form. 59/5434 useless extension candidates. Maximal degree in co-relation 15753. Up to 4230 conditions per place. [2022-12-06 06:17:04,378 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 45 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2022-12-06 06:17:04,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 324 flow [2022-12-06 06:17:04,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:17:04,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:17:04,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 06:17:04,380 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-06 06:17:04,380 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 178 flow. Second operand 3 states and 54 transitions. [2022-12-06 06:17:04,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 324 flow [2022-12-06 06:17:04,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 312 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 06:17:04,383 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 180 flow [2022-12-06 06:17:04,384 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2022-12-06 06:17:04,384 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2022-12-06 06:17:04,384 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:04,384 INFO L89 Accepts]: Start accepts. Operand has 47 places, 37 transitions, 180 flow [2022-12-06 06:17:04,385 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:04,385 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:04,385 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 37 transitions, 180 flow [2022-12-06 06:17:04,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 180 flow [2022-12-06 06:17:04,425 INFO L130 PetriNetUnfolder]: 169/333 cut-off events. [2022-12-06 06:17:04,425 INFO L131 PetriNetUnfolder]: For 643/718 co-relation queries the response was YES. [2022-12-06 06:17:04,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 333 events. 169/333 cut-off events. For 643/718 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1596 event pairs, 95 based on Foata normal form. 2/306 useless extension candidates. Maximal degree in co-relation 960. Up to 192 conditions per place. [2022-12-06 06:17:04,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 180 flow [2022-12-06 06:17:04,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 524 [2022-12-06 06:17:04,433 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:04,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 06:17:04,434 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 180 flow [2022-12-06 06:17:04,434 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 06:17:04,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:04,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:04,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:17:04,435 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:04,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:04,435 INFO L85 PathProgramCache]: Analyzing trace with hash -897462578, now seen corresponding path program 1 times [2022-12-06 06:17:04,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:04,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534712271] [2022-12-06 06:17:04,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:04,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:04,742 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 06:17:04,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:04,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534712271] [2022-12-06 06:17:04,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534712271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:04,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:04,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:17:04,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905402723] [2022-12-06 06:17:04,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:04,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:17:04,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:04,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:17:04,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:17:04,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2022-12-06 06:17:04,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 06:17:04,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:04,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2022-12-06 06:17:04,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:05,356 INFO L130 PetriNetUnfolder]: 3881/5631 cut-off events. [2022-12-06 06:17:05,357 INFO L131 PetriNetUnfolder]: For 7788/7937 co-relation queries the response was YES. [2022-12-06 06:17:05,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16828 conditions, 5631 events. 3881/5631 cut-off events. For 7788/7937 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 30258 event pairs, 610 based on Foata normal form. 65/5676 useless extension candidates. Maximal degree in co-relation 16810. Up to 4330 conditions per place. [2022-12-06 06:17:05,387 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 54 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2022-12-06 06:17:05,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 402 flow [2022-12-06 06:17:05,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:17:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:17:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-06 06:17:05,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5546875 [2022-12-06 06:17:05,389 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 180 flow. Second operand 4 states and 71 transitions. [2022-12-06 06:17:05,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 402 flow [2022-12-06 06:17:05,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 390 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:17:05,392 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 228 flow [2022-12-06 06:17:05,392 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2022-12-06 06:17:05,393 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2022-12-06 06:17:05,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:05,393 INFO L89 Accepts]: Start accepts. Operand has 48 places, 42 transitions, 228 flow [2022-12-06 06:17:05,393 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:05,394 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:05,394 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 42 transitions, 228 flow [2022-12-06 06:17:05,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 42 transitions, 228 flow [2022-12-06 06:17:05,488 INFO L130 PetriNetUnfolder]: 208/384 cut-off events. [2022-12-06 06:17:05,488 INFO L131 PetriNetUnfolder]: For 715/871 co-relation queries the response was YES. [2022-12-06 06:17:05,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 384 events. 208/384 cut-off events. For 715/871 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1814 event pairs, 88 based on Foata normal form. 4/357 useless extension candidates. Maximal degree in co-relation 1320. Up to 238 conditions per place. [2022-12-06 06:17:05,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 42 transitions, 228 flow [2022-12-06 06:17:05,508 INFO L188 LiptonReduction]: Number of co-enabled transitions 604 [2022-12-06 06:17:05,512 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [537] L755-->L785: Formula: (and (= v_~x$w_buff0_used~0_599 1) (= v_~x$r_buff0_thd0~0_307 v_~x$r_buff1_thd0~0_308) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_33| 0)) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_33| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_33|) (= v_~x$r_buff0_thd2~0_154 1) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_33| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_599 256) 0)) (not (= (mod v_~x$w_buff1_used~0_553 256) 0)))) 1 0)) (= v_~x~0_518 1) (= v_~x$w_buff0_used~0_600 v_~x$w_buff1_used~0_553) (= 2 v_~x$w_buff0~0_354) (= |v_P1Thread1of1ForFork3_#in~arg#1.base_29| |v_P1Thread1of1ForFork3_~arg#1.base_29|) (= v_~x$r_buff0_thd2~0_155 v_~x$r_buff1_thd2~0_113) (= v_~x$r_buff0_thd1~0_123 v_~x$r_buff1_thd1~0_122) (= v_~x$r_buff0_thd4~0_103 v_~x$r_buff1_thd4~0_101) (= v_~x$w_buff0~0_355 v_~x$w_buff1~0_314) (= |v_P1Thread1of1ForFork3_~arg#1.offset_29| |v_P1Thread1of1ForFork3_#in~arg#1.offset_29|) (= v_~x$r_buff0_thd3~0_107 v_~x$r_buff1_thd3~0_101)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_355, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_307, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_123, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_103, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_155, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_29|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_600} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_354, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_307, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_123, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_101, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_553, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_122, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_103, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_154, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_308, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_33|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_29|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_101, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_599, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_33|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_29|, ~x~0=v_~x~0_518, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_29|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset, ~x~0] and [384] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_127 256) 0)) .cse4)) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5))) (and (= v_~x~0_89 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_47 v_~x~0_90))) (= (ite .cse2 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= v_~x$w_buff1_used~0_126 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_127)) (= v_~x$r_buff1_thd1~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_126 256) 0)))) 0 v_~x$r_buff1_thd1~0_20)) (= v_~x$w_buff0_used~0_145 (ite .cse0 0 v_~x$w_buff0_used~0_146))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_90, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_126, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:17:05,726 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:17:05,727 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 334 [2022-12-06 06:17:05,727 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 234 flow [2022-12-06 06:17:05,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 06:17:05,727 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:05,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:05,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:17:05,728 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:05,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:05,728 INFO L85 PathProgramCache]: Analyzing trace with hash -897397478, now seen corresponding path program 2 times [2022-12-06 06:17:05,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:05,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987512105] [2022-12-06 06:17:05,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:05,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:06,313 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 06:17:06,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:06,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987512105] [2022-12-06 06:17:06,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987512105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:06,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:06,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:17:06,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699385410] [2022-12-06 06:17:06,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:06,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:17:06,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:06,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:17:06,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:17:06,316 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-06 06:17:06,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 06:17:06,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:06,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-06 06:17:06,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:06,979 INFO L130 PetriNetUnfolder]: 3921/5633 cut-off events. [2022-12-06 06:17:06,980 INFO L131 PetriNetUnfolder]: For 10257/10670 co-relation queries the response was YES. [2022-12-06 06:17:06,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19055 conditions, 5633 events. 3921/5633 cut-off events. For 10257/10670 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 30084 event pairs, 759 based on Foata normal form. 81/5636 useless extension candidates. Maximal degree in co-relation 19037. Up to 4354 conditions per place. [2022-12-06 06:17:07,018 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 55 selfloop transitions, 12 changer transitions 0/70 dead transitions. [2022-12-06 06:17:07,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 476 flow [2022-12-06 06:17:07,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:17:07,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:17:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 06:17:07,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-06 06:17:07,020 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 234 flow. Second operand 4 states and 72 transitions. [2022-12-06 06:17:07,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 476 flow [2022-12-06 06:17:07,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 451 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 06:17:07,027 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 279 flow [2022-12-06 06:17:07,027 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2022-12-06 06:17:07,027 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2022-12-06 06:17:07,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:07,028 INFO L89 Accepts]: Start accepts. Operand has 50 places, 46 transitions, 279 flow [2022-12-06 06:17:07,028 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:07,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:07,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 46 transitions, 279 flow [2022-12-06 06:17:07,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 46 transitions, 279 flow [2022-12-06 06:17:07,078 INFO L130 PetriNetUnfolder]: 217/404 cut-off events. [2022-12-06 06:17:07,079 INFO L131 PetriNetUnfolder]: For 1121/1382 co-relation queries the response was YES. [2022-12-06 06:17:07,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1603 conditions, 404 events. 217/404 cut-off events. For 1121/1382 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1947 event pairs, 88 based on Foata normal form. 6/375 useless extension candidates. Maximal degree in co-relation 1587. Up to 251 conditions per place. [2022-12-06 06:17:07,084 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 46 transitions, 279 flow [2022-12-06 06:17:07,084 INFO L188 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-06 06:17:07,088 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:07,089 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 06:17:07,089 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 279 flow [2022-12-06 06:17:07,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 06:17:07,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:07,089 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:07,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:17:07,090 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:07,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:07,090 INFO L85 PathProgramCache]: Analyzing trace with hash -897462516, now seen corresponding path program 1 times [2022-12-06 06:17:07,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:07,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370182491] [2022-12-06 06:17:07,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:07,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:07,772 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 06:17:07,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:07,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370182491] [2022-12-06 06:17:07,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370182491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:07,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:07,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:17:07,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155165981] [2022-12-06 06:17:07,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:07,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:17:07,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:07,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:17:07,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:17:07,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 06:17:07,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 279 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 06:17:07,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:07,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 06:17:07,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:08,930 INFO L130 PetriNetUnfolder]: 8836/11956 cut-off events. [2022-12-06 06:17:08,930 INFO L131 PetriNetUnfolder]: For 22618/22618 co-relation queries the response was YES. [2022-12-06 06:17:08,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40552 conditions, 11956 events. 8836/11956 cut-off events. For 22618/22618 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 56454 event pairs, 2919 based on Foata normal form. 32/11988 useless extension candidates. Maximal degree in co-relation 40533. Up to 10173 conditions per place. [2022-12-06 06:17:09,012 INFO L137 encePairwiseOnDemand]: 17/33 looper letters, 76 selfloop transitions, 25 changer transitions 0/101 dead transitions. [2022-12-06 06:17:09,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 101 transitions, 721 flow [2022-12-06 06:17:09,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:17:09,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:17:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-06 06:17:09,014 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5212121212121212 [2022-12-06 06:17:09,014 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 279 flow. Second operand 5 states and 86 transitions. [2022-12-06 06:17:09,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 101 transitions, 721 flow [2022-12-06 06:17:09,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 101 transitions, 686 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 06:17:09,032 INFO L231 Difference]: Finished difference. Result has 54 places, 66 transitions, 482 flow [2022-12-06 06:17:09,033 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=482, PETRI_PLACES=54, PETRI_TRANSITIONS=66} [2022-12-06 06:17:09,033 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2022-12-06 06:17:09,033 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:09,033 INFO L89 Accepts]: Start accepts. Operand has 54 places, 66 transitions, 482 flow [2022-12-06 06:17:09,034 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:09,034 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:09,034 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 66 transitions, 482 flow [2022-12-06 06:17:09,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 66 transitions, 482 flow [2022-12-06 06:17:09,263 INFO L130 PetriNetUnfolder]: 1269/2021 cut-off events. [2022-12-06 06:17:09,263 INFO L131 PetriNetUnfolder]: For 6096/6502 co-relation queries the response was YES. [2022-12-06 06:17:09,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8101 conditions, 2021 events. 1269/2021 cut-off events. For 6096/6502 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 11367 event pairs, 428 based on Foata normal form. 9/1948 useless extension candidates. Maximal degree in co-relation 8083. Up to 1471 conditions per place. [2022-12-06 06:17:09,283 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 66 transitions, 482 flow [2022-12-06 06:17:09,283 INFO L188 LiptonReduction]: Number of co-enabled transitions 696 [2022-12-06 06:17:09,294 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:09,295 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 262 [2022-12-06 06:17:09,295 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 66 transitions, 482 flow [2022-12-06 06:17:09,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 06:17:09,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:09,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:09,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:17:09,296 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:09,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:09,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1763869768, now seen corresponding path program 2 times [2022-12-06 06:17:09,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:09,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818276661] [2022-12-06 06:17:09,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:09,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:09,672 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 06:17:09,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:09,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818276661] [2022-12-06 06:17:09,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818276661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:09,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:09,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:17:09,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33952710] [2022-12-06 06:17:09,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:09,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:17:09,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:09,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:17:09,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:17:09,675 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-06 06:17:09,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 66 transitions, 482 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 06:17:09,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:09,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-06 06:17:09,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:10,749 INFO L130 PetriNetUnfolder]: 8542/12012 cut-off events. [2022-12-06 06:17:10,749 INFO L131 PetriNetUnfolder]: For 46415/47016 co-relation queries the response was YES. [2022-12-06 06:17:10,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49734 conditions, 12012 events. 8542/12012 cut-off events. For 46415/47016 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 65016 event pairs, 2013 based on Foata normal form. 252/12033 useless extension candidates. Maximal degree in co-relation 49713. Up to 6916 conditions per place. [2022-12-06 06:17:10,822 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 64 selfloop transitions, 27 changer transitions 0/97 dead transitions. [2022-12-06 06:17:10,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 97 transitions, 832 flow [2022-12-06 06:17:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:17:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:17:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-06 06:17:10,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2022-12-06 06:17:10,825 INFO L175 Difference]: Start difference. First operand has 54 places, 66 transitions, 482 flow. Second operand 4 states and 75 transitions. [2022-12-06 06:17:10,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 97 transitions, 832 flow [2022-12-06 06:17:10,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 97 transitions, 795 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-06 06:17:10,837 INFO L231 Difference]: Finished difference. Result has 57 places, 70 transitions, 577 flow [2022-12-06 06:17:10,837 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=577, PETRI_PLACES=57, PETRI_TRANSITIONS=70} [2022-12-06 06:17:10,838 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2022-12-06 06:17:10,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:10,838 INFO L89 Accepts]: Start accepts. Operand has 57 places, 70 transitions, 577 flow [2022-12-06 06:17:10,838 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:10,838 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:10,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 70 transitions, 577 flow [2022-12-06 06:17:10,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 70 transitions, 577 flow [2022-12-06 06:17:11,010 INFO L130 PetriNetUnfolder]: 1410/2242 cut-off events. [2022-12-06 06:17:11,011 INFO L131 PetriNetUnfolder]: For 10314/10874 co-relation queries the response was YES. [2022-12-06 06:17:11,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9920 conditions, 2242 events. 1410/2242 cut-off events. For 10314/10874 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 12968 event pairs, 465 based on Foata normal form. 90/2281 useless extension candidates. Maximal degree in co-relation 9900. Up to 1660 conditions per place. [2022-12-06 06:17:11,033 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 70 transitions, 577 flow [2022-12-06 06:17:11,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 744 [2022-12-06 06:17:11,044 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:11,045 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 207 [2022-12-06 06:17:11,045 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 70 transitions, 577 flow [2022-12-06 06:17:11,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 06:17:11,045 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:11,045 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:11,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:17:11,045 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:11,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:11,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1097349712, now seen corresponding path program 1 times [2022-12-06 06:17:11,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:11,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950487275] [2022-12-06 06:17:11,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:11,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:11,486 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 06:17:11,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:11,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950487275] [2022-12-06 06:17:11,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950487275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:11,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:11,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:17:11,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872592005] [2022-12-06 06:17:11,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:11,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:17:11,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:11,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:17:11,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:17:11,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-06 06:17:11,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 70 transitions, 577 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 06:17:11,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:11,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-06 06:17:11,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:12,845 INFO L130 PetriNetUnfolder]: 8895/12549 cut-off events. [2022-12-06 06:17:12,845 INFO L131 PetriNetUnfolder]: For 62003/62954 co-relation queries the response was YES. [2022-12-06 06:17:12,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55560 conditions, 12549 events. 8895/12549 cut-off events. For 62003/62954 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 69143 event pairs, 2107 based on Foata normal form. 392/12705 useless extension candidates. Maximal degree in co-relation 55537. Up to 6546 conditions per place. [2022-12-06 06:17:12,930 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 67 selfloop transitions, 27 changer transitions 0/100 dead transitions. [2022-12-06 06:17:12,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 100 transitions, 935 flow [2022-12-06 06:17:12,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:17:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:17:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-06 06:17:12,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2022-12-06 06:17:12,932 INFO L175 Difference]: Start difference. First operand has 57 places, 70 transitions, 577 flow. Second operand 4 states and 75 transitions. [2022-12-06 06:17:12,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 100 transitions, 935 flow [2022-12-06 06:17:12,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 885 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 06:17:12,972 INFO L231 Difference]: Finished difference. Result has 59 places, 73 transitions, 659 flow [2022-12-06 06:17:12,972 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=659, PETRI_PLACES=59, PETRI_TRANSITIONS=73} [2022-12-06 06:17:12,973 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2022-12-06 06:17:12,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:12,973 INFO L89 Accepts]: Start accepts. Operand has 59 places, 73 transitions, 659 flow [2022-12-06 06:17:12,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:12,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:12,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 73 transitions, 659 flow [2022-12-06 06:17:12,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 73 transitions, 659 flow [2022-12-06 06:17:13,165 INFO L130 PetriNetUnfolder]: 1418/2308 cut-off events. [2022-12-06 06:17:13,166 INFO L131 PetriNetUnfolder]: For 10460/11045 co-relation queries the response was YES. [2022-12-06 06:17:13,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10183 conditions, 2308 events. 1418/2308 cut-off events. For 10460/11045 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 13834 event pairs, 481 based on Foata normal form. 145/2402 useless extension candidates. Maximal degree in co-relation 10162. Up to 1676 conditions per place. [2022-12-06 06:17:13,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 73 transitions, 659 flow [2022-12-06 06:17:13,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 780 [2022-12-06 06:17:13,202 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:13,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 06:17:13,203 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 73 transitions, 659 flow [2022-12-06 06:17:13,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 06:17:13,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:13,203 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:13,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:17:13,203 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:13,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:13,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1213159704, now seen corresponding path program 1 times [2022-12-06 06:17:13,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:13,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499548005] [2022-12-06 06:17:13,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:13,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:13,336 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 06:17:13,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:13,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499548005] [2022-12-06 06:17:13,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499548005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:13,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:13,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:17:13,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696131184] [2022-12-06 06:17:13,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:13,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:17:13,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:13,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:17:13,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:17:13,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-06 06:17:13,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 73 transitions, 659 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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 06:17:13,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:13,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-06 06:17:13,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:14,904 INFO L130 PetriNetUnfolder]: 7444/10871 cut-off events. [2022-12-06 06:17:14,904 INFO L131 PetriNetUnfolder]: For 79687/80483 co-relation queries the response was YES. [2022-12-06 06:17:14,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51778 conditions, 10871 events. 7444/10871 cut-off events. For 79687/80483 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 64892 event pairs, 1230 based on Foata normal form. 1173/11562 useless extension candidates. Maximal degree in co-relation 51754. Up to 6146 conditions per place. [2022-12-06 06:17:15,000 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 178 selfloop transitions, 10 changer transitions 0/196 dead transitions. [2022-12-06 06:17:15,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 196 transitions, 2304 flow [2022-12-06 06:17:15,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:17:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:17:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-06 06:17:15,001 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2022-12-06 06:17:15,002 INFO L175 Difference]: Start difference. First operand has 59 places, 73 transitions, 659 flow. Second operand 5 states and 111 transitions. [2022-12-06 06:17:15,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 196 transitions, 2304 flow [2022-12-06 06:17:15,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 196 transitions, 2213 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:17:15,068 INFO L231 Difference]: Finished difference. Result has 64 places, 80 transitions, 708 flow [2022-12-06 06:17:15,068 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=708, PETRI_PLACES=64, PETRI_TRANSITIONS=80} [2022-12-06 06:17:15,069 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2022-12-06 06:17:15,069 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:15,069 INFO L89 Accepts]: Start accepts. Operand has 64 places, 80 transitions, 708 flow [2022-12-06 06:17:15,070 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:15,070 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:15,070 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 80 transitions, 708 flow [2022-12-06 06:17:15,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 80 transitions, 708 flow [2022-12-06 06:17:15,462 INFO L130 PetriNetUnfolder]: 2237/3829 cut-off events. [2022-12-06 06:17:15,462 INFO L131 PetriNetUnfolder]: For 17679/19344 co-relation queries the response was YES. [2022-12-06 06:17:15,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16624 conditions, 3829 events. 2237/3829 cut-off events. For 17679/19344 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 27583 event pairs, 863 based on Foata normal form. 276/3762 useless extension candidates. Maximal degree in co-relation 16600. Up to 2023 conditions per place. [2022-12-06 06:17:15,523 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 80 transitions, 708 flow [2022-12-06 06:17:15,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 1158 [2022-12-06 06:17:15,536 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] L865-3-->L3: Formula: (and (= (mod v_~main$tmp_guard0~0_56 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_125 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_56) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_11|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_56, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [483] L818-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_92 1) v_~__unbuffered_cnt~0_91)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-06 06:17:15,583 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] L865-3-->L3: Formula: (and (= (mod v_~main$tmp_guard0~0_56 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_125 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_56) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_11|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_56, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [497] L765-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-06 06:17:15,615 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] L865-3-->L3: Formula: (and (= (mod v_~main$tmp_guard0~0_56 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_125 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_56) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_11|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_56, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [486] L841-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#res.base_17| 0) (= |v_P3Thread1of1ForFork2_#res.offset_17| 0) (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_17|, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] [2022-12-06 06:17:15,644 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] L865-3-->L3: Formula: (and (= (mod v_~main$tmp_guard0~0_56 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_125 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_56) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_11|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_56, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [427] L795-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P1Thread1of1ForFork3_#res#1.offset_13| 0) (= |v_P1Thread1of1ForFork3_#res#1.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P1Thread1of1ForFork3_#res#1.base=|v_P1Thread1of1ForFork3_#res#1.base_13|, P1Thread1of1ForFork3_#res#1.offset=|v_P1Thread1of1ForFork3_#res#1.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res#1.base, P1Thread1of1ForFork3_#res#1.offset, ~__unbuffered_cnt~0] [2022-12-06 06:17:15,681 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:17:15,682 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 613 [2022-12-06 06:17:15,682 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 79 transitions, 718 flow [2022-12-06 06:17:15,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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 06:17:15,682 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:15,682 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:15,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:17:15,683 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:15,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:15,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1010830205, now seen corresponding path program 1 times [2022-12-06 06:17:15,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:15,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078612703] [2022-12-06 06:17:15,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:15,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:15,890 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 06:17:15,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:15,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078612703] [2022-12-06 06:17:15,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078612703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:15,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:15,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:17:15,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377954831] [2022-12-06 06:17:15,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:15,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:17:15,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:15,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:17:15,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:17:15,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2022-12-06 06:17:15,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 79 transitions, 718 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 06:17:15,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:15,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2022-12-06 06:17:15,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:16,837 INFO L130 PetriNetUnfolder]: 5056/7762 cut-off events. [2022-12-06 06:17:16,837 INFO L131 PetriNetUnfolder]: For 61497/62166 co-relation queries the response was YES. [2022-12-06 06:17:16,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40194 conditions, 7762 events. 5056/7762 cut-off events. For 61497/62166 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 47885 event pairs, 532 based on Foata normal form. 647/8138 useless extension candidates. Maximal degree in co-relation 40167. Up to 3301 conditions per place. [2022-12-06 06:17:16,895 INFO L137 encePairwiseOnDemand]: 25/37 looper letters, 187 selfloop transitions, 18 changer transitions 3/216 dead transitions. [2022-12-06 06:17:16,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 216 transitions, 2516 flow [2022-12-06 06:17:16,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:17:16,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:17:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2022-12-06 06:17:16,897 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2022-12-06 06:17:16,897 INFO L175 Difference]: Start difference. First operand has 63 places, 79 transitions, 718 flow. Second operand 6 states and 136 transitions. [2022-12-06 06:17:16,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 216 transitions, 2516 flow [2022-12-06 06:17:16,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 216 transitions, 2503 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 06:17:16,941 INFO L231 Difference]: Finished difference. Result has 70 places, 86 transitions, 833 flow [2022-12-06 06:17:16,941 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=833, PETRI_PLACES=70, PETRI_TRANSITIONS=86} [2022-12-06 06:17:16,942 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2022-12-06 06:17:16,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:16,942 INFO L89 Accepts]: Start accepts. Operand has 70 places, 86 transitions, 833 flow [2022-12-06 06:17:16,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:16,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:16,943 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 86 transitions, 833 flow [2022-12-06 06:17:16,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 86 transitions, 833 flow [2022-12-06 06:17:17,141 INFO L130 PetriNetUnfolder]: 1189/2450 cut-off events. [2022-12-06 06:17:17,141 INFO L131 PetriNetUnfolder]: For 15014/18166 co-relation queries the response was YES. [2022-12-06 06:17:17,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12012 conditions, 2450 events. 1189/2450 cut-off events. For 15014/18166 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 19248 event pairs, 286 based on Foata normal form. 250/2535 useless extension candidates. Maximal degree in co-relation 11984. Up to 1227 conditions per place. [2022-12-06 06:17:17,174 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 86 transitions, 833 flow [2022-12-06 06:17:17,174 INFO L188 LiptonReduction]: Number of co-enabled transitions 1356 [2022-12-06 06:17:18,102 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:17:18,102 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1160 [2022-12-06 06:17:18,102 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 87 transitions, 863 flow [2022-12-06 06:17:18,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 06:17:18,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:18,103 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 06:17:18,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:17:18,103 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:18,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:18,103 INFO L85 PathProgramCache]: Analyzing trace with hash -570403627, now seen corresponding path program 1 times [2022-12-06 06:17:18,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:18,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613330481] [2022-12-06 06:17:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:18,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:18,234 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 06:17:18,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:18,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613330481] [2022-12-06 06:17:18,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613330481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:18,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:18,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:17:18,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074882585] [2022-12-06 06:17:18,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:18,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:17:18,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:18,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:17:18,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:17:18,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2022-12-06 06:17:18,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 87 transitions, 863 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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 06:17:18,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:18,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2022-12-06 06:17:18,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:19,242 INFO L130 PetriNetUnfolder]: 4636/7156 cut-off events. [2022-12-06 06:17:19,242 INFO L131 PetriNetUnfolder]: For 57694/58297 co-relation queries the response was YES. [2022-12-06 06:17:19,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39635 conditions, 7156 events. 4636/7156 cut-off events. For 57694/58297 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 44442 event pairs, 411 based on Foata normal form. 266/7175 useless extension candidates. Maximal degree in co-relation 39604. Up to 2873 conditions per place. [2022-12-06 06:17:19,308 INFO L137 encePairwiseOnDemand]: 26/38 looper letters, 193 selfloop transitions, 27 changer transitions 14/242 dead transitions. [2022-12-06 06:17:19,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 242 transitions, 2887 flow [2022-12-06 06:17:19,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:17:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:17:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2022-12-06 06:17:19,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.555921052631579 [2022-12-06 06:17:19,310 INFO L175 Difference]: Start difference. First operand has 71 places, 87 transitions, 863 flow. Second operand 8 states and 169 transitions. [2022-12-06 06:17:19,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 242 transitions, 2887 flow [2022-12-06 06:17:19,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 242 transitions, 2727 flow, removed 50 selfloop flow, removed 4 redundant places. [2022-12-06 06:17:19,710 INFO L231 Difference]: Finished difference. Result has 76 places, 90 transitions, 873 flow [2022-12-06 06:17:19,710 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=873, PETRI_PLACES=76, PETRI_TRANSITIONS=90} [2022-12-06 06:17:19,710 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2022-12-06 06:17:19,710 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:19,711 INFO L89 Accepts]: Start accepts. Operand has 76 places, 90 transitions, 873 flow [2022-12-06 06:17:19,711 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:19,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:19,712 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 90 transitions, 873 flow [2022-12-06 06:17:19,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 90 transitions, 873 flow [2022-12-06 06:17:19,859 INFO L130 PetriNetUnfolder]: 860/1954 cut-off events. [2022-12-06 06:17:19,859 INFO L131 PetriNetUnfolder]: For 9939/10984 co-relation queries the response was YES. [2022-12-06 06:17:19,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8962 conditions, 1954 events. 860/1954 cut-off events. For 9939/10984 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 16203 event pairs, 131 based on Foata normal form. 177/1998 useless extension candidates. Maximal degree in co-relation 8932. Up to 607 conditions per place. [2022-12-06 06:17:19,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 90 transitions, 873 flow [2022-12-06 06:17:19,883 INFO L188 LiptonReduction]: Number of co-enabled transitions 1468 [2022-12-06 06:17:20,447 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:17:20,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 738 [2022-12-06 06:17:20,448 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 91 transitions, 907 flow [2022-12-06 06:17:20,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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 06:17:20,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:20,448 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, 1] [2022-12-06 06:17:20,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:17:20,448 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:20,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash 682891665, now seen corresponding path program 1 times [2022-12-06 06:17:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:20,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086564846] [2022-12-06 06:17:20,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:20,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:20,578 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 06:17:20,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:20,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086564846] [2022-12-06 06:17:20,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086564846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:20,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:20,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:17:20,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453861197] [2022-12-06 06:17:20,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:20,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:17:20,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:20,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:17:20,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:17:20,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2022-12-06 06:17:20,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 91 transitions, 907 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 06:17:20,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:20,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2022-12-06 06:17:20,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:21,939 INFO L130 PetriNetUnfolder]: 7133/11083 cut-off events. [2022-12-06 06:17:21,939 INFO L131 PetriNetUnfolder]: For 69003/69029 co-relation queries the response was YES. [2022-12-06 06:17:22,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57993 conditions, 11083 events. 7133/11083 cut-off events. For 69003/69029 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 72786 event pairs, 1228 based on Foata normal form. 26/10932 useless extension candidates. Maximal degree in co-relation 57960. Up to 4513 conditions per place. [2022-12-06 06:17:22,047 INFO L137 encePairwiseOnDemand]: 34/37 looper letters, 146 selfloop transitions, 4 changer transitions 43/199 dead transitions. [2022-12-06 06:17:22,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 199 transitions, 2426 flow [2022-12-06 06:17:22,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:17:22,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:17:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-06 06:17:22,048 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.581081081081081 [2022-12-06 06:17:22,048 INFO L175 Difference]: Start difference. First operand has 77 places, 91 transitions, 907 flow. Second operand 4 states and 86 transitions. [2022-12-06 06:17:22,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 199 transitions, 2426 flow [2022-12-06 06:17:22,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 199 transitions, 2139 flow, removed 107 selfloop flow, removed 4 redundant places. [2022-12-06 06:17:22,726 INFO L231 Difference]: Finished difference. Result has 78 places, 90 transitions, 773 flow [2022-12-06 06:17:22,726 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=773, PETRI_PLACES=78, PETRI_TRANSITIONS=90} [2022-12-06 06:17:22,726 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 29 predicate places. [2022-12-06 06:17:22,726 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:22,727 INFO L89 Accepts]: Start accepts. Operand has 78 places, 90 transitions, 773 flow [2022-12-06 06:17:22,727 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:22,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:22,728 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 90 transitions, 773 flow [2022-12-06 06:17:22,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 90 transitions, 773 flow [2022-12-06 06:17:22,989 INFO L130 PetriNetUnfolder]: 1248/2821 cut-off events. [2022-12-06 06:17:22,989 INFO L131 PetriNetUnfolder]: For 9865/10946 co-relation queries the response was YES. [2022-12-06 06:17:23,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11282 conditions, 2821 events. 1248/2821 cut-off events. For 9865/10946 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 25020 event pairs, 156 based on Foata normal form. 270/2878 useless extension candidates. Maximal degree in co-relation 11251. Up to 830 conditions per place. [2022-12-06 06:17:23,036 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 90 transitions, 773 flow [2022-12-06 06:17:23,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 1494 [2022-12-06 06:17:23,544 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:17:23,545 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 819 [2022-12-06 06:17:23,545 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 86 transitions, 741 flow [2022-12-06 06:17:23,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 06:17:23,545 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:23,545 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, 1] [2022-12-06 06:17:23,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:17:23,545 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:23,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:23,546 INFO L85 PathProgramCache]: Analyzing trace with hash 224438025, now seen corresponding path program 2 times [2022-12-06 06:17:23,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:23,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934933769] [2022-12-06 06:17:23,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:23,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:23,690 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 06:17:23,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:23,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934933769] [2022-12-06 06:17:23,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934933769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:23,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:23,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:17:23,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362062695] [2022-12-06 06:17:23,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:23,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:17:23,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:23,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:17:23,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:17:23,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-06 06:17:23,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 86 transitions, 741 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 06:17:23,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:23,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-06 06:17:23,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:24,586 INFO L130 PetriNetUnfolder]: 3707/5876 cut-off events. [2022-12-06 06:17:24,586 INFO L131 PetriNetUnfolder]: For 38464/38786 co-relation queries the response was YES. [2022-12-06 06:17:24,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30325 conditions, 5876 events. 3707/5876 cut-off events. For 38464/38786 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 36894 event pairs, 445 based on Foata normal form. 112/5792 useless extension candidates. Maximal degree in co-relation 30291. Up to 2477 conditions per place. [2022-12-06 06:17:24,622 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 156 selfloop transitions, 24 changer transitions 28/217 dead transitions. [2022-12-06 06:17:24,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 217 transitions, 2435 flow [2022-12-06 06:17:24,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 06:17:24,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 06:17:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2022-12-06 06:17:24,624 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-06 06:17:24,624 INFO L175 Difference]: Start difference. First operand has 77 places, 86 transitions, 741 flow. Second operand 10 states and 165 transitions. [2022-12-06 06:17:24,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 217 transitions, 2435 flow [2022-12-06 06:17:24,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 217 transitions, 2306 flow, removed 26 selfloop flow, removed 7 redundant places. [2022-12-06 06:17:24,717 INFO L231 Difference]: Finished difference. Result has 82 places, 83 transitions, 728 flow [2022-12-06 06:17:24,717 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=728, PETRI_PLACES=82, PETRI_TRANSITIONS=83} [2022-12-06 06:17:24,717 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2022-12-06 06:17:24,717 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:24,717 INFO L89 Accepts]: Start accepts. Operand has 82 places, 83 transitions, 728 flow [2022-12-06 06:17:24,718 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:24,718 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:24,719 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 83 transitions, 728 flow [2022-12-06 06:17:24,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 83 transitions, 728 flow [2022-12-06 06:17:24,876 INFO L130 PetriNetUnfolder]: 818/1747 cut-off events. [2022-12-06 06:17:24,877 INFO L131 PetriNetUnfolder]: For 6044/6509 co-relation queries the response was YES. [2022-12-06 06:17:24,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7490 conditions, 1747 events. 818/1747 cut-off events. For 6044/6509 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 13066 event pairs, 138 based on Foata normal form. 212/1881 useless extension candidates. Maximal degree in co-relation 7461. Up to 763 conditions per place. [2022-12-06 06:17:24,901 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 83 transitions, 728 flow [2022-12-06 06:17:24,901 INFO L188 LiptonReduction]: Number of co-enabled transitions 1064 [2022-12-06 06:17:36,321 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:17:36,322 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11605 [2022-12-06 06:17:36,322 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 78 transitions, 688 flow [2022-12-06 06:17:36,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 06:17:36,322 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:36,322 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, 1, 1] [2022-12-06 06:17:36,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 06:17:36,322 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:36,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:36,323 INFO L85 PathProgramCache]: Analyzing trace with hash 933644767, now seen corresponding path program 1 times [2022-12-06 06:17:36,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:36,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744360067] [2022-12-06 06:17:36,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:36,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:36,470 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 06:17:36,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:36,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744360067] [2022-12-06 06:17:36,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744360067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:36,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:36,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:17:36,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724177263] [2022-12-06 06:17:36,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:36,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:17:36,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:36,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:17:36,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:17:36,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-06 06:17:36,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 78 transitions, 688 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 06:17:36,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:36,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-06 06:17:36,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:37,200 INFO L130 PetriNetUnfolder]: 4707/7265 cut-off events. [2022-12-06 06:17:37,200 INFO L131 PetriNetUnfolder]: For 39219/39400 co-relation queries the response was YES. [2022-12-06 06:17:37,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36527 conditions, 7265 events. 4707/7265 cut-off events. For 39219/39400 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 44770 event pairs, 780 based on Foata normal form. 34/7060 useless extension candidates. Maximal degree in co-relation 36495. Up to 3753 conditions per place. [2022-12-06 06:17:37,236 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 85 selfloop transitions, 1 changer transitions 59/150 dead transitions. [2022-12-06 06:17:37,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 150 transitions, 1625 flow [2022-12-06 06:17:37,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:17:37,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:17:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-06 06:17:37,238 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2022-12-06 06:17:37,238 INFO L175 Difference]: Start difference. First operand has 78 places, 78 transitions, 688 flow. Second operand 4 states and 71 transitions. [2022-12-06 06:17:37,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 150 transitions, 1625 flow [2022-12-06 06:17:37,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 150 transitions, 1468 flow, removed 40 selfloop flow, removed 9 redundant places. [2022-12-06 06:17:37,371 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 514 flow [2022-12-06 06:17:37,372 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=514, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2022-12-06 06:17:37,372 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2022-12-06 06:17:37,372 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:37,372 INFO L89 Accepts]: Start accepts. Operand has 67 places, 65 transitions, 514 flow [2022-12-06 06:17:37,373 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:37,373 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:37,373 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 65 transitions, 514 flow [2022-12-06 06:17:37,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 65 transitions, 514 flow [2022-12-06 06:17:37,436 INFO L130 PetriNetUnfolder]: 385/848 cut-off events. [2022-12-06 06:17:37,436 INFO L131 PetriNetUnfolder]: For 5054/5388 co-relation queries the response was YES. [2022-12-06 06:17:37,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 848 events. 385/848 cut-off events. For 5054/5388 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5488 event pairs, 70 based on Foata normal form. 138/951 useless extension candidates. Maximal degree in co-relation 3272. Up to 332 conditions per place. [2022-12-06 06:17:37,445 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 65 transitions, 514 flow [2022-12-06 06:17:37,445 INFO L188 LiptonReduction]: Number of co-enabled transitions 698 [2022-12-06 06:17:38,076 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [551] $Ultimate##0-->L785: Formula: (and (= 2 v_~x$w_buff0~0_382) (= |v_P1Thread1of1ForFork3_~arg#1.offset_33| |v_P1Thread1of1ForFork3_#in~arg#1.offset_33|) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_~x$r_buff0_thd2~0_163 v_~x$r_buff1_thd2~0_117) (= v_~x$w_buff0_used~0_640 v_~x$w_buff1_used~0_589) (= |v_P1Thread1of1ForFork3_#in~arg#1.base_33| |v_P1Thread1of1ForFork3_~arg#1.base_33|) (= v_~a~0_38 1) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~x$r_buff0_thd0~0_337 v_~x$r_buff1_thd0~0_338) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_37| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_589 256) 0)) (not (= (mod v_~x$w_buff0_used~0_639 256) 0)))) 1 0)) (= v_~x$r_buff0_thd1~0_133 v_~x$r_buff1_thd1~0_132) (= v_~x~0_556 1) (= v_~x$w_buff0~0_383 v_~x$w_buff1~0_338) (= v_~x$w_buff0_used~0_639 1) (= v_~x$r_buff0_thd2~0_162 1) (= v_~x$r_buff0_thd3~0_111 v_~x$r_buff1_thd3~0_105) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_37| 0)) (= v_~x$r_buff0_thd4~0_107 v_~x$r_buff1_thd4~0_105) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_37| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_37|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_383, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_133, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_107, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_111, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_33|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_640} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_382, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_33|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_133, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_105, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_132, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_111, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_33|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21, ~a~0=v_~a~0_38, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_37|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_33|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_33|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~x$w_buff1~0=v_~x$w_buff1~0_338, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_589, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_107, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_162, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_338, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_37|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_105, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_639, ~x~0=v_~x~0_556} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, P0Thread1of1ForFork1_~arg.base, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, ~a~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork3_~arg#1.offset, ~x~0] and [408] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_138 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5)) (.cse4 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_121 256) 0))))) (and (= v_~x$r_buff0_thd4~0_21 (ite .cse0 0 v_~x$r_buff0_thd4~0_22)) (= (ite .cse1 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_120 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse1 v_~x$w_buff0~0_50 (ite .cse4 v_~x$w_buff1~0_41 v_~x~0_82)) v_~x~0_81) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_121) v_~x$w_buff1_used~0_120)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_121, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_82, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_120, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_81, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-06 06:17:38,288 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [551] $Ultimate##0-->L785: Formula: (and (= 2 v_~x$w_buff0~0_382) (= |v_P1Thread1of1ForFork3_~arg#1.offset_33| |v_P1Thread1of1ForFork3_#in~arg#1.offset_33|) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_~x$r_buff0_thd2~0_163 v_~x$r_buff1_thd2~0_117) (= v_~x$w_buff0_used~0_640 v_~x$w_buff1_used~0_589) (= |v_P1Thread1of1ForFork3_#in~arg#1.base_33| |v_P1Thread1of1ForFork3_~arg#1.base_33|) (= v_~a~0_38 1) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~x$r_buff0_thd0~0_337 v_~x$r_buff1_thd0~0_338) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_37| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_589 256) 0)) (not (= (mod v_~x$w_buff0_used~0_639 256) 0)))) 1 0)) (= v_~x$r_buff0_thd1~0_133 v_~x$r_buff1_thd1~0_132) (= v_~x~0_556 1) (= v_~x$w_buff0~0_383 v_~x$w_buff1~0_338) (= v_~x$w_buff0_used~0_639 1) (= v_~x$r_buff0_thd2~0_162 1) (= v_~x$r_buff0_thd3~0_111 v_~x$r_buff1_thd3~0_105) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_37| 0)) (= v_~x$r_buff0_thd4~0_107 v_~x$r_buff1_thd4~0_105) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_37| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_37|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_383, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_133, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_107, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_111, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_33|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_640} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_382, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_33|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_133, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_105, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_132, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_111, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_33|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21, ~a~0=v_~a~0_38, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_37|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_33|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_33|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_337, ~x$w_buff1~0=v_~x$w_buff1~0_338, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_589, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_107, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_162, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_338, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_37|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_105, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_639, ~x~0=v_~x~0_556} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, P0Thread1of1ForFork1_~arg.base, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, ~a~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork3_~arg#1.offset, ~x~0] and [400] L811-->L818: Formula: (let ((.cse2 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_123 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_109 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_124 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_109) v_~x$w_buff1_used~0_108) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_108 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_20)) (= v_~x~0_69 (ite .cse4 v_~x$w_buff0~0_40 (ite .cse1 v_~x$w_buff1~0_33 v_~x~0_70))) (= v_~x$w_buff0_used~0_123 (ite .cse4 0 v_~x$w_buff0_used~0_124))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_33, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_109, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_70, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_33, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_108, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:17:38,501 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:17:38,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1130 [2022-12-06 06:17:38,502 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 554 flow [2022-12-06 06:17:38,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 06:17:38,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:38,502 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, 1] [2022-12-06 06:17:38,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 06:17:38,502 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:38,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:38,502 INFO L85 PathProgramCache]: Analyzing trace with hash 776416330, now seen corresponding path program 1 times [2022-12-06 06:17:38,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:38,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015986505] [2022-12-06 06:17:38,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:38,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:38,721 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 06:17:38,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:38,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015986505] [2022-12-06 06:17:38,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015986505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:38,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:38,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:17:38,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829388033] [2022-12-06 06:17:38,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:38,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:17:38,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:38,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:17:38,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:17:38,722 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 06:17:38,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 554 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 06:17:38,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:38,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 06:17:38,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:39,118 INFO L130 PetriNetUnfolder]: 2442/3801 cut-off events. [2022-12-06 06:17:39,118 INFO L131 PetriNetUnfolder]: For 18426/18514 co-relation queries the response was YES. [2022-12-06 06:17:39,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18296 conditions, 3801 events. 2442/3801 cut-off events. For 18426/18514 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 20660 event pairs, 397 based on Foata normal form. 12/3740 useless extension candidates. Maximal degree in co-relation 18268. Up to 1795 conditions per place. [2022-12-06 06:17:39,140 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 48 selfloop transitions, 1 changer transitions 73/124 dead transitions. [2022-12-06 06:17:39,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 124 transitions, 1254 flow [2022-12-06 06:17:39,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:17:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:17:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 06:17:39,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5078125 [2022-12-06 06:17:39,147 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 554 flow. Second operand 4 states and 65 transitions. [2022-12-06 06:17:39,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 124 transitions, 1254 flow [2022-12-06 06:17:39,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 124 transitions, 1237 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 06:17:39,191 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 349 flow [2022-12-06 06:17:39,191 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=349, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2022-12-06 06:17:39,192 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2022-12-06 06:17:39,192 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:39,192 INFO L89 Accepts]: Start accepts. Operand has 66 places, 47 transitions, 349 flow [2022-12-06 06:17:39,193 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:39,193 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:39,193 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 47 transitions, 349 flow [2022-12-06 06:17:39,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 47 transitions, 349 flow [2022-12-06 06:17:39,227 INFO L130 PetriNetUnfolder]: 154/350 cut-off events. [2022-12-06 06:17:39,227 INFO L131 PetriNetUnfolder]: For 1761/1957 co-relation queries the response was YES. [2022-12-06 06:17:39,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 350 events. 154/350 cut-off events. For 1761/1957 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1789 event pairs, 26 based on Foata normal form. 59/395 useless extension candidates. Maximal degree in co-relation 1365. Up to 110 conditions per place. [2022-12-06 06:17:39,230 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 47 transitions, 349 flow [2022-12-06 06:17:39,231 INFO L188 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-06 06:17:39,499 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:17:39,500 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 308 [2022-12-06 06:17:39,500 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 353 flow [2022-12-06 06:17:39,500 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 06:17:39,500 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:39,500 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, 1] [2022-12-06 06:17:39,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 06:17:39,501 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:39,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:39,501 INFO L85 PathProgramCache]: Analyzing trace with hash -55620927, now seen corresponding path program 1 times [2022-12-06 06:17:39,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:39,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112315267] [2022-12-06 06:17:39,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:39,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:40,474 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 06:17:40,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:40,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112315267] [2022-12-06 06:17:40,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112315267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:40,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:40,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:17:40,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233654016] [2022-12-06 06:17:40,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:40,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:17:40,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:40,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:17:40,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:17:40,476 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 06:17:40,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 353 flow. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 06:17:40,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:40,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 06:17:40,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:40,738 INFO L130 PetriNetUnfolder]: 1139/1828 cut-off events. [2022-12-06 06:17:40,738 INFO L131 PetriNetUnfolder]: For 8540/8654 co-relation queries the response was YES. [2022-12-06 06:17:40,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8988 conditions, 1828 events. 1139/1828 cut-off events. For 8540/8654 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8882 event pairs, 305 based on Foata normal form. 15/1811 useless extension candidates. Maximal degree in co-relation 8960. Up to 1074 conditions per place. [2022-12-06 06:17:40,746 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 45 selfloop transitions, 2 changer transitions 44/93 dead transitions. [2022-12-06 06:17:40,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 93 transitions, 821 flow [2022-12-06 06:17:40,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:17:40,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:17:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-12-06 06:17:40,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.504 [2022-12-06 06:17:40,748 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 353 flow. Second operand 5 states and 63 transitions. [2022-12-06 06:17:40,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 93 transitions, 821 flow [2022-12-06 06:17:40,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 93 transitions, 770 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-12-06 06:17:40,766 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 318 flow [2022-12-06 06:17:40,766 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=318, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2022-12-06 06:17:40,767 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2022-12-06 06:17:40,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:40,767 INFO L89 Accepts]: Start accepts. Operand has 62 places, 45 transitions, 318 flow [2022-12-06 06:17:40,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:40,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:40,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 45 transitions, 318 flow [2022-12-06 06:17:40,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 45 transitions, 318 flow [2022-12-06 06:17:40,791 INFO L130 PetriNetUnfolder]: 141/325 cut-off events. [2022-12-06 06:17:40,792 INFO L131 PetriNetUnfolder]: For 1238/1401 co-relation queries the response was YES. [2022-12-06 06:17:40,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1218 conditions, 325 events. 141/325 cut-off events. For 1238/1401 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1741 event pairs, 35 based on Foata normal form. 48/356 useless extension candidates. Maximal degree in co-relation 1194. Up to 102 conditions per place. [2022-12-06 06:17:40,794 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 45 transitions, 318 flow [2022-12-06 06:17:40,794 INFO L188 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-06 06:17:40,795 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:40,796 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 06:17:40,796 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 318 flow [2022-12-06 06:17:40,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 06:17:40,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:40,796 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, 1, 1] [2022-12-06 06:17:40,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 06:17:40,796 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:40,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:40,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1391884502, now seen corresponding path program 1 times [2022-12-06 06:17:40,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:40,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985872066] [2022-12-06 06:17:40,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:40,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:17:40,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:17:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:17:40,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:17:40,920 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:17:40,921 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:17:40,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:17:40,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:17:40,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:17:40,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:17:40,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:17:40,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:17:40,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 06:17:40,923 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:40,928 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:17:40,928 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:17:41,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:17:41 BasicIcfg [2022-12-06 06:17:41,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:17:41,017 INFO L158 Benchmark]: Toolchain (without parser) took 52574.30ms. Allocated memory was 188.7MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 163.9MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 754.4MB. Max. memory is 8.0GB. [2022-12-06 06:17:41,017 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory is still 165.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:17:41,017 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.87ms. Allocated memory is still 188.7MB. Free memory was 163.9MB in the beginning and 135.0MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 06:17:41,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.71ms. Allocated memory is still 188.7MB. Free memory was 135.0MB in the beginning and 132.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:17:41,018 INFO L158 Benchmark]: Boogie Preprocessor took 35.97ms. Allocated memory is still 188.7MB. Free memory was 132.4MB in the beginning and 130.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:17:41,018 INFO L158 Benchmark]: RCFGBuilder took 669.04ms. Allocated memory is still 188.7MB. Free memory was 130.3MB in the beginning and 92.0MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 06:17:41,018 INFO L158 Benchmark]: TraceAbstraction took 51271.82ms. Allocated memory was 188.7MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 91.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 682.1MB. Max. memory is 8.0GB. [2022-12-06 06:17:41,020 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 is still 165.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 546.87ms. Allocated memory is still 188.7MB. Free memory was 163.9MB in the beginning and 135.0MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.71ms. Allocated memory is still 188.7MB. Free memory was 135.0MB in the beginning and 132.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.97ms. Allocated memory is still 188.7MB. Free memory was 132.4MB in the beginning and 130.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 669.04ms. Allocated memory is still 188.7MB. Free memory was 130.3MB in the beginning and 92.0MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 51271.82ms. Allocated memory was 188.7MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 91.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 682.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 140 PlacesBefore, 49 PlacesAfterwards, 129 TransitionsBefore, 37 TransitionsAfterwards, 3272 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 51 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2520, independent: 2446, independent conditional: 2446, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2520, independent: 2446, independent conditional: 0, independent unconditional: 2446, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2520, independent: 2446, independent conditional: 0, independent unconditional: 2446, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2520, independent: 2446, independent conditional: 0, independent unconditional: 2446, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1942, independent: 1898, independent conditional: 0, independent unconditional: 1898, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1942, independent: 1868, independent conditional: 0, independent unconditional: 1868, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 241, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2520, independent: 548, independent conditional: 0, independent unconditional: 548, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 1942, unknown conditional: 0, unknown unconditional: 1942] , Statistics on independence cache: Total cache size (in pairs): 2793, Positive cache size: 2749, Positive conditional cache size: 0, Positive unconditional cache size: 2749, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, 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.3s, 41 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 511, independent: 446, independent conditional: 446, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 511, independent: 446, independent conditional: 35, independent unconditional: 411, dependent: 65, dependent conditional: 6, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 511, independent: 446, independent conditional: 35, independent unconditional: 411, dependent: 65, dependent conditional: 6, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 511, independent: 446, independent conditional: 35, independent unconditional: 411, dependent: 65, dependent conditional: 6, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 239, independent: 212, independent conditional: 17, independent unconditional: 195, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 239, independent: 206, independent conditional: 0, independent unconditional: 206, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 96, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 89, dependent conditional: 17, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 511, independent: 234, independent conditional: 18, independent unconditional: 216, dependent: 38, dependent conditional: 4, dependent unconditional: 34, unknown: 239, unknown conditional: 19, unknown unconditional: 220] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 213, Positive conditional cache size: 17, Positive unconditional cache size: 196, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, 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, 41 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 437, independent: 380, independent conditional: 380, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 437, independent: 380, independent conditional: 23, independent unconditional: 357, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 437, independent: 380, independent conditional: 0, independent unconditional: 380, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 437, independent: 380, independent conditional: 0, independent unconditional: 380, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 437, independent: 351, independent conditional: 0, independent unconditional: 351, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 33, unknown conditional: 0, unknown unconditional: 33] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 255, Positive conditional cache size: 18, Positive unconditional cache size: 237, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 40 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 343, independent: 292, independent conditional: 292, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 343, independent: 292, independent conditional: 15, independent unconditional: 277, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 343, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 343, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 343, independent: 284, independent conditional: 0, independent unconditional: 284, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 315, Positive cache size: 280, Positive conditional cache size: 19, Positive unconditional cache size: 261, Negative cache size: 35, Negative conditional cache size: 2, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 136, independent conditional: 136, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 136, independent conditional: 14, independent unconditional: 122, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 159, independent: 136, independent conditional: 9, independent unconditional: 127, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 159, independent: 136, independent conditional: 9, independent unconditional: 127, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 17, dependent conditional: 15, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 159, independent: 134, independent conditional: 7, independent unconditional: 127, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 323, Positive cache size: 282, Positive conditional cache size: 21, Positive unconditional cache size: 261, Negative cache size: 41, Negative conditional cache size: 6, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 129, independent: 108, independent conditional: 108, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 129, independent: 108, independent conditional: 21, independent unconditional: 87, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 129, independent: 108, independent conditional: 16, independent unconditional: 92, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 129, independent: 108, independent conditional: 16, independent unconditional: 92, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 129, independent: 104, independent conditional: 14, independent unconditional: 90, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 10, unknown conditional: 2, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 333, Positive cache size: 286, Positive conditional cache size: 23, Positive unconditional cache size: 263, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 46 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 550 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 554, independent: 518, independent conditional: 518, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 554, independent: 518, independent conditional: 169, independent unconditional: 349, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 554, independent: 518, independent conditional: 89, independent unconditional: 429, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 554, independent: 518, independent conditional: 89, independent unconditional: 429, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ 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] ], Cache Queries: [ total: 554, independent: 510, independent conditional: 89, independent unconditional: 421, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 395, Positive cache size: 348, Positive conditional cache size: 23, Positive unconditional cache size: 325, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 80, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 287, independent: 265, independent conditional: 265, 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: 287, independent: 265, independent conditional: 64, independent unconditional: 201, 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: 287, independent: 265, independent conditional: 59, independent unconditional: 206, 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: 287, independent: 265, independent conditional: 59, independent unconditional: 206, 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: 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: 287, independent: 264, independent conditional: 59, independent unconditional: 205, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 396, Positive cache size: 349, Positive conditional cache size: 23, Positive unconditional cache size: 326, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 48 PlacesBefore, 48 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 604 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 449, independent: 392, independent conditional: 392, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 449, independent: 392, independent conditional: 125, independent unconditional: 267, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 449, independent: 392, independent conditional: 103, independent unconditional: 289, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 449, independent: 392, independent conditional: 103, independent unconditional: 289, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 6, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 449, independent: 384, independent conditional: 97, independent unconditional: 287, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 415, Positive cache size: 368, Positive conditional cache size: 29, Positive unconditional cache size: 339, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 644 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 258, independent: 227, independent conditional: 227, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 258, independent: 227, independent conditional: 80, independent unconditional: 147, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 258, independent: 227, independent conditional: 68, independent unconditional: 159, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 258, independent: 227, independent conditional: 68, independent unconditional: 159, dependent: 31, dependent conditional: 0, dependent unconditional: 31, 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: 258, independent: 227, independent conditional: 68, independent unconditional: 159, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 415, Positive cache size: 368, Positive conditional cache size: 29, Positive unconditional cache size: 339, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 696 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 577, independent: 545, independent conditional: 545, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 577, independent: 545, independent conditional: 236, independent unconditional: 309, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 577, independent: 545, independent conditional: 140, independent unconditional: 405, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 577, independent: 545, independent conditional: 140, independent unconditional: 405, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 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: 577, independent: 543, independent conditional: 138, independent unconditional: 405, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 417, Positive cache size: 370, Positive conditional cache size: 31, Positive unconditional cache size: 339, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 96, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 600, independent: 567, independent conditional: 567, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 600, independent: 567, independent conditional: 244, independent unconditional: 323, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 600, independent: 567, independent conditional: 157, independent unconditional: 410, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 600, independent: 567, independent conditional: 157, independent unconditional: 410, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 600, independent: 564, independent conditional: 155, independent unconditional: 409, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 373, Positive conditional cache size: 33, Positive unconditional cache size: 340, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 87, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 780 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 646, independent: 611, independent conditional: 611, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 646, independent: 611, independent conditional: 288, independent unconditional: 323, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 646, independent: 611, independent conditional: 198, independent unconditional: 413, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 646, independent: 611, independent conditional: 198, independent unconditional: 413, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 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: 646, independent: 609, independent conditional: 196, independent unconditional: 413, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 422, Positive cache size: 375, Positive conditional cache size: 35, Positive unconditional cache size: 340, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 90, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 64 PlacesBefore, 63 PlacesAfterwards, 80 TransitionsBefore, 79 TransitionsAfterwards, 1158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 819, independent: 797, independent conditional: 797, 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: 819, independent: 797, independent conditional: 467, independent unconditional: 330, 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: 819, independent: 797, independent conditional: 329, independent unconditional: 468, 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: 819, independent: 797, independent conditional: 329, independent unconditional: 468, 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: 12, independent: 12, independent conditional: 9, independent unconditional: 3, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 819, independent: 785, independent conditional: 320, independent unconditional: 465, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 12, unknown conditional: 9, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 468, Positive cache size: 421, Positive conditional cache size: 44, Positive unconditional cache size: 377, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 138, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 70 PlacesBefore, 71 PlacesAfterwards, 86 TransitionsBefore, 87 TransitionsAfterwards, 1356 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 775, independent: 753, independent conditional: 753, 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: 775, independent: 753, independent conditional: 396, independent unconditional: 357, 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: 775, independent: 753, independent conditional: 286, independent unconditional: 467, 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: 775, independent: 753, independent conditional: 286, independent unconditional: 467, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 775, independent: 749, independent conditional: 286, independent unconditional: 463, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 474, Positive cache size: 427, Positive conditional cache size: 44, Positive unconditional cache size: 383, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 110, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 76 PlacesBefore, 77 PlacesAfterwards, 90 TransitionsBefore, 91 TransitionsAfterwards, 1468 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 745, independent: 725, independent conditional: 725, 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: 745, independent: 725, independent conditional: 440, independent unconditional: 285, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 745, independent: 725, independent conditional: 340, independent unconditional: 385, 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: 745, independent: 725, independent conditional: 340, independent unconditional: 385, 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: 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: 745, independent: 725, independent conditional: 340, independent unconditional: 385, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 476, Positive cache size: 429, Positive conditional cache size: 44, Positive unconditional cache size: 385, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 100, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 77 PlacesBefore, 77 PlacesAfterwards, 90 TransitionsBefore, 86 TransitionsAfterwards, 1494 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 882, independent: 862, independent conditional: 862, 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: 882, independent: 862, independent conditional: 582, independent unconditional: 280, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 882, independent: 862, independent conditional: 473, independent unconditional: 389, 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: 882, independent: 862, independent conditional: 473, independent unconditional: 389, 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: 38, independent: 38, independent conditional: 35, independent unconditional: 3, 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: 38, independent: 38, independent conditional: 0, independent unconditional: 38, 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: 882, independent: 824, independent conditional: 438, independent unconditional: 386, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 38, unknown conditional: 35, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 514, Positive cache size: 467, Positive conditional cache size: 79, Positive unconditional cache size: 388, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 109, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.4s, 81 PlacesBefore, 78 PlacesAfterwards, 83 TransitionsBefore, 78 TransitionsAfterwards, 1064 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 678, independent: 658, independent conditional: 658, 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: 678, independent: 658, independent conditional: 438, independent unconditional: 220, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 678, independent: 658, independent conditional: 333, independent unconditional: 325, 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: 678, independent: 658, independent conditional: 333, independent unconditional: 325, 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: 22, independent: 22, independent conditional: 19, independent unconditional: 3, 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: 22, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 678, independent: 636, independent conditional: 314, independent unconditional: 322, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 22, unknown conditional: 19, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 539, Positive cache size: 492, Positive conditional cache size: 98, Positive unconditional cache size: 394, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 105, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 65 PlacesBefore, 64 PlacesAfterwards, 65 TransitionsBefore, 64 TransitionsAfterwards, 698 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 222, independent: 222, independent conditional: 222, 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: 222, independent: 222, independent conditional: 131, independent unconditional: 91, 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: 222, independent: 222, independent conditional: 110, independent unconditional: 112, 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: 222, independent: 222, independent conditional: 110, independent unconditional: 112, 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: 2, independent: 2, independent conditional: 2, 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: 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: 222, independent: 220, independent conditional: 108, independent unconditional: 112, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 674, Positive cache size: 627, Positive conditional cache size: 110, Positive unconditional cache size: 517, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 63 PlacesBefore, 61 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 8, independent unconditional: 5, 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: 13, independent: 13, independent conditional: 8, independent unconditional: 5, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 13, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 711, Positive cache size: 664, Positive conditional cache size: 116, Positive unconditional cache size: 548, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 711, Positive cache size: 664, Positive conditional cache size: 116, Positive unconditional cache size: 548, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t145, ((void *)0), P0, ((void *)0))=-3, t145={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t146, ((void *)0), P1, ((void *)0))=-2, t145={5:0}, t146={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t147; [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t147, ((void *)0), P2, ((void *)0))=-1, t145={5:0}, t146={6:0}, t147={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t148; [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t148, ((void *)0), P3, ((void *)0))=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 3 y = 1 [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L827] 4 z = 1 [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 a = 1 [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [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 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 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: 51.0s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 813 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 813 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2183 IncrementalHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 28 mSDtfsCounter, 2183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=907occurred in iteration=15, InterpolantAutomatonStates: 90, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 2774 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 06:17:41,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...