/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/mix046.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:18:04,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:18:04,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:18:05,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:18:05,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:18:05,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:18:05,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:18:05,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:18:05,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:18:05,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:18:05,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:18:05,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:18:05,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:18:05,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:18:05,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:18:05,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:18:05,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:18:05,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:18:05,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:18:05,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:18:05,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:18:05,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:18:05,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:18:05,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:18:05,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:18:05,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:18:05,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:18:05,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:18:05,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:18:05,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:18:05,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:18:05,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:18:05,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:18:05,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:18:05,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:18:05,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:18:05,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:18:05,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:18:05,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:18:05,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:18:05,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:18:05,100 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:18:05,136 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:18:05,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:18:05,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:18:05,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:18:05,140 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:18:05,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:18:05,141 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:18:05,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:18:05,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:18:05,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:18:05,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:18:05,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:18:05,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:18:05,142 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:18:05,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:18:05,143 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:18:05,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:18:05,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:18:05,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:18:05,143 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:18:05,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:18:05,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:18:05,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:18:05,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:18:05,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:18:05,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:18:05,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:18:05,144 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:18:05,145 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:18:05,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:18:05,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:18:05,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:18:05,530 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:18:05,530 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:18:05,532 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.oepc.i [2022-12-06 04:18:06,739 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:18:06,974 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:18:06,974 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.oepc.i [2022-12-06 04:18:06,996 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3904ab4/8cb84d15ee9942a7980897656c597972/FLAG112845404 [2022-12-06 04:18:07,013 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3904ab4/8cb84d15ee9942a7980897656c597972 [2022-12-06 04:18:07,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:18:07,016 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:18:07,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:18:07,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:18:07,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:18:07,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:18:07" (1/1) ... [2022-12-06 04:18:07,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b77d0e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:07, skipping insertion in model container [2022-12-06 04:18:07,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:18:07" (1/1) ... [2022-12-06 04:18:07,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:18:07,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:18:07,204 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/mix046.oepc.i[945,958] [2022-12-06 04:18:07,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:18:07,395 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:18:07,403 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/mix046.oepc.i[945,958] [2022-12-06 04:18:07,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:07,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:07,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:18:07,488 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:18:07,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:07 WrapperNode [2022-12-06 04:18:07,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:18:07,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:18:07,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:18:07,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:18:07,496 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:18:07" (1/1) ... [2022-12-06 04:18:07,522 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:18:07" (1/1) ... [2022-12-06 04:18:07,556 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-06 04:18:07,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:18:07,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:18:07,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:18:07,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:18:07,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:07" (1/1) ... [2022-12-06 04:18:07,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:07" (1/1) ... [2022-12-06 04:18:07,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:07" (1/1) ... [2022-12-06 04:18:07,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:07" (1/1) ... [2022-12-06 04:18:07,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:07" (1/1) ... [2022-12-06 04:18:07,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:07" (1/1) ... [2022-12-06 04:18:07,588 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:07" (1/1) ... [2022-12-06 04:18:07,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:07" (1/1) ... [2022-12-06 04:18:07,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:18:07,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:18:07,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:18:07,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:18:07,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:07" (1/1) ... [2022-12-06 04:18:07,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:18:07,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:18:07,667 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:18:07,683 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:18:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:18:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:18:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:18:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:18:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:18:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:18:07,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:18:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:18:07,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:18:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:18:07,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:18:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:18:07,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:18:07,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:18:07,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:18:07,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:18:07,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:18:07,699 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:18:07,792 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:18:07,794 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:18:08,070 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:18:08,152 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:18:08,152 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:18:08,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:18:08 BoogieIcfgContainer [2022-12-06 04:18:08,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:18:08,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:18:08,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:18:08,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:18:08,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:18:07" (1/3) ... [2022-12-06 04:18:08,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a08cd21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:18:08, skipping insertion in model container [2022-12-06 04:18:08,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:07" (2/3) ... [2022-12-06 04:18:08,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a08cd21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:18:08, skipping insertion in model container [2022-12-06 04:18:08,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:18:08" (3/3) ... [2022-12-06 04:18:08,164 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.oepc.i [2022-12-06 04:18:08,177 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:18:08,177 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:18:08,177 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:18:08,234 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:18:08,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2022-12-06 04:18:08,377 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-06 04:18:08,378 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:18:08,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 04:18:08,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2022-12-06 04:18:08,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2022-12-06 04:18:08,394 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:08,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-06 04:18:08,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2022-12-06 04:18:08,477 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-06 04:18:08,478 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:18:08,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 04:18:08,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-06 04:18:08,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 3270 [2022-12-06 04:18:13,819 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-06 04:18:13,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:18:13,840 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;@62a75678, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:18:13,841 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:18:13,843 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 04:18:13,844 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:18:13,844 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:13,844 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:18:13,845 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:13,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash 556139, now seen corresponding path program 1 times [2022-12-06 04:18:13,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:13,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43753510] [2022-12-06 04:18:13,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:13,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:14,154 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:18:14,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:14,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43753510] [2022-12-06 04:18:14,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43753510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:14,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:14,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:18:14,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475687326] [2022-12-06 04:18:14,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:14,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:18:14,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:14,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:18:14,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:18:14,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 04:18:14,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:14,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:14,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 04:18:14,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:15,209 INFO L130 PetriNetUnfolder]: 6050/8308 cut-off events. [2022-12-06 04:18:15,209 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-06 04:18:15,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16707 conditions, 8308 events. 6050/8308 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 41419 event pairs, 3098 based on Foata normal form. 0/7547 useless extension candidates. Maximal degree in co-relation 16695. Up to 6574 conditions per place. [2022-12-06 04:18:15,259 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 41 selfloop transitions, 2 changer transitions 10/57 dead transitions. [2022-12-06 04:18:15,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 241 flow [2022-12-06 04:18:15,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:18:15,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:18:15,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-06 04:18:15,269 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-06 04:18:15,271 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 70 transitions. [2022-12-06 04:18:15,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 241 flow [2022-12-06 04:18:15,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:18:15,277 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 68 flow [2022-12-06 04:18:15,279 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-06 04:18:15,282 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2022-12-06 04:18:15,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:15,283 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 68 flow [2022-12-06 04:18:15,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:15,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:15,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 68 flow [2022-12-06 04:18:15,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-06 04:18:15,292 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 04:18:15,292 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:18:15,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:18:15,293 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-06 04:18:15,293 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 04:18:15,410 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:15,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-06 04:18:15,412 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2022-12-06 04:18:15,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:15,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:15,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:15,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:18:15,413 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:15,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:15,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1501688075, now seen corresponding path program 1 times [2022-12-06 04:18:15,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:15,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878590312] [2022-12-06 04:18:15,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:15,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:15,587 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:18:15,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:15,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878590312] [2022-12-06 04:18:15,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878590312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:15,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:15,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:18:15,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058292546] [2022-12-06 04:18:15,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:15,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:18:15,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:15,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:18:15,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:18:15,590 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:18:15,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:15,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:15,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:18:15,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:17,843 INFO L130 PetriNetUnfolder]: 16167/22000 cut-off events. [2022-12-06 04:18:17,843 INFO L131 PetriNetUnfolder]: For 1094/1094 co-relation queries the response was YES. [2022-12-06 04:18:17,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45567 conditions, 22000 events. 16167/22000 cut-off events. For 1094/1094 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 115784 event pairs, 5981 based on Foata normal form. 634/22634 useless extension candidates. Maximal degree in co-relation 45557. Up to 12890 conditions per place. [2022-12-06 04:18:17,993 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2022-12-06 04:18:17,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 232 flow [2022-12-06 04:18:17,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:18:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:18:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 04:18:17,995 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-06 04:18:17,995 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 3 states and 54 transitions. [2022-12-06 04:18:17,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 232 flow [2022-12-06 04:18:17,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:18:17,998 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 126 flow [2022-12-06 04:18:17,998 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2022-12-06 04:18:17,998 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2022-12-06 04:18:17,999 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:17,999 INFO L89 Accepts]: Start accepts. Operand has 41 places, 35 transitions, 126 flow [2022-12-06 04:18:18,001 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:18,001 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:18,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 35 transitions, 126 flow [2022-12-06 04:18:18,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 126 flow [2022-12-06 04:18:18,064 INFO L130 PetriNetUnfolder]: 230/595 cut-off events. [2022-12-06 04:18:18,065 INFO L131 PetriNetUnfolder]: For 71/79 co-relation queries the response was YES. [2022-12-06 04:18:18,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 595 events. 230/595 cut-off events. For 71/79 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3978 event pairs, 96 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 1152. Up to 273 conditions per place. [2022-12-06 04:18:18,074 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 35 transitions, 126 flow [2022-12-06 04:18:18,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-06 04:18:18,168 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:18,169 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 04:18:18,169 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 126 flow [2022-12-06 04:18:18,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:18,170 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:18,170 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:18,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:18:18,170 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:18,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:18,171 INFO L85 PathProgramCache]: Analyzing trace with hash 692310708, now seen corresponding path program 1 times [2022-12-06 04:18:18,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:18,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568877926] [2022-12-06 04:18:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:18,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:18,387 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:18:18,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:18,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568877926] [2022-12-06 04:18:18,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568877926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:18,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:18,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:18:18,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701817957] [2022-12-06 04:18:18,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:18,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:18:18,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:18,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:18:18,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:18:18,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:18:18,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 126 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:18,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:18,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:18:18,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:20,127 INFO L130 PetriNetUnfolder]: 14987/20406 cut-off events. [2022-12-06 04:18:20,127 INFO L131 PetriNetUnfolder]: For 8354/8354 co-relation queries the response was YES. [2022-12-06 04:18:20,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50968 conditions, 20406 events. 14987/20406 cut-off events. For 8354/8354 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 103913 event pairs, 3878 based on Foata normal form. 210/20616 useless extension candidates. Maximal degree in co-relation 50956. Up to 8687 conditions per place. [2022-12-06 04:18:20,214 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 57 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2022-12-06 04:18:20,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 340 flow [2022-12-06 04:18:20,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:18:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:18:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-06 04:18:20,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-06 04:18:20,217 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 126 flow. Second operand 4 states and 60 transitions. [2022-12-06 04:18:20,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 340 flow [2022-12-06 04:18:20,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 65 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:18:20,251 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 168 flow [2022-12-06 04:18:20,251 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-12-06 04:18:20,251 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2022-12-06 04:18:20,252 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:20,252 INFO L89 Accepts]: Start accepts. Operand has 45 places, 39 transitions, 168 flow [2022-12-06 04:18:20,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:20,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:20,253 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 168 flow [2022-12-06 04:18:20,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 168 flow [2022-12-06 04:18:20,285 INFO L130 PetriNetUnfolder]: 160/428 cut-off events. [2022-12-06 04:18:20,285 INFO L131 PetriNetUnfolder]: For 185/187 co-relation queries the response was YES. [2022-12-06 04:18:20,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 428 events. 160/428 cut-off events. For 185/187 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2504 event pairs, 44 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 964. Up to 194 conditions per place. [2022-12-06 04:18:20,289 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 39 transitions, 168 flow [2022-12-06 04:18:20,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 578 [2022-12-06 04:18:20,310 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:20,311 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 04:18:20,311 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 168 flow [2022-12-06 04:18:20,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:20,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:20,311 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:20,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:18:20,312 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:20,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:20,312 INFO L85 PathProgramCache]: Analyzing trace with hash -13459691, now seen corresponding path program 1 times [2022-12-06 04:18:20,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:20,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597933443] [2022-12-06 04:18:20,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:20,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:20,539 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:18:20,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:20,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597933443] [2022-12-06 04:18:20,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597933443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:20,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:20,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:18:20,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56046495] [2022-12-06 04:18:20,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:20,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:18:20,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:20,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:18:20,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:18:20,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 04:18:20,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:20,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:20,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 04:18:20,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:22,009 INFO L130 PetriNetUnfolder]: 11913/17105 cut-off events. [2022-12-06 04:18:22,009 INFO L131 PetriNetUnfolder]: For 8776/8862 co-relation queries the response was YES. [2022-12-06 04:18:22,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43147 conditions, 17105 events. 11913/17105 cut-off events. For 8776/8862 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 100452 event pairs, 3416 based on Foata normal form. 66/16998 useless extension candidates. Maximal degree in co-relation 43132. Up to 15241 conditions per place. [2022-12-06 04:18:22,225 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 45 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2022-12-06 04:18:22,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 338 flow [2022-12-06 04:18:22,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:18:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:18:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 04:18:22,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 04:18:22,229 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 168 flow. Second operand 3 states and 51 transitions. [2022-12-06 04:18:22,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 338 flow [2022-12-06 04:18:22,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 335 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:18:22,274 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 223 flow [2022-12-06 04:18:22,274 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=223, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2022-12-06 04:18:22,276 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2022-12-06 04:18:22,276 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:22,276 INFO L89 Accepts]: Start accepts. Operand has 47 places, 44 transitions, 223 flow [2022-12-06 04:18:22,277 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:22,277 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:22,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 44 transitions, 223 flow [2022-12-06 04:18:22,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 44 transitions, 223 flow [2022-12-06 04:18:22,313 INFO L130 PetriNetUnfolder]: 144/388 cut-off events. [2022-12-06 04:18:22,313 INFO L131 PetriNetUnfolder]: For 233/238 co-relation queries the response was YES. [2022-12-06 04:18:22,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 388 events. 144/388 cut-off events. For 233/238 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2250 event pairs, 20 based on Foata normal form. 1/384 useless extension candidates. Maximal degree in co-relation 974. Up to 174 conditions per place. [2022-12-06 04:18:22,318 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 44 transitions, 223 flow [2022-12-06 04:18:22,318 INFO L188 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-06 04:18:22,323 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:22,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 04:18:22,329 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 223 flow [2022-12-06 04:18:22,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:22,329 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:22,329 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:22,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:18:22,330 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:22,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:22,330 INFO L85 PathProgramCache]: Analyzing trace with hash -409312094, now seen corresponding path program 1 times [2022-12-06 04:18:22,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:22,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880833889] [2022-12-06 04:18:22,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:22,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:22,534 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:18:22,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:22,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880833889] [2022-12-06 04:18:22,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880833889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:22,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:22,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:18:22,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177942117] [2022-12-06 04:18:22,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:22,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:18:22,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:22,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:18:22,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:18:22,539 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-06 04:18:22,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:22,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:22,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-06 04:18:22,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:23,745 INFO L130 PetriNetUnfolder]: 9122/13496 cut-off events. [2022-12-06 04:18:23,745 INFO L131 PetriNetUnfolder]: For 8105/8881 co-relation queries the response was YES. [2022-12-06 04:18:23,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33752 conditions, 13496 events. 9122/13496 cut-off events. For 8105/8881 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 84273 event pairs, 1449 based on Foata normal form. 1173/14481 useless extension candidates. Maximal degree in co-relation 33735. Up to 8287 conditions per place. [2022-12-06 04:18:23,821 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 82 selfloop transitions, 10 changer transitions 0/106 dead transitions. [2022-12-06 04:18:23,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 106 transitions, 643 flow [2022-12-06 04:18:23,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:18:23,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:18:23,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-06 04:18:23,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2022-12-06 04:18:23,822 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 223 flow. Second operand 5 states and 92 transitions. [2022-12-06 04:18:23,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 106 transitions, 643 flow [2022-12-06 04:18:23,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 106 transitions, 633 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:18:23,827 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 292 flow [2022-12-06 04:18:23,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2022-12-06 04:18:23,828 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2022-12-06 04:18:23,828 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:23,828 INFO L89 Accepts]: Start accepts. Operand has 53 places, 53 transitions, 292 flow [2022-12-06 04:18:23,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:23,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:23,829 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 53 transitions, 292 flow [2022-12-06 04:18:23,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 53 transitions, 292 flow [2022-12-06 04:18:23,943 INFO L130 PetriNetUnfolder]: 781/1596 cut-off events. [2022-12-06 04:18:23,943 INFO L131 PetriNetUnfolder]: For 1315/1943 co-relation queries the response was YES. [2022-12-06 04:18:23,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4603 conditions, 1596 events. 781/1596 cut-off events. For 1315/1943 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 12353 event pairs, 314 based on Foata normal form. 15/1435 useless extension candidates. Maximal degree in co-relation 4585. Up to 949 conditions per place. [2022-12-06 04:18:23,960 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 53 transitions, 292 flow [2022-12-06 04:18:23,961 INFO L188 LiptonReduction]: Number of co-enabled transitions 976 [2022-12-06 04:18:23,971 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [456] L852-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P3Thread1of1ForFork1_#res.base_11| 0) (= |v_P3Thread1of1ForFork1_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset] [2022-12-06 04:18:23,996 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [441] L793-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_15| 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_15|) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-06 04:18:24,025 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [504] L813-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.base_9| 0) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= |v_P2Thread1of1ForFork3_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_9|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_9|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] [2022-12-06 04:18:24,054 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [512] L773-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res#1.base_7| 0) (= |v_P0Thread1of1ForFork0_#res#1.offset_7| 0) (= v_~__unbuffered_cnt~0_99 (+ v_~__unbuffered_cnt~0_100 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_7|, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, P0Thread1of1ForFork0_#res#1.base, ~__unbuffered_cnt~0] [2022-12-06 04:18:24,116 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:18:24,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 290 [2022-12-06 04:18:24,118 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 302 flow [2022-12-06 04:18:24,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:24,120 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:24,120 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:18:24,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:18:24,120 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:24,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:24,121 INFO L85 PathProgramCache]: Analyzing trace with hash -222324327, now seen corresponding path program 1 times [2022-12-06 04:18:24,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:24,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935705334] [2022-12-06 04:18:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:24,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:24,267 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:18:24,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:24,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935705334] [2022-12-06 04:18:24,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935705334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:24,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:24,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:18:24,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733268974] [2022-12-06 04:18:24,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:24,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:18:24,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:24,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:18:24,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:18:24,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 04:18:24,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 302 flow. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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:18:24,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:24,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 04:18:24,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:26,309 INFO L130 PetriNetUnfolder]: 15412/22081 cut-off events. [2022-12-06 04:18:26,309 INFO L131 PetriNetUnfolder]: For 34237/34237 co-relation queries the response was YES. [2022-12-06 04:18:26,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75752 conditions, 22081 events. 15412/22081 cut-off events. For 34237/34237 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 131596 event pairs, 3087 based on Foata normal form. 204/22285 useless extension candidates. Maximal degree in co-relation 75731. Up to 10170 conditions per place. [2022-12-06 04:18:26,379 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 78 selfloop transitions, 18 changer transitions 15/111 dead transitions. [2022-12-06 04:18:26,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 111 transitions, 830 flow [2022-12-06 04:18:26,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:18:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:18:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-06 04:18:26,380 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2022-12-06 04:18:26,380 INFO L175 Difference]: Start difference. First operand has 52 places, 52 transitions, 302 flow. Second operand 4 states and 85 transitions. [2022-12-06 04:18:26,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 111 transitions, 830 flow [2022-12-06 04:18:26,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 111 transitions, 793 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-06 04:18:26,398 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 391 flow [2022-12-06 04:18:26,398 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2022-12-06 04:18:26,398 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2022-12-06 04:18:26,398 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:26,398 INFO L89 Accepts]: Start accepts. Operand has 57 places, 55 transitions, 391 flow [2022-12-06 04:18:26,399 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:26,399 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:26,399 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 55 transitions, 391 flow [2022-12-06 04:18:26,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 55 transitions, 391 flow [2022-12-06 04:18:26,514 INFO L130 PetriNetUnfolder]: 890/1787 cut-off events. [2022-12-06 04:18:26,514 INFO L131 PetriNetUnfolder]: For 2148/2785 co-relation queries the response was YES. [2022-12-06 04:18:26,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5430 conditions, 1787 events. 890/1787 cut-off events. For 2148/2785 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 13734 event pairs, 404 based on Foata normal form. 4/1603 useless extension candidates. Maximal degree in co-relation 5408. Up to 1102 conditions per place. [2022-12-06 04:18:26,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 55 transitions, 391 flow [2022-12-06 04:18:26,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 920 [2022-12-06 04:18:26,544 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:26,544 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-06 04:18:26,545 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 391 flow [2022-12-06 04:18:26,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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:18:26,545 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:26,545 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:18:26,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:18:26,545 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:26,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:26,549 INFO L85 PathProgramCache]: Analyzing trace with hash 963826633, now seen corresponding path program 1 times [2022-12-06 04:18:26,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:26,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547657276] [2022-12-06 04:18:26,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:26,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:26,677 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:18:26,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:26,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547657276] [2022-12-06 04:18:26,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547657276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:26,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:26,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:18:26,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138923035] [2022-12-06 04:18:26,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:26,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:18:26,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:26,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:18:26,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:18:26,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 04:18:26,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:26,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:26,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 04:18:26,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:29,037 INFO L130 PetriNetUnfolder]: 14032/20936 cut-off events. [2022-12-06 04:18:29,037 INFO L131 PetriNetUnfolder]: For 35602/36565 co-relation queries the response was YES. [2022-12-06 04:18:29,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69800 conditions, 20936 events. 14032/20936 cut-off events. For 35602/36565 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 138469 event pairs, 6252 based on Foata normal form. 369/21011 useless extension candidates. Maximal degree in co-relation 69775. Up to 10063 conditions per place. [2022-12-06 04:18:29,208 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 56 selfloop transitions, 9 changer transitions 5/80 dead transitions. [2022-12-06 04:18:29,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 80 transitions, 647 flow [2022-12-06 04:18:29,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:18:29,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:18:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 04:18:29,211 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2022-12-06 04:18:29,211 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 391 flow. Second operand 3 states and 53 transitions. [2022-12-06 04:18:29,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 80 transitions, 647 flow [2022-12-06 04:18:29,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 80 transitions, 643 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 04:18:29,441 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 396 flow [2022-12-06 04:18:29,441 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2022-12-06 04:18:29,442 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2022-12-06 04:18:29,442 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:29,442 INFO L89 Accepts]: Start accepts. Operand has 58 places, 53 transitions, 396 flow [2022-12-06 04:18:29,443 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:29,443 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:29,443 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 53 transitions, 396 flow [2022-12-06 04:18:29,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 53 transitions, 396 flow [2022-12-06 04:18:29,583 INFO L130 PetriNetUnfolder]: 1178/2315 cut-off events. [2022-12-06 04:18:29,583 INFO L131 PetriNetUnfolder]: For 2858/3680 co-relation queries the response was YES. [2022-12-06 04:18:29,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6774 conditions, 2315 events. 1178/2315 cut-off events. For 2858/3680 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 18602 event pairs, 569 based on Foata normal form. 4/2065 useless extension candidates. Maximal degree in co-relation 6751. Up to 1576 conditions per place. [2022-12-06 04:18:29,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 53 transitions, 396 flow [2022-12-06 04:18:29,608 INFO L188 LiptonReduction]: Number of co-enabled transitions 860 [2022-12-06 04:18:29,622 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:29,622 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 04:18:29,623 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 396 flow [2022-12-06 04:18:29,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:29,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:29,623 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:18:29,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:18:29,623 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:29,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:29,623 INFO L85 PathProgramCache]: Analyzing trace with hash -707691359, now seen corresponding path program 1 times [2022-12-06 04:18:29,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:29,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396088261] [2022-12-06 04:18:29,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:29,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:29,869 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:18:29,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:29,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396088261] [2022-12-06 04:18:29,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396088261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:29,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:29,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:18:29,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077151437] [2022-12-06 04:18:29,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:29,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:18:29,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:29,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:18:29,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:18:29,871 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-06 04:18:29,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 396 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:29,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:29,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-06 04:18:29,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:31,282 INFO L130 PetriNetUnfolder]: 9210/14425 cut-off events. [2022-12-06 04:18:31,282 INFO L131 PetriNetUnfolder]: For 18281/18876 co-relation queries the response was YES. [2022-12-06 04:18:31,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45995 conditions, 14425 events. 9210/14425 cut-off events. For 18281/18876 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 99786 event pairs, 1290 based on Foata normal form. 1466/15680 useless extension candidates. Maximal degree in co-relation 45969. Up to 5542 conditions per place. [2022-12-06 04:18:31,598 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 107 selfloop transitions, 14 changer transitions 7/144 dead transitions. [2022-12-06 04:18:31,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 144 transitions, 1210 flow [2022-12-06 04:18:31,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:18:31,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:18:31,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-06 04:18:31,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6726190476190477 [2022-12-06 04:18:31,601 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 396 flow. Second operand 6 states and 113 transitions. [2022-12-06 04:18:31,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 144 transitions, 1210 flow [2022-12-06 04:18:31,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 144 transitions, 1169 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-06 04:18:31,624 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 503 flow [2022-12-06 04:18:31,625 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=503, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2022-12-06 04:18:31,627 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2022-12-06 04:18:31,627 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:31,627 INFO L89 Accepts]: Start accepts. Operand has 65 places, 62 transitions, 503 flow [2022-12-06 04:18:31,633 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:31,633 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:31,633 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 62 transitions, 503 flow [2022-12-06 04:18:31,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 62 transitions, 503 flow [2022-12-06 04:18:31,791 INFO L130 PetriNetUnfolder]: 887/1934 cut-off events. [2022-12-06 04:18:31,791 INFO L131 PetriNetUnfolder]: For 5004/6788 co-relation queries the response was YES. [2022-12-06 04:18:31,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8477 conditions, 1934 events. 887/1934 cut-off events. For 5004/6788 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 15821 event pairs, 161 based on Foata normal form. 47/1867 useless extension candidates. Maximal degree in co-relation 8450. Up to 1418 conditions per place. [2022-12-06 04:18:31,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 62 transitions, 503 flow [2022-12-06 04:18:31,818 INFO L188 LiptonReduction]: Number of co-enabled transitions 1224 [2022-12-06 04:18:31,874 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [441] L793-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_15| 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_15|) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-06 04:18:31,915 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [504] L813-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.base_9| 0) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= |v_P2Thread1of1ForFork3_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_9|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_9|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] [2022-12-06 04:18:31,947 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [512] L773-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res#1.base_7| 0) (= |v_P0Thread1of1ForFork0_#res#1.offset_7| 0) (= v_~__unbuffered_cnt~0_99 (+ v_~__unbuffered_cnt~0_100 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_7|, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, P0Thread1of1ForFork0_#res#1.base, ~__unbuffered_cnt~0] [2022-12-06 04:18:31,984 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L876-3-->L880: Formula: (and (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_107 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [456] L852-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P3Thread1of1ForFork1_#res.base_11| 0) (= |v_P3Thread1of1ForFork1_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset] [2022-12-06 04:18:32,043 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:18:32,046 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 419 [2022-12-06 04:18:32,046 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 511 flow [2022-12-06 04:18:32,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:32,046 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:32,046 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:32,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:18:32,046 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:32,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:32,047 INFO L85 PathProgramCache]: Analyzing trace with hash -144723242, now seen corresponding path program 1 times [2022-12-06 04:18:32,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:32,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291715421] [2022-12-06 04:18:32,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:32,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:32,242 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:18:32,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:32,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291715421] [2022-12-06 04:18:32,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291715421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:32,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:32,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:18:32,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009954582] [2022-12-06 04:18:32,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:32,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:18:32,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:32,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:18:32,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:18:32,245 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-06 04:18:32,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 511 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:32,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:32,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-06 04:18:32,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:33,383 INFO L130 PetriNetUnfolder]: 6700/10583 cut-off events. [2022-12-06 04:18:33,383 INFO L131 PetriNetUnfolder]: For 26577/26950 co-relation queries the response was YES. [2022-12-06 04:18:33,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42835 conditions, 10583 events. 6700/10583 cut-off events. For 26577/26950 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 70134 event pairs, 1039 based on Foata normal form. 587/10994 useless extension candidates. Maximal degree in co-relation 42805. Up to 4357 conditions per place. [2022-12-06 04:18:33,450 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 95 selfloop transitions, 21 changer transitions 33/163 dead transitions. [2022-12-06 04:18:33,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 163 transitions, 1433 flow [2022-12-06 04:18:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:18:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:18:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2022-12-06 04:18:33,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 04:18:33,468 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 511 flow. Second operand 7 states and 136 transitions. [2022-12-06 04:18:33,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 163 transitions, 1433 flow [2022-12-06 04:18:34,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 163 transitions, 1349 flow, removed 37 selfloop flow, removed 3 redundant places. [2022-12-06 04:18:34,156 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 559 flow [2022-12-06 04:18:34,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=559, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2022-12-06 04:18:34,156 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2022-12-06 04:18:34,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:34,156 INFO L89 Accepts]: Start accepts. Operand has 70 places, 66 transitions, 559 flow [2022-12-06 04:18:34,157 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:34,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:34,158 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 66 transitions, 559 flow [2022-12-06 04:18:34,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 66 transitions, 559 flow [2022-12-06 04:18:34,241 INFO L130 PetriNetUnfolder]: 545/1358 cut-off events. [2022-12-06 04:18:34,241 INFO L131 PetriNetUnfolder]: For 5164/5772 co-relation queries the response was YES. [2022-12-06 04:18:34,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6246 conditions, 1358 events. 545/1358 cut-off events. For 5164/5772 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 11157 event pairs, 22 based on Foata normal form. 12/1278 useless extension candidates. Maximal degree in co-relation 6217. Up to 973 conditions per place. [2022-12-06 04:18:34,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 66 transitions, 559 flow [2022-12-06 04:18:34,253 INFO L188 LiptonReduction]: Number of co-enabled transitions 1158 [2022-12-06 04:18:34,436 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:18:34,437 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 281 [2022-12-06 04:18:34,437 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 549 flow [2022-12-06 04:18:34,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:34,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:34,437 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:34,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:18:34,437 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:34,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:34,438 INFO L85 PathProgramCache]: Analyzing trace with hash 159281199, now seen corresponding path program 1 times [2022-12-06 04:18:34,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:34,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658487898] [2022-12-06 04:18:34,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:34,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:35,048 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:18:35,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:35,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658487898] [2022-12-06 04:18:35,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658487898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:35,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:35,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:18:35,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958748212] [2022-12-06 04:18:35,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:35,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:18:35,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:35,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:18:35,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:18:35,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-06 04:18:35,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 549 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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:18:35,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:35,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-06 04:18:35,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:36,874 INFO L130 PetriNetUnfolder]: 9666/15480 cut-off events. [2022-12-06 04:18:36,875 INFO L131 PetriNetUnfolder]: For 49120/49579 co-relation queries the response was YES. [2022-12-06 04:18:36,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60912 conditions, 15480 events. 9666/15480 cut-off events. For 49120/49579 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 112113 event pairs, 1450 based on Foata normal form. 137/15369 useless extension candidates. Maximal degree in co-relation 60880. Up to 7450 conditions per place. [2022-12-06 04:18:37,009 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 112 selfloop transitions, 11 changer transitions 69/206 dead transitions. [2022-12-06 04:18:37,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 206 transitions, 2065 flow [2022-12-06 04:18:37,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:18:37,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:18:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2022-12-06 04:18:37,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2022-12-06 04:18:37,011 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 549 flow. Second operand 7 states and 132 transitions. [2022-12-06 04:18:37,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 206 transitions, 2065 flow [2022-12-06 04:18:37,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 206 transitions, 1745 flow, removed 101 selfloop flow, removed 4 redundant places. [2022-12-06 04:18:37,898 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 561 flow [2022-12-06 04:18:37,898 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=561, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2022-12-06 04:18:37,899 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 27 predicate places. [2022-12-06 04:18:37,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:37,899 INFO L89 Accepts]: Start accepts. Operand has 75 places, 74 transitions, 561 flow [2022-12-06 04:18:37,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:37,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:37,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 74 transitions, 561 flow [2022-12-06 04:18:37,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 74 transitions, 561 flow [2022-12-06 04:18:38,142 INFO L130 PetriNetUnfolder]: 1565/3349 cut-off events. [2022-12-06 04:18:38,142 INFO L131 PetriNetUnfolder]: For 8657/8984 co-relation queries the response was YES. [2022-12-06 04:18:38,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12384 conditions, 3349 events. 1565/3349 cut-off events. For 8657/8984 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 29217 event pairs, 74 based on Foata normal form. 100/3135 useless extension candidates. Maximal degree in co-relation 12353. Up to 1516 conditions per place. [2022-12-06 04:18:38,178 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 74 transitions, 561 flow [2022-12-06 04:18:38,178 INFO L188 LiptonReduction]: Number of co-enabled transitions 1408 [2022-12-06 04:18:38,194 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:38,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 296 [2022-12-06 04:18:38,195 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 561 flow [2022-12-06 04:18:38,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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:18:38,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:38,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:38,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:18:38,195 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:38,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:38,196 INFO L85 PathProgramCache]: Analyzing trace with hash 437042641, now seen corresponding path program 2 times [2022-12-06 04:18:38,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:38,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423532253] [2022-12-06 04:18:38,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:38,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:38,386 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:18:38,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:38,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423532253] [2022-12-06 04:18:38,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423532253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:38,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:38,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:18:38,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659756778] [2022-12-06 04:18:38,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:38,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:18:38,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:38,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:18:38,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:18:38,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-06 04:18:38,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 561 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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:18:38,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:38,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-06 04:18:38,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:39,755 INFO L130 PetriNetUnfolder]: 7892/12532 cut-off events. [2022-12-06 04:18:39,755 INFO L131 PetriNetUnfolder]: For 27590/28163 co-relation queries the response was YES. [2022-12-06 04:18:39,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49345 conditions, 12532 events. 7892/12532 cut-off events. For 27590/28163 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 88220 event pairs, 882 based on Foata normal form. 310/12579 useless extension candidates. Maximal degree in co-relation 49315. Up to 3916 conditions per place. [2022-12-06 04:18:39,865 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 89 selfloop transitions, 19 changer transitions 74/189 dead transitions. [2022-12-06 04:18:39,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 189 transitions, 1634 flow [2022-12-06 04:18:39,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 04:18:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 04:18:39,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2022-12-06 04:18:39,866 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4965277777777778 [2022-12-06 04:18:39,866 INFO L175 Difference]: Start difference. First operand has 73 places, 74 transitions, 561 flow. Second operand 9 states and 143 transitions. [2022-12-06 04:18:39,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 189 transitions, 1634 flow [2022-12-06 04:18:40,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 189 transitions, 1608 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 04:18:40,559 INFO L231 Difference]: Finished difference. Result has 81 places, 54 transitions, 402 flow [2022-12-06 04:18:40,559 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=402, PETRI_PLACES=81, PETRI_TRANSITIONS=54} [2022-12-06 04:18:40,559 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 33 predicate places. [2022-12-06 04:18:40,560 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:40,560 INFO L89 Accepts]: Start accepts. Operand has 81 places, 54 transitions, 402 flow [2022-12-06 04:18:40,560 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:40,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:40,561 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 54 transitions, 402 flow [2022-12-06 04:18:40,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 54 transitions, 402 flow [2022-12-06 04:18:40,583 INFO L130 PetriNetUnfolder]: 120/312 cut-off events. [2022-12-06 04:18:40,583 INFO L131 PetriNetUnfolder]: For 823/925 co-relation queries the response was YES. [2022-12-06 04:18:40,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 312 events. 120/312 cut-off events. For 823/925 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1688 event pairs, 5 based on Foata normal form. 10/287 useless extension candidates. Maximal degree in co-relation 1233. Up to 131 conditions per place. [2022-12-06 04:18:40,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 54 transitions, 402 flow [2022-12-06 04:18:40,586 INFO L188 LiptonReduction]: Number of co-enabled transitions 658 [2022-12-06 04:18:40,873 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:18:40,874 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 314 [2022-12-06 04:18:40,874 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 53 transitions, 413 flow [2022-12-06 04:18:40,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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:18:40,874 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:40,874 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:40,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:18:40,874 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:40,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:40,874 INFO L85 PathProgramCache]: Analyzing trace with hash -905119152, now seen corresponding path program 1 times [2022-12-06 04:18:40,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:40,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137375011] [2022-12-06 04:18:40,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:40,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:41,020 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:18:41,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:41,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137375011] [2022-12-06 04:18:41,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137375011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:41,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:41,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:18:41,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041753155] [2022-12-06 04:18:41,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:41,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:18:41,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:41,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:18:41,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:18:41,023 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2022-12-06 04:18:41,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 53 transitions, 413 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:41,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:41,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2022-12-06 04:18:41,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:41,390 INFO L130 PetriNetUnfolder]: 2299/3731 cut-off events. [2022-12-06 04:18:41,390 INFO L131 PetriNetUnfolder]: For 10440/10476 co-relation queries the response was YES. [2022-12-06 04:18:41,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15617 conditions, 3731 events. 2299/3731 cut-off events. For 10440/10476 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 20241 event pairs, 645 based on Foata normal form. 11/3724 useless extension candidates. Maximal degree in co-relation 15583. Up to 2149 conditions per place. [2022-12-06 04:18:41,412 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 45 selfloop transitions, 1 changer transitions 46/95 dead transitions. [2022-12-06 04:18:41,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 95 transitions, 870 flow [2022-12-06 04:18:41,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:18:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:18:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-06 04:18:41,413 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.53125 [2022-12-06 04:18:41,413 INFO L175 Difference]: Start difference. First operand has 76 places, 53 transitions, 413 flow. Second operand 4 states and 68 transitions. [2022-12-06 04:18:41,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 95 transitions, 870 flow [2022-12-06 04:18:41,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 95 transitions, 713 flow, removed 38 selfloop flow, removed 14 redundant places. [2022-12-06 04:18:41,446 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 244 flow [2022-12-06 04:18:41,446 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2022-12-06 04:18:41,447 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2022-12-06 04:18:41,447 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:41,447 INFO L89 Accepts]: Start accepts. Operand has 67 places, 43 transitions, 244 flow [2022-12-06 04:18:41,448 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:41,448 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:41,448 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 43 transitions, 244 flow [2022-12-06 04:18:41,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 43 transitions, 244 flow [2022-12-06 04:18:41,456 INFO L130 PetriNetUnfolder]: 42/103 cut-off events. [2022-12-06 04:18:41,456 INFO L131 PetriNetUnfolder]: For 104/114 co-relation queries the response was YES. [2022-12-06 04:18:41,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 103 events. 42/103 cut-off events. For 104/114 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 265 event pairs, 1 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 294. Up to 32 conditions per place. [2022-12-06 04:18:41,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 43 transitions, 244 flow [2022-12-06 04:18:41,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 366 [2022-12-06 04:18:43,120 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 04:18:43,121 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1674 [2022-12-06 04:18:43,121 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 37 transitions, 245 flow [2022-12-06 04:18:43,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:43,121 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:43,121 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:18:43,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:18:43,122 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:43,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:43,122 INFO L85 PathProgramCache]: Analyzing trace with hash -802413938, now seen corresponding path program 1 times [2022-12-06 04:18:43,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:43,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286785772] [2022-12-06 04:18:43,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:43,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:43,810 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:18:43,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:43,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286785772] [2022-12-06 04:18:43,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286785772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:43,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:43,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:18:43,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859036103] [2022-12-06 04:18:43,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:43,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:18:43,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:43,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:18:43,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:18:43,811 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:18:43,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 37 transitions, 245 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:18:43,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:43,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:18:43,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:43,988 INFO L130 PetriNetUnfolder]: 506/835 cut-off events. [2022-12-06 04:18:43,988 INFO L131 PetriNetUnfolder]: For 1859/1859 co-relation queries the response was YES. [2022-12-06 04:18:43,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3224 conditions, 835 events. 506/835 cut-off events. For 1859/1859 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3339 event pairs, 176 based on Foata normal form. 1/836 useless extension candidates. Maximal degree in co-relation 3197. Up to 502 conditions per place. [2022-12-06 04:18:43,992 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 39 selfloop transitions, 2 changer transitions 39/80 dead transitions. [2022-12-06 04:18:43,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 624 flow [2022-12-06 04:18:43,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:18:43,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:18:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-12-06 04:18:43,993 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 04:18:43,993 INFO L175 Difference]: Start difference. First operand has 57 places, 37 transitions, 245 flow. Second operand 5 states and 50 transitions. [2022-12-06 04:18:43,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 624 flow [2022-12-06 04:18:43,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 80 transitions, 559 flow, removed 9 selfloop flow, removed 9 redundant places. [2022-12-06 04:18:43,997 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 188 flow [2022-12-06 04:18:43,997 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2022-12-06 04:18:43,998 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2022-12-06 04:18:43,998 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:43,998 INFO L89 Accepts]: Start accepts. Operand has 54 places, 35 transitions, 188 flow [2022-12-06 04:18:43,998 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:43,998 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:43,998 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 35 transitions, 188 flow [2022-12-06 04:18:43,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 35 transitions, 188 flow [2022-12-06 04:18:44,005 INFO L130 PetriNetUnfolder]: 29/75 cut-off events. [2022-12-06 04:18:44,005 INFO L131 PetriNetUnfolder]: For 166/179 co-relation queries the response was YES. [2022-12-06 04:18:44,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 75 events. 29/75 cut-off events. For 166/179 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 208 event pairs, 1 based on Foata normal form. 5/76 useless extension candidates. Maximal degree in co-relation 210. Up to 24 conditions per place. [2022-12-06 04:18:44,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 35 transitions, 188 flow [2022-12-06 04:18:44,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 04:18:44,118 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [555] $Ultimate##0-->L766: Formula: (and (= v_~b$r_buff0_thd2~0_163 v_~b$r_buff1_thd2~0_160) (= v_~b$r_buff0_thd0~0_204 v_~b$r_buff1_thd0~0_196) (= v_~b$r_buff0_thd1~0_231 1) (= v_~b$w_buff0~0_338 1) (= v_~b$w_buff0_used~0_614 v_~b$w_buff1_used~0_538) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_71| |v_P0Thread1of1ForFork0_~arg#1.offset_71|) (= |v_P0Thread1of1ForFork0_~arg#1.base_71| |v_P0Thread1of1ForFork0_#in~arg#1.base_71|) (= v_~x~0_50 v_~__unbuffered_p0_EAX~0_82) (= v_~b$w_buff0_used~0_613 1) (= v_~b$w_buff1~0_289 v_~b$w_buff0~0_339) (= v_~b$r_buff0_thd1~0_232 v_~b$r_buff1_thd1~0_149) (= (ite (not (and (not (= (mod v_~b$w_buff1_used~0_538 256) 0)) (not (= (mod v_~b$w_buff0_used~0_613 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_73|) (= v_~b$r_buff0_thd3~0_220 v_~b$r_buff1_thd3~0_217) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_73| 0)) (= v_~b$r_buff0_thd4~0_223 v_~b$r_buff1_thd4~0_223) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_73| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_73|)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_614, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_232, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_163, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_220, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_71|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_71|, ~b$w_buff0~0=v_~b$w_buff0~0_339, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_223, ~x~0=v_~x~0_50, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_231, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_163, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_220, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_149, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_196, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_71|, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_71|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_71|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_71|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_613, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_538, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_73|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_223, ~b$w_buff1~0=v_~b$w_buff1~0_289, ~b$w_buff0~0=v_~b$w_buff0~0_338, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_223, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_160, ~x~0=v_~x~0_50, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_73|, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_217, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg#1.base, P0Thread1of1ForFork0_~arg#1.offset, ~b$w_buff0_used~0, ~__unbuffered_p0_EAX~0, ~b$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~b$r_buff1_thd2~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~b$r_buff1_thd3~0] and [559] $Ultimate##0-->L793: Formula: (let ((.cse5 (not (= (mod v_~b$r_buff0_thd2~0_184 256) 0))) (.cse4 (not (= (mod v_~b$w_buff0_used~0_649 256) 0))) (.cse3 (not (= (mod v_~b$r_buff1_thd2~0_181 256) 0)))) (let ((.cse1 (and (not (= (mod v_~b$w_buff1_used~0_569 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_650 256) 0))))) (and (= v_~x~0_56 1) (= |v_P1Thread1of1ForFork2_#in~arg.base_19| v_P1Thread1of1ForFork2_~arg.base_19) (= v_~y~0_107 1) (= (ite .cse0 v_~b$w_buff0~0_357 (ite .cse1 v_~b$w_buff1~0_303 v_~b~0_489)) v_~b~0_488) (= (ite (or .cse1 .cse2) 0 v_~b$w_buff1_used~0_569) v_~b$w_buff1_used~0_568) (= v_~b$r_buff0_thd2~0_183 (ite .cse2 0 v_~b$r_buff0_thd2~0_184)) (= v_~b$w_buff0_used~0_649 (ite .cse0 0 v_~b$w_buff0_used~0_650)) (= (ite (or (and (not (= (mod v_~b$w_buff1_used~0_568 256) 0)) .cse3) (and (not (= (mod v_~b$r_buff0_thd2~0_183 256) 0)) .cse4)) 0 v_~b$r_buff1_thd2~0_181) v_~b$r_buff1_thd2~0_180) (= |v_P1Thread1of1ForFork2_#in~arg.offset_19| v_P1Thread1of1ForFork2_~arg.offset_19)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_650, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_184, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_569, ~b~0=v_~b~0_489, ~b$w_buff1~0=v_~b$w_buff1~0_303, ~b$w_buff0~0=v_~b$w_buff0~0_357, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_181} OutVars{~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_183, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_19, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_649, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_19, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_568, ~b~0=v_~b~0_488, ~b$w_buff1~0=v_~b$w_buff1~0_303, ~b$w_buff0~0=v_~b$w_buff0~0_357, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_180, ~y~0=v_~y~0_107, ~x~0=v_~x~0_56} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0, ~y~0, ~x~0] [2022-12-06 04:18:44,326 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:18:44,327 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 329 [2022-12-06 04:18:44,327 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 196 flow [2022-12-06 04:18:44,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:18:44,327 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:44,327 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:18:44,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:18:44,328 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:44,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:44,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1693021907, now seen corresponding path program 1 times [2022-12-06 04:18:44,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:44,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107358695] [2022-12-06 04:18:44,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:44,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:45,114 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:18:45,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:45,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107358695] [2022-12-06 04:18:45,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107358695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:45,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:45,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:18:45,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662986627] [2022-12-06 04:18:45,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:45,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:18:45,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:45,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:18:45,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:18:45,115 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:18:45,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 196 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:18:45,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:45,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:18:45,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:45,291 INFO L130 PetriNetUnfolder]: 389/644 cut-off events. [2022-12-06 04:18:45,291 INFO L131 PetriNetUnfolder]: For 998/998 co-relation queries the response was YES. [2022-12-06 04:18:45,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2309 conditions, 644 events. 389/644 cut-off events. For 998/998 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2451 event pairs, 62 based on Foata normal form. 1/645 useless extension candidates. Maximal degree in co-relation 2287. Up to 335 conditions per place. [2022-12-06 04:18:45,293 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 41 selfloop transitions, 6 changer transitions 35/82 dead transitions. [2022-12-06 04:18:45,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 82 transitions, 589 flow [2022-12-06 04:18:45,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:18:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:18:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-12-06 04:18:45,295 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38405797101449274 [2022-12-06 04:18:45,295 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 196 flow. Second operand 6 states and 53 transitions. [2022-12-06 04:18:45,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 82 transitions, 589 flow [2022-12-06 04:18:45,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 82 transitions, 563 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-06 04:18:45,298 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 222 flow [2022-12-06 04:18:45,298 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2022-12-06 04:18:45,298 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2022-12-06 04:18:45,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:45,298 INFO L89 Accepts]: Start accepts. Operand has 53 places, 38 transitions, 222 flow [2022-12-06 04:18:45,299 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:45,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:45,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 38 transitions, 222 flow [2022-12-06 04:18:45,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 38 transitions, 222 flow [2022-12-06 04:18:45,307 INFO L130 PetriNetUnfolder]: 41/106 cut-off events. [2022-12-06 04:18:45,307 INFO L131 PetriNetUnfolder]: For 360/403 co-relation queries the response was YES. [2022-12-06 04:18:45,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 106 events. 41/106 cut-off events. For 360/403 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 359 event pairs, 1 based on Foata normal form. 12/112 useless extension candidates. Maximal degree in co-relation 306. Up to 32 conditions per place. [2022-12-06 04:18:45,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 38 transitions, 222 flow [2022-12-06 04:18:45,308 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 04:18:45,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] $Ultimate##0-->L806: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg.offset_17| v_P2Thread1of1ForFork3_~arg.offset_17) (= v_~y~0_101 2) (= v_~z~0_105 1) (= v_P2Thread1of1ForFork3_~arg.base_17 |v_P2Thread1of1ForFork3_#in~arg.base_17|)) InVars {P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} OutVars{P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_17, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_17, ~z~0=v_~z~0_105, ~y~0=v_~y~0_101, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork3_~arg.offset, ~z~0, ~y~0] and [553] $Ultimate##0-->L845: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_216 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_216 256) 0))) (let ((.cse7 (not .cse6)) (.cse5 (and .cse6 .cse4)) (.cse8 (and .cse6 (= 0 (mod v_~b$w_buff1_used~0_523 256)))) (.cse12 (= (mod v_~b$w_buff0_used~0_598 256) 0))) (let ((.cse10 (or .cse5 .cse8 .cse12)) (.cse11 (and (not .cse12) .cse7))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_522 256) 0)) (.cse3 (= (mod v_~b$w_buff0_used~0_597 256) 0)) (.cse9 (ite .cse10 v_~b~0_444 (ite .cse11 v_~b$w_buff0~0_328 v_~b$w_buff1~0_279))) (.cse0 (not (= (mod v_~weak$$choice2~0_64 256) 0)))) (and (= v_~b$r_buff1_thd4~0_215 (ite .cse0 v_~b$r_buff1_thd4~0_216 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_215 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~b$r_buff1_thd4~0_216 0))) (= v_~weak$$choice2~0_64 |v_P3Thread1of1ForFork1_#t~nondet4_38|) (= v_~b$flush_delayed~0_61 0) (= v_~b$w_buff1~0_279 v_~b$w_buff1~0_278) (= v_~a~0_42 v_~__unbuffered_p3_EAX~0_78) (= v_~z~0_107 2) (= v_P3Thread1of1ForFork1_~arg.base_29 |v_P3Thread1of1ForFork1_#in~arg.base_29|) (= v_~weak$$choice0~0_41 |v_P3Thread1of1ForFork1_#t~nondet3_38|) (= v_~b$r_buff0_thd4~0_215 (ite .cse0 v_~b$r_buff0_thd4~0_216 (ite (or .cse5 (and .cse6 .cse1) .cse3) v_~b$r_buff0_thd4~0_216 (ite (and .cse7 (not .cse3)) 0 v_~b$r_buff0_thd4~0_216)))) (= (ite .cse0 v_~b$w_buff1_used~0_523 (ite (or .cse5 .cse8 .cse3) v_~b$w_buff1_used~0_523 0)) v_~b$w_buff1_used~0_522) (= v_~b$w_buff0~0_328 v_~b$w_buff0~0_327) (= v_~b$mem_tmp~0_56 v_~b~0_444) (= v_~a~0_42 1) (= v_~b~0_443 (ite .cse0 v_~b$mem_tmp~0_56 .cse9)) (= .cse9 v_~__unbuffered_p3_EBX~0_90) (= (ite .cse0 v_~b$w_buff0_used~0_598 (ite .cse10 v_~b$w_buff0_used~0_598 (ite .cse11 0 v_~b$w_buff0_used~0_598))) v_~b$w_buff0_used~0_597) (= v_P3Thread1of1ForFork1_~arg.offset_29 |v_P3Thread1of1ForFork1_#in~arg.offset_29|)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_598, ~b~0=v_~b~0_444, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_523, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_29|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_216, ~b$w_buff1~0=v_~b$w_buff1~0_279, ~b$w_buff0~0=v_~b$w_buff0~0_328, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_216, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_29|, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_38|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_38|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_56, ~b$flush_delayed~0=v_~b$flush_delayed~0_61, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_90, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_29|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_29, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_597, ~weak$$choice0~0=v_~weak$$choice0~0_41, ~a~0=v_~a~0_42, ~b~0=v_~b~0_443, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_522, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_29|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_78, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_215, ~b$w_buff1~0=v_~b$w_buff1~0_278, ~b$w_buff0~0=v_~b$w_buff0~0_327, ~z~0=v_~z~0_107, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_29, ~weak$$choice2~0=v_~weak$$choice2~0_64, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_215} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, P3Thread1of1ForFork1_~arg.base, ~b$w_buff0_used~0, ~weak$$choice0~0, ~a~0, ~b~0, ~b$w_buff1_used~0, ~__unbuffered_p3_EAX~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~z~0, P3Thread1of1ForFork1_~arg.offset, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4] [2022-12-06 04:18:45,572 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] $Ultimate##0-->L806: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg.offset_17| v_P2Thread1of1ForFork3_~arg.offset_17) (= v_~y~0_101 2) (= v_~z~0_105 1) (= v_P2Thread1of1ForFork3_~arg.base_17 |v_P2Thread1of1ForFork3_#in~arg.base_17|)) InVars {P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} OutVars{P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_17, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_17, ~z~0=v_~z~0_105, ~y~0=v_~y~0_101, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork3_~arg.offset, ~z~0, ~y~0] and [554] $Ultimate##0-->L845: Formula: (let ((.cse9 (= (mod v_~b$r_buff1_thd4~0_220 256) 0)) (.cse5 (= (mod v_~b$r_buff0_thd4~0_220 256) 0))) (let ((.cse7 (not .cse5)) (.cse3 (and .cse9 .cse5)) (.cse12 (= (mod v_~b$w_buff0_used~0_602 256) 0)) (.cse4 (and .cse5 (= (mod v_~b$w_buff1_used~0_527 256) 0)))) (let ((.cse10 (or .cse3 .cse12 .cse4)) (.cse11 (and (not .cse12) .cse7))) (let ((.cse2 (= (mod v_~b$w_buff0_used~0_601 256) 0)) (.cse6 (= (mod v_~b$w_buff1_used~0_526 256) 0)) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_66 256)))) (.cse1 (ite .cse10 v_~b~0_448 (ite .cse11 v_~b$w_buff0~0_332 v_~b$w_buff1~0_283)))) (and (= v_~a~0_44 v_~__unbuffered_p3_EAX~0_80) (= (ite .cse0 v_~b$mem_tmp~0_58 .cse1) v_~b~0_447) (= v_P3Thread1of1ForFork1_~arg.base_31 |v_P3Thread1of1ForFork1_#in~arg.base_31|) (= v_~weak$$choice2~0_66 |v_P3Thread1of1ForFork1_#t~nondet4_42|) (= (ite .cse0 v_~b$w_buff1_used~0_527 (ite (or .cse2 .cse3 .cse4) v_~b$w_buff1_used~0_527 0)) v_~b$w_buff1_used~0_526) (= v_~b$flush_delayed~0_63 0) (= v_P3Thread1of1ForFork1_~arg.offset_31 |v_P3Thread1of1ForFork1_#in~arg.offset_31|) (= (ite .cse0 v_~b$r_buff0_thd4~0_220 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~b$r_buff0_thd4~0_220 (ite (and (not .cse2) .cse7) 0 v_~b$r_buff0_thd4~0_220))) v_~b$r_buff0_thd4~0_219) (= v_~b$mem_tmp~0_58 v_~b~0_448) (= v_~a~0_44 1) (= v_~b$w_buff1~0_283 v_~b$w_buff1~0_282) (= v_~b$r_buff1_thd4~0_219 (ite .cse0 v_~b$r_buff1_thd4~0_220 (ite (let ((.cse8 (= (mod v_~b$r_buff0_thd4~0_219 256) 0))) (or .cse2 (and .cse8 .cse6) (and .cse9 .cse8))) v_~b$r_buff1_thd4~0_220 0))) (= (ite .cse0 v_~b$w_buff0_used~0_602 (ite .cse10 v_~b$w_buff0_used~0_602 (ite .cse11 0 v_~b$w_buff0_used~0_602))) v_~b$w_buff0_used~0_601) (= v_~z~0_109 2) (= .cse1 v_~__unbuffered_p3_EBX~0_92) (= v_~b$w_buff0~0_332 v_~b$w_buff0~0_331) (= v_~weak$$choice0~0_43 |v_P3Thread1of1ForFork1_#t~nondet3_42|)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_602, ~b~0=v_~b~0_448, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_527, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_31|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_220, ~b$w_buff1~0=v_~b$w_buff1~0_283, ~b$w_buff0~0=v_~b$w_buff0~0_332, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_220, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_31|, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_42|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_42|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_58, ~b$flush_delayed~0=v_~b$flush_delayed~0_63, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_92, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_31|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_31, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_601, ~weak$$choice0~0=v_~weak$$choice0~0_43, ~a~0=v_~a~0_44, ~b~0=v_~b~0_447, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_526, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_219, ~b$w_buff1~0=v_~b$w_buff1~0_282, ~b$w_buff0~0=v_~b$w_buff0~0_331, ~z~0=v_~z~0_109, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_31, ~weak$$choice2~0=v_~weak$$choice2~0_66, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_219} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, P3Thread1of1ForFork1_~arg.base, ~b$w_buff0_used~0, ~weak$$choice0~0, ~a~0, ~b~0, ~b$w_buff1_used~0, ~__unbuffered_p3_EAX~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~z~0, P3Thread1of1ForFork1_~arg.offset, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4] [2022-12-06 04:18:45,765 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:18:45,766 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 468 [2022-12-06 04:18:45,766 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 226 flow [2022-12-06 04:18:45,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:18:45,767 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:45,767 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:18:45,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:18:45,779 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:45,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:45,779 INFO L85 PathProgramCache]: Analyzing trace with hash 528874221, now seen corresponding path program 2 times [2022-12-06 04:18:45,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:45,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332739615] [2022-12-06 04:18:45,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:45,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:46,370 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:18:46,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:46,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332739615] [2022-12-06 04:18:46,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332739615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:46,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:46,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:18:46,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827317489] [2022-12-06 04:18:46,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:46,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:18:46,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:46,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:18:46,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:18:46,372 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:18:46,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 226 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:18:46,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:46,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:18:46,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:46,584 INFO L130 PetriNetUnfolder]: 265/452 cut-off events. [2022-12-06 04:18:46,584 INFO L131 PetriNetUnfolder]: For 740/740 co-relation queries the response was YES. [2022-12-06 04:18:46,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1717 conditions, 452 events. 265/452 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1619 event pairs, 66 based on Foata normal form. 1/453 useless extension candidates. Maximal degree in co-relation 1696. Up to 234 conditions per place. [2022-12-06 04:18:46,587 INFO L137 encePairwiseOnDemand]: 15/25 looper letters, 41 selfloop transitions, 7 changer transitions 39/87 dead transitions. [2022-12-06 04:18:46,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 664 flow [2022-12-06 04:18:46,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:18:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:18:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-12-06 04:18:46,588 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-06 04:18:46,588 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 226 flow. Second operand 7 states and 50 transitions. [2022-12-06 04:18:46,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 664 flow [2022-12-06 04:18:46,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 87 transitions, 651 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-06 04:18:46,592 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 241 flow [2022-12-06 04:18:46,592 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=241, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2022-12-06 04:18:46,593 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2022-12-06 04:18:46,593 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:46,593 INFO L89 Accepts]: Start accepts. Operand has 56 places, 38 transitions, 241 flow [2022-12-06 04:18:46,594 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:46,594 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:46,594 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 38 transitions, 241 flow [2022-12-06 04:18:46,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 38 transitions, 241 flow [2022-12-06 04:18:46,605 INFO L130 PetriNetUnfolder]: 34/91 cut-off events. [2022-12-06 04:18:46,605 INFO L131 PetriNetUnfolder]: For 176/188 co-relation queries the response was YES. [2022-12-06 04:18:46,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 91 events. 34/91 cut-off events. For 176/188 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 297 event pairs, 2 based on Foata normal form. 5/92 useless extension candidates. Maximal degree in co-relation 277. Up to 28 conditions per place. [2022-12-06 04:18:46,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 38 transitions, 241 flow [2022-12-06 04:18:46,606 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 04:18:46,607 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:46,608 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 04:18:46,608 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 241 flow [2022-12-06 04:18:46,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:18:46,608 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:46,609 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:18:46,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:18:46,609 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:18:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1467200598, now seen corresponding path program 1 times [2022-12-06 04:18:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:46,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209705811] [2022-12-06 04:18:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:46,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:18:46,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:18:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:18:46,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:18:46,783 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:18:46,785 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:18:46,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:18:46,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:18:46,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:18:46,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:18:46,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:18:46,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:18:46,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 04:18:46,790 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:46,796 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:18:46,796 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:18:46,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:18:46 BasicIcfg [2022-12-06 04:18:46,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:18:46,974 INFO L158 Benchmark]: Toolchain (without parser) took 39958.12ms. Allocated memory was 182.5MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 145.0MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-06 04:18:46,974 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 182.5MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:18:46,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.82ms. Allocated memory is still 182.5MB. Free memory was 145.0MB in the beginning and 116.2MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 04:18:46,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.47ms. Allocated memory is still 182.5MB. Free memory was 116.2MB in the beginning and 113.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:18:46,975 INFO L158 Benchmark]: Boogie Preprocessor took 44.67ms. Allocated memory is still 182.5MB. Free memory was 113.6MB in the beginning and 111.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:18:46,975 INFO L158 Benchmark]: RCFGBuilder took 551.54ms. Allocated memory is still 182.5MB. Free memory was 111.5MB in the beginning and 73.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 04:18:46,975 INFO L158 Benchmark]: TraceAbstraction took 38814.67ms. Allocated memory was 182.5MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 73.2MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-06 04:18:46,976 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.13ms. Allocated memory is still 182.5MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 471.82ms. Allocated memory is still 182.5MB. Free memory was 145.0MB in the beginning and 116.2MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.47ms. Allocated memory is still 182.5MB. Free memory was 116.2MB in the beginning and 113.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.67ms. Allocated memory is still 182.5MB. Free memory was 113.6MB in the beginning and 111.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 551.54ms. Allocated memory is still 182.5MB. Free memory was 111.5MB in the beginning and 73.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 38814.67ms. Allocated memory was 182.5MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 73.2MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 139 PlacesBefore, 48 PlacesAfterwards, 128 TransitionsBefore, 36 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2434, independent: 2360, independent conditional: 2360, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2434, independent: 2360, independent conditional: 0, independent unconditional: 2360, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2434, independent: 2360, independent conditional: 0, independent unconditional: 2360, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2434, independent: 2360, independent conditional: 0, independent unconditional: 2360, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1966, independent: 1915, independent conditional: 0, independent unconditional: 1915, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1966, independent: 1890, independent conditional: 0, independent unconditional: 1890, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 290, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 242, dependent conditional: 0, dependent unconditional: 242, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2434, independent: 445, independent conditional: 0, independent unconditional: 445, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 1966, unknown conditional: 0, unknown unconditional: 1966] , Statistics on independence cache: Total cache size (in pairs): 2916, Positive cache size: 2865, Positive conditional cache size: 0, Positive unconditional cache size: 2865, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, 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.1s, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 180, independent: 150, independent conditional: 150, 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: 180, independent: 150, independent conditional: 20, independent unconditional: 130, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 180, independent: 150, independent conditional: 20, independent unconditional: 130, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 180, independent: 150, independent conditional: 20, independent unconditional: 130, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 166, independent: 141, independent conditional: 19, independent unconditional: 122, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 166, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 112, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 105, dependent conditional: 60, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 180, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 166, unknown conditional: 29, unknown unconditional: 137] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 141, Positive conditional cache size: 19, Positive unconditional cache size: 122, Negative cache size: 25, Negative conditional cache size: 10, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123, independent: 103, independent conditional: 103, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123, independent: 103, independent conditional: 9, independent unconditional: 94, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 123, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 123, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 82, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 123, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 28, unknown conditional: 0, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 161, Positive conditional cache size: 19, Positive unconditional cache size: 142, Negative cache size: 33, Negative conditional cache size: 10, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 578 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 120, independent: 101, independent conditional: 101, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 120, independent: 101, independent conditional: 7, independent unconditional: 94, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 120, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 120, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 161, Positive conditional cache size: 19, Positive unconditional cache size: 142, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 644 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 150, independent: 120, independent conditional: 120, 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: 150, independent: 120, independent conditional: 15, independent unconditional: 105, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 150, independent: 120, independent conditional: 0, independent unconditional: 120, 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: 150, independent: 120, independent conditional: 0, independent unconditional: 120, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 161, Positive conditional cache size: 19, Positive unconditional cache size: 142, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 53 PlacesBefore, 52 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 976 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 300, independent: 230, independent conditional: 230, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 300, independent: 230, independent conditional: 138, independent unconditional: 92, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 300, independent: 230, independent conditional: 116, independent unconditional: 114, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 300, independent: 230, independent conditional: 116, independent unconditional: 114, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 300, independent: 223, independent conditional: 109, independent unconditional: 114, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 174, Positive conditional cache size: 26, Positive unconditional cache size: 148, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 109, independent: 73, independent conditional: 73, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 109, independent: 73, independent conditional: 5, independent unconditional: 68, dependent: 36, dependent conditional: 8, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 109, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 109, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 109, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 174, Positive conditional cache size: 26, Positive unconditional cache size: 148, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 860 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 115, independent: 83, independent conditional: 83, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 115, independent: 83, independent conditional: 17, independent unconditional: 66, dependent: 32, dependent conditional: 6, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 115, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 115, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 115, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 174, Positive conditional cache size: 26, Positive unconditional cache size: 148, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 65 PlacesBefore, 64 PlacesAfterwards, 62 TransitionsBefore, 61 TransitionsAfterwards, 1224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 462, independent: 374, independent conditional: 374, independent unconditional: 0, dependent: 88, dependent conditional: 88, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 462, independent: 374, independent conditional: 222, independent unconditional: 152, dependent: 88, dependent conditional: 12, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 462, independent: 374, independent conditional: 152, independent unconditional: 222, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 462, independent: 374, independent conditional: 152, independent unconditional: 222, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 17, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 462, independent: 353, independent conditional: 135, independent unconditional: 218, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 21, unknown conditional: 17, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 203, Positive conditional cache size: 43, Positive unconditional cache size: 160, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 82, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 70 PlacesBefore, 70 PlacesAfterwards, 66 TransitionsBefore, 65 TransitionsAfterwards, 1158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 145, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 88, dependent conditional: 88, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 145, independent: 57, independent conditional: 27, independent unconditional: 30, dependent: 88, dependent conditional: 10, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 145, independent: 57, independent conditional: 16, independent unconditional: 41, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 145, independent: 57, independent conditional: 16, independent unconditional: 41, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 145, independent: 51, independent conditional: 13, independent unconditional: 38, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 12, unknown conditional: 3, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 209, Positive conditional cache size: 46, Positive unconditional cache size: 163, Negative cache size: 43, Negative conditional cache size: 10, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 1408 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 12, dependent conditional: 7, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 12, dependent conditional: 7, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 211, Positive conditional cache size: 48, Positive unconditional cache size: 163, Negative cache size: 45, Negative conditional cache size: 12, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 77 PlacesBefore, 76 PlacesAfterwards, 54 TransitionsBefore, 53 TransitionsAfterwards, 658 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57, independent: 39, independent conditional: 30, independent unconditional: 9, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 39, independent conditional: 28, independent unconditional: 11, dependent: 18, dependent conditional: 14, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 39, independent conditional: 28, independent unconditional: 11, dependent: 18, dependent conditional: 14, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, independent: 36, independent conditional: 26, independent unconditional: 10, dependent: 18, dependent conditional: 14, dependent unconditional: 4, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 284, Positive cache size: 239, Positive conditional cache size: 54, Positive unconditional cache size: 185, Negative cache size: 45, Negative conditional cache size: 12, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 63 PlacesBefore, 57 PlacesAfterwards, 43 TransitionsBefore, 37 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 217, independent: 199, independent conditional: 199, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 217, independent: 199, independent conditional: 191, independent unconditional: 8, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 217, independent: 199, independent conditional: 152, independent unconditional: 47, dependent: 18, dependent conditional: 15, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 217, independent: 199, independent conditional: 152, independent unconditional: 47, dependent: 18, dependent conditional: 15, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 27, independent conditional: 18, independent unconditional: 9, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 32, dependent conditional: 23, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 217, independent: 172, independent conditional: 134, independent unconditional: 38, dependent: 15, dependent conditional: 13, dependent unconditional: 2, unknown: 30, unknown conditional: 20, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 392, Positive cache size: 344, Positive conditional cache size: 77, Positive unconditional cache size: 267, Negative cache size: 48, Negative conditional cache size: 14, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 51 PlacesBefore, 51 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 76, independent: 58, independent conditional: 43, independent unconditional: 15, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 58, independent conditional: 43, independent unconditional: 15, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 58, independent conditional: 43, independent unconditional: 15, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 11, independent unconditional: 2, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 32, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 24, dependent conditional: 11, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 45, independent conditional: 32, independent unconditional: 13, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 16, unknown conditional: 12, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 368, Positive conditional cache size: 88, Positive unconditional cache size: 280, Negative cache size: 51, Negative conditional cache size: 15, Negative unconditional cache size: 36, 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.5s, 51 PlacesBefore, 51 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 423, Positive cache size: 371, Positive conditional cache size: 88, Positive unconditional cache size: 283, Negative cache size: 52, Negative conditional cache size: 16, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 423, Positive cache size: 371, Positive conditional cache size: 88, Positive unconditional cache size: 283, Negative cache size: 52, Negative conditional cache size: 16, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1217; [L870] FCALL, FORK 0 pthread_create(&t1217, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1217, ((void *)0), P0, ((void *)0))=-3, t1217={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1218; [L872] FCALL, FORK 0 pthread_create(&t1218, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1218, ((void *)0), P1, ((void *)0))=-2, t1217={5:0}, t1218={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1219; [L874] FCALL, FORK 0 pthread_create(&t1219, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1219, ((void *)0), P2, ((void *)0))=-1, t1217={5:0}, t1218={6:0}, t1219={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1220; [L876] FCALL, FORK 0 pthread_create(&t1220, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1220, ((void *)0), P3, ((void *)0))=0, t1217={5:0}, t1218={6:0}, t1219={7:0}, t1220={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 [L765] 1 __unbuffered_p0_EAX = x [L782] 1 x = 1 [L785] 1 y = 1 [L788] 1 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 1 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 1 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L802] 3 y = 2 [L805] 3 z = 1 [L822] 3 z = 2 [L825] 3 a = 1 [L828] 3 __unbuffered_p3_EAX = a [L831] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 3 b$flush_delayed = weak$$choice2 [L834] 3 b$mem_tmp = b [L835] 3 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 3 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 3 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 3 __unbuffered_p3_EBX = b [L843] 3 b = b$flush_delayed ? b$mem_tmp : b [L844] 3 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=2] [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=2] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=2] [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=2] - 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: 876]: 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: 872]: 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: 870]: 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 38.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 23.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 609 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 609 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1914 IncrementalHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 22 mSDtfsCounter, 1914 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=561occurred in iteration=10, InterpolantAutomatonStates: 76, 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.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 1722 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:18:47,012 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...