/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:03:49,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:03:49,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:03:50,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:03:50,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:03:50,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:03:50,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:03:50,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:03:50,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:03:50,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:03:50,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:03:50,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:03:50,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:03:50,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:03:50,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:03:50,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:03:50,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:03:50,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:03:50,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:03:50,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:03:50,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:03:50,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:03:50,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:03:50,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:03:50,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:03:50,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:03:50,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:03:50,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:03:50,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:03:50,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:03:50,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:03:50,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:03:50,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:03:50,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:03:50,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:03:50,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:03:50,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:03:50,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:03:50,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:03:50,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:03:50,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:03:50,056 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-RepeatedSemanticLbe.epf [2022-12-05 23:03:50,079 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:03:50,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:03:50,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:03:50,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:03:50,081 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:03:50,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:03:50,082 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:03:50,082 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:03:50,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:03:50,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:03:50,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:03:50,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:03:50,083 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:03:50,083 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:03:50,083 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:03:50,083 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:03:50,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:03:50,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:03:50,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:03:50,083 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:03:50,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:03:50,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:03:50,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:03:50,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:03:50,084 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:03:50,084 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:03:50,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:03:50,084 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:03:50,084 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-05 23:03:50,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:03:50,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:03:50,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:03:50,328 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:03:50,328 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:03:50,329 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2022-12-05 23:03:51,256 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:03:51,478 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:03:51,478 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2022-12-05 23:03:51,498 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30441fb18/16e32d8abc4c4ef8a8087ad2b58b9375/FLAG925800ee8 [2022-12-05 23:03:51,514 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30441fb18/16e32d8abc4c4ef8a8087ad2b58b9375 [2022-12-05 23:03:51,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:03:51,518 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:03:51,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:03:51,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:03:51,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:03:51,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:03:51" (1/1) ... [2022-12-05 23:03:51,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c015e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:51, skipping insertion in model container [2022-12-05 23:03:51,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:03:51" (1/1) ... [2022-12-05 23:03:51,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:03:51,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:03:51,702 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/mix043.opt.i[944,957] [2022-12-05 23:03:51,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:03:51,897 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:03:51,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/mix043.opt.i[944,957] [2022-12-05 23:03:51,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:03:51,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:03:51,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:03:51,978 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:03:51,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:51 WrapperNode [2022-12-05 23:03:51,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:03:51,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:03:51,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:03:51,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:03:51,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:51" (1/1) ... [2022-12-05 23:03:51,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:51" (1/1) ... [2022-12-05 23:03:52,014 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 167 [2022-12-05 23:03:52,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:03:52,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:03:52,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:03:52,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:03:52,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:51" (1/1) ... [2022-12-05 23:03:52,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:51" (1/1) ... [2022-12-05 23:03:52,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:51" (1/1) ... [2022-12-05 23:03:52,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:51" (1/1) ... [2022-12-05 23:03:52,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:51" (1/1) ... [2022-12-05 23:03:52,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:51" (1/1) ... [2022-12-05 23:03:52,046 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:51" (1/1) ... [2022-12-05 23:03:52,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:51" (1/1) ... [2022-12-05 23:03:52,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:03:52,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:03:52,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:03:52,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:03:52,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:51" (1/1) ... [2022-12-05 23:03:52,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:03:52,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:03:52,090 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-05 23:03:52,114 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-05 23:03:52,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:03:52,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:03:52,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:03:52,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:03:52,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:03:52,126 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:03:52,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:03:52,126 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:03:52,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:03:52,126 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:03:52,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:03:52,126 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 23:03:52,127 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 23:03:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:03:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:03:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:03:52,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:03:52,128 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:03:52,267 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:03:52,268 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:03:52,558 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:03:52,652 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:03:52,653 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:03:52,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:03:52 BoogieIcfgContainer [2022-12-05 23:03:52,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:03:52,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:03:52,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:03:52,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:03:52,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:03:51" (1/3) ... [2022-12-05 23:03:52,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fd3d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:03:52, skipping insertion in model container [2022-12-05 23:03:52,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:03:51" (2/3) ... [2022-12-05 23:03:52,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fd3d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:03:52, skipping insertion in model container [2022-12-05 23:03:52,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:03:52" (3/3) ... [2022-12-05 23:03:52,661 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.opt.i [2022-12-05 23:03:52,674 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:03:52,674 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:03:52,674 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:03:52,715 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:03:52,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2022-12-05 23:03:52,797 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-05 23:03:52,797 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:03:52,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 23:03:52,803 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2022-12-05 23:03:52,809 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2022-12-05 23:03:52,810 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:03:52,832 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-05 23:03:52,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2022-12-05 23:03:52,876 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-05 23:03:52,876 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:03:52,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 23:03:52,879 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-05 23:03:52,880 INFO L188 LiptonReduction]: Number of co-enabled transitions 2936 [2022-12-05 23:03:58,545 INFO L203 LiptonReduction]: Total number of compositions: 99 [2022-12-05 23:03:58,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:03:58,560 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;@4059353d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:03:58,560 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 23:03:58,564 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-05 23:03:58,564 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:03:58,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:03:58,565 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:03:58,565 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:03:58,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:03:58,569 INFO L85 PathProgramCache]: Analyzing trace with hash -435920279, now seen corresponding path program 1 times [2022-12-05 23:03:58,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:03:58,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264521447] [2022-12-05 23:03:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:03:58,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:03:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:03:58,924 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-05 23:03:58,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:03:58,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264521447] [2022-12-05 23:03:58,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264521447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:03:58,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:03:58,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:03:58,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243713672] [2022-12-05 23:03:58,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:03:58,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:03:58,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:03:58,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:03:58,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:03:58,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-05 23:03:58,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:03:58,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:03:58,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-05 23:03:58,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:03:59,472 INFO L130 PetriNetUnfolder]: 3113/4529 cut-off events. [2022-12-05 23:03:59,472 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-05 23:03:59,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8923 conditions, 4529 events. 3113/4529 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 24406 event pairs, 593 based on Foata normal form. 0/4156 useless extension candidates. Maximal degree in co-relation 8911. Up to 3385 conditions per place. [2022-12-05 23:03:59,491 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 30 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2022-12-05 23:03:59,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 164 flow [2022-12-05 23:03:59,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:03:59,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:03:59,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-05 23:03:59,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5698924731182796 [2022-12-05 23:03:59,501 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 53 transitions. [2022-12-05 23:03:59,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 164 flow [2022-12-05 23:03:59,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:03:59,506 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2022-12-05 23:03:59,508 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, 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=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-12-05 23:03:59,510 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2022-12-05 23:03:59,511 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:03:59,511 INFO L89 Accepts]: Start accepts. Operand has 39 places, 26 transitions, 64 flow [2022-12-05 23:03:59,513 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:03:59,513 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:03:59,513 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 26 transitions, 64 flow [2022-12-05 23:03:59,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 64 flow [2022-12-05 23:03:59,518 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-05 23:03:59,519 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:03:59,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:03:59,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 64 flow [2022-12-05 23:03:59,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-05 23:03:59,672 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:03:59,674 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-05 23:03:59,674 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 62 flow [2022-12-05 23:03:59,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:03:59,674 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:03:59,674 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:03:59,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:03:59,677 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:03:59,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:03:59,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1987423476, now seen corresponding path program 1 times [2022-12-05 23:03:59,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:03:59,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241087378] [2022-12-05 23:03:59,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:03:59,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:03:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:03:59,886 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-05 23:03:59,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:03:59,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241087378] [2022-12-05 23:03:59,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241087378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:03:59,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:03:59,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:03:59,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788362542] [2022-12-05 23:03:59,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:03:59,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:03:59,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:03:59,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:03:59,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:03:59,889 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2022-12-05 23:03:59,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 62 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-05 23:03:59,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:03:59,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2022-12-05 23:03:59,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:00,079 INFO L130 PetriNetUnfolder]: 1556/2324 cut-off events. [2022-12-05 23:04:00,079 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-12-05 23:04:00,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4727 conditions, 2324 events. 1556/2324 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11597 event pairs, 440 based on Foata normal form. 36/2347 useless extension candidates. Maximal degree in co-relation 4717. Up to 1621 conditions per place. [2022-12-05 23:04:00,091 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 28 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2022-12-05 23:04:00,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 140 flow [2022-12-05 23:04:00,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:04:00,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:04:00,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-05 23:04:00,092 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-05 23:04:00,093 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 62 flow. Second operand 3 states and 43 transitions. [2022-12-05 23:04:00,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 140 flow [2022-12-05 23:04:00,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:04:00,095 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 66 flow [2022-12-05 23:04:00,095 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2022-12-05 23:04:00,095 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -6 predicate places. [2022-12-05 23:04:00,095 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:00,096 INFO L89 Accepts]: Start accepts. Operand has 37 places, 25 transitions, 66 flow [2022-12-05 23:04:00,096 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:00,096 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:00,096 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 66 flow [2022-12-05 23:04:00,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 25 transitions, 66 flow [2022-12-05 23:04:00,100 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-05 23:04:00,100 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:04:00,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:04:00,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 66 flow [2022-12-05 23:04:00,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-05 23:04:00,112 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:00,112 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-05 23:04:00,114 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2022-12-05 23:04:00,116 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-05 23:04:00,117 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:00,117 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:00,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:04:00,117 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:00,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1480587412, now seen corresponding path program 1 times [2022-12-05 23:04:00,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:00,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33629795] [2022-12-05 23:04:00,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:00,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:00,556 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-05 23:04:00,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:00,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33629795] [2022-12-05 23:04:00,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33629795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:00,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:00,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:00,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935914308] [2022-12-05 23:04:00,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:00,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:04:00,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:00,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:04:00,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:04:00,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 23:04:00,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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-05 23:04:00,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:00,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 23:04:00,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:00,838 INFO L130 PetriNetUnfolder]: 2018/2966 cut-off events. [2022-12-05 23:04:00,838 INFO L131 PetriNetUnfolder]: For 207/207 co-relation queries the response was YES. [2022-12-05 23:04:00,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6318 conditions, 2966 events. 2018/2966 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 14811 event pairs, 464 based on Foata normal form. 18/2980 useless extension candidates. Maximal degree in co-relation 6307. Up to 2365 conditions per place. [2022-12-05 23:04:00,852 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 36 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2022-12-05 23:04:00,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 195 flow [2022-12-05 23:04:00,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:00,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-05 23:04:00,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-05 23:04:00,854 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 4 states and 55 transitions. [2022-12-05 23:04:00,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 195 flow [2022-12-05 23:04:00,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:04:00,856 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 102 flow [2022-12-05 23:04:00,856 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-05 23:04:00,856 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2022-12-05 23:04:00,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:00,857 INFO L89 Accepts]: Start accepts. Operand has 40 places, 30 transitions, 102 flow [2022-12-05 23:04:00,857 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:00,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:00,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 102 flow [2022-12-05 23:04:00,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 102 flow [2022-12-05 23:04:00,863 INFO L130 PetriNetUnfolder]: 10/51 cut-off events. [2022-12-05 23:04:00,863 INFO L131 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2022-12-05 23:04:00,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 51 events. 10/51 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 3 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 96. Up to 20 conditions per place. [2022-12-05 23:04:00,864 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 102 flow [2022-12-05 23:04:00,864 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-05 23:04:00,865 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:00,865 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-05 23:04:00,866 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 102 flow [2022-12-05 23:04:00,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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-05 23:04:00,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:00,866 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:00,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:04:00,866 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:00,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:00,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1480751092, now seen corresponding path program 2 times [2022-12-05 23:04:00,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:00,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680395623] [2022-12-05 23:04:00,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:00,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:01,187 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-05 23:04:01,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:01,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680395623] [2022-12-05 23:04:01,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680395623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:01,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:01,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:01,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436886567] [2022-12-05 23:04:01,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:01,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:04:01,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:01,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:04:01,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:04:01,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 23:04:01,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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-05 23:04:01,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:01,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 23:04:01,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:01,446 INFO L130 PetriNetUnfolder]: 1958/2888 cut-off events. [2022-12-05 23:04:01,446 INFO L131 PetriNetUnfolder]: For 657/657 co-relation queries the response was YES. [2022-12-05 23:04:01,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6974 conditions, 2888 events. 1958/2888 cut-off events. For 657/657 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 14353 event pairs, 464 based on Foata normal form. 18/2902 useless extension candidates. Maximal degree in co-relation 6961. Up to 2236 conditions per place. [2022-12-05 23:04:01,462 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 37 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2022-12-05 23:04:01,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 232 flow [2022-12-05 23:04:01,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-05 23:04:01,463 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-05 23:04:01,463 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 102 flow. Second operand 4 states and 55 transitions. [2022-12-05 23:04:01,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 232 flow [2022-12-05 23:04:01,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 232 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:04:01,465 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 135 flow [2022-12-05 23:04:01,465 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2022-12-05 23:04:01,465 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2022-12-05 23:04:01,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:01,466 INFO L89 Accepts]: Start accepts. Operand has 44 places, 32 transitions, 135 flow [2022-12-05 23:04:01,466 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:01,466 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:01,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 32 transitions, 135 flow [2022-12-05 23:04:01,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 32 transitions, 135 flow [2022-12-05 23:04:01,472 INFO L130 PetriNetUnfolder]: 11/51 cut-off events. [2022-12-05 23:04:01,472 INFO L131 PetriNetUnfolder]: For 26/27 co-relation queries the response was YES. [2022-12-05 23:04:01,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 51 events. 11/51 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 128 event pairs, 3 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 121. Up to 18 conditions per place. [2022-12-05 23:04:01,473 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 32 transitions, 135 flow [2022-12-05 23:04:01,473 INFO L188 LiptonReduction]: Number of co-enabled transitions 396 [2022-12-05 23:04:01,474 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:01,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-05 23:04:01,475 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 135 flow [2022-12-05 23:04:01,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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-05 23:04:01,475 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:01,475 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:01,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:04:01,475 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:01,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash -427786839, now seen corresponding path program 1 times [2022-12-05 23:04:01,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:01,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317536273] [2022-12-05 23:04:01,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:01,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:01,740 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-05 23:04:01,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:01,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317536273] [2022-12-05 23:04:01,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317536273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:01,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:01,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:01,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356709408] [2022-12-05 23:04:01,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:01,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:04:01,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:01,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:04:01,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:04:01,743 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 23:04:01,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 135 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-05 23:04:01,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:01,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 23:04:01,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:02,056 INFO L130 PetriNetUnfolder]: 2276/3314 cut-off events. [2022-12-05 23:04:02,057 INFO L131 PetriNetUnfolder]: For 1791/1791 co-relation queries the response was YES. [2022-12-05 23:04:02,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8648 conditions, 3314 events. 2276/3314 cut-off events. For 1791/1791 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 16787 event pairs, 1589 based on Foata normal form. 9/3301 useless extension candidates. Maximal degree in co-relation 8632. Up to 2667 conditions per place. [2022-12-05 23:04:02,077 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 38 selfloop transitions, 12 changer transitions 0/53 dead transitions. [2022-12-05 23:04:02,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 300 flow [2022-12-05 23:04:02,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:04:02,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:04:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-05 23:04:02,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.472 [2022-12-05 23:04:02,080 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 135 flow. Second operand 5 states and 59 transitions. [2022-12-05 23:04:02,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 300 flow [2022-12-05 23:04:02,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 291 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:04:02,087 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 207 flow [2022-12-05 23:04:02,087 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2022-12-05 23:04:02,088 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2022-12-05 23:04:02,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:02,088 INFO L89 Accepts]: Start accepts. Operand has 48 places, 39 transitions, 207 flow [2022-12-05 23:04:02,089 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:02,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:02,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 39 transitions, 207 flow [2022-12-05 23:04:02,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 207 flow [2022-12-05 23:04:02,101 INFO L130 PetriNetUnfolder]: 27/88 cut-off events. [2022-12-05 23:04:02,102 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-12-05 23:04:02,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 88 events. 27/88 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 304 event pairs, 7 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 263. Up to 33 conditions per place. [2022-12-05 23:04:02,103 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 39 transitions, 207 flow [2022-12-05 23:04:02,103 INFO L188 LiptonReduction]: Number of co-enabled transitions 498 [2022-12-05 23:04:02,106 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:02,107 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-05 23:04:02,107 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 207 flow [2022-12-05 23:04:02,107 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-05 23:04:02,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:02,107 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:02,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:04:02,107 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:02,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:02,110 INFO L85 PathProgramCache]: Analyzing trace with hash -427660359, now seen corresponding path program 2 times [2022-12-05 23:04:02,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:02,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967835919] [2022-12-05 23:04:02,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:02,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:02,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-05 23:04:02,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:02,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967835919] [2022-12-05 23:04:02,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967835919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:02,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:02,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:04:02,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586117153] [2022-12-05 23:04:02,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:02,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:04:02,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:02,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:04:02,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:04:02,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 23:04:02,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-05 23:04:02,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:02,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 23:04:02,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:02,682 INFO L130 PetriNetUnfolder]: 2270/3335 cut-off events. [2022-12-05 23:04:02,683 INFO L131 PetriNetUnfolder]: For 3384/3384 co-relation queries the response was YES. [2022-12-05 23:04:02,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9862 conditions, 3335 events. 2270/3335 cut-off events. For 3384/3384 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 17091 event pairs, 443 based on Foata normal form. 27/3358 useless extension candidates. Maximal degree in co-relation 9844. Up to 2076 conditions per place. [2022-12-05 23:04:02,722 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 46 selfloop transitions, 16 changer transitions 0/65 dead transitions. [2022-12-05 23:04:02,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 404 flow [2022-12-05 23:04:02,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:04:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:04:02,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-05 23:04:02,723 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-05 23:04:02,724 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 207 flow. Second operand 6 states and 70 transitions. [2022-12-05 23:04:02,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 404 flow [2022-12-05 23:04:02,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 389 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-05 23:04:02,741 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 261 flow [2022-12-05 23:04:02,742 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=261, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-05 23:04:02,743 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2022-12-05 23:04:02,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:02,744 INFO L89 Accepts]: Start accepts. Operand has 53 places, 43 transitions, 261 flow [2022-12-05 23:04:02,744 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:02,744 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:02,744 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 261 flow [2022-12-05 23:04:02,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 261 flow [2022-12-05 23:04:02,754 INFO L130 PetriNetUnfolder]: 26/88 cut-off events. [2022-12-05 23:04:02,754 INFO L131 PetriNetUnfolder]: For 160/160 co-relation queries the response was YES. [2022-12-05 23:04:02,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 88 events. 26/88 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 304 event pairs, 5 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 301. Up to 30 conditions per place. [2022-12-05 23:04:02,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 261 flow [2022-12-05 23:04:02,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-05 23:04:02,757 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [510] $Ultimate##0-->L821: Formula: (and (= v_~z$r_buff0_thd2~0_40 v_~z$r_buff1_thd2~0_50) (= v_~z$w_buff0_used~0_347 v_~z$w_buff1_used~0_322) (= v_~z$w_buff0_used~0_346 1) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_26| |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_26|) (= v_~z$w_buff0~0_236 2) (= v_~a~0_34 v_~__unbuffered_p3_EAX~0_83) (= v_~z$r_buff0_thd4~0_112 1) (= |v_P3Thread1of1ForFork3_~arg#1.base_18| |v_P3Thread1of1ForFork3_#in~arg#1.base_18|) (not (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_26| 0)) (= v_~z$r_buff0_thd1~0_38 v_~z$r_buff1_thd1~0_50) (= v_~z$w_buff0~0_237 v_~z$w_buff1~0_207) (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff1_thd3~0_104) (= |v_P3Thread1of1ForFork3_~arg#1.offset_18| |v_P3Thread1of1ForFork3_#in~arg#1.offset_18|) (= v_~z$r_buff1_thd4~0_92 v_~z$r_buff0_thd4~0_113) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_26| (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_346 256))) (not (= (mod v_~z$w_buff1_used~0_322 256) 0)))) 1 0)) (= v_~z$r_buff0_thd0~0_216 v_~z$r_buff1_thd0~0_221) (= v_~a~0_34 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_216, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_347, ~z$w_buff0~0=v_~z$w_buff0~0_237, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_18|, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_18|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_113, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_40} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_92, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_346, ~z$w_buff0~0=v_~z$w_buff0~0_236, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_104, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_50, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_18|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_322, ~z$w_buff1~0=v_~z$w_buff1~0_207, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_26|, ~a~0=v_~a~0_34, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_216, P3Thread1of1ForFork3_~arg#1.base=|v_P3Thread1of1ForFork3_~arg#1.base_18|, P3Thread1of1ForFork3_~arg#1.offset=|v_P3Thread1of1ForFork3_~arg#1.offset_18|, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_26|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_83, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_112, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_40} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork3_~arg#1.base, P3Thread1of1ForFork3_~arg#1.offset, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] and [375] L788-->L795: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse4 (not (= (mod v_~z$w_buff1_used~0_81 256) 0)))) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5))) (and (= v_~z$r_buff0_thd3~0_21 (ite .cse0 0 v_~z$r_buff0_thd3~0_22)) (= (ite (or .cse1 .cse0) 0 v_~z$w_buff1_used~0_81) v_~z$w_buff1_used~0_80) (= v_~z~0_51 (ite .cse2 v_~z$w_buff0~0_42 (ite .cse1 v_~z$w_buff1~0_29 v_~z~0_52))) (= (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_21 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_80 256) 0)))) 0 v_~z$r_buff1_thd3~0_20) v_~z$r_buff1_thd3~0_19) (= v_~z$w_buff0_used~0_91 (ite .cse2 0 v_~z$w_buff0_used~0_92))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_81, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_22, ~z$w_buff1~0=v_~z$w_buff1~0_29, ~z~0=v_~z~0_52} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_80, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~z$w_buff1~0=v_~z$w_buff1~0_29, ~z~0=v_~z~0_51} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0] [2022-12-05 23:04:03,076 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [374] L785-->L788: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [510] $Ultimate##0-->L821: Formula: (and (= v_~z$r_buff0_thd2~0_40 v_~z$r_buff1_thd2~0_50) (= v_~z$w_buff0_used~0_347 v_~z$w_buff1_used~0_322) (= v_~z$w_buff0_used~0_346 1) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_26| |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_26|) (= v_~z$w_buff0~0_236 2) (= v_~a~0_34 v_~__unbuffered_p3_EAX~0_83) (= v_~z$r_buff0_thd4~0_112 1) (= |v_P3Thread1of1ForFork3_~arg#1.base_18| |v_P3Thread1of1ForFork3_#in~arg#1.base_18|) (not (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_26| 0)) (= v_~z$r_buff0_thd1~0_38 v_~z$r_buff1_thd1~0_50) (= v_~z$w_buff0~0_237 v_~z$w_buff1~0_207) (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff1_thd3~0_104) (= |v_P3Thread1of1ForFork3_~arg#1.offset_18| |v_P3Thread1of1ForFork3_#in~arg#1.offset_18|) (= v_~z$r_buff1_thd4~0_92 v_~z$r_buff0_thd4~0_113) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_26| (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_346 256))) (not (= (mod v_~z$w_buff1_used~0_322 256) 0)))) 1 0)) (= v_~z$r_buff0_thd0~0_216 v_~z$r_buff1_thd0~0_221) (= v_~a~0_34 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_216, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_347, ~z$w_buff0~0=v_~z$w_buff0~0_237, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_18|, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_18|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_113, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_40} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_92, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_346, ~z$w_buff0~0=v_~z$w_buff0~0_236, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_104, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_50, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_18|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_322, ~z$w_buff1~0=v_~z$w_buff1~0_207, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_26|, ~a~0=v_~a~0_34, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_216, P3Thread1of1ForFork3_~arg#1.base=|v_P3Thread1of1ForFork3_~arg#1.base_18|, P3Thread1of1ForFork3_~arg#1.offset=|v_P3Thread1of1ForFork3_~arg#1.offset_18|, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_26|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_83, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_112, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_40} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork3_~arg#1.base, P3Thread1of1ForFork3_~arg#1.offset, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] [2022-12-05 23:04:03,175 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [374] L785-->L788: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [511] $Ultimate##0-->L795: Formula: (let ((.cse4 (= (mod v_~z$w_buff0_used~0_405 256) 0)) (.cse0 (not (= (mod v_~z$w_buff0_used~0_403 256) 0))) (.cse1 (not (= (mod v_~z$r_buff0_thd3~0_124 256) 0)))) (let ((.cse2 (and .cse0 .cse1)) (.cse3 (and (not .cse4) .cse1))) (and (= v_~z$w_buff0~0_271 v_~z$w_buff1~0_235) (= v_~z$r_buff0_thd1~0_47 v_~z$r_buff1_thd1~0_59) (= v_~a~0_43 v_~__unbuffered_p3_EAX~0_94) (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd3~0_123 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_372 256) 0)) .cse1)) 0 v_~z$r_buff0_thd3~0_124) v_~z$r_buff1_thd3~0_130) (= v_~a~0_43 1) (not (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_35| 0)) (= |v_P3Thread1of1ForFork3_~arg#1.offset_27| |v_P3Thread1of1ForFork3_#in~arg#1.offset_27|) (= v_~z$r_buff0_thd4~0_139 v_~z$r_buff1_thd4~0_109) (= |v_P3Thread1of1ForFork3_~arg#1.base_27| |v_P3Thread1of1ForFork3_#in~arg#1.base_27|) (= v_~z$w_buff0_used~0_403 (ite .cse1 0 1)) (= (ite .cse2 0 v_~z$r_buff0_thd3~0_124) v_~z$r_buff0_thd3~0_123) (= v_~z$r_buff0_thd4~0_138 1) (= v_~z$r_buff0_thd2~0_49 v_~z$r_buff1_thd2~0_59) (= v_~z$w_buff0~0_270 2) (= (ite (or .cse2 .cse3) 0 v_~z$w_buff0_used~0_405) v_~z$w_buff1_used~0_372) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_35| (ite .cse4 1 0)) (= v_~z~0_322 (ite .cse1 v_~z$w_buff0~0_270 (ite .cse3 v_~z$w_buff1~0_235 v_~z~0_323))) (= v_~z$r_buff0_thd0~0_245 v_~z$r_buff1_thd0~0_250) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_35| |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_35|)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_245, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_405, ~z$w_buff0~0=v_~z$w_buff0~0_271, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_27|, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_27|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_124, ~z~0=v_~z~0_323, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_47, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_49} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_109, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_403, ~z$w_buff0~0=v_~z$w_buff0~0_270, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_130, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_59, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_27|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_372, ~z$w_buff1~0=v_~z$w_buff1~0_235, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_35|, ~a~0=v_~a~0_43, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_245, P3Thread1of1ForFork3_~arg#1.base=|v_P3Thread1of1ForFork3_~arg#1.base_27|, P3Thread1of1ForFork3_~arg#1.offset=|v_P3Thread1of1ForFork3_~arg#1.offset_27|, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_250, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_94, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_138, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_123, ~z~0=v_~z~0_322, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_47, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_49} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork3_~arg#1.base, P3Thread1of1ForFork3_~arg#1.offset, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z$r_buff0_thd3~0, ~z~0] [2022-12-05 23:04:03,331 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [374] L785-->L788: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [334] L860-->L866: Formula: (let ((.cse1 (not (= (mod v_~z$r_buff1_thd0~0_46 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_48 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_85 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_86 256) 0)))) (.cse3 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse1))) (and (= v_~z$r_buff0_thd0~0_47 (ite .cse0 0 v_~z$r_buff0_thd0~0_48)) (= (ite (or (and .cse1 (not (= (mod v_~z$w_buff1_used~0_72 256) 0))) (and .cse2 (not (= (mod v_~z$r_buff0_thd0~0_47 256) 0)))) 0 v_~z$r_buff1_thd0~0_46) v_~z$r_buff1_thd0~0_45) (= (ite (or .cse0 .cse3) 0 v_~z$w_buff1_used~0_73) v_~z$w_buff1_used~0_72) (= v_~z$w_buff0_used~0_85 (ite .cse4 0 v_~z$w_buff0_used~0_86)) (= v_~z~0_47 (ite .cse4 v_~z$w_buff0~0_40 (ite .cse3 v_~z$w_buff1~0_27 v_~z~0_48)))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_48, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_86, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_46, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_48} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_85, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_45, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~z~0=v_~z~0_47} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] [2022-12-05 23:04:03,396 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:04:03,397 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 653 [2022-12-05 23:04:03,397 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 277 flow [2022-12-05 23:04:03,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-05 23:04:03,397 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:03,398 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:03,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:04:03,398 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:03,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:03,398 INFO L85 PathProgramCache]: Analyzing trace with hash 540567852, now seen corresponding path program 1 times [2022-12-05 23:04:03,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:03,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121056892] [2022-12-05 23:04:03,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:03,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:03,792 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-05 23:04:03,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:03,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121056892] [2022-12-05 23:04:03,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121056892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:03,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:03,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:03,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223171037] [2022-12-05 23:04:03,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:03,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:04:03,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:03,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:04:03,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:04:03,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 23:04:03,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 277 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-05 23:04:03,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:03,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 23:04:03,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:04,628 INFO L130 PetriNetUnfolder]: 5471/7496 cut-off events. [2022-12-05 23:04:04,628 INFO L131 PetriNetUnfolder]: For 12796/12796 co-relation queries the response was YES. [2022-12-05 23:04:04,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23952 conditions, 7496 events. 5471/7496 cut-off events. For 12796/12796 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 34190 event pairs, 699 based on Foata normal form. 16/7464 useless extension candidates. Maximal degree in co-relation 23932. Up to 5893 conditions per place. [2022-12-05 23:04:04,675 INFO L137 encePairwiseOnDemand]: 16/29 looper letters, 74 selfloop transitions, 25 changer transitions 0/99 dead transitions. [2022-12-05 23:04:04,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 99 transitions, 702 flow [2022-12-05 23:04:04,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:04:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:04:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2022-12-05 23:04:04,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43349753694581283 [2022-12-05 23:04:04,678 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 277 flow. Second operand 7 states and 88 transitions. [2022-12-05 23:04:04,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 99 transitions, 702 flow [2022-12-05 23:04:04,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 99 transitions, 671 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-12-05 23:04:04,711 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 469 flow [2022-12-05 23:04:04,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=469, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2022-12-05 23:04:04,712 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2022-12-05 23:04:04,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:04,712 INFO L89 Accepts]: Start accepts. Operand has 60 places, 59 transitions, 469 flow [2022-12-05 23:04:04,713 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:04,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:04,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 59 transitions, 469 flow [2022-12-05 23:04:04,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 59 transitions, 469 flow [2022-12-05 23:04:04,751 INFO L130 PetriNetUnfolder]: 217/440 cut-off events. [2022-12-05 23:04:04,751 INFO L131 PetriNetUnfolder]: For 1511/1527 co-relation queries the response was YES. [2022-12-05 23:04:04,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1784 conditions, 440 events. 217/440 cut-off events. For 1511/1527 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2376 event pairs, 34 based on Foata normal form. 1/415 useless extension candidates. Maximal degree in co-relation 1763. Up to 176 conditions per place. [2022-12-05 23:04:04,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 59 transitions, 469 flow [2022-12-05 23:04:04,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 668 [2022-12-05 23:04:04,761 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:04,762 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-05 23:04:04,762 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 469 flow [2022-12-05 23:04:04,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-05 23:04:04,762 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:04,762 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:04,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:04:04,762 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:04,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:04,763 INFO L85 PathProgramCache]: Analyzing trace with hash 540394035, now seen corresponding path program 1 times [2022-12-05 23:04:04,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:04,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458140641] [2022-12-05 23:04:04,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:04,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:05,160 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-05 23:04:05,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:05,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458140641] [2022-12-05 23:04:05,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458140641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:05,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:05,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:04:05,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670873094] [2022-12-05 23:04:05,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:05,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:04:05,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:05,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:04:05,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:04:05,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 23:04:05,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 469 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-05 23:04:05,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:05,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 23:04:05,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:05,866 INFO L130 PetriNetUnfolder]: 5727/7848 cut-off events. [2022-12-05 23:04:05,866 INFO L131 PetriNetUnfolder]: For 20468/20468 co-relation queries the response was YES. [2022-12-05 23:04:05,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28812 conditions, 7848 events. 5727/7848 cut-off events. For 20468/20468 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 36252 event pairs, 1791 based on Foata normal form. 32/7880 useless extension candidates. Maximal degree in co-relation 28788. Up to 7416 conditions per place. [2022-12-05 23:04:05,915 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 67 selfloop transitions, 18 changer transitions 0/85 dead transitions. [2022-12-05 23:04:05,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 784 flow [2022-12-05 23:04:05,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-05 23:04:05,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4482758620689655 [2022-12-05 23:04:05,916 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 469 flow. Second operand 4 states and 52 transitions. [2022-12-05 23:04:05,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 784 flow [2022-12-05 23:04:05,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 85 transitions, 748 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-05 23:04:05,972 INFO L231 Difference]: Finished difference. Result has 64 places, 72 transitions, 645 flow [2022-12-05 23:04:05,972 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=645, PETRI_PLACES=64, PETRI_TRANSITIONS=72} [2022-12-05 23:04:05,973 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2022-12-05 23:04:05,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:05,973 INFO L89 Accepts]: Start accepts. Operand has 64 places, 72 transitions, 645 flow [2022-12-05 23:04:05,973 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:05,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:05,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 72 transitions, 645 flow [2022-12-05 23:04:05,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 72 transitions, 645 flow [2022-12-05 23:04:06,016 INFO L130 PetriNetUnfolder]: 244/483 cut-off events. [2022-12-05 23:04:06,016 INFO L131 PetriNetUnfolder]: For 1880/1945 co-relation queries the response was YES. [2022-12-05 23:04:06,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2180 conditions, 483 events. 244/483 cut-off events. For 1880/1945 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2625 event pairs, 30 based on Foata normal form. 9/475 useless extension candidates. Maximal degree in co-relation 2156. Up to 239 conditions per place. [2022-12-05 23:04:06,021 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 72 transitions, 645 flow [2022-12-05 23:04:06,022 INFO L188 LiptonReduction]: Number of co-enabled transitions 736 [2022-12-05 23:04:06,028 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:06,030 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-05 23:04:06,030 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 72 transitions, 645 flow [2022-12-05 23:04:06,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-05 23:04:06,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:06,030 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:06,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:04:06,030 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:06,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:06,031 INFO L85 PathProgramCache]: Analyzing trace with hash 540561435, now seen corresponding path program 2 times [2022-12-05 23:04:06,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:06,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660601339] [2022-12-05 23:04:06,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:06,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:06,378 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-05 23:04:06,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:06,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660601339] [2022-12-05 23:04:06,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660601339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:06,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:06,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:06,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834265637] [2022-12-05 23:04:06,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:06,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:04:06,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:06,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:04:06,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:04:06,380 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-05 23:04:06,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 72 transitions, 645 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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-05 23:04:06,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:06,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-05 23:04:06,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:06,983 INFO L130 PetriNetUnfolder]: 4160/6151 cut-off events. [2022-12-05 23:04:06,983 INFO L131 PetriNetUnfolder]: For 22389/22611 co-relation queries the response was YES. [2022-12-05 23:04:07,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23957 conditions, 6151 events. 4160/6151 cut-off events. For 22389/22611 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 34009 event pairs, 506 based on Foata normal form. 152/6121 useless extension candidates. Maximal degree in co-relation 23930. Up to 3287 conditions per place. [2022-12-05 23:04:07,031 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 56 selfloop transitions, 28 changer transitions 0/100 dead transitions. [2022-12-05 23:04:07,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 100 transitions, 924 flow [2022-12-05 23:04:07,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:04:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:04:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-05 23:04:07,033 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4896551724137931 [2022-12-05 23:04:07,033 INFO L175 Difference]: Start difference. First operand has 64 places, 72 transitions, 645 flow. Second operand 5 states and 71 transitions. [2022-12-05 23:04:07,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 100 transitions, 924 flow [2022-12-05 23:04:07,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 100 transitions, 907 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-05 23:04:07,083 INFO L231 Difference]: Finished difference. Result has 68 places, 74 transitions, 735 flow [2022-12-05 23:04:07,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=735, PETRI_PLACES=68, PETRI_TRANSITIONS=74} [2022-12-05 23:04:07,084 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2022-12-05 23:04:07,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:07,084 INFO L89 Accepts]: Start accepts. Operand has 68 places, 74 transitions, 735 flow [2022-12-05 23:04:07,085 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:07,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:07,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 74 transitions, 735 flow [2022-12-05 23:04:07,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 74 transitions, 735 flow [2022-12-05 23:04:07,137 INFO L130 PetriNetUnfolder]: 244/489 cut-off events. [2022-12-05 23:04:07,137 INFO L131 PetriNetUnfolder]: For 2375/2414 co-relation queries the response was YES. [2022-12-05 23:04:07,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2373 conditions, 489 events. 244/489 cut-off events. For 2375/2414 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2726 event pairs, 38 based on Foata normal form. 8/482 useless extension candidates. Maximal degree in co-relation 2347. Up to 250 conditions per place. [2022-12-05 23:04:07,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 74 transitions, 735 flow [2022-12-05 23:04:07,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 762 [2022-12-05 23:04:07,153 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] L785-->L795: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd3~0_135 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_409 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_128 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_410 256) 0)) .cse5)) (.cse2 (and .cse5 .cse3)) (.cse1 (and .cse4 (not (= (mod v_~z$w_buff1_used~0_377 256) 0))))) (and (= (ite .cse0 0 v_~z$w_buff0_used~0_410) v_~z$w_buff0_used~0_409) (= (ite .cse0 v_~z$w_buff0~0_274 (ite .cse1 v_~z$w_buff1~0_237 1)) v_~z~0_326) (= (ite .cse2 0 v_~z$r_buff0_thd3~0_128) v_~z$r_buff0_thd3~0_127) (= v_~z$w_buff1_used~0_376 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_377)) (= v_~z$r_buff1_thd3~0_134 (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_127 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_376 256) 0)))) 0 v_~z$r_buff1_thd3~0_135))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_410, ~z$w_buff0~0=v_~z$w_buff0~0_274, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_135, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_377, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_128, ~z$w_buff1~0=v_~z$w_buff1~0_237} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_409, ~z$w_buff0~0=v_~z$w_buff0~0_274, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_134, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_376, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_127, ~z$w_buff1~0=v_~z$w_buff1~0_237, ~z~0=v_~z~0_326} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0] and [510] $Ultimate##0-->L821: Formula: (and (= v_~z$r_buff0_thd2~0_40 v_~z$r_buff1_thd2~0_50) (= v_~z$w_buff0_used~0_347 v_~z$w_buff1_used~0_322) (= v_~z$w_buff0_used~0_346 1) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_26| |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_26|) (= v_~z$w_buff0~0_236 2) (= v_~a~0_34 v_~__unbuffered_p3_EAX~0_83) (= v_~z$r_buff0_thd4~0_112 1) (= |v_P3Thread1of1ForFork3_~arg#1.base_18| |v_P3Thread1of1ForFork3_#in~arg#1.base_18|) (not (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_26| 0)) (= v_~z$r_buff0_thd1~0_38 v_~z$r_buff1_thd1~0_50) (= v_~z$w_buff0~0_237 v_~z$w_buff1~0_207) (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff1_thd3~0_104) (= |v_P3Thread1of1ForFork3_~arg#1.offset_18| |v_P3Thread1of1ForFork3_#in~arg#1.offset_18|) (= v_~z$r_buff1_thd4~0_92 v_~z$r_buff0_thd4~0_113) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_26| (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_346 256))) (not (= (mod v_~z$w_buff1_used~0_322 256) 0)))) 1 0)) (= v_~z$r_buff0_thd0~0_216 v_~z$r_buff1_thd0~0_221) (= v_~a~0_34 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_216, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_347, ~z$w_buff0~0=v_~z$w_buff0~0_237, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_18|, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_18|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_113, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_40} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_92, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_346, ~z$w_buff0~0=v_~z$w_buff0~0_236, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_104, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_50, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_18|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_322, ~z$w_buff1~0=v_~z$w_buff1~0_207, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_26|, ~a~0=v_~a~0_34, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_216, P3Thread1of1ForFork3_~arg#1.base=|v_P3Thread1of1ForFork3_~arg#1.base_18|, P3Thread1of1ForFork3_~arg#1.offset=|v_P3Thread1of1ForFork3_~arg#1.offset_18|, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_26|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_83, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_112, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_40} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork3_~arg#1.base, P3Thread1of1ForFork3_~arg#1.offset, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] [2022-12-05 23:04:07,363 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L788-->L795: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_91 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse4 (not (= (mod v_~z$w_buff1_used~0_81 256) 0)))) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_92 256) 0)) .cse5))) (and (= v_~z$r_buff0_thd3~0_21 (ite .cse0 0 v_~z$r_buff0_thd3~0_22)) (= (ite (or .cse1 .cse0) 0 v_~z$w_buff1_used~0_81) v_~z$w_buff1_used~0_80) (= v_~z~0_51 (ite .cse2 v_~z$w_buff0~0_42 (ite .cse1 v_~z$w_buff1~0_29 v_~z~0_52))) (= (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_21 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_80 256) 0)))) 0 v_~z$r_buff1_thd3~0_20) v_~z$r_buff1_thd3~0_19) (= v_~z$w_buff0_used~0_91 (ite .cse2 0 v_~z$w_buff0_used~0_92))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_81, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_22, ~z$w_buff1~0=v_~z$w_buff1~0_29, ~z~0=v_~z~0_52} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_80, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~z$w_buff1~0=v_~z$w_buff1~0_29, ~z~0=v_~z~0_51} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0] and [510] $Ultimate##0-->L821: Formula: (and (= v_~z$r_buff0_thd2~0_40 v_~z$r_buff1_thd2~0_50) (= v_~z$w_buff0_used~0_347 v_~z$w_buff1_used~0_322) (= v_~z$w_buff0_used~0_346 1) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_26| |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_26|) (= v_~z$w_buff0~0_236 2) (= v_~a~0_34 v_~__unbuffered_p3_EAX~0_83) (= v_~z$r_buff0_thd4~0_112 1) (= |v_P3Thread1of1ForFork3_~arg#1.base_18| |v_P3Thread1of1ForFork3_#in~arg#1.base_18|) (not (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_26| 0)) (= v_~z$r_buff0_thd1~0_38 v_~z$r_buff1_thd1~0_50) (= v_~z$w_buff0~0_237 v_~z$w_buff1~0_207) (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff1_thd3~0_104) (= |v_P3Thread1of1ForFork3_~arg#1.offset_18| |v_P3Thread1of1ForFork3_#in~arg#1.offset_18|) (= v_~z$r_buff1_thd4~0_92 v_~z$r_buff0_thd4~0_113) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_26| (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_346 256))) (not (= (mod v_~z$w_buff1_used~0_322 256) 0)))) 1 0)) (= v_~z$r_buff0_thd0~0_216 v_~z$r_buff1_thd0~0_221) (= v_~a~0_34 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_216, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_347, ~z$w_buff0~0=v_~z$w_buff0~0_237, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_18|, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_18|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_113, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_40} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_92, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_346, ~z$w_buff0~0=v_~z$w_buff0~0_236, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_104, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_50, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_18|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_322, ~z$w_buff1~0=v_~z$w_buff1~0_207, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_26|, ~a~0=v_~a~0_34, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_216, P3Thread1of1ForFork3_~arg#1.base=|v_P3Thread1of1ForFork3_~arg#1.base_18|, P3Thread1of1ForFork3_~arg#1.offset=|v_P3Thread1of1ForFork3_~arg#1.offset_18|, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_26|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_83, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_112, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_40} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork3_~arg#1.base, P3Thread1of1ForFork3_~arg#1.offset, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] [2022-12-05 23:04:07,571 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:04:07,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 488 [2022-12-05 23:04:07,572 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 74 transitions, 747 flow [2022-12-05 23:04:07,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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-05 23:04:07,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:07,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:07,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:04:07,572 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:07,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:07,573 INFO L85 PathProgramCache]: Analyzing trace with hash -422522481, now seen corresponding path program 1 times [2022-12-05 23:04:07,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:07,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500528739] [2022-12-05 23:04:07,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:07,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:07,916 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-05 23:04:07,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:07,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500528739] [2022-12-05 23:04:07,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500528739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:07,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:07,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:04:07,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634026111] [2022-12-05 23:04:07,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:07,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:04:07,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:07,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:04:07,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:04:07,918 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-05 23:04:07,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 74 transitions, 747 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-05 23:04:07,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:07,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-05 23:04:07,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:08,529 INFO L130 PetriNetUnfolder]: 4527/6650 cut-off events. [2022-12-05 23:04:08,529 INFO L131 PetriNetUnfolder]: For 29654/29850 co-relation queries the response was YES. [2022-12-05 23:04:08,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27841 conditions, 6650 events. 4527/6650 cut-off events. For 29654/29850 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 37011 event pairs, 649 based on Foata normal form. 92/6514 useless extension candidates. Maximal degree in co-relation 27812. Up to 4086 conditions per place. [2022-12-05 23:04:08,576 INFO L137 encePairwiseOnDemand]: 19/31 looper letters, 56 selfloop transitions, 31 changer transitions 0/103 dead transitions. [2022-12-05 23:04:08,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 103 transitions, 1045 flow [2022-12-05 23:04:08,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:04:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:04:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-05 23:04:08,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4645161290322581 [2022-12-05 23:04:08,577 INFO L175 Difference]: Start difference. First operand has 68 places, 74 transitions, 747 flow. Second operand 5 states and 72 transitions. [2022-12-05 23:04:08,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 103 transitions, 1045 flow [2022-12-05 23:04:08,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 103 transitions, 971 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-05 23:04:08,707 INFO L231 Difference]: Finished difference. Result has 69 places, 79 transitions, 822 flow [2022-12-05 23:04:08,708 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=822, PETRI_PLACES=69, PETRI_TRANSITIONS=79} [2022-12-05 23:04:08,708 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2022-12-05 23:04:08,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:08,708 INFO L89 Accepts]: Start accepts. Operand has 69 places, 79 transitions, 822 flow [2022-12-05 23:04:08,711 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:08,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:08,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 79 transitions, 822 flow [2022-12-05 23:04:08,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 79 transitions, 822 flow [2022-12-05 23:04:08,753 INFO L130 PetriNetUnfolder]: 265/532 cut-off events. [2022-12-05 23:04:08,753 INFO L131 PetriNetUnfolder]: For 2536/2588 co-relation queries the response was YES. [2022-12-05 23:04:08,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2629 conditions, 532 events. 265/532 cut-off events. For 2536/2588 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3035 event pairs, 36 based on Foata normal form. 11/522 useless extension candidates. Maximal degree in co-relation 2604. Up to 273 conditions per place. [2022-12-05 23:04:08,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 79 transitions, 822 flow [2022-12-05 23:04:08,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 826 [2022-12-05 23:04:08,764 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:08,765 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-05 23:04:08,765 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 79 transitions, 822 flow [2022-12-05 23:04:08,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-05 23:04:08,765 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:08,765 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:08,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:04:08,765 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:08,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:08,766 INFO L85 PathProgramCache]: Analyzing trace with hash -422358801, now seen corresponding path program 2 times [2022-12-05 23:04:08,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:08,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712129121] [2022-12-05 23:04:08,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:08,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:09,265 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-05 23:04:09,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:09,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712129121] [2022-12-05 23:04:09,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712129121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:09,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:09,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:04:09,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248523261] [2022-12-05 23:04:09,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:09,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:04:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:09,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:04:09,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:04:09,267 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-05 23:04:09,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 79 transitions, 822 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-05 23:04:09,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:09,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-05 23:04:09,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:10,090 INFO L130 PetriNetUnfolder]: 6763/9316 cut-off events. [2022-12-05 23:04:10,090 INFO L131 PetriNetUnfolder]: For 34778/34778 co-relation queries the response was YES. [2022-12-05 23:04:10,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39316 conditions, 9316 events. 6763/9316 cut-off events. For 34778/34778 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 45037 event pairs, 647 based on Foata normal form. 64/9380 useless extension candidates. Maximal degree in co-relation 39288. Up to 5805 conditions per place. [2022-12-05 23:04:10,136 INFO L137 encePairwiseOnDemand]: 18/31 looper letters, 91 selfloop transitions, 31 changer transitions 0/122 dead transitions. [2022-12-05 23:04:10,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 122 transitions, 1256 flow [2022-12-05 23:04:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:04:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:04:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-12-05 23:04:10,137 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44623655913978494 [2022-12-05 23:04:10,137 INFO L175 Difference]: Start difference. First operand has 69 places, 79 transitions, 822 flow. Second operand 6 states and 83 transitions. [2022-12-05 23:04:10,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 122 transitions, 1256 flow [2022-12-05 23:04:10,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 122 transitions, 1232 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:04:10,211 INFO L231 Difference]: Finished difference. Result has 73 places, 81 transitions, 909 flow [2022-12-05 23:04:10,212 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=909, PETRI_PLACES=73, PETRI_TRANSITIONS=81} [2022-12-05 23:04:10,212 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2022-12-05 23:04:10,212 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:10,212 INFO L89 Accepts]: Start accepts. Operand has 73 places, 81 transitions, 909 flow [2022-12-05 23:04:10,214 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:10,214 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:10,214 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 81 transitions, 909 flow [2022-12-05 23:04:10,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 81 transitions, 909 flow [2022-12-05 23:04:10,260 INFO L130 PetriNetUnfolder]: 270/554 cut-off events. [2022-12-05 23:04:10,260 INFO L131 PetriNetUnfolder]: For 3593/3667 co-relation queries the response was YES. [2022-12-05 23:04:10,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2835 conditions, 554 events. 270/554 cut-off events. For 3593/3667 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3274 event pairs, 33 based on Foata normal form. 14/543 useless extension candidates. Maximal degree in co-relation 2808. Up to 278 conditions per place. [2022-12-05 23:04:10,266 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 81 transitions, 909 flow [2022-12-05 23:04:10,266 INFO L188 LiptonReduction]: Number of co-enabled transitions 852 [2022-12-05 23:04:10,272 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:10,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-05 23:04:10,273 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 81 transitions, 909 flow [2022-12-05 23:04:10,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-05 23:04:10,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:10,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:10,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:04:10,273 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:10,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:10,274 INFO L85 PathProgramCache]: Analyzing trace with hash -422496875, now seen corresponding path program 1 times [2022-12-05 23:04:10,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:10,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433930058] [2022-12-05 23:04:10,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:10,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:10,702 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-05 23:04:10,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:10,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433930058] [2022-12-05 23:04:10,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433930058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:10,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:10,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:04:10,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44266982] [2022-12-05 23:04:10,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:10,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:04:10,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:10,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:04:10,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:04:10,705 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-05 23:04:10,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 81 transitions, 909 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-05 23:04:10,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:10,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-05 23:04:10,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:11,378 INFO L130 PetriNetUnfolder]: 4444/6567 cut-off events. [2022-12-05 23:04:11,378 INFO L131 PetriNetUnfolder]: For 39028/39344 co-relation queries the response was YES. [2022-12-05 23:04:11,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28434 conditions, 6567 events. 4444/6567 cut-off events. For 39028/39344 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 37059 event pairs, 788 based on Foata normal form. 112/6443 useless extension candidates. Maximal degree in co-relation 28404. Up to 2827 conditions per place. [2022-12-05 23:04:11,416 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 56 selfloop transitions, 26 changer transitions 0/98 dead transitions. [2022-12-05 23:04:11,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 98 transitions, 1133 flow [2022-12-05 23:04:11,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-05 23:04:11,417 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47580645161290325 [2022-12-05 23:04:11,417 INFO L175 Difference]: Start difference. First operand has 73 places, 81 transitions, 909 flow. Second operand 4 states and 59 transitions. [2022-12-05 23:04:11,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 98 transitions, 1133 flow [2022-12-05 23:04:11,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 98 transitions, 1065 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-05 23:04:11,484 INFO L231 Difference]: Finished difference. Result has 72 places, 81 transitions, 920 flow [2022-12-05 23:04:11,484 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=920, PETRI_PLACES=72, PETRI_TRANSITIONS=81} [2022-12-05 23:04:11,485 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2022-12-05 23:04:11,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:11,485 INFO L89 Accepts]: Start accepts. Operand has 72 places, 81 transitions, 920 flow [2022-12-05 23:04:11,485 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:11,486 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:11,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 81 transitions, 920 flow [2022-12-05 23:04:11,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 81 transitions, 920 flow [2022-12-05 23:04:11,526 INFO L130 PetriNetUnfolder]: 250/524 cut-off events. [2022-12-05 23:04:11,526 INFO L131 PetriNetUnfolder]: For 3193/3250 co-relation queries the response was YES. [2022-12-05 23:04:11,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2720 conditions, 524 events. 250/524 cut-off events. For 3193/3250 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3122 event pairs, 30 based on Foata normal form. 14/517 useless extension candidates. Maximal degree in co-relation 2693. Up to 254 conditions per place. [2022-12-05 23:04:11,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 81 transitions, 920 flow [2022-12-05 23:04:11,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 852 [2022-12-05 23:04:11,536 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:11,536 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-05 23:04:11,536 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 81 transitions, 920 flow [2022-12-05 23:04:11,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-05 23:04:11,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:11,537 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:11,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:04:11,537 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:11,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:11,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1368998575, now seen corresponding path program 1 times [2022-12-05 23:04:11,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:11,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411823000] [2022-12-05 23:04:11,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:11,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:11,612 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-05 23:04:11,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:11,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411823000] [2022-12-05 23:04:11,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411823000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:11,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:11,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:04:11,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881430825] [2022-12-05 23:04:11,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:11,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:04:11,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:11,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:04:11,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:04:11,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-05 23:04:11,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 81 transitions, 920 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-05 23:04:11,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:11,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-05 23:04:11,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:12,037 INFO L130 PetriNetUnfolder]: 2710/4179 cut-off events. [2022-12-05 23:04:12,038 INFO L131 PetriNetUnfolder]: For 25674/25860 co-relation queries the response was YES. [2022-12-05 23:04:12,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18782 conditions, 4179 events. 2710/4179 cut-off events. For 25674/25860 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 23627 event pairs, 581 based on Foata normal form. 194/4216 useless extension candidates. Maximal degree in co-relation 18752. Up to 3353 conditions per place. [2022-12-05 23:04:12,065 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 79 selfloop transitions, 5 changer transitions 0/101 dead transitions. [2022-12-05 23:04:12,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 101 transitions, 1216 flow [2022-12-05 23:04:12,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:04:12,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:04:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-05 23:04:12,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6236559139784946 [2022-12-05 23:04:12,066 INFO L175 Difference]: Start difference. First operand has 72 places, 81 transitions, 920 flow. Second operand 3 states and 58 transitions. [2022-12-05 23:04:12,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 101 transitions, 1216 flow [2022-12-05 23:04:12,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 101 transitions, 1128 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-05 23:04:12,088 INFO L231 Difference]: Finished difference. Result has 71 places, 78 transitions, 765 flow [2022-12-05 23:04:12,088 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=765, PETRI_PLACES=71, PETRI_TRANSITIONS=78} [2022-12-05 23:04:12,089 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2022-12-05 23:04:12,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:12,089 INFO L89 Accepts]: Start accepts. Operand has 71 places, 78 transitions, 765 flow [2022-12-05 23:04:12,089 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:12,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:12,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 78 transitions, 765 flow [2022-12-05 23:04:12,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 78 transitions, 765 flow [2022-12-05 23:04:12,203 INFO L130 PetriNetUnfolder]: 627/1190 cut-off events. [2022-12-05 23:04:12,204 INFO L131 PetriNetUnfolder]: For 4633/4743 co-relation queries the response was YES. [2022-12-05 23:04:12,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5100 conditions, 1190 events. 627/1190 cut-off events. For 4633/4743 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 8174 event pairs, 181 based on Foata normal form. 16/1081 useless extension candidates. Maximal degree in co-relation 5072. Up to 456 conditions per place. [2022-12-05 23:04:12,217 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 78 transitions, 765 flow [2022-12-05 23:04:12,217 INFO L188 LiptonReduction]: Number of co-enabled transitions 932 [2022-12-05 23:04:12,256 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] L785-->L866: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd0~0_257 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_252 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_421 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_422 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_385 256) 0))))) (and (= v_~z$w_buff1_used~0_384 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_385)) (= v_~z$w_buff0_used~0_421 (ite .cse2 0 v_~z$w_buff0_used~0_422)) (= v_~z$r_buff0_thd0~0_251 (ite .cse0 0 v_~z$r_buff0_thd0~0_252)) (= v_~z$r_buff1_thd0~0_256 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_384 256) 0)) .cse3) (and (not (= (mod v_~z$r_buff0_thd0~0_251 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_257)) (= v_~z~0_336 (ite .cse2 v_~z$w_buff0~0_284 (ite .cse1 v_~z$w_buff1~0_243 1)))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_252, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_422, ~z$w_buff0~0=v_~z$w_buff0~0_284, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_257, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_385, ~z$w_buff1~0=v_~z$w_buff1~0_243} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_251, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_421, ~z$w_buff0~0=v_~z$w_buff0~0_284, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_256, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_384, ~z$w_buff1~0=v_~z$w_buff1~0_243, ~z~0=v_~z~0_336} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] and [510] $Ultimate##0-->L821: Formula: (and (= v_~z$r_buff0_thd2~0_40 v_~z$r_buff1_thd2~0_50) (= v_~z$w_buff0_used~0_347 v_~z$w_buff1_used~0_322) (= v_~z$w_buff0_used~0_346 1) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_26| |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_26|) (= v_~z$w_buff0~0_236 2) (= v_~a~0_34 v_~__unbuffered_p3_EAX~0_83) (= v_~z$r_buff0_thd4~0_112 1) (= |v_P3Thread1of1ForFork3_~arg#1.base_18| |v_P3Thread1of1ForFork3_#in~arg#1.base_18|) (not (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_26| 0)) (= v_~z$r_buff0_thd1~0_38 v_~z$r_buff1_thd1~0_50) (= v_~z$w_buff0~0_237 v_~z$w_buff1~0_207) (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff1_thd3~0_104) (= |v_P3Thread1of1ForFork3_~arg#1.offset_18| |v_P3Thread1of1ForFork3_#in~arg#1.offset_18|) (= v_~z$r_buff1_thd4~0_92 v_~z$r_buff0_thd4~0_113) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_26| (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_346 256))) (not (= (mod v_~z$w_buff1_used~0_322 256) 0)))) 1 0)) (= v_~z$r_buff0_thd0~0_216 v_~z$r_buff1_thd0~0_221) (= v_~a~0_34 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_216, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_347, ~z$w_buff0~0=v_~z$w_buff0~0_237, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_18|, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_18|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_113, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_40} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_92, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_346, ~z$w_buff0~0=v_~z$w_buff0~0_236, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_104, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_50, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_18|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_322, ~z$w_buff1~0=v_~z$w_buff1~0_207, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_26|, ~a~0=v_~a~0_34, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_216, P3Thread1of1ForFork3_~arg#1.base=|v_P3Thread1of1ForFork3_~arg#1.base_18|, P3Thread1of1ForFork3_~arg#1.offset=|v_P3Thread1of1ForFork3_~arg#1.offset_18|, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_26|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_50, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_83, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_112, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_40} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork3_~arg#1.base, P3Thread1of1ForFork3_~arg#1.offset, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] [2022-12-05 23:04:12,446 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] L785-->L866: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd0~0_257 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_252 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_421 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_422 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_385 256) 0))))) (and (= v_~z$w_buff1_used~0_384 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_385)) (= v_~z$w_buff0_used~0_421 (ite .cse2 0 v_~z$w_buff0_used~0_422)) (= v_~z$r_buff0_thd0~0_251 (ite .cse0 0 v_~z$r_buff0_thd0~0_252)) (= v_~z$r_buff1_thd0~0_256 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_384 256) 0)) .cse3) (and (not (= (mod v_~z$r_buff0_thd0~0_251 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_257)) (= v_~z~0_336 (ite .cse2 v_~z$w_buff0~0_284 (ite .cse1 v_~z$w_buff1~0_243 1)))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_252, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_422, ~z$w_buff0~0=v_~z$w_buff0~0_284, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_257, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_385, ~z$w_buff1~0=v_~z$w_buff1~0_243} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_251, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_421, ~z$w_buff0~0=v_~z$w_buff0~0_284, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_256, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_384, ~z$w_buff1~0=v_~z$w_buff1~0_243, ~z~0=v_~z~0_336} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] and [517] L788-->L821: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff0_thd3~0_148 256) 0)))) (let ((.cse0 (and .cse2 (not (= (mod v_~z$w_buff0_used~0_441 256) 0))))) (let ((.cse1 (ite .cse0 0 v_~z$w_buff0_used~0_441))) (and (= |v_P3Thread1of1ForFork3_~arg#1.base_35| |v_P3Thread1of1ForFork3_#in~arg#1.base_35|) (= v_~a~0_51 1) (not (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_43| 0)) (= (ite .cse0 v_~z$w_buff0~0_297 (ite (and (not (= (mod v_~z$w_buff1_used~0_404 256) 0)) (not (= (mod v_~z$r_buff1_thd3~0_156 256) 0))) v_~z$w_buff1~0_256 v_~z~0_351)) v_~z~0_350) (= v_~z$r_buff0_thd4~0_155 v_~z$r_buff1_thd4~0_117) (= v_~a~0_51 v_~__unbuffered_p3_EAX~0_105) (= v_~z$w_buff0_used~0_439 1) (= v_~z$w_buff1_used~0_402 .cse1) (= |v_P3Thread1of1ForFork3_~arg#1.offset_35| |v_P3Thread1of1ForFork3_#in~arg#1.offset_35|) (= v_~z$w_buff0~0_297 v_~z$w_buff1~0_255) (= v_~z$r_buff0_thd2~0_57 v_~z$r_buff1_thd2~0_67) (= v_~z$r_buff0_thd1~0_55 v_~z$r_buff1_thd1~0_67) (= v_~z$r_buff0_thd4~0_154 1) (= v_~z$w_buff0~0_296 2) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_439 256) 0)) (not (= (mod v_~z$w_buff1_used~0_402 256) 0)))) 1 0) |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_43|) (= v_~z$r_buff0_thd3~0_147 v_~z$r_buff1_thd3~0_154) (= v_~z$r_buff0_thd0~0_264 v_~z$r_buff1_thd0~0_268) (= v_~z$r_buff0_thd3~0_147 (ite (and (not (= (mod .cse1 256) 0)) .cse2) 0 v_~z$r_buff0_thd3~0_148)) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_43| |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_43|))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_441, ~z$w_buff0~0=v_~z$w_buff0~0_297, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_156, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_35|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_404, ~z$w_buff1~0=v_~z$w_buff1~0_256, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_264, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_35|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_155, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_148, ~z~0=v_~z~0_351, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_55, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_117, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_439, ~z$w_buff0~0=v_~z$w_buff0~0_296, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_154, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_67, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_35|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_402, ~z$w_buff1~0=v_~z$w_buff1~0_255, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_43|, ~a~0=v_~a~0_51, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_264, P3Thread1of1ForFork3_~arg#1.base=|v_P3Thread1of1ForFork3_~arg#1.base_35|, P3Thread1of1ForFork3_~arg#1.offset=|v_P3Thread1of1ForFork3_~arg#1.offset_35|, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_43|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_268, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_35|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_67, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_105, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_154, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_147, ~z~0=v_~z~0_350, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_55, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork3_~arg#1.base, P3Thread1of1ForFork3_~arg#1.offset, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z$r_buff0_thd3~0, ~z~0] [2022-12-05 23:04:12,705 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:04:12,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 617 [2022-12-05 23:04:12,706 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 78 transitions, 777 flow [2022-12-05 23:04:12,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-05 23:04:12,706 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:12,706 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:12,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:04:12,707 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:12,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:12,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1164880753, now seen corresponding path program 1 times [2022-12-05 23:04:12,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:12,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857156120] [2022-12-05 23:04:12,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:12,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:12,804 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-05 23:04:12,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:12,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857156120] [2022-12-05 23:04:12,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857156120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:12,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:12,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:12,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883457048] [2022-12-05 23:04:12,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:12,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:04:12,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:12,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:04:12,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:04:12,807 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-05 23:04:12,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 78 transitions, 777 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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-05 23:04:12,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:12,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-05 23:04:12,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:13,106 INFO L130 PetriNetUnfolder]: 1380/2277 cut-off events. [2022-12-05 23:04:13,106 INFO L131 PetriNetUnfolder]: For 10032/10148 co-relation queries the response was YES. [2022-12-05 23:04:13,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10373 conditions, 2277 events. 1380/2277 cut-off events. For 10032/10148 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 12322 event pairs, 234 based on Foata normal form. 222/2423 useless extension candidates. Maximal degree in co-relation 10342. Up to 1126 conditions per place. [2022-12-05 23:04:13,123 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 99 selfloop transitions, 9 changer transitions 1/124 dead transitions. [2022-12-05 23:04:13,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 124 transitions, 1429 flow [2022-12-05 23:04:13,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-05 23:04:13,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2022-12-05 23:04:13,125 INFO L175 Difference]: Start difference. First operand has 71 places, 78 transitions, 777 flow. Second operand 4 states and 80 transitions. [2022-12-05 23:04:13,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 124 transitions, 1429 flow [2022-12-05 23:04:13,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 124 transitions, 1399 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:04:13,140 INFO L231 Difference]: Finished difference. Result has 72 places, 79 transitions, 778 flow [2022-12-05 23:04:13,140 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=778, PETRI_PLACES=72, PETRI_TRANSITIONS=79} [2022-12-05 23:04:13,141 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2022-12-05 23:04:13,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:13,141 INFO L89 Accepts]: Start accepts. Operand has 72 places, 79 transitions, 778 flow [2022-12-05 23:04:13,143 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:13,143 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:13,143 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 79 transitions, 778 flow [2022-12-05 23:04:13,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 79 transitions, 778 flow [2022-12-05 23:04:13,206 INFO L130 PetriNetUnfolder]: 304/650 cut-off events. [2022-12-05 23:04:13,206 INFO L131 PetriNetUnfolder]: For 2648/2840 co-relation queries the response was YES. [2022-12-05 23:04:13,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3055 conditions, 650 events. 304/650 cut-off events. For 2648/2840 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4029 event pairs, 52 based on Foata normal form. 25/629 useless extension candidates. Maximal degree in co-relation 3027. Up to 266 conditions per place. [2022-12-05 23:04:13,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 79 transitions, 778 flow [2022-12-05 23:04:13,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 810 [2022-12-05 23:04:13,324 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L855-3-->L860: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_29| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|) (= v_~main$tmp_guard0~0_44 (ite (= (ite (= v_~__unbuffered_cnt~0_129 4) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_29| 0)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_39|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} 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 [519] L785-->L821: Formula: (let ((.cse7 (not (= (mod v_~z$r_buff0_thd0~0_271 256) 0)))) (let ((.cse4 (and .cse7 (not (= (mod v_~z$w_buff0_used~0_453 256) 0))))) (let ((.cse6 (ite .cse4 0 v_~z$w_buff0_used~0_453))) (let ((.cse5 (not (= (mod v_~z$r_buff0_thd3~0_154 256) 0))) (.cse8 (not (= (mod .cse6 256) 0)))) (let ((.cse2 (and .cse5 .cse8))) (let ((.cse1 (and .cse7 .cse8)) (.cse0 (ite .cse2 0 .cse6))) (and (= v_~z$w_buff0_used~0_451 1) (= v_~z$r_buff0_thd4~0_163 v_~z$r_buff1_thd4~0_121) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_47| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_451 256) 0)) (not (= (mod v_~z$w_buff1_used~0_414 256) 0)))) 1 0)) (not (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_47| 0)) (= v_~z$w_buff1_used~0_414 .cse0) (= v_~a~0_55 v_~__unbuffered_p3_EAX~0_109) (= v_~z$r_buff0_thd0~0_270 (ite .cse1 0 v_~z$r_buff0_thd0~0_271)) (= |v_P3Thread1of1ForFork3_~arg#1.offset_39| |v_P3Thread1of1ForFork3_#in~arg#1.offset_39|) (= v_~z$r_buff0_thd1~0_59 v_~z$r_buff1_thd1~0_71) (= v_~z$r_buff0_thd4~0_162 1) (= v_~z$r_buff0_thd3~0_153 v_~z$r_buff1_thd3~0_162) (= v_~z$w_buff0~0_305 v_~z$w_buff1~0_263) (= v_~z$w_buff0~0_304 2) (= v_~z$r_buff0_thd2~0_61 v_~z$r_buff1_thd2~0_71) (= v_~z$r_buff0_thd0~0_270 v_~z$r_buff1_thd0~0_276) (= |v_P3Thread1of1ForFork3_~arg#1.base_39| |v_P3Thread1of1ForFork3_#in~arg#1.base_39|) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_47| |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_47|) (= v_~a~0_55 1) (= v_~z~0_356 (ite .cse2 v_~z$w_buff0~0_305 (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_416 256) 0)) (not (= (mod v_~z$r_buff1_thd0~0_278 256) 0))))) (ite (and (not (= (mod (ite (or .cse1 .cse3) 0 v_~z$w_buff1_used~0_416) 256) 0)) (not (= (mod v_~z$r_buff1_thd3~0_163 256) 0))) v_~z$w_buff1~0_264 (ite .cse4 v_~z$w_buff0~0_305 (ite .cse3 v_~z$w_buff1~0_264 1)))))) (= v_~z$r_buff0_thd3~0_153 (ite (and .cse5 (not (= (mod .cse0 256) 0))) 0 v_~z$r_buff0_thd3~0_154))))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_453, ~z$w_buff0~0=v_~z$w_buff0~0_305, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_163, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_39|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_416, ~z$w_buff1~0=v_~z$w_buff1~0_264, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_271, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_39|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_278, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_163, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_154, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_59, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_61} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_121, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_451, ~z$w_buff0~0=v_~z$w_buff0~0_304, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_162, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_71, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_39|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_414, ~z$w_buff1~0=v_~z$w_buff1~0_263, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_47|, ~a~0=v_~a~0_55, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_270, P3Thread1of1ForFork3_~arg#1.base=|v_P3Thread1of1ForFork3_~arg#1.base_39|, P3Thread1of1ForFork3_~arg#1.offset=|v_P3Thread1of1ForFork3_~arg#1.offset_39|, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_47|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_276, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_39|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_71, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_109, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_162, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_153, ~z~0=v_~z~0_356, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_59, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_61} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~a~0, ~z$r_buff0_thd0~0, P3Thread1of1ForFork3_~arg#1.base, P3Thread1of1ForFork3_~arg#1.offset, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z$r_buff0_thd3~0, ~z~0] [2022-12-05 23:04:13,609 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L855-3-->L860: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_29| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|) (= v_~main$tmp_guard0~0_44 (ite (= (ite (= v_~__unbuffered_cnt~0_129 4) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_29| 0)) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_39|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} 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 [518] L785-->L821: Formula: (let ((.cse2 (not (= (mod v_~z$r_buff0_thd0~0_267 256) 0)))) (let ((.cse0 (and .cse2 (not (= 0 (mod v_~z$w_buff0_used~0_447 256))))) (.cse1 (not (= (mod v_~z$w_buff1_used~0_408 256) 0)))) (and (= v_~z$r_buff0_thd1~0_57 v_~z$r_buff1_thd1~0_69) (= v_~a~0_53 1) (= v_~z$w_buff0~0_300 2) (= v_~z$r_buff0_thd0~0_266 v_~z$r_buff1_thd0~0_270) (= v_~a~0_53 v_~__unbuffered_p3_EAX~0_107) (= v_~z$r_buff0_thd2~0_59 v_~z$r_buff1_thd2~0_69) (= v_~z$r_buff0_thd4~0_158 1) (= |v_P3Thread1of1ForFork3_~arg#1.offset_37| |v_P3Thread1of1ForFork3_#in~arg#1.offset_37|) (= v_~z$r_buff0_thd4~0_159 v_~z$r_buff1_thd4~0_119) (= v_~z$w_buff1_used~0_408 (ite .cse0 0 v_~z$w_buff0_used~0_447)) (not (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_45| 0)) (= v_~z$w_buff0~0_301 v_~z$w_buff1~0_259) (= v_~z$r_buff0_thd3~0_151 v_~z$r_buff1_thd3~0_160) (= v_~z$r_buff0_thd0~0_266 (ite (and .cse1 .cse2) 0 v_~z$r_buff0_thd0~0_267)) (= |v_P3Thread1of1ForFork3_~arg#1.base_37| |v_P3Thread1of1ForFork3_#in~arg#1.base_37|) (= v_~z$w_buff0_used~0_445 1) (= v_~z~0_354 (ite .cse0 v_~z$w_buff0~0_301 (ite (and (not (= 0 (mod v_~z$w_buff1_used~0_410 256))) (not (= (mod v_~z$r_buff1_thd0~0_272 256) 0))) v_~z$w_buff1~0_260 1))) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_45| |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_45|) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_45| (ite (not (and .cse1 (not (= (mod v_~z$w_buff0_used~0_445 256) 0)))) 1 0))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_267, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_447, ~z$w_buff0~0=v_~z$w_buff0~0_301, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_37|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_272, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_37|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_159, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_410, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_151, ~z$w_buff1~0=v_~z$w_buff1~0_260, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_57, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_59} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_119, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_445, ~z$w_buff0~0=v_~z$w_buff0~0_300, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_160, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_69, P3Thread1of1ForFork3_#in~arg#1.offset=|v_P3Thread1of1ForFork3_#in~arg#1.offset_37|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_408, ~z$w_buff1~0=v_~z$w_buff1~0_259, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_45|, ~a~0=v_~a~0_53, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_266, P3Thread1of1ForFork3_~arg#1.base=|v_P3Thread1of1ForFork3_~arg#1.base_37|, P3Thread1of1ForFork3_~arg#1.offset=|v_P3Thread1of1ForFork3_~arg#1.offset_37|, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork3___VERIFIER_assert_~expression#1_45|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_270, P3Thread1of1ForFork3_#in~arg#1.base=|v_P3Thread1of1ForFork3_#in~arg#1.base_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_107, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_158, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_151, ~z~0=v_~z~0_354, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_57, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_59} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~a~0, ~z$r_buff0_thd0~0, P3Thread1of1ForFork3_~arg#1.base, P3Thread1of1ForFork3_~arg#1.offset, P3Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~z~0] [2022-12-05 23:04:14,093 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:04:14,094 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 953 [2022-12-05 23:04:14,094 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 802 flow [2022-12-05 23:04:14,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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-05 23:04:14,094 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:14,094 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:14,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 23:04:14,094 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:14,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:14,095 INFO L85 PathProgramCache]: Analyzing trace with hash 213725456, now seen corresponding path program 1 times [2022-12-05 23:04:14,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:14,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561572065] [2022-12-05 23:04:14,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:14,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:14,187 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-05 23:04:14,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:14,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561572065] [2022-12-05 23:04:14,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561572065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:14,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:14,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:04:14,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97956696] [2022-12-05 23:04:14,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:14,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:04:14,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:14,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:04:14,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:04:14,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-05 23:04:14,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 802 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-05 23:04:14,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:14,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-05 23:04:14,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:14,429 INFO L130 PetriNetUnfolder]: 935/1561 cut-off events. [2022-12-05 23:04:14,429 INFO L131 PetriNetUnfolder]: For 6864/7047 co-relation queries the response was YES. [2022-12-05 23:04:14,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7308 conditions, 1561 events. 935/1561 cut-off events. For 6864/7047 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8102 event pairs, 163 based on Foata normal form. 198/1709 useless extension candidates. Maximal degree in co-relation 7277. Up to 566 conditions per place. [2022-12-05 23:04:14,437 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 94 selfloop transitions, 13 changer transitions 0/120 dead transitions. [2022-12-05 23:04:14,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 120 transitions, 1316 flow [2022-12-05 23:04:14,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:04:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:04:14,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-12-05 23:04:14,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5823529411764706 [2022-12-05 23:04:14,438 INFO L175 Difference]: Start difference. First operand has 71 places, 79 transitions, 802 flow. Second operand 5 states and 99 transitions. [2022-12-05 23:04:14,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 120 transitions, 1316 flow [2022-12-05 23:04:14,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 120 transitions, 1217 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-12-05 23:04:14,447 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 576 flow [2022-12-05 23:04:14,447 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=576, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2022-12-05 23:04:14,448 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2022-12-05 23:04:14,448 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:14,448 INFO L89 Accepts]: Start accepts. Operand has 70 places, 65 transitions, 576 flow [2022-12-05 23:04:14,448 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:14,448 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:14,448 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 65 transitions, 576 flow [2022-12-05 23:04:14,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 65 transitions, 576 flow [2022-12-05 23:04:14,470 INFO L130 PetriNetUnfolder]: 137/334 cut-off events. [2022-12-05 23:04:14,471 INFO L131 PetriNetUnfolder]: For 1094/1185 co-relation queries the response was YES. [2022-12-05 23:04:14,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 334 events. 137/334 cut-off events. For 1094/1185 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1768 event pairs, 10 based on Foata normal form. 26/340 useless extension candidates. Maximal degree in co-relation 1436. Up to 136 conditions per place. [2022-12-05 23:04:14,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 65 transitions, 576 flow [2022-12-05 23:04:14,474 INFO L188 LiptonReduction]: Number of co-enabled transitions 720 [2022-12-05 23:04:15,317 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:04:15,318 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 870 [2022-12-05 23:04:15,318 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 606 flow [2022-12-05 23:04:15,318 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-05 23:04:15,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:15,318 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:15,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 23:04:15,318 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:15,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:15,318 INFO L85 PathProgramCache]: Analyzing trace with hash 721303362, now seen corresponding path program 1 times [2022-12-05 23:04:15,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:15,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154788512] [2022-12-05 23:04:15,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:15,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:15,406 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-05 23:04:15,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:15,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154788512] [2022-12-05 23:04:15,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154788512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:15,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:15,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:15,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581643389] [2022-12-05 23:04:15,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:15,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:04:15,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:15,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:04:15,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:04:15,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-05 23:04:15,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 606 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-05 23:04:15,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:15,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-05 23:04:15,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:15,665 INFO L130 PetriNetUnfolder]: 1535/2529 cut-off events. [2022-12-05 23:04:15,665 INFO L131 PetriNetUnfolder]: For 9946/10059 co-relation queries the response was YES. [2022-12-05 23:04:15,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11390 conditions, 2529 events. 1535/2529 cut-off events. For 9946/10059 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 14257 event pairs, 217 based on Foata normal form. 73/2564 useless extension candidates. Maximal degree in co-relation 11359. Up to 1188 conditions per place. [2022-12-05 23:04:15,678 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 86 selfloop transitions, 1 changer transitions 42/137 dead transitions. [2022-12-05 23:04:15,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 137 transitions, 1529 flow [2022-12-05 23:04:15,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-05 23:04:15,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5967741935483871 [2022-12-05 23:04:15,680 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 606 flow. Second operand 4 states and 74 transitions. [2022-12-05 23:04:15,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 137 transitions, 1529 flow [2022-12-05 23:04:15,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 137 transitions, 1433 flow, removed 25 selfloop flow, removed 3 redundant places. [2022-12-05 23:04:15,705 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 552 flow [2022-12-05 23:04:15,705 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=552, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2022-12-05 23:04:15,706 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2022-12-05 23:04:15,706 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:15,706 INFO L89 Accepts]: Start accepts. Operand has 72 places, 62 transitions, 552 flow [2022-12-05 23:04:15,707 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:15,707 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:15,707 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 62 transitions, 552 flow [2022-12-05 23:04:15,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 552 flow [2022-12-05 23:04:15,728 INFO L130 PetriNetUnfolder]: 111/310 cut-off events. [2022-12-05 23:04:15,729 INFO L131 PetriNetUnfolder]: For 1232/1321 co-relation queries the response was YES. [2022-12-05 23:04:15,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 310 events. 111/310 cut-off events. For 1232/1321 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1775 event pairs, 4 based on Foata normal form. 36/331 useless extension candidates. Maximal degree in co-relation 1206. Up to 103 conditions per place. [2022-12-05 23:04:15,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 62 transitions, 552 flow [2022-12-05 23:04:15,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 670 [2022-12-05 23:04:15,765 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:04:15,765 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-05 23:04:15,765 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 553 flow [2022-12-05 23:04:15,766 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-05 23:04:15,766 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:15,766 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-05 23:04:15,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 23:04:15,766 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:15,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:15,766 INFO L85 PathProgramCache]: Analyzing trace with hash -565746573, now seen corresponding path program 1 times [2022-12-05 23:04:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:15,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074584230] [2022-12-05 23:04:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:15,874 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-05 23:04:15,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:15,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074584230] [2022-12-05 23:04:15,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074584230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:15,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:15,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:04:15,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659405393] [2022-12-05 23:04:15,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:15,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:04:15,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:15,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:04:15,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:04:15,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-05 23:04:15,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 553 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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-05 23:04:15,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:15,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-05 23:04:15,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:16,060 INFO L130 PetriNetUnfolder]: 838/1350 cut-off events. [2022-12-05 23:04:16,061 INFO L131 PetriNetUnfolder]: For 6163/6271 co-relation queries the response was YES. [2022-12-05 23:04:16,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6136 conditions, 1350 events. 838/1350 cut-off events. For 6163/6271 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6617 event pairs, 125 based on Foata normal form. 74/1392 useless extension candidates. Maximal degree in co-relation 6104. Up to 556 conditions per place. [2022-12-05 23:04:16,067 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 75 selfloop transitions, 17 changer transitions 12/113 dead transitions. [2022-12-05 23:04:16,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 113 transitions, 1199 flow [2022-12-05 23:04:16,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:04:16,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:04:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-12-05 23:04:16,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2022-12-05 23:04:16,068 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 553 flow. Second operand 6 states and 94 transitions. [2022-12-05 23:04:16,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 113 transitions, 1199 flow [2022-12-05 23:04:16,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 113 transitions, 1057 flow, removed 26 selfloop flow, removed 6 redundant places. [2022-12-05 23:04:16,082 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 464 flow [2022-12-05 23:04:16,082 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=464, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2022-12-05 23:04:16,083 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2022-12-05 23:04:16,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:16,083 INFO L89 Accepts]: Start accepts. Operand has 70 places, 57 transitions, 464 flow [2022-12-05 23:04:16,084 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:16,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:16,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 57 transitions, 464 flow [2022-12-05 23:04:16,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 57 transitions, 464 flow [2022-12-05 23:04:16,099 INFO L130 PetriNetUnfolder]: 94/240 cut-off events. [2022-12-05 23:04:16,100 INFO L131 PetriNetUnfolder]: For 511/539 co-relation queries the response was YES. [2022-12-05 23:04:16,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 240 events. 94/240 cut-off events. For 511/539 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1285 event pairs, 1 based on Foata normal form. 1/227 useless extension candidates. Maximal degree in co-relation 936. Up to 82 conditions per place. [2022-12-05 23:04:16,102 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 57 transitions, 464 flow [2022-12-05 23:04:16,102 INFO L188 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-05 23:04:16,757 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:04:16,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 675 [2022-12-05 23:04:16,758 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 460 flow [2022-12-05 23:04:16,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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-05 23:04:16,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:16,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:16,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 23:04:16,758 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:16,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash 578760901, now seen corresponding path program 1 times [2022-12-05 23:04:16,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:16,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158698157] [2022-12-05 23:04:16,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:16,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:29,728 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-05 23:04:29,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:29,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158698157] [2022-12-05 23:04:29,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158698157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:29,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:29,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:04:29,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191010703] [2022-12-05 23:04:29,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:29,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:04:29,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:29,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:04:29,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:04:29,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 23:04:29,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 460 flow. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:29,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:29,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 23:04:29,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:30,023 INFO L130 PetriNetUnfolder]: 1235/1975 cut-off events. [2022-12-05 23:04:30,024 INFO L131 PetriNetUnfolder]: For 7363/7363 co-relation queries the response was YES. [2022-12-05 23:04:30,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9218 conditions, 1975 events. 1235/1975 cut-off events. For 7363/7363 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10321 event pairs, 102 based on Foata normal form. 1/1976 useless extension candidates. Maximal degree in co-relation 9189. Up to 943 conditions per place. [2022-12-05 23:04:30,034 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 66 selfloop transitions, 6 changer transitions 64/136 dead transitions. [2022-12-05 23:04:30,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 136 transitions, 1356 flow [2022-12-05 23:04:30,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:04:30,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:04:30,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-05 23:04:30,036 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 23:04:30,036 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 460 flow. Second operand 6 states and 75 transitions. [2022-12-05 23:04:30,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 136 transitions, 1356 flow [2022-12-05 23:04:30,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 136 transitions, 1227 flow, removed 27 selfloop flow, removed 5 redundant places. [2022-12-05 23:04:30,052 INFO L231 Difference]: Finished difference. Result has 70 places, 48 transitions, 350 flow [2022-12-05 23:04:30,052 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=70, PETRI_TRANSITIONS=48} [2022-12-05 23:04:30,052 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2022-12-05 23:04:30,053 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:30,053 INFO L89 Accepts]: Start accepts. Operand has 70 places, 48 transitions, 350 flow [2022-12-05 23:04:30,053 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:30,053 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:30,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 48 transitions, 350 flow [2022-12-05 23:04:30,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 48 transitions, 350 flow [2022-12-05 23:04:30,065 INFO L130 PetriNetUnfolder]: 71/195 cut-off events. [2022-12-05 23:04:30,065 INFO L131 PetriNetUnfolder]: For 285/288 co-relation queries the response was YES. [2022-12-05 23:04:30,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 195 events. 71/195 cut-off events. For 285/288 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1010 event pairs, 2 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 633. Up to 66 conditions per place. [2022-12-05 23:04:30,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 48 transitions, 350 flow [2022-12-05 23:04:30,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-05 23:04:30,327 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:04:30,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 275 [2022-12-05 23:04:30,328 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 334 flow [2022-12-05 23:04:30,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:30,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:30,328 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-05 23:04:30,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-05 23:04:30,328 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:30,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:30,329 INFO L85 PathProgramCache]: Analyzing trace with hash 825993323, now seen corresponding path program 1 times [2022-12-05 23:04:30,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:30,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314939609] [2022-12-05 23:04:30,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:30,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:30,446 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-05 23:04:30,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:30,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314939609] [2022-12-05 23:04:30,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314939609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:30,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:30,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:30,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292723492] [2022-12-05 23:04:30,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:30,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:04:30,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:30,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:04:30,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:04:30,448 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-05 23:04:30,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 334 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-05 23:04:30,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:30,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-05 23:04:30,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:30,553 INFO L130 PetriNetUnfolder]: 495/861 cut-off events. [2022-12-05 23:04:30,553 INFO L131 PetriNetUnfolder]: For 3194/3219 co-relation queries the response was YES. [2022-12-05 23:04:30,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3902 conditions, 861 events. 495/861 cut-off events. For 3194/3219 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4333 event pairs, 66 based on Foata normal form. 21/866 useless extension candidates. Maximal degree in co-relation 3876. Up to 407 conditions per place. [2022-12-05 23:04:30,557 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 44 selfloop transitions, 1 changer transitions 39/87 dead transitions. [2022-12-05 23:04:30,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 779 flow [2022-12-05 23:04:30,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:30,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-05 23:04:30,558 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2022-12-05 23:04:30,558 INFO L175 Difference]: Start difference. First operand has 64 places, 45 transitions, 334 flow. Second operand 4 states and 49 transitions. [2022-12-05 23:04:30,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 779 flow [2022-12-05 23:04:30,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 87 transitions, 722 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-12-05 23:04:30,564 INFO L231 Difference]: Finished difference. Result has 64 places, 38 transitions, 242 flow [2022-12-05 23:04:30,564 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=64, PETRI_TRANSITIONS=38} [2022-12-05 23:04:30,565 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2022-12-05 23:04:30,565 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:30,565 INFO L89 Accepts]: Start accepts. Operand has 64 places, 38 transitions, 242 flow [2022-12-05 23:04:30,565 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:30,565 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:30,565 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 38 transitions, 242 flow [2022-12-05 23:04:30,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 38 transitions, 242 flow [2022-12-05 23:04:30,574 INFO L130 PetriNetUnfolder]: 51/141 cut-off events. [2022-12-05 23:04:30,574 INFO L131 PetriNetUnfolder]: For 184/188 co-relation queries the response was YES. [2022-12-05 23:04:30,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 141 events. 51/141 cut-off events. For 184/188 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 642 event pairs, 1 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 455. Up to 48 conditions per place. [2022-12-05 23:04:30,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 38 transitions, 242 flow [2022-12-05 23:04:30,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-05 23:04:30,605 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:04:30,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-05 23:04:30,606 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 37 transitions, 243 flow [2022-12-05 23:04:30,606 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-05 23:04:30,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:30,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:30,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-05 23:04:30,606 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:30,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:30,607 INFO L85 PathProgramCache]: Analyzing trace with hash 198238418, now seen corresponding path program 1 times [2022-12-05 23:04:30,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:30,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955776702] [2022-12-05 23:04:30,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:30,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:04:30,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:04:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:04:30,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:04:30,675 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:04:30,675 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 23:04:30,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 23:04:30,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 23:04:30,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 23:04:30,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 23:04:30,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 23:04:30,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 23:04:30,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-05 23:04:30,677 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:30,680 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:04:30,680 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:04:30,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:04:30 BasicIcfg [2022-12-05 23:04:30,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:04:30,741 INFO L158 Benchmark]: Toolchain (without parser) took 39223.59ms. Allocated memory was 183.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 158.0MB in the beginning and 762.4MB in the end (delta: -604.4MB). Peak memory consumption was 589.9MB. Max. memory is 8.0GB. [2022-12-05 23:04:30,741 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 160.0MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:04:30,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.01ms. Allocated memory is still 183.5MB. Free memory was 157.5MB in the beginning and 130.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-05 23:04:30,741 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.89ms. Allocated memory is still 183.5MB. Free memory was 130.2MB in the beginning and 127.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:04:30,743 INFO L158 Benchmark]: Boogie Preprocessor took 34.23ms. Allocated memory is still 183.5MB. Free memory was 127.1MB in the beginning and 125.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:04:30,743 INFO L158 Benchmark]: RCFGBuilder took 605.55ms. Allocated memory is still 183.5MB. Free memory was 125.5MB in the beginning and 91.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-05 23:04:30,743 INFO L158 Benchmark]: TraceAbstraction took 38084.10ms. Allocated memory was 183.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 90.9MB in the beginning and 762.4MB in the end (delta: -671.5MB). Peak memory consumption was 522.8MB. Max. memory is 8.0GB. [2022-12-05 23:04:30,744 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.09ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 160.0MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 459.01ms. Allocated memory is still 183.5MB. Free memory was 157.5MB in the beginning and 130.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.89ms. Allocated memory is still 183.5MB. Free memory was 130.2MB in the beginning and 127.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.23ms. Allocated memory is still 183.5MB. Free memory was 127.1MB in the beginning and 125.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 605.55ms. Allocated memory is still 183.5MB. Free memory was 125.5MB in the beginning and 91.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 38084.10ms. Allocated memory was 183.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 90.9MB in the beginning and 762.4MB in the end (delta: -671.5MB). Peak memory consumption was 522.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 138 PlacesBefore, 43 PlacesAfterwards, 127 TransitionsBefore, 31 TransitionsAfterwards, 2936 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2049, independent: 1982, independent conditional: 1982, independent unconditional: 0, dependent: 67, dependent conditional: 67, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2049, independent: 1982, independent conditional: 0, independent unconditional: 1982, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2049, independent: 1982, independent conditional: 0, independent unconditional: 1982, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2049, independent: 1982, independent conditional: 0, independent unconditional: 1982, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1733, independent: 1689, independent conditional: 0, independent unconditional: 1689, 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: 1733, independent: 1664, independent conditional: 0, independent unconditional: 1664, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 282, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 226, dependent conditional: 0, dependent unconditional: 226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2049, independent: 293, independent conditional: 0, independent unconditional: 293, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 1733, unknown conditional: 0, unknown unconditional: 1733] , Statistics on independence cache: Total cache size (in pairs): 2494, Positive cache size: 2450, Positive conditional cache size: 0, Positive unconditional cache size: 2450, 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.2s, 37 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 371, independent: 322, independent conditional: 322, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 371, independent: 322, independent conditional: 27, independent unconditional: 295, dependent: 49, dependent conditional: 3, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 371, independent: 322, independent conditional: 27, independent unconditional: 295, dependent: 49, dependent conditional: 3, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 371, independent: 322, independent conditional: 27, independent unconditional: 295, dependent: 49, dependent conditional: 3, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 180, independent: 161, independent conditional: 18, independent unconditional: 143, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 180, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 49, dependent conditional: 9, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 371, independent: 161, independent conditional: 9, independent unconditional: 152, dependent: 30, dependent conditional: 1, dependent unconditional: 29, unknown: 180, unknown conditional: 20, unknown unconditional: 160] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 161, Positive conditional cache size: 18, Positive unconditional cache size: 143, Negative cache size: 19, Negative conditional cache size: 2, Negative unconditional cache size: 17, 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, 37 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 143, independent conditional: 143, 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: 165, independent: 143, independent conditional: 6, independent unconditional: 137, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 165, independent: 143, independent conditional: 0, independent unconditional: 143, 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: 165, independent: 143, independent conditional: 0, independent unconditional: 143, 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: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 165, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 169, Positive conditional cache size: 18, Positive unconditional cache size: 151, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 151, independent: 129, independent conditional: 129, 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: 151, independent: 129, independent conditional: 9, independent unconditional: 120, 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: 151, independent: 129, independent conditional: 3, independent unconditional: 126, 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: 151, independent: 129, independent conditional: 3, independent unconditional: 126, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 151, independent: 129, independent conditional: 3, independent unconditional: 126, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 169, Positive conditional cache size: 18, Positive unconditional cache size: 151, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 147, independent conditional: 147, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 173, independent: 147, independent conditional: 6, independent unconditional: 141, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 173, independent: 147, independent conditional: 3, independent unconditional: 144, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 173, independent: 147, independent conditional: 3, independent unconditional: 144, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 173, independent: 145, independent conditional: 3, independent unconditional: 142, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 171, Positive conditional cache size: 18, Positive unconditional cache size: 153, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 128, independent conditional: 128, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 152, independent: 128, independent conditional: 22, independent unconditional: 106, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, independent: 128, independent conditional: 11, independent unconditional: 117, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, independent: 128, independent conditional: 11, independent unconditional: 117, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ 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] ], Cache Queries: [ total: 152, independent: 121, independent conditional: 10, independent unconditional: 111, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 178, Positive conditional cache size: 19, Positive unconditional cache size: 159, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 53 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 546 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 474, independent: 406, independent conditional: 406, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 474, independent: 406, independent conditional: 98, independent unconditional: 308, dependent: 68, dependent conditional: 2, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 474, independent: 406, independent conditional: 45, independent unconditional: 361, dependent: 68, dependent conditional: 2, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 474, independent: 406, independent conditional: 45, independent unconditional: 361, dependent: 68, dependent conditional: 2, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 474, independent: 404, independent conditional: 45, independent unconditional: 359, dependent: 67, dependent conditional: 1, dependent unconditional: 66, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 245, Positive cache size: 223, Positive conditional cache size: 19, Positive unconditional cache size: 204, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 53, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 668 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 351, independent: 315, independent conditional: 315, 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: 351, independent: 315, independent conditional: 105, independent unconditional: 210, dependent: 36, dependent conditional: 17, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 351, independent: 315, independent conditional: 62, independent unconditional: 253, 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: 351, independent: 315, independent conditional: 62, independent unconditional: 253, 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: 1, independent: 1, independent conditional: 1, 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: 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: 351, independent: 314, independent conditional: 61, independent unconditional: 253, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 224, Positive conditional cache size: 20, Positive unconditional cache size: 204, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 60, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 736 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 666, independent: 613, independent conditional: 613, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 666, independent: 613, independent conditional: 230, independent unconditional: 383, dependent: 53, dependent conditional: 26, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 686, independent: 613, independent conditional: 119, independent unconditional: 494, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 686, independent: 613, independent conditional: 119, independent unconditional: 494, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 2, 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: 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: 686, independent: 607, independent conditional: 117, independent unconditional: 490, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 230, Positive conditional cache size: 22, Positive unconditional cache size: 208, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 157, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 68 PlacesBefore, 68 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 762 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1176, independent: 1062, independent conditional: 1062, independent unconditional: 0, dependent: 114, dependent conditional: 114, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1176, independent: 1062, independent conditional: 346, independent unconditional: 716, dependent: 114, dependent conditional: 40, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1216, independent: 1062, independent conditional: 194, independent unconditional: 868, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1216, independent: 1062, independent conditional: 194, independent unconditional: 868, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 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: 1216, independent: 1054, independent conditional: 186, independent unconditional: 868, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 244, Positive conditional cache size: 30, Positive unconditional cache size: 214, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 232, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 826 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 614, independent: 553, independent conditional: 553, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 614, independent: 553, independent conditional: 189, independent unconditional: 364, dependent: 61, dependent conditional: 20, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 634, independent: 553, independent conditional: 91, independent unconditional: 462, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 634, independent: 553, independent conditional: 91, independent unconditional: 462, dependent: 81, dependent conditional: 0, dependent unconditional: 81, 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: 634, independent: 553, independent conditional: 91, independent unconditional: 462, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 244, Positive conditional cache size: 30, Positive unconditional cache size: 214, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 138, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 852 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 661, independent: 600, independent conditional: 600, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 661, independent: 600, independent conditional: 205, independent unconditional: 395, dependent: 61, dependent conditional: 20, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 701, independent: 600, independent conditional: 100, independent unconditional: 500, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 701, independent: 600, independent conditional: 100, independent unconditional: 500, dependent: 101, dependent conditional: 0, dependent unconditional: 101, 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: 701, independent: 600, independent conditional: 100, independent unconditional: 500, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 244, Positive conditional cache size: 30, Positive unconditional cache size: 214, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 165, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 72 PlacesBefore, 72 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 852 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 626, independent: 564, independent conditional: 564, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 626, independent: 564, independent conditional: 193, independent unconditional: 371, dependent: 62, dependent conditional: 20, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 666, independent: 564, independent conditional: 101, independent unconditional: 463, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 666, independent: 564, independent conditional: 101, independent unconditional: 463, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 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: 666, independent: 563, independent conditional: 100, independent unconditional: 463, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 245, Positive conditional cache size: 31, Positive unconditional cache size: 214, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 152, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 71 PlacesBefore, 71 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 932 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 434, independent: 390, independent conditional: 390, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 434, independent: 390, independent conditional: 174, independent unconditional: 216, dependent: 44, dependent conditional: 34, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 502, independent: 390, independent conditional: 140, independent unconditional: 250, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 502, independent: 390, independent conditional: 140, independent unconditional: 250, dependent: 112, dependent conditional: 0, dependent unconditional: 112, 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: 502, independent: 389, independent conditional: 140, independent unconditional: 249, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 252, Positive conditional cache size: 31, Positive unconditional cache size: 221, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 136, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 71 PlacesBefore, 71 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 810 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 448, independent: 414, independent conditional: 414, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 448, independent: 414, independent conditional: 254, independent unconditional: 160, dependent: 34, dependent conditional: 26, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 474, independent: 414, independent conditional: 174, independent unconditional: 240, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 474, independent: 414, independent conditional: 174, independent unconditional: 240, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 3, 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: 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: 474, independent: 408, independent conditional: 171, independent unconditional: 237, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 292, Positive conditional cache size: 34, Positive unconditional cache size: 258, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 132, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 70 PlacesBefore, 70 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 720 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 321, independent: 289, independent conditional: 289, 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: 321, independent: 289, independent conditional: 152, independent unconditional: 137, dependent: 32, dependent conditional: 24, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 345, independent: 289, independent conditional: 113, independent unconditional: 176, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 345, independent: 289, independent conditional: 113, independent unconditional: 176, dependent: 56, dependent conditional: 0, dependent unconditional: 56, 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: 345, independent: 285, independent conditional: 113, independent unconditional: 172, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 345, Positive cache size: 323, Positive conditional cache size: 34, Positive unconditional cache size: 289, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 87, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 70 PlacesAfterwards, 62 TransitionsBefore, 61 TransitionsAfterwards, 670 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 464, independent: 440, independent conditional: 440, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 464, independent: 440, independent conditional: 328, independent unconditional: 112, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 488, independent: 440, independent conditional: 256, independent unconditional: 184, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 488, independent: 440, independent conditional: 256, independent unconditional: 184, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 5, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 488, independent: 428, independent conditional: 251, independent unconditional: 177, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 13, unknown conditional: 5, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 397, Positive conditional cache size: 43, Positive unconditional cache size: 354, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 120, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 70 PlacesBefore, 68 PlacesAfterwards, 57 TransitionsBefore, 55 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 72, independent conditional: 40, independent unconditional: 32, dependent: 24, dependent conditional: 16, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 112, independent: 72, independent conditional: 40, independent unconditional: 32, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 112, independent: 72, independent conditional: 40, independent unconditional: 32, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 112, independent: 72, independent conditional: 40, independent unconditional: 32, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 436, Positive cache size: 412, Positive conditional cache size: 43, Positive unconditional cache size: 369, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 67 PlacesBefore, 64 PlacesAfterwards, 48 TransitionsBefore, 45 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 185, independent: 173, independent conditional: 173, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 185, independent: 173, independent conditional: 137, independent unconditional: 36, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 185, independent: 173, independent conditional: 122, independent unconditional: 51, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 185, independent: 173, independent conditional: 122, independent unconditional: 51, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 185, independent: 170, independent conditional: 121, independent unconditional: 49, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 478, Positive cache size: 452, Positive conditional cache size: 47, Positive unconditional cache size: 405, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 60 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 22, independent unconditional: 8, 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: 30, independent: 30, independent conditional: 22, independent unconditional: 8, 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: 30, independent: 30, independent conditional: 22, independent unconditional: 8, 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: 30, independent: 30, independent conditional: 22, independent unconditional: 8, 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): 514, Positive cache size: 488, Positive conditional cache size: 51, Positive unconditional cache size: 437, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1133; [L849] FCALL, FORK 0 pthread_create(&t1133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1133, ((void *)0), P0, ((void *)0))=-3, t1133={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1134; [L851] FCALL, FORK 0 pthread_create(&t1134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1134, ((void *)0), P1, ((void *)0))=-2, t1133={5:0}, t1134={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1135; [L853] FCALL, FORK 0 pthread_create(&t1135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1135, ((void *)0), P2, ((void *)0))=-1, t1133={5:0}, t1134={6:0}, t1135={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 pthread_t t1136; [L855] FCALL, FORK 0 pthread_create(&t1136, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1136, ((void *)0), P3, ((void *)0))=0, t1133={5:0}, t1134={6:0}, t1135={7:0}, t1136={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L808] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L808] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 [L817] 4 a = 1 [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 1 [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 1 [L787] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L873] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L874] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L875] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L876] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L878] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 0 z$flush_delayed = (_Bool)0 [L883] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 849]: 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: 855]: 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: 851]: 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, 167 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: 37.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 651 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 651 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1643 IncrementalHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 38 mSDtfsCounter, 1643 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=920occurred in iteration=12, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 2770 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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-05 23:04:30,769 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...