/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:08:00,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:08:00,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:08:00,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:08:00,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:08:00,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:08:00,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:08:00,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:08:00,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:08:00,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:08:00,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:08:00,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:08:00,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:08:00,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:08:00,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:08:00,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:08:00,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:08:00,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:08:00,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:08:00,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:08:00,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:08:00,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:08:00,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:08:00,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:08:00,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:08:00,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:08:00,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:08:00,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:08:00,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:08:00,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:08:00,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:08:00,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:08:00,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:08:00,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:08:00,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:08:00,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:08:00,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:08:00,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:08:00,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:08:00,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:08:00,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:08:00,955 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:08:00,986 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:08:00,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:08:00,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:08:00,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:08:00,988 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:08:00,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:08:00,989 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:08:00,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:08:00,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:08:00,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:08:00,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:08:00,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:08:00,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:08:00,991 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:08:00,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:08:00,991 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:08:00,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:08:00,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:08:00,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:08:00,991 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:08:00,991 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:08:00,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:08:00,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:08:00,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:08:00,992 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:08:00,992 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:08:00,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:08:00,992 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:08:00,993 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:08:01,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:08:01,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:08:01,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:08:01,322 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:08:01,322 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:08:01,324 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:08:02,554 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:08:02,854 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:08:02,854 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:08:02,869 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62db3ffd5/3ab887e7ff6e4813aadbb120ff729216/FLAG42dfe1978 [2022-12-06 04:08:02,892 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62db3ffd5/3ab887e7ff6e4813aadbb120ff729216 [2022-12-06 04:08:02,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:08:02,896 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:08:02,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:08:02,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:08:02,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:08:02,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:08:02" (1/1) ... [2022-12-06 04:08:02,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef1dbc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:02, skipping insertion in model container [2022-12-06 04:08:02,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:08:02" (1/1) ... [2022-12-06 04:08:02,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:08:02,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:08:03,140 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/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 04:08:03,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:08:03,337 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:08:03,352 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/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 04:08:03,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:08:03,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:08:03,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:08:03,470 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:08:03,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:03 WrapperNode [2022-12-06 04:08:03,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:08:03,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:08:03,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:08:03,471 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:08:03,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:03" (1/1) ... [2022-12-06 04:08:03,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:03" (1/1) ... [2022-12-06 04:08:03,511 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-12-06 04:08:03,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:08:03,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:08:03,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:08:03,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:08:03,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:03" (1/1) ... [2022-12-06 04:08:03,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:03" (1/1) ... [2022-12-06 04:08:03,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:03" (1/1) ... [2022-12-06 04:08:03,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:03" (1/1) ... [2022-12-06 04:08:03,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:03" (1/1) ... [2022-12-06 04:08:03,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:03" (1/1) ... [2022-12-06 04:08:03,536 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:03" (1/1) ... [2022-12-06 04:08:03,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:03" (1/1) ... [2022-12-06 04:08:03,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:08:03,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:08:03,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:08:03,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:08:03,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:03" (1/1) ... [2022-12-06 04:08:03,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:08:03,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:08:03,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:08:03,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:08:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:08:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:08:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:08:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:08:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:08:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:08:03,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:08:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:08:03,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:08:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:08:03,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:08:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:08:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:08:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:08:03,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:08:03,624 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:08:03,796 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:08:03,797 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:08:04,097 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:08:04,223 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:08:04,224 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:08:04,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:08:04 BoogieIcfgContainer [2022-12-06 04:08:04,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:08:04,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:08:04,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:08:04,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:08:04,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:08:02" (1/3) ... [2022-12-06 04:08:04,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6d7a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:08:04, skipping insertion in model container [2022-12-06 04:08:04,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:08:03" (2/3) ... [2022-12-06 04:08:04,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6d7a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:08:04, skipping insertion in model container [2022-12-06 04:08:04,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:08:04" (3/3) ... [2022-12-06 04:08:04,234 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:08:04,250 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:08:04,250 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:08:04,250 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:08:04,311 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:08:04,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-12-06 04:08:04,420 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-06 04:08:04,420 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:08:04,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-06 04:08:04,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-12-06 04:08:04,430 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-12-06 04:08:04,432 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:04,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-06 04:08:04,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 231 flow [2022-12-06 04:08:04,501 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-06 04:08:04,501 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:08:04,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-06 04:08:04,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-06 04:08:04,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 2216 [2022-12-06 04:08:09,346 INFO L203 LiptonReduction]: Total number of compositions: 86 [2022-12-06 04:08:09,358 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:08:09,363 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;@265553e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:08:09,363 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:08:09,365 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 04:08:09,365 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:08:09,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:09,366 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:08:09,367 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:09,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:09,370 INFO L85 PathProgramCache]: Analyzing trace with hash 489260, now seen corresponding path program 1 times [2022-12-06 04:08:09,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:09,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536182390] [2022-12-06 04:08:09,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:09,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:09,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:09,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536182390] [2022-12-06 04:08:09,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536182390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:09,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:09,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:08:09,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421293173] [2022-12-06 04:08:09,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:09,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:08:09,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:09,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:08:09,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:08:09,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-06 04:08:09,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:09,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:09,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-06 04:08:09,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:10,145 INFO L130 PetriNetUnfolder]: 1648/2622 cut-off events. [2022-12-06 04:08:10,145 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-06 04:08:10,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5098 conditions, 2622 events. 1648/2622 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14747 event pairs, 268 based on Foata normal form. 0/2387 useless extension candidates. Maximal degree in co-relation 5087. Up to 1960 conditions per place. [2022-12-06 04:08:10,161 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 35 selfloop transitions, 2 changer transitions 8/48 dead transitions. [2022-12-06 04:08:10,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 201 flow [2022-12-06 04:08:10,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:08:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:08:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-06 04:08:10,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6344086021505376 [2022-12-06 04:08:10,173 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 59 transitions. [2022-12-06 04:08:10,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 201 flow [2022-12-06 04:08:10,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 196 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:08:10,177 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 58 flow [2022-12-06 04:08:10,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=58, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2022-12-06 04:08:10,181 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2022-12-06 04:08:10,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:10,182 INFO L89 Accepts]: Start accepts. Operand has 37 places, 24 transitions, 58 flow [2022-12-06 04:08:10,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:10,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:10,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 24 transitions, 58 flow [2022-12-06 04:08:10,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 58 flow [2022-12-06 04:08:10,191 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-06 04:08:10,191 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:08:10,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:08:10,191 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 58 flow [2022-12-06 04:08:10,191 INFO L188 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-06 04:08:10,351 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:08:10,352 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 04:08:10,352 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2022-12-06 04:08:10,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:10,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:10,353 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:10,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:08:10,353 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:10,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:10,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1144460526, now seen corresponding path program 1 times [2022-12-06 04:08:10,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:10,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262195398] [2022-12-06 04:08:10,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:10,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:10,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:10,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262195398] [2022-12-06 04:08:10,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262195398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:10,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:10,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:08:10,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257474210] [2022-12-06 04:08:10,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:10,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:08:10,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:10,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:08:10,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:08:10,602 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-06 04:08:10,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:10,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:10,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-06 04:08:10,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:10,785 INFO L130 PetriNetUnfolder]: 660/1038 cut-off events. [2022-12-06 04:08:10,785 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 04:08:10,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2170 conditions, 1038 events. 660/1038 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4517 event pairs, 234 based on Foata normal form. 20/1053 useless extension candidates. Maximal degree in co-relation 2160. Up to 839 conditions per place. [2022-12-06 04:08:10,792 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 28 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-06 04:08:10,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 140 flow [2022-12-06 04:08:10,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:08:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:08:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 04:08:10,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2022-12-06 04:08:10,794 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 40 transitions. [2022-12-06 04:08:10,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 140 flow [2022-12-06 04:08:10,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:08:10,795 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2022-12-06 04:08:10,795 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-06 04:08:10,796 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2022-12-06 04:08:10,796 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:10,796 INFO L89 Accepts]: Start accepts. Operand has 32 places, 22 transitions, 58 flow [2022-12-06 04:08:10,797 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:10,797 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:10,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 22 transitions, 58 flow [2022-12-06 04:08:10,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 22 transitions, 58 flow [2022-12-06 04:08:10,802 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-06 04:08:10,802 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:08:10,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:08:10,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 22 transitions, 58 flow [2022-12-06 04:08:10,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-06 04:08:10,899 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:08:10,900 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 04:08:10,901 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2022-12-06 04:08:10,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:10,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:10,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:10,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:08:10,902 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:10,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:10,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1118537439, now seen corresponding path program 1 times [2022-12-06 04:08:10,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:10,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804009728] [2022-12-06 04:08:10,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:10,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:11,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:11,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:11,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804009728] [2022-12-06 04:08:11,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804009728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:11,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:11,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:08:11,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869933404] [2022-12-06 04:08:11,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:11,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:08:11,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:11,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:08:11,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:08:11,088 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:08:11,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:11,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:11,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:08:11,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:11,405 INFO L130 PetriNetUnfolder]: 1613/2432 cut-off events. [2022-12-06 04:08:11,405 INFO L131 PetriNetUnfolder]: For 272/272 co-relation queries the response was YES. [2022-12-06 04:08:11,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5283 conditions, 2432 events. 1613/2432 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10756 event pairs, 414 based on Foata normal form. 88/2520 useless extension candidates. Maximal degree in co-relation 5272. Up to 1310 conditions per place. [2022-12-06 04:08:11,418 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 37 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2022-12-06 04:08:11,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 43 transitions, 192 flow [2022-12-06 04:08:11,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:08:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:08:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 04:08:11,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2022-12-06 04:08:11,420 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 4 states and 45 transitions. [2022-12-06 04:08:11,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 43 transitions, 192 flow [2022-12-06 04:08:11,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 43 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:08:11,422 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 99 flow [2022-12-06 04:08:11,422 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2022-12-06 04:08:11,422 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2022-12-06 04:08:11,423 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:11,423 INFO L89 Accepts]: Start accepts. Operand has 36 places, 26 transitions, 99 flow [2022-12-06 04:08:11,423 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:11,424 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:11,424 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 99 flow [2022-12-06 04:08:11,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 99 flow [2022-12-06 04:08:11,435 INFO L130 PetriNetUnfolder]: 26/105 cut-off events. [2022-12-06 04:08:11,436 INFO L131 PetriNetUnfolder]: For 41/43 co-relation queries the response was YES. [2022-12-06 04:08:11,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 105 events. 26/105 cut-off events. For 41/43 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 469 event pairs, 12 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 212. Up to 45 conditions per place. [2022-12-06 04:08:11,437 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 99 flow [2022-12-06 04:08:11,437 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-06 04:08:11,446 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:08:11,447 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 04:08:11,447 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 99 flow [2022-12-06 04:08:11,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:11,447 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:11,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:11,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:08:11,448 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:11,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:11,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1810291582, now seen corresponding path program 1 times [2022-12-06 04:08:11,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:11,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223829787] [2022-12-06 04:08:11,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:11,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:11,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:11,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223829787] [2022-12-06 04:08:11,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223829787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:11,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:11,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:08:11,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656169553] [2022-12-06 04:08:11,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:11,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:08:11,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:11,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:08:11,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:08:11,637 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-06 04:08:11,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:11,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:11,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-06 04:08:11,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:11,889 INFO L130 PetriNetUnfolder]: 904/1508 cut-off events. [2022-12-06 04:08:11,890 INFO L131 PetriNetUnfolder]: For 565/575 co-relation queries the response was YES. [2022-12-06 04:08:11,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3706 conditions, 1508 events. 904/1508 cut-off events. For 565/575 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8109 event pairs, 216 based on Foata normal form. 156/1588 useless extension candidates. Maximal degree in co-relation 3692. Up to 596 conditions per place. [2022-12-06 04:08:11,899 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 45 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2022-12-06 04:08:11,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 55 transitions, 289 flow [2022-12-06 04:08:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:08:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:08:11,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 04:08:11,901 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2022-12-06 04:08:11,902 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 99 flow. Second operand 4 states and 58 transitions. [2022-12-06 04:08:11,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 55 transitions, 289 flow [2022-12-06 04:08:11,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:08:11,905 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 135 flow [2022-12-06 04:08:11,906 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-06 04:08:11,907 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2022-12-06 04:08:11,907 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:11,907 INFO L89 Accepts]: Start accepts. Operand has 40 places, 30 transitions, 135 flow [2022-12-06 04:08:11,909 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:11,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:11,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 135 flow [2022-12-06 04:08:11,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 135 flow [2022-12-06 04:08:11,939 INFO L130 PetriNetUnfolder]: 90/258 cut-off events. [2022-12-06 04:08:11,939 INFO L131 PetriNetUnfolder]: For 124/143 co-relation queries the response was YES. [2022-12-06 04:08:11,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 258 events. 90/258 cut-off events. For 124/143 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1543 event pairs, 35 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 620. Up to 150 conditions per place. [2022-12-06 04:08:11,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 135 flow [2022-12-06 04:08:11,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-06 04:08:12,108 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:08:12,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 04:08:12,109 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 137 flow [2022-12-06 04:08:12,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:12,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:12,110 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:12,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:08:12,110 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:12,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:12,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1133506902, now seen corresponding path program 1 times [2022-12-06 04:08:12,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:12,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719600781] [2022-12-06 04:08:12,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:12,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:12,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:12,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719600781] [2022-12-06 04:08:12,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719600781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:12,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:12,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:08:12,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123863537] [2022-12-06 04:08:12,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:12,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:08:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:12,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:08:12,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:08:12,281 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:08:12,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 137 flow. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:12,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:12,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:08:12,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:12,604 INFO L130 PetriNetUnfolder]: 1174/1960 cut-off events. [2022-12-06 04:08:12,604 INFO L131 PetriNetUnfolder]: For 1591/1591 co-relation queries the response was YES. [2022-12-06 04:08:12,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6154 conditions, 1960 events. 1174/1960 cut-off events. For 1591/1591 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10011 event pairs, 100 based on Foata normal form. 36/1996 useless extension candidates. Maximal degree in co-relation 6137. Up to 829 conditions per place. [2022-12-06 04:08:12,617 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 59 selfloop transitions, 14 changer transitions 0/73 dead transitions. [2022-12-06 04:08:12,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 73 transitions, 457 flow [2022-12-06 04:08:12,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:08:12,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:08:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-06 04:08:12,618 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5130434782608696 [2022-12-06 04:08:12,619 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 137 flow. Second operand 5 states and 59 transitions. [2022-12-06 04:08:12,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 73 transitions, 457 flow [2022-12-06 04:08:12,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 73 transitions, 430 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:08:12,628 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 240 flow [2022-12-06 04:08:12,628 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2022-12-06 04:08:12,630 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2022-12-06 04:08:12,630 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:12,631 INFO L89 Accepts]: Start accepts. Operand has 46 places, 39 transitions, 240 flow [2022-12-06 04:08:12,632 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:12,632 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:12,632 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 240 flow [2022-12-06 04:08:12,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 240 flow [2022-12-06 04:08:12,666 INFO L130 PetriNetUnfolder]: 108/331 cut-off events. [2022-12-06 04:08:12,666 INFO L131 PetriNetUnfolder]: For 191/226 co-relation queries the response was YES. [2022-12-06 04:08:12,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 331 events. 108/331 cut-off events. For 191/226 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2083 event pairs, 36 based on Foata normal form. 1/313 useless extension candidates. Maximal degree in co-relation 832. Up to 173 conditions per place. [2022-12-06 04:08:12,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 39 transitions, 240 flow [2022-12-06 04:08:12,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 430 [2022-12-06 04:08:12,708 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:08:12,710 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 04:08:12,710 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 240 flow [2022-12-06 04:08:12,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:12,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:12,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:12,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:08:12,711 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:12,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:12,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1399459241, now seen corresponding path program 1 times [2022-12-06 04:08:12,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:12,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324032740] [2022-12-06 04:08:12,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:12,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:12,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-06 04:08:12,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:12,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324032740] [2022-12-06 04:08:12,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324032740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:12,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:12,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:08:12,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737042482] [2022-12-06 04:08:12,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:12,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:08:12,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:12,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:08:12,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:08:12,919 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-06 04:08:12,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 240 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-06 04:08:12,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:12,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-06 04:08:12,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:13,155 INFO L130 PetriNetUnfolder]: 623/1172 cut-off events. [2022-12-06 04:08:13,156 INFO L131 PetriNetUnfolder]: For 1235/1261 co-relation queries the response was YES. [2022-12-06 04:08:13,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3710 conditions, 1172 events. 623/1172 cut-off events. For 1235/1261 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6406 event pairs, 104 based on Foata normal form. 134/1288 useless extension candidates. Maximal degree in co-relation 3689. Up to 501 conditions per place. [2022-12-06 04:08:13,164 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 68 selfloop transitions, 8 changer transitions 0/87 dead transitions. [2022-12-06 04:08:13,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 87 transitions, 641 flow [2022-12-06 04:08:13,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:08:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:08:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 04:08:13,167 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2022-12-06 04:08:13,167 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 240 flow. Second operand 5 states and 73 transitions. [2022-12-06 04:08:13,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 87 transitions, 641 flow [2022-12-06 04:08:13,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 87 transitions, 635 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-06 04:08:13,173 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 289 flow [2022-12-06 04:08:13,173 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2022-12-06 04:08:13,175 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2022-12-06 04:08:13,175 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:13,175 INFO L89 Accepts]: Start accepts. Operand has 52 places, 43 transitions, 289 flow [2022-12-06 04:08:13,176 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:13,176 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:13,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 43 transitions, 289 flow [2022-12-06 04:08:13,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 289 flow [2022-12-06 04:08:13,204 INFO L130 PetriNetUnfolder]: 83/287 cut-off events. [2022-12-06 04:08:13,205 INFO L131 PetriNetUnfolder]: For 429/468 co-relation queries the response was YES. [2022-12-06 04:08:13,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 287 events. 83/287 cut-off events. For 429/468 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1780 event pairs, 6 based on Foata normal form. 12/285 useless extension candidates. Maximal degree in co-relation 969. Up to 142 conditions per place. [2022-12-06 04:08:13,208 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 43 transitions, 289 flow [2022-12-06 04:08:13,208 INFO L188 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-06 04:08:13,368 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:08:13,369 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 04:08:13,369 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 293 flow [2022-12-06 04:08:13,369 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-06 04:08:13,369 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:13,369 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:13,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:08:13,370 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:13,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:13,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1523713224, now seen corresponding path program 1 times [2022-12-06 04:08:13,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:13,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124884177] [2022-12-06 04:08:13,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:13,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:13,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:13,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124884177] [2022-12-06 04:08:13,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124884177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:13,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:13,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:08:13,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622809739] [2022-12-06 04:08:13,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:13,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:08:13,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:13,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:08:13,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:08:13,661 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-06 04:08:13,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 293 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:13,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:13,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-06 04:08:13,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:13,838 INFO L130 PetriNetUnfolder]: 407/782 cut-off events. [2022-12-06 04:08:13,838 INFO L131 PetriNetUnfolder]: For 1361/1374 co-relation queries the response was YES. [2022-12-06 04:08:13,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 782 events. 407/782 cut-off events. For 1361/1374 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3977 event pairs, 103 based on Foata normal form. 35/804 useless extension candidates. Maximal degree in co-relation 2891. Up to 280 conditions per place. [2022-12-06 04:08:13,844 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 48 selfloop transitions, 11 changer transitions 3/73 dead transitions. [2022-12-06 04:08:13,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 572 flow [2022-12-06 04:08:13,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:08:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:08:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-06 04:08:13,846 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2022-12-06 04:08:13,846 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 293 flow. Second operand 6 states and 66 transitions. [2022-12-06 04:08:13,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 572 flow [2022-12-06 04:08:13,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 529 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-06 04:08:13,855 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 291 flow [2022-12-06 04:08:13,855 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-06 04:08:13,855 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2022-12-06 04:08:13,855 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:13,855 INFO L89 Accepts]: Start accepts. Operand has 53 places, 43 transitions, 291 flow [2022-12-06 04:08:13,858 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:13,858 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:13,858 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 291 flow [2022-12-06 04:08:13,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 291 flow [2022-12-06 04:08:13,876 INFO L130 PetriNetUnfolder]: 55/192 cut-off events. [2022-12-06 04:08:13,876 INFO L131 PetriNetUnfolder]: For 331/341 co-relation queries the response was YES. [2022-12-06 04:08:13,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 192 events. 55/192 cut-off events. For 331/341 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 973 event pairs, 1 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 648. Up to 56 conditions per place. [2022-12-06 04:08:13,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 291 flow [2022-12-06 04:08:13,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 348 [2022-12-06 04:08:14,551 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [418] L831-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [474] L853-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd0~0_206 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_210 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_539 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse0 (and (not (= (mod v_~a$w_buff1_used~0_475 256) 0)) .cse2)) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_540 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_475) v_~a$w_buff1_used~0_474) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_73 1) (= v_~__unbuffered_p1_EAX~0_78 1) (= v_~__unbuffered_p2_EBX~0_92 0) (= v_~x~0_96 2) (= v_~__unbuffered_p1_EBX~0_79 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_74) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71| (mod v_~main$tmp_guard1~0_74 256)) (= (mod v_~main$tmp_guard0~0_106 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_183 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_106) (= (ite .cse1 0 v_~a$r_buff0_thd0~0_210) v_~a$r_buff0_thd0~0_209) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_105| 0)) (= (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_474 256) 0))) (and (not (= (mod v_~a$r_buff0_thd0~0_209 256) 0)) .cse3)) 0 v_~a$r_buff1_thd0~0_206) v_~a$r_buff1_thd0~0_205) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_105| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= v_~a~0_412 (ite .cse4 v_~a$w_buff0~0_319 (ite .cse0 v_~a$w_buff1~0_262 v_~a~0_413))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= v_~a$w_buff0_used~0_539 (ite .cse4 0 v_~a$w_buff0_used~0_540)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_79, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_92, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_540, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_210, ~a~0=v_~a~0_413, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_262, ~a$w_buff0~0=v_~a$w_buff0~0_319, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_206, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_73, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_183, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_475, ~x~0=v_~x~0_96} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_79, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_92, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_61|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_55|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_539, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_74, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_209, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_106, ~a~0=v_~a~0_412, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_262, ~a$w_buff0~0=v_~a$w_buff0~0_319, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_105|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_205, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_73, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_183, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_474, ~x~0=v_~x~0_96, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:08:14,786 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [420] L795-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_13|) (= (+ v_~__unbuffered_cnt~0_78 1) v_~__unbuffered_cnt~0_77) (= |v_P1Thread1of1ForFork2_#res.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_13|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [474] L853-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd0~0_206 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_210 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_539 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse0 (and (not (= (mod v_~a$w_buff1_used~0_475 256) 0)) .cse2)) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_540 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_475) v_~a$w_buff1_used~0_474) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_73 1) (= v_~__unbuffered_p1_EAX~0_78 1) (= v_~__unbuffered_p2_EBX~0_92 0) (= v_~x~0_96 2) (= v_~__unbuffered_p1_EBX~0_79 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_74) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71| (mod v_~main$tmp_guard1~0_74 256)) (= (mod v_~main$tmp_guard0~0_106 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_183 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_106) (= (ite .cse1 0 v_~a$r_buff0_thd0~0_210) v_~a$r_buff0_thd0~0_209) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_105| 0)) (= (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_474 256) 0))) (and (not (= (mod v_~a$r_buff0_thd0~0_209 256) 0)) .cse3)) 0 v_~a$r_buff1_thd0~0_206) v_~a$r_buff1_thd0~0_205) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_105| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= v_~a~0_412 (ite .cse4 v_~a$w_buff0~0_319 (ite .cse0 v_~a$w_buff1~0_262 v_~a~0_413))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= v_~a$w_buff0_used~0_539 (ite .cse4 0 v_~a$w_buff0_used~0_540)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_79, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_92, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_540, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_210, ~a~0=v_~a~0_413, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_262, ~a$w_buff0~0=v_~a$w_buff0~0_319, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_206, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_73, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_183, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_475, ~x~0=v_~x~0_96} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_79, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_92, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_61|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_55|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_539, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_74, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_209, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_106, ~a~0=v_~a~0_412, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_262, ~a$w_buff0~0=v_~a$w_buff0~0_319, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_105|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_205, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_73, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_183, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_474, ~x~0=v_~x~0_96, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:08:15,005 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [425] L769-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res#1.offset_7| 0) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1)) (= |v_P0Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_7|, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, P0Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0] and [474] L853-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd0~0_206 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_210 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_539 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse0 (and (not (= (mod v_~a$w_buff1_used~0_475 256) 0)) .cse2)) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_540 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_475) v_~a$w_buff1_used~0_474) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_73 1) (= v_~__unbuffered_p1_EAX~0_78 1) (= v_~__unbuffered_p2_EBX~0_92 0) (= v_~x~0_96 2) (= v_~__unbuffered_p1_EBX~0_79 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_74) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71| (mod v_~main$tmp_guard1~0_74 256)) (= (mod v_~main$tmp_guard0~0_106 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_183 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_106) (= (ite .cse1 0 v_~a$r_buff0_thd0~0_210) v_~a$r_buff0_thd0~0_209) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_105| 0)) (= (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_474 256) 0))) (and (not (= (mod v_~a$r_buff0_thd0~0_209 256) 0)) .cse3)) 0 v_~a$r_buff1_thd0~0_206) v_~a$r_buff1_thd0~0_205) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_105| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= v_~a~0_412 (ite .cse4 v_~a$w_buff0~0_319 (ite .cse0 v_~a$w_buff1~0_262 v_~a~0_413))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= v_~a$w_buff0_used~0_539 (ite .cse4 0 v_~a$w_buff0_used~0_540)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_79, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_92, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_540, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_210, ~a~0=v_~a~0_413, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_262, ~a$w_buff0~0=v_~a$w_buff0~0_319, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_206, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_73, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_183, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_475, ~x~0=v_~x~0_96} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_79, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_92, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_61|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_55|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_539, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_74, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_209, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_106, ~a~0=v_~a~0_412, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_262, ~a$w_buff0~0=v_~a$w_buff0~0_319, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_105|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_205, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_73, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_183, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_474, ~x~0=v_~x~0_96, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:08:15,215 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:08:15,215 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1360 [2022-12-06 04:08:15,216 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 303 flow [2022-12-06 04:08:15,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:15,216 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:15,216 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:15,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:08:15,216 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:15,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:15,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1044988799, now seen corresponding path program 1 times [2022-12-06 04:08:15,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:15,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369047322] [2022-12-06 04:08:15,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:15,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:15,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:15,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:15,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369047322] [2022-12-06 04:08:15,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369047322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:15,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:15,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:08:15,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552390624] [2022-12-06 04:08:15,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:15,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:08:15,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:15,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:08:15,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:08:15,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-06 04:08:15,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 303 flow. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:15,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:15,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-06 04:08:15,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:16,244 INFO L130 PetriNetUnfolder]: 432/822 cut-off events. [2022-12-06 04:08:16,244 INFO L131 PetriNetUnfolder]: For 1752/1766 co-relation queries the response was YES. [2022-12-06 04:08:16,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3024 conditions, 822 events. 432/822 cut-off events. For 1752/1766 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4422 event pairs, 28 based on Foata normal form. 8/823 useless extension candidates. Maximal degree in co-relation 3000. Up to 356 conditions per place. [2022-12-06 04:08:16,249 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 47 selfloop transitions, 6 changer transitions 20/84 dead transitions. [2022-12-06 04:08:16,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 84 transitions, 700 flow [2022-12-06 04:08:16,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:08:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:08:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-12-06 04:08:16,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4927536231884058 [2022-12-06 04:08:16,251 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 303 flow. Second operand 6 states and 68 transitions. [2022-12-06 04:08:16,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 84 transitions, 700 flow [2022-12-06 04:08:16,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 590 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-12-06 04:08:16,257 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 256 flow [2022-12-06 04:08:16,258 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2022-12-06 04:08:16,258 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2022-12-06 04:08:16,258 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:16,258 INFO L89 Accepts]: Start accepts. Operand has 48 places, 39 transitions, 256 flow [2022-12-06 04:08:16,259 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:16,259 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:16,260 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 39 transitions, 256 flow [2022-12-06 04:08:16,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 39 transitions, 256 flow [2022-12-06 04:08:16,274 INFO L130 PetriNetUnfolder]: 46/161 cut-off events. [2022-12-06 04:08:16,274 INFO L131 PetriNetUnfolder]: For 136/142 co-relation queries the response was YES. [2022-12-06 04:08:16,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 161 events. 46/161 cut-off events. For 136/142 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 812 event pairs, 1 based on Foata normal form. 2/160 useless extension candidates. Maximal degree in co-relation 439. Up to 36 conditions per place. [2022-12-06 04:08:16,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 39 transitions, 256 flow [2022-12-06 04:08:16,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-06 04:08:16,981 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:08:16,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 723 [2022-12-06 04:08:16,982 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 258 flow [2022-12-06 04:08:16,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:16,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:16,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:16,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:08:16,982 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:16,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:16,983 INFO L85 PathProgramCache]: Analyzing trace with hash 312529381, now seen corresponding path program 1 times [2022-12-06 04:08:16,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:16,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200539966] [2022-12-06 04:08:16,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:16,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:17,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:17,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200539966] [2022-12-06 04:08:17,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200539966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:17,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:17,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:08:17,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121639212] [2022-12-06 04:08:17,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:17,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:08:17,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:17,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:08:17,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:08:17,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:08:17,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 258 flow. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:17,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:17,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:08:17,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:17,444 INFO L130 PetriNetUnfolder]: 441/810 cut-off events. [2022-12-06 04:08:17,444 INFO L131 PetriNetUnfolder]: For 1518/1518 co-relation queries the response was YES. [2022-12-06 04:08:17,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2928 conditions, 810 events. 441/810 cut-off events. For 1518/1518 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3900 event pairs, 74 based on Foata normal form. 3/813 useless extension candidates. Maximal degree in co-relation 2907. Up to 295 conditions per place. [2022-12-06 04:08:17,449 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 31 selfloop transitions, 10 changer transitions 36/77 dead transitions. [2022-12-06 04:08:17,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 77 transitions, 612 flow [2022-12-06 04:08:17,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:08:17,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:08:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-12-06 04:08:17,450 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2022-12-06 04:08:17,450 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 258 flow. Second operand 6 states and 65 transitions. [2022-12-06 04:08:17,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 77 transitions, 612 flow [2022-12-06 04:08:17,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 77 transitions, 586 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:08:17,455 INFO L231 Difference]: Finished difference. Result has 50 places, 31 transitions, 225 flow [2022-12-06 04:08:17,455 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2022-12-06 04:08:17,455 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2022-12-06 04:08:17,455 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:17,455 INFO L89 Accepts]: Start accepts. Operand has 50 places, 31 transitions, 225 flow [2022-12-06 04:08:17,456 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:17,456 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:17,457 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 31 transitions, 225 flow [2022-12-06 04:08:17,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 31 transitions, 225 flow [2022-12-06 04:08:17,469 INFO L130 PetriNetUnfolder]: 23/104 cut-off events. [2022-12-06 04:08:17,469 INFO L131 PetriNetUnfolder]: For 215/221 co-relation queries the response was YES. [2022-12-06 04:08:17,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 104 events. 23/104 cut-off events. For 215/221 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 479 event pairs, 0 based on Foata normal form. 3/105 useless extension candidates. Maximal degree in co-relation 344. Up to 26 conditions per place. [2022-12-06 04:08:17,470 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 31 transitions, 225 flow [2022-12-06 04:08:17,470 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 04:08:17,605 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [338] L759-->L762: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [355] L808-->L824: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd3~0_54 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd3~0_68 256) 0))) (let ((.cse8 (not .cse6)) (.cse11 (= (mod v_~a$w_buff0_used~0_132 256) 0)) (.cse4 (and .cse10 .cse6)) (.cse5 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse6))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_131 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse1 (or .cse11 .cse4 .cse5)) (.cse2 (and (not .cse11) .cse8))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a~0_86 v_~a$mem_tmp~0_18) (= (ite .cse0 v_~a$w_buff0_used~0_132 (ite .cse1 v_~a$w_buff0_used~0_132 (ite .cse2 0 v_~a$w_buff0_used~0_132))) v_~a$w_buff0_used~0_131) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= v_~a$r_buff0_thd3~0_67 (ite .cse0 v_~a$r_buff0_thd3~0_68 (ite (or (and .cse6 .cse7) .cse3 .cse4) v_~a$r_buff0_thd3~0_68 (ite (and (not .cse3) .cse8) 0 v_~a$r_buff0_thd3~0_68)))) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= v_~a$w_buff0~0_74 v_~a$w_buff0~0_73) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_8)) (= (ite .cse0 v_~a$r_buff1_thd3~0_54 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd3~0_67 256) 0))) (or .cse3 (and .cse9 .cse7) (and .cse9 .cse10))) v_~a$r_buff1_thd3~0_54 0)) v_~a$r_buff1_thd3~0_53) (= v_~__unbuffered_p2_EBX~0_8 (ite .cse1 v_~a~0_86 (ite .cse2 v_~a$w_buff0~0_74 v_~a$w_buff1~0_67))) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_32) (= v_~a$w_buff1~0_66 v_~a$w_buff1~0_67))))) InVars {~a~0=v_~a~0_86, ~a$w_buff1~0=v_~a$w_buff1~0_67, ~a$w_buff0~0=v_~a$w_buff0~0_74, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_54, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_132, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_53, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_131, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_66, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_73, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~a$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~nondet4, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0] [2022-12-06 04:08:17,800 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [338] L759-->L762: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [354] L805-->L808: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-06 04:08:17,837 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [423] $Ultimate##0-->L805: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~z~0_23 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~z~0=v_~z~0_23, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~z~0] and [484] L759-->L808: Formula: (and (= v_~x~0_112 1) (= v_~z~0_55 v_~__unbuffered_p2_EAX~0_85)) InVars {~z~0=v_~z~0_55} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~z~0=v_~z~0_55, ~x~0=v_~x~0_112} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0, ~x~0] [2022-12-06 04:08:17,876 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:08:17,877 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 422 [2022-12-06 04:08:17,877 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 216 flow [2022-12-06 04:08:17,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:17,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:17,877 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:17,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:08:17,878 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:08:17,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:17,878 INFO L85 PathProgramCache]: Analyzing trace with hash -854922960, now seen corresponding path program 1 times [2022-12-06 04:08:17,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:17,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525219066] [2022-12-06 04:08:17,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:17,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:08:17,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:08:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:08:18,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:08:18,029 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:08:18,030 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:08:18,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:08:18,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:08:18,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:08:18,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:08:18,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:08:18,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:08:18,032 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:18,037 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:08:18,037 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:08:18,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:08:18 BasicIcfg [2022-12-06 04:08:18,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:08:18,085 INFO L158 Benchmark]: Toolchain (without parser) took 15189.08ms. Allocated memory was 183.5MB in the beginning and 383.8MB in the end (delta: 200.3MB). Free memory was 160.3MB in the beginning and 286.4MB in the end (delta: -126.2MB). Peak memory consumption was 75.2MB. Max. memory is 8.0GB. [2022-12-06 04:08:18,085 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:08:18,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 572.01ms. Allocated memory is still 183.5MB. Free memory was 160.3MB in the beginning and 132.9MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:08:18,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.92ms. Allocated memory is still 183.5MB. Free memory was 132.9MB in the beginning and 130.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:08:18,086 INFO L158 Benchmark]: Boogie Preprocessor took 27.46ms. Allocated memory is still 183.5MB. Free memory was 130.4MB in the beginning and 128.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:08:18,086 INFO L158 Benchmark]: RCFGBuilder took 680.49ms. Allocated memory is still 183.5MB. Free memory was 128.3MB in the beginning and 92.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-06 04:08:18,086 INFO L158 Benchmark]: TraceAbstraction took 13856.60ms. Allocated memory was 183.5MB in the beginning and 383.8MB in the end (delta: 200.3MB). Free memory was 92.1MB in the beginning and 286.4MB in the end (delta: -194.3MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2022-12-06 04:08:18,087 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.12ms. Allocated memory is still 183.5MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 572.01ms. Allocated memory is still 183.5MB. Free memory was 160.3MB in the beginning and 132.9MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.92ms. Allocated memory is still 183.5MB. Free memory was 132.9MB in the beginning and 130.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.46ms. Allocated memory is still 183.5MB. Free memory was 130.4MB in the beginning and 128.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 680.49ms. Allocated memory is still 183.5MB. Free memory was 128.3MB in the beginning and 92.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 13856.60ms. Allocated memory was 183.5MB in the beginning and 383.8MB in the end (delta: 200.3MB). Free memory was 92.1MB in the beginning and 286.4MB in the end (delta: -194.3MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 119 PlacesBefore, 40 PlacesAfterwards, 111 TransitionsBefore, 31 TransitionsAfterwards, 2216 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1923, independent: 1864, independent conditional: 1864, independent unconditional: 0, dependent: 59, dependent conditional: 59, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1923, independent: 1864, independent conditional: 0, independent unconditional: 1864, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1923, independent: 1864, independent conditional: 0, independent unconditional: 1864, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1923, independent: 1864, independent conditional: 0, independent unconditional: 1864, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1414, independent: 1372, independent conditional: 0, independent unconditional: 1372, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1414, independent: 1354, independent conditional: 0, independent unconditional: 1354, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 249, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 228, dependent conditional: 0, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1923, independent: 492, independent conditional: 0, independent unconditional: 492, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1414, unknown conditional: 0, unknown unconditional: 1414] , Statistics on independence cache: Total cache size (in pairs): 2109, Positive cache size: 2067, Positive conditional cache size: 0, Positive unconditional cache size: 2067, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, 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, 33 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 22 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 308, independent: 258, independent conditional: 258, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 308, independent: 258, independent conditional: 42, independent unconditional: 216, dependent: 50, dependent conditional: 18, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 308, independent: 258, independent conditional: 42, independent unconditional: 216, dependent: 50, dependent conditional: 18, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 308, independent: 258, independent conditional: 42, independent unconditional: 216, dependent: 50, dependent conditional: 18, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 173, independent: 146, independent conditional: 21, independent unconditional: 125, dependent: 27, dependent conditional: 8, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 173, independent: 142, independent conditional: 0, independent unconditional: 142, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 27, dependent conditional: 8, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 88, dependent conditional: 49, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 308, independent: 112, independent conditional: 21, independent unconditional: 91, dependent: 23, dependent conditional: 10, dependent unconditional: 13, unknown: 173, unknown conditional: 29, unknown unconditional: 144] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 158, Positive conditional cache size: 24, Positive unconditional cache size: 134, Negative cache size: 27, Negative conditional cache size: 8, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 32 PlacesBefore, 32 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, independent: 83, independent conditional: 83, 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: 105, independent: 83, independent conditional: 7, independent unconditional: 76, 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: 105, independent: 83, independent conditional: 0, independent unconditional: 83, 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: 105, independent: 83, independent conditional: 0, independent unconditional: 83, 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: 30, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 105, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 30, unknown conditional: 0, unknown unconditional: 30] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 178, Positive conditional cache size: 24, Positive unconditional cache size: 154, Negative cache size: 37, Negative conditional cache size: 8, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 87, independent conditional: 87, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 102, independent: 87, independent conditional: 12, independent unconditional: 75, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 102, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 15, dependent conditional: 0, dependent unconditional: 15, 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: 0, dependent unconditional: 1, 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: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 180, Positive conditional cache size: 24, Positive unconditional cache size: 156, Negative cache size: 38, Negative conditional cache size: 8, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 168, independent: 138, independent conditional: 138, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 168, independent: 138, independent conditional: 35, independent unconditional: 103, dependent: 30, dependent conditional: 4, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 168, independent: 138, independent conditional: 0, independent unconditional: 138, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 168, independent: 138, independent conditional: 0, independent unconditional: 138, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 168, independent: 132, independent conditional: 0, independent unconditional: 132, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 193, Positive conditional cache size: 24, Positive unconditional cache size: 169, Negative cache size: 40, Negative conditional cache size: 8, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 39, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 161, independent: 139, independent conditional: 139, 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: 161, independent: 139, independent conditional: 97, independent unconditional: 42, 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: 161, independent: 139, independent conditional: 16, independent unconditional: 123, 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: 161, independent: 139, independent conditional: 16, independent unconditional: 123, 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: 8, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 161, independent: 134, independent conditional: 14, independent unconditional: 120, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 8, unknown conditional: 2, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 198, Positive conditional cache size: 26, Positive unconditional cache size: 172, Negative cache size: 43, Negative conditional cache size: 8, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 83, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 52 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 238, independent: 188, independent conditional: 188, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 238, independent: 188, independent conditional: 78, independent unconditional: 110, dependent: 50, dependent conditional: 4, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 242, independent: 188, independent conditional: 10, independent unconditional: 178, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 242, independent: 188, independent conditional: 10, independent unconditional: 178, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 242, independent: 186, independent conditional: 8, independent unconditional: 178, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 207, Positive conditional cache size: 28, Positive unconditional cache size: 179, Negative cache size: 43, Negative conditional cache size: 8, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 76, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 53 PlacesBefore, 50 PlacesAfterwards, 43 TransitionsBefore, 40 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 285, independent: 239, independent conditional: 239, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 285, independent: 239, independent conditional: 105, independent unconditional: 134, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 285, independent: 239, independent conditional: 35, independent unconditional: 204, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 285, independent: 239, independent conditional: 35, independent unconditional: 204, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 4, 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: 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: 285, independent: 233, independent conditional: 31, independent unconditional: 202, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 239, Positive conditional cache size: 32, Positive unconditional cache size: 207, Negative cache size: 43, Negative conditional cache size: 8, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 70, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 47 PlacesBefore, 46 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 216, independent: 182, independent conditional: 182, 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: 216, independent: 182, independent conditional: 182, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 216, independent: 182, independent conditional: 154, independent unconditional: 28, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 216, independent: 182, independent conditional: 154, independent unconditional: 28, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 216, independent: 178, independent conditional: 150, independent unconditional: 28, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 279, Positive conditional cache size: 36, Positive unconditional cache size: 243, Negative cache size: 47, Negative conditional cache size: 12, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 49 PlacesBefore, 45 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 186, independent: 145, independent conditional: 145, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 186, independent: 145, independent conditional: 94, independent unconditional: 51, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 186, independent: 145, independent conditional: 36, independent unconditional: 109, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 186, independent: 145, independent conditional: 36, independent unconditional: 109, dependent: 41, dependent conditional: 0, dependent unconditional: 41, 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: 186, independent: 139, independent conditional: 34, independent unconditional: 105, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 437, Positive cache size: 390, Positive conditional cache size: 44, Positive unconditional cache size: 346, Negative cache size: 47, Negative conditional cache size: 12, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 58, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t281; [L849] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t281, ((void *)0), P0, ((void *)0))=-2, t281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t282; [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t282, ((void *)0), P1, ((void *)0))=-1, t281={5:0}, t282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L852] 0 pthread_t t283; [L853] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t283, ((void *)0), P2, ((void *)0))=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 [L781] 2 y = 1 [L784] 2 __unbuffered_p1_EAX = y [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L804] 3 z = 1 [L807] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L855] 1 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 1 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 1 !(!cond) [L857] RET 1 assume_abort_if_not(main$tmp_guard0) [L859] 1 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 1 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 1 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L866] 1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L868] CALL 1 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 1 !expression [L18] 1 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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: 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 7 procedures, 144 locations, 6 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: 13.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 350 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 350 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 669 IncrementalHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 12 mSDtfsCounter, 669 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=7, InterpolantAutomatonStates: 42, 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.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:08:18,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...