/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/mix002.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:06:46,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:06:46,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:06:46,358 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:06:46,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:06:46,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:06:46,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:06:46,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:06:46,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:06:46,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:06:46,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:06:46,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:06:46,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:06:46,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:06:46,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:06:46,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:06:46,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:06:46,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:06:46,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:06:46,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:06:46,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:06:46,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:06:46,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:06:46,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:06:46,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:06:46,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:06:46,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:06:46,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:06:46,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:06:46,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:06:46,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:06:46,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:06:46,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:06:46,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:06:46,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:06:46,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:06:46,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:06:46,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:06:46,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:06:46,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:06:46,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:06:46,405 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:06:46,429 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:06:46,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:06:46,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:06:46,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:06:46,431 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:06:46,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:06:46,432 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:06:46,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:06:46,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:06:46,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:06:46,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:06:46,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:06:46,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:06:46,433 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:06:46,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:06:46,433 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:06:46,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:06:46,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:06:46,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:06:46,434 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:06:46,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:06:46,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:06:46,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:06:46,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:06:46,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:06:46,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:06:46,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:06:46,435 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:06:46,435 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:06:46,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:06:46,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:06:46,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:06:46,744 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:06:46,744 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:06:46,745 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2022-12-06 04:06:47,676 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:06:47,924 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:06:47,925 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2022-12-06 04:06:47,942 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/684bfabe9/4ab6fe5a2400430d848e4e2f1c9e7481/FLAG37ff9df85 [2022-12-06 04:06:47,958 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/684bfabe9/4ab6fe5a2400430d848e4e2f1c9e7481 [2022-12-06 04:06:47,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:06:47,962 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:06:47,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:06:47,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:06:47,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:06:47,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:06:47" (1/1) ... [2022-12-06 04:06:47,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3f33d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:47, skipping insertion in model container [2022-12-06 04:06:47,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:06:47" (1/1) ... [2022-12-06 04:06:47,975 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:06:48,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:06:48,186 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/mix002.oepc.i[945,958] [2022-12-06 04:06:48,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:06:48,402 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:06:48,412 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/mix002.oepc.i[945,958] [2022-12-06 04:06:48,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:06:48,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:06:48,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:06:48,512 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:06:48,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:48 WrapperNode [2022-12-06 04:06:48,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:06:48,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:06:48,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:06:48,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:06:48,518 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:06:48" (1/1) ... [2022-12-06 04:06:48,549 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:06:48" (1/1) ... [2022-12-06 04:06:48,577 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2022-12-06 04:06:48,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:06:48,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:06:48,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:06:48,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:06:48,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:48" (1/1) ... [2022-12-06 04:06:48,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:48" (1/1) ... [2022-12-06 04:06:48,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:48" (1/1) ... [2022-12-06 04:06:48,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:48" (1/1) ... [2022-12-06 04:06:48,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:48" (1/1) ... [2022-12-06 04:06:48,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:48" (1/1) ... [2022-12-06 04:06:48,613 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:48" (1/1) ... [2022-12-06 04:06:48,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:48" (1/1) ... [2022-12-06 04:06:48,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:06:48,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:06:48,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:06:48,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:06:48,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:48" (1/1) ... [2022-12-06 04:06:48,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:06:48,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:06:48,673 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:06:48,696 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:06:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:06:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:06:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:06:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:06:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:06:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:06:48,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:06:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:06:48,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:06:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:06:48,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:06:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:06:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:06:48,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:06:48,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:06:48,714 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:06:48,875 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:06:48,877 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:06:49,102 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:06:49,222 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:06:49,222 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:06:49,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:06:49 BoogieIcfgContainer [2022-12-06 04:06:49,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:06:49,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:06:49,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:06:49,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:06:49,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:06:47" (1/3) ... [2022-12-06 04:06:49,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f04be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:06:49, skipping insertion in model container [2022-12-06 04:06:49,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:06:48" (2/3) ... [2022-12-06 04:06:49,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f04be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:06:49, skipping insertion in model container [2022-12-06 04:06:49,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:06:49" (3/3) ... [2022-12-06 04:06:49,229 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2022-12-06 04:06:49,244 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:06:49,245 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:06:49,245 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:06:49,282 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:06:49,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-12-06 04:06:49,359 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-12-06 04:06:49,359 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:49,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-06 04:06:49,365 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-12-06 04:06:49,371 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-12-06 04:06:49,372 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:49,391 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 114 transitions, 237 flow [2022-12-06 04:06:49,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 237 flow [2022-12-06 04:06:49,410 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-12-06 04:06:49,411 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:49,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-06 04:06:49,414 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 114 transitions, 237 flow [2022-12-06 04:06:49,414 INFO L188 LiptonReduction]: Number of co-enabled transitions 2348 [2022-12-06 04:06:53,619 INFO L203 LiptonReduction]: Total number of compositions: 88 [2022-12-06 04:06:53,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:06:53,634 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;@bdf9e5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:06:53,634 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:06:53,648 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-06 04:06:53,649 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:53,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:53,649 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:06:53,650 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:53,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:53,653 INFO L85 PathProgramCache]: Analyzing trace with hash 498149, now seen corresponding path program 1 times [2022-12-06 04:06:53,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:53,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059052118] [2022-12-06 04:06:53,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:53,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:53,978 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:06:53,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:53,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059052118] [2022-12-06 04:06:53,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059052118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:53,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:53,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:06:53,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735608694] [2022-12-06 04:06:53,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:53,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:06:53,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:54,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:06:54,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:06:54,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-06 04:06:54,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 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:06:54,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:54,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-06 04:06:54,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:54,328 INFO L130 PetriNetUnfolder]: 1416/2143 cut-off events. [2022-12-06 04:06:54,328 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 04:06:54,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4292 conditions, 2143 events. 1416/2143 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10516 event pairs, 626 based on Foata normal form. 0/1907 useless extension candidates. Maximal degree in co-relation 4281. Up to 1781 conditions per place. [2022-12-06 04:06:54,338 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 32 selfloop transitions, 2 changer transitions 8/46 dead transitions. [2022-12-06 04:06:54,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 191 flow [2022-12-06 04:06:54,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:06:54,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:06:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-06 04:06:54,347 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6344086021505376 [2022-12-06 04:06:54,348 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 59 transitions. [2022-12-06 04:06:54,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 191 flow [2022-12-06 04:06:54,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:06:54,351 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 58 flow [2022-12-06 04:06:54,353 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2022-12-06 04:06:54,355 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2022-12-06 04:06:54,355 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:54,356 INFO L89 Accepts]: Start accepts. Operand has 37 places, 24 transitions, 58 flow [2022-12-06 04:06:54,357 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:54,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:54,358 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 24 transitions, 58 flow [2022-12-06 04:06:54,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 58 flow [2022-12-06 04:06:54,363 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-06 04:06:54,363 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:54,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:06:54,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 58 flow [2022-12-06 04:06:54,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 04:06:54,575 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:54,576 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-06 04:06:54,576 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2022-12-06 04:06:54,576 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:06:54,576 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:54,577 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:54,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:06:54,577 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:54,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:54,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2078616218, now seen corresponding path program 1 times [2022-12-06 04:06:54,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:54,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104453526] [2022-12-06 04:06:54,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:54,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:54,774 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:06:54,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:54,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104453526] [2022-12-06 04:06:54,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104453526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:54,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:54,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:06:54,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149222905] [2022-12-06 04:06:54,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:54,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:06:54,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:54,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:06:54,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:06:54,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:06:54,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:06:54,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:54,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:06:54,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:55,002 INFO L130 PetriNetUnfolder]: 1691/2478 cut-off events. [2022-12-06 04:06:55,002 INFO L131 PetriNetUnfolder]: For 153/153 co-relation queries the response was YES. [2022-12-06 04:06:55,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5186 conditions, 2478 events. 1691/2478 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10403 event pairs, 891 based on Foata normal form. 4/2482 useless extension candidates. Maximal degree in co-relation 5176. Up to 2449 conditions per place. [2022-12-06 04:06:55,013 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 04:06:55,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 152 flow [2022-12-06 04:06:55,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:06:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:06:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 04:06:55,015 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2022-12-06 04:06:55,015 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 35 transitions. [2022-12-06 04:06:55,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 152 flow [2022-12-06 04:06:55,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:06:55,016 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 78 flow [2022-12-06 04:06:55,016 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-06 04:06:55,017 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2022-12-06 04:06:55,017 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:55,017 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 78 flow [2022-12-06 04:06:55,017 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:55,017 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:55,018 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 78 flow [2022-12-06 04:06:55,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 78 flow [2022-12-06 04:06:55,024 INFO L130 PetriNetUnfolder]: 14/71 cut-off events. [2022-12-06 04:06:55,024 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:06:55,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 71 events. 14/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 241 event pairs, 6 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 104. Up to 29 conditions per place. [2022-12-06 04:06:55,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 78 flow [2022-12-06 04:06:55,025 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-06 04:06:55,067 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:55,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 04:06:55,068 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 78 flow [2022-12-06 04:06:55,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:06:55,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:55,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:55,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:06:55,068 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:55,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:55,069 INFO L85 PathProgramCache]: Analyzing trace with hash 12594005, now seen corresponding path program 1 times [2022-12-06 04:06:55,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:55,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372026100] [2022-12-06 04:06:55,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:55,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:55,218 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:06:55,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:55,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372026100] [2022-12-06 04:06:55,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372026100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:55,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:55,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:06:55,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103559968] [2022-12-06 04:06:55,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:55,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:06:55,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:55,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:06:55,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:06:55,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:06:55,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 78 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:55,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:55,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:06:55,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:55,440 INFO L130 PetriNetUnfolder]: 1545/2276 cut-off events. [2022-12-06 04:06:55,441 INFO L131 PetriNetUnfolder]: For 359/359 co-relation queries the response was YES. [2022-12-06 04:06:55,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5137 conditions, 2276 events. 1545/2276 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9676 event pairs, 477 based on Foata normal form. 56/2332 useless extension candidates. Maximal degree in co-relation 5126. Up to 1707 conditions per place. [2022-12-06 04:06:55,450 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 36 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2022-12-06 04:06:55,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 188 flow [2022-12-06 04:06:55,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:06:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:06:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 04:06:55,451 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2022-12-06 04:06:55,451 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 78 flow. Second operand 3 states and 37 transitions. [2022-12-06 04:06:55,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 188 flow [2022-12-06 04:06:55,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:06:55,452 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 85 flow [2022-12-06 04:06:55,452 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-06 04:06:55,453 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2022-12-06 04:06:55,453 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:55,453 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 85 flow [2022-12-06 04:06:55,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:55,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:55,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 85 flow [2022-12-06 04:06:55,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 85 flow [2022-12-06 04:06:55,459 INFO L130 PetriNetUnfolder]: 9/54 cut-off events. [2022-12-06 04:06:55,459 INFO L131 PetriNetUnfolder]: For 7/11 co-relation queries the response was YES. [2022-12-06 04:06:55,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 54 events. 9/54 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 157 event pairs, 3 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 88. Up to 21 conditions per place. [2022-12-06 04:06:55,460 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 85 flow [2022-12-06 04:06:55,460 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 04:06:55,461 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:55,461 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 04:06:55,461 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 85 flow [2022-12-06 04:06:55,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:55,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:55,462 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:55,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:06:55,462 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:55,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:55,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1847051553, now seen corresponding path program 1 times [2022-12-06 04:06:55,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:55,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237525184] [2022-12-06 04:06:55,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:55,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:55,550 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:06:55,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:55,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237525184] [2022-12-06 04:06:55,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237525184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:55,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:55,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:06:55,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795363699] [2022-12-06 04:06:55,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:55,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:06:55,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:55,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:06:55,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:06:55,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:06:55,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 85 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:55,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:55,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:06:55,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:55,751 INFO L130 PetriNetUnfolder]: 1443/2134 cut-off events. [2022-12-06 04:06:55,751 INFO L131 PetriNetUnfolder]: For 694/694 co-relation queries the response was YES. [2022-12-06 04:06:55,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5035 conditions, 2134 events. 1443/2134 cut-off events. For 694/694 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8609 event pairs, 459 based on Foata normal form. 40/2174 useless extension candidates. Maximal degree in co-relation 5022. Up to 1453 conditions per place. [2022-12-06 04:06:55,761 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 34 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-12-06 04:06:55,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 188 flow [2022-12-06 04:06:55,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:06:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:06:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 04:06:55,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2022-12-06 04:06:55,762 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 85 flow. Second operand 3 states and 35 transitions. [2022-12-06 04:06:55,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 188 flow [2022-12-06 04:06:55,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:06:55,764 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 90 flow [2022-12-06 04:06:55,764 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2022-12-06 04:06:55,764 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2022-12-06 04:06:55,764 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:55,764 INFO L89 Accepts]: Start accepts. Operand has 36 places, 26 transitions, 90 flow [2022-12-06 04:06:55,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:55,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:55,765 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 90 flow [2022-12-06 04:06:55,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 90 flow [2022-12-06 04:06:55,770 INFO L130 PetriNetUnfolder]: 6/46 cut-off events. [2022-12-06 04:06:55,770 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 04:06:55,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 46 events. 6/46 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 121 event pairs, 1 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 79. Up to 16 conditions per place. [2022-12-06 04:06:55,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 90 flow [2022-12-06 04:06:55,771 INFO L188 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-06 04:06:55,782 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:55,783 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 04:06:55,783 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 90 flow [2022-12-06 04:06:55,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:55,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:55,784 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:55,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:06:55,784 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:55,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2000096940, now seen corresponding path program 1 times [2022-12-06 04:06:55,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:55,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300921497] [2022-12-06 04:06:55,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:55,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:55,878 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:06:55,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:55,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300921497] [2022-12-06 04:06:55,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300921497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:55,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:55,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:06:55,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661796603] [2022-12-06 04:06:55,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:55,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:06:55,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:55,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:06:55,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:06:55,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:06:55,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 90 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:55,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:55,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:06:55,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:56,071 INFO L130 PetriNetUnfolder]: 1403/2078 cut-off events. [2022-12-06 04:06:56,071 INFO L131 PetriNetUnfolder]: For 817/817 co-relation queries the response was YES. [2022-12-06 04:06:56,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5020 conditions, 2078 events. 1403/2078 cut-off events. For 817/817 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8482 event pairs, 791 based on Foata normal form. 16/2094 useless extension candidates. Maximal degree in co-relation 5006. Up to 1801 conditions per place. [2022-12-06 04:06:56,080 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 39 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2022-12-06 04:06:56,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 218 flow [2022-12-06 04:06:56,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:06:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:06:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 04:06:56,081 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5797101449275363 [2022-12-06 04:06:56,081 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 90 flow. Second operand 3 states and 40 transitions. [2022-12-06 04:06:56,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 218 flow [2022-12-06 04:06:56,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:06:56,082 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 95 flow [2022-12-06 04:06:56,082 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2022-12-06 04:06:56,083 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2022-12-06 04:06:56,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:56,083 INFO L89 Accepts]: Start accepts. Operand has 37 places, 26 transitions, 95 flow [2022-12-06 04:06:56,084 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:56,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:56,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 26 transitions, 95 flow [2022-12-06 04:06:56,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 95 flow [2022-12-06 04:06:56,088 INFO L130 PetriNetUnfolder]: 5/44 cut-off events. [2022-12-06 04:06:56,088 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 04:06:56,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 44 events. 5/44 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 111 event pairs, 1 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 78. Up to 14 conditions per place. [2022-12-06 04:06:56,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 95 flow [2022-12-06 04:06:56,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-06 04:06:56,090 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:06:56,090 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 04:06:56,090 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 95 flow [2022-12-06 04:06:56,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:56,090 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:56,091 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:56,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:06:56,091 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:56,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:56,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1569757137, now seen corresponding path program 1 times [2022-12-06 04:06:56,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:56,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524032789] [2022-12-06 04:06:56,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:56,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:56,199 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:06:56,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:56,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524032789] [2022-12-06 04:06:56,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524032789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:56,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:56,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:06:56,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982959133] [2022-12-06 04:06:56,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:56,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:06:56,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:56,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:06:56,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:06:56,201 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2022-12-06 04:06:56,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:56,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:56,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2022-12-06 04:06:56,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:56,348 INFO L130 PetriNetUnfolder]: 623/1052 cut-off events. [2022-12-06 04:06:56,348 INFO L131 PetriNetUnfolder]: For 451/463 co-relation queries the response was YES. [2022-12-06 04:06:56,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2567 conditions, 1052 events. 623/1052 cut-off events. For 451/463 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5356 event pairs, 157 based on Foata normal form. 104/1129 useless extension candidates. Maximal degree in co-relation 2552. Up to 369 conditions per place. [2022-12-06 04:06:56,352 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 40 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2022-12-06 04:06:56,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 249 flow [2022-12-06 04:06:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:06:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:06:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 04:06:56,353 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6739130434782609 [2022-12-06 04:06:56,353 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 95 flow. Second operand 4 states and 62 transitions. [2022-12-06 04:06:56,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 249 flow [2022-12-06 04:06:56,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:06:56,355 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 127 flow [2022-12-06 04:06:56,355 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-06 04:06:56,355 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2022-12-06 04:06:56,355 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:56,356 INFO L89 Accepts]: Start accepts. Operand has 40 places, 30 transitions, 127 flow [2022-12-06 04:06:56,356 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:56,356 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:56,356 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 127 flow [2022-12-06 04:06:56,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 127 flow [2022-12-06 04:06:56,364 INFO L130 PetriNetUnfolder]: 32/114 cut-off events. [2022-12-06 04:06:56,365 INFO L131 PetriNetUnfolder]: For 59/72 co-relation queries the response was YES. [2022-12-06 04:06:56,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 114 events. 32/114 cut-off events. For 59/72 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 536 event pairs, 10 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 272. Up to 67 conditions per place. [2022-12-06 04:06:56,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 127 flow [2022-12-06 04:06:56,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-06 04:06:56,476 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:56,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-06 04:06:56,476 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 129 flow [2022-12-06 04:06:56,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:56,477 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:56,477 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:06:56,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:06:56,477 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:56,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:56,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1208877179, now seen corresponding path program 1 times [2022-12-06 04:06:56,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:56,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052880783] [2022-12-06 04:06:56,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:56,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:56,619 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:06:56,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:56,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052880783] [2022-12-06 04:06:56,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052880783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:56,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:56,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:56,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840836745] [2022-12-06 04:06:56,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:56,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:06:56,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:56,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:06:56,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:06:56,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2022-12-06 04:06:56,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:06:56,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:56,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2022-12-06 04:06:56,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:56,755 INFO L130 PetriNetUnfolder]: 311/574 cut-off events. [2022-12-06 04:06:56,755 INFO L131 PetriNetUnfolder]: For 286/287 co-relation queries the response was YES. [2022-12-06 04:06:56,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1674 conditions, 574 events. 311/574 cut-off events. For 286/287 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2609 event pairs, 67 based on Foata normal form. 56/613 useless extension candidates. Maximal degree in co-relation 1657. Up to 240 conditions per place. [2022-12-06 04:06:56,758 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 49 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2022-12-06 04:06:56,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 335 flow [2022-12-06 04:06:56,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:06:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:06:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-12-06 04:06:56,759 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-06 04:06:56,759 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 129 flow. Second operand 5 states and 78 transitions. [2022-12-06 04:06:56,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 335 flow [2022-12-06 04:06:56,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 325 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:06:56,761 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 168 flow [2022-12-06 04:06:56,761 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-12-06 04:06:56,762 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2022-12-06 04:06:56,762 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:56,762 INFO L89 Accepts]: Start accepts. Operand has 44 places, 33 transitions, 168 flow [2022-12-06 04:06:56,762 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:56,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:56,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 168 flow [2022-12-06 04:06:56,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 168 flow [2022-12-06 04:06:56,770 INFO L130 PetriNetUnfolder]: 22/91 cut-off events. [2022-12-06 04:06:56,770 INFO L131 PetriNetUnfolder]: For 109/119 co-relation queries the response was YES. [2022-12-06 04:06:56,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 91 events. 22/91 cut-off events. For 109/119 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 349 event pairs, 2 based on Foata normal form. 4/90 useless extension candidates. Maximal degree in co-relation 263. Up to 43 conditions per place. [2022-12-06 04:06:56,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 168 flow [2022-12-06 04:06:56,771 INFO L188 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-06 04:06:56,956 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:56,956 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 04:06:56,956 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 172 flow [2022-12-06 04:06:56,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:06:56,957 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:56,957 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:06:56,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:06:56,957 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:56,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:56,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1267896980, now seen corresponding path program 1 times [2022-12-06 04:06:56,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:56,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440225254] [2022-12-06 04:06:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:56,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:57,094 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:06:57,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:57,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440225254] [2022-12-06 04:06:57,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440225254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:57,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:57,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:06:57,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343120184] [2022-12-06 04:06:57,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:57,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:06:57,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:57,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:06:57,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:06:57,096 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:06:57,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 172 flow. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:57,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:57,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:06:57,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:57,242 INFO L130 PetriNetUnfolder]: 590/1028 cut-off events. [2022-12-06 04:06:57,243 INFO L131 PetriNetUnfolder]: For 1126/1126 co-relation queries the response was YES. [2022-12-06 04:06:57,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3307 conditions, 1028 events. 590/1028 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4670 event pairs, 35 based on Foata normal form. 9/1037 useless extension candidates. Maximal degree in co-relation 3288. Up to 646 conditions per place. [2022-12-06 04:06:57,247 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 61 selfloop transitions, 13 changer transitions 2/76 dead transitions. [2022-12-06 04:06:57,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 76 transitions, 521 flow [2022-12-06 04:06:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:06:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:06:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-06 04:06:57,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2022-12-06 04:06:57,248 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 172 flow. Second operand 5 states and 61 transitions. [2022-12-06 04:06:57,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 76 transitions, 521 flow [2022-12-06 04:06:57,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 76 transitions, 464 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 04:06:57,252 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 225 flow [2022-12-06 04:06:57,253 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2022-12-06 04:06:57,253 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2022-12-06 04:06:57,253 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:57,253 INFO L89 Accepts]: Start accepts. Operand has 46 places, 40 transitions, 225 flow [2022-12-06 04:06:57,254 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:57,254 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:57,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 40 transitions, 225 flow [2022-12-06 04:06:57,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 225 flow [2022-12-06 04:06:57,288 INFO L130 PetriNetUnfolder]: 61/221 cut-off events. [2022-12-06 04:06:57,288 INFO L131 PetriNetUnfolder]: For 153/182 co-relation queries the response was YES. [2022-12-06 04:06:57,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 221 events. 61/221 cut-off events. For 153/182 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1102 event pairs, 14 based on Foata normal form. 10/223 useless extension candidates. Maximal degree in co-relation 596. Up to 62 conditions per place. [2022-12-06 04:06:57,289 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 40 transitions, 225 flow [2022-12-06 04:06:57,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-06 04:06:57,411 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:06:57,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 04:06:57,412 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 225 flow [2022-12-06 04:06:57,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:57,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:57,412 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:06:57,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:06:57,412 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:57,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:57,413 INFO L85 PathProgramCache]: Analyzing trace with hash -526167127, now seen corresponding path program 1 times [2022-12-06 04:06:57,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:57,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865079556] [2022-12-06 04:06:57,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:57,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:57,517 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:06:57,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:57,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865079556] [2022-12-06 04:06:57,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865079556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:57,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:57,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:06:57,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027900960] [2022-12-06 04:06:57,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:57,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:06:57,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:57,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:06:57,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:06:57,519 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 04:06:57,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:57,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:57,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 04:06:57,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:57,669 INFO L130 PetriNetUnfolder]: 660/1206 cut-off events. [2022-12-06 04:06:57,669 INFO L131 PetriNetUnfolder]: For 1293/1321 co-relation queries the response was YES. [2022-12-06 04:06:57,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3984 conditions, 1206 events. 660/1206 cut-off events. For 1293/1321 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6220 event pairs, 154 based on Foata normal form. 20/1202 useless extension candidates. Maximal degree in co-relation 3964. Up to 545 conditions per place. [2022-12-06 04:06:57,674 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 49 selfloop transitions, 2 changer transitions 18/74 dead transitions. [2022-12-06 04:06:57,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 74 transitions, 536 flow [2022-12-06 04:06:57,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:06:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:06:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 04:06:57,675 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 04:06:57,675 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 225 flow. Second operand 4 states and 52 transitions. [2022-12-06 04:06:57,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 74 transitions, 536 flow [2022-12-06 04:06:57,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 532 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 04:06:57,678 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 240 flow [2022-12-06 04:06:57,678 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2022-12-06 04:06:57,678 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2022-12-06 04:06:57,678 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:57,678 INFO L89 Accepts]: Start accepts. Operand has 51 places, 41 transitions, 240 flow [2022-12-06 04:06:57,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:57,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:57,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 41 transitions, 240 flow [2022-12-06 04:06:57,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 240 flow [2022-12-06 04:06:57,701 INFO L130 PetriNetUnfolder]: 82/307 cut-off events. [2022-12-06 04:06:57,701 INFO L131 PetriNetUnfolder]: For 282/345 co-relation queries the response was YES. [2022-12-06 04:06:57,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 307 events. 82/307 cut-off events. For 282/345 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1820 event pairs, 14 based on Foata normal form. 15/310 useless extension candidates. Maximal degree in co-relation 848. Up to 104 conditions per place. [2022-12-06 04:06:57,703 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 41 transitions, 240 flow [2022-12-06 04:06:57,703 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-06 04:06:57,738 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [481] $Ultimate##0-->L815: Formula: (and (= v_~z~0_51 1) (= v_~z~0_51 v_~__unbuffered_p2_EAX~0_92) (= |v_P2Thread1of1ForFork0_#in~arg.base_15| v_P2Thread1of1ForFork0_~arg.base_15) (= |v_P2Thread1of1ForFork0_#in~arg.offset_15| v_P2Thread1of1ForFork0_~arg.offset_15)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_15, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~z~0=v_~z~0_51, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~z~0] and [354] L792-->L795: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0] [2022-12-06 04:06:57,764 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:06:57,764 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 04:06:57,764 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 252 flow [2022-12-06 04:06:57,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:57,765 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:57,765 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:06:57,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:06:57,765 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:57,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:57,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1454980957, now seen corresponding path program 1 times [2022-12-06 04:06:57,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:57,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563736070] [2022-12-06 04:06:57,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:57,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:06:57,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:57,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563736070] [2022-12-06 04:06:57,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563736070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:57,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:57,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:06:57,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465803327] [2022-12-06 04:06:57,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:57,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:06:57,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:57,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:06:57,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:06:57,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:06:57,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 252 flow. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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:06:57,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:57,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:06:57,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:58,144 INFO L130 PetriNetUnfolder]: 976/1768 cut-off events. [2022-12-06 04:06:58,144 INFO L131 PetriNetUnfolder]: For 2277/2277 co-relation queries the response was YES. [2022-12-06 04:06:58,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6092 conditions, 1768 events. 976/1768 cut-off events. For 2277/2277 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 9555 event pairs, 341 based on Foata normal form. 9/1777 useless extension candidates. Maximal degree in co-relation 6069. Up to 931 conditions per place. [2022-12-06 04:06:58,151 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 50 selfloop transitions, 6 changer transitions 27/83 dead transitions. [2022-12-06 04:06:58,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 83 transitions, 596 flow [2022-12-06 04:06:58,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:06:58,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:06:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-06 04:06:58,152 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2022-12-06 04:06:58,152 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 252 flow. Second operand 6 states and 64 transitions. [2022-12-06 04:06:58,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 83 transitions, 596 flow [2022-12-06 04:06:58,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 590 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:06:58,157 INFO L231 Difference]: Finished difference. Result has 56 places, 34 transitions, 199 flow [2022-12-06 04:06:58,157 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=56, PETRI_TRANSITIONS=34} [2022-12-06 04:06:58,157 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2022-12-06 04:06:58,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:58,157 INFO L89 Accepts]: Start accepts. Operand has 56 places, 34 transitions, 199 flow [2022-12-06 04:06:58,158 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:58,158 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:58,158 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 34 transitions, 199 flow [2022-12-06 04:06:58,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 34 transitions, 199 flow [2022-12-06 04:06:58,178 INFO L130 PetriNetUnfolder]: 58/269 cut-off events. [2022-12-06 04:06:58,178 INFO L131 PetriNetUnfolder]: For 353/388 co-relation queries the response was YES. [2022-12-06 04:06:58,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 269 events. 58/269 cut-off events. For 353/388 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1660 event pairs, 16 based on Foata normal form. 12/273 useless extension candidates. Maximal degree in co-relation 744. Up to 101 conditions per place. [2022-12-06 04:06:58,180 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 34 transitions, 199 flow [2022-12-06 04:06:58,180 INFO L188 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-06 04:06:58,216 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:06:58,217 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 04:06:58,217 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 191 flow [2022-12-06 04:06:58,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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:06:58,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:58,217 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:06:58,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:06:58,217 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:58,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:58,217 INFO L85 PathProgramCache]: Analyzing trace with hash -267109463, now seen corresponding path program 1 times [2022-12-06 04:06:58,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:58,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713617341] [2022-12-06 04:06:58,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:58,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:06:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:06:58,441 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:06:58,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:06:58,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713617341] [2022-12-06 04:06:58,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713617341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:06:58,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:06:58,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:06:58,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136365756] [2022-12-06 04:06:58,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:06:58,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:06:58,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:06:58,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:06:58,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:06:58,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-06 04:06:58,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 32 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:58,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:06:58,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-06 04:06:58,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:06:58,599 INFO L130 PetriNetUnfolder]: 402/820 cut-off events. [2022-12-06 04:06:58,600 INFO L131 PetriNetUnfolder]: For 1132/1135 co-relation queries the response was YES. [2022-12-06 04:06:58,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2699 conditions, 820 events. 402/820 cut-off events. For 1132/1135 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4494 event pairs, 115 based on Foata normal form. 42/845 useless extension candidates. Maximal degree in co-relation 2674. Up to 301 conditions per place. [2022-12-06 04:06:58,607 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 31 selfloop transitions, 11 changer transitions 8/53 dead transitions. [2022-12-06 04:06:58,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 370 flow [2022-12-06 04:06:58,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:06:58,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:06:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-12-06 04:06:58,609 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4855072463768116 [2022-12-06 04:06:58,609 INFO L175 Difference]: Start difference. First operand has 54 places, 32 transitions, 191 flow. Second operand 6 states and 67 transitions. [2022-12-06 04:06:58,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 370 flow [2022-12-06 04:06:58,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 329 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-06 04:06:58,612 INFO L231 Difference]: Finished difference. Result has 53 places, 28 transitions, 169 flow [2022-12-06 04:06:58,612 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=53, PETRI_TRANSITIONS=28} [2022-12-06 04:06:58,613 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2022-12-06 04:06:58,613 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:06:58,614 INFO L89 Accepts]: Start accepts. Operand has 53 places, 28 transitions, 169 flow [2022-12-06 04:06:58,616 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:06:58,616 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:06:58,616 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 28 transitions, 169 flow [2022-12-06 04:06:58,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 28 transitions, 169 flow [2022-12-06 04:06:58,622 INFO L130 PetriNetUnfolder]: 12/63 cut-off events. [2022-12-06 04:06:58,622 INFO L131 PetriNetUnfolder]: For 97/109 co-relation queries the response was YES. [2022-12-06 04:06:58,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 63 events. 12/63 cut-off events. For 97/109 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 193 event pairs, 4 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 192. Up to 20 conditions per place. [2022-12-06 04:06:58,623 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 28 transitions, 169 flow [2022-12-06 04:06:58,623 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 04:06:58,761 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [418] L779-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_29 (+ v_~__unbuffered_cnt~0_30 1)) (= |v_P0Thread1of1ForFork1_#res#1.base_9| 0) (= |v_P0Thread1of1ForFork1_#res#1.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_9|, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, P0Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0] and [465] L860-3-->L863: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_77) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-06 04:06:58,985 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [419] L838-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [489] L860-3-->L871: Formula: (let ((.cse4 (not (= (mod v_~a$r_buff1_thd0~0_194 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_497 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_193 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_498 256) 0)))) (.cse2 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~a$w_buff1_used~0_447 256) 0)) .cse4))) (and (= v_~a~0_374 (ite .cse0 v_~a$w_buff0~0_283 (ite .cse1 v_~a$w_buff1~0_234 v_~a~0_375))) (= v_~a$w_buff0_used~0_497 (ite .cse0 0 v_~a$w_buff0_used~0_498)) (= v_~main$tmp_guard0~0_124 (ite (= (ite (= v_~__unbuffered_cnt~0_161 3) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| 0)) (= (ite .cse2 0 v_~a$r_buff0_thd0~0_193) v_~a$r_buff0_thd0~0_192) (= (mod v_~main$tmp_guard0~0_124 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= v_~a$r_buff1_thd0~0_193 (ite (or (and (not (= (mod v_~a$r_buff0_thd0~0_192 256) 0)) .cse3) (and .cse4 (not (= (mod v_~a$w_buff1_used~0_446 256) 0)))) 0 v_~a$r_buff1_thd0~0_194)) (= (ite (or .cse2 .cse1) 0 v_~a$w_buff1_used~0_447) v_~a$w_buff1_used~0_446)))) InVars {~a~0=v_~a~0_375, ~a$w_buff1~0=v_~a$w_buff1~0_234, ~a$w_buff0~0=v_~a$w_buff0~0_283, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_194, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_498, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_193, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_447} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_61|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_71|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_497, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_192, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_124, ~a~0=v_~a~0_374, ~a$w_buff1~0=v_~a$w_buff1~0_234, ~a$w_buff0~0=v_~a$w_buff0~0_283, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_95|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_193, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_446, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:06:59,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L802-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [489] L860-3-->L871: Formula: (let ((.cse4 (not (= (mod v_~a$r_buff1_thd0~0_194 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_497 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_193 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_498 256) 0)))) (.cse2 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~a$w_buff1_used~0_447 256) 0)) .cse4))) (and (= v_~a~0_374 (ite .cse0 v_~a$w_buff0~0_283 (ite .cse1 v_~a$w_buff1~0_234 v_~a~0_375))) (= v_~a$w_buff0_used~0_497 (ite .cse0 0 v_~a$w_buff0_used~0_498)) (= v_~main$tmp_guard0~0_124 (ite (= (ite (= v_~__unbuffered_cnt~0_161 3) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| 0)) (= (ite .cse2 0 v_~a$r_buff0_thd0~0_193) v_~a$r_buff0_thd0~0_192) (= (mod v_~main$tmp_guard0~0_124 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= v_~a$r_buff1_thd0~0_193 (ite (or (and (not (= (mod v_~a$r_buff0_thd0~0_192 256) 0)) .cse3) (and .cse4 (not (= (mod v_~a$w_buff1_used~0_446 256) 0)))) 0 v_~a$r_buff1_thd0~0_194)) (= (ite (or .cse2 .cse1) 0 v_~a$w_buff1_used~0_447) v_~a$w_buff1_used~0_446)))) InVars {~a~0=v_~a~0_375, ~a$w_buff1~0=v_~a$w_buff1~0_234, ~a$w_buff0~0=v_~a$w_buff0~0_283, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_194, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_498, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_193, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_447} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_61|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_71|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_497, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_192, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_124, ~a~0=v_~a~0_374, ~a$w_buff1~0=v_~a$w_buff1~0_234, ~a$w_buff0~0=v_~a$w_buff0~0_283, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_95|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_193, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_446, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:06:59,242 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [418] L779-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_29 (+ v_~__unbuffered_cnt~0_30 1)) (= |v_P0Thread1of1ForFork1_#res#1.base_9| 0) (= |v_P0Thread1of1ForFork1_#res#1.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_9|, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, P0Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0] and [489] L860-3-->L871: Formula: (let ((.cse4 (not (= (mod v_~a$r_buff1_thd0~0_194 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_497 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_193 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_498 256) 0)))) (.cse2 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~a$w_buff1_used~0_447 256) 0)) .cse4))) (and (= v_~a~0_374 (ite .cse0 v_~a$w_buff0~0_283 (ite .cse1 v_~a$w_buff1~0_234 v_~a~0_375))) (= v_~a$w_buff0_used~0_497 (ite .cse0 0 v_~a$w_buff0_used~0_498)) (= v_~main$tmp_guard0~0_124 (ite (= (ite (= v_~__unbuffered_cnt~0_161 3) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| 0)) (= (ite .cse2 0 v_~a$r_buff0_thd0~0_193) v_~a$r_buff0_thd0~0_192) (= (mod v_~main$tmp_guard0~0_124 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= v_~a$r_buff1_thd0~0_193 (ite (or (and (not (= (mod v_~a$r_buff0_thd0~0_192 256) 0)) .cse3) (and .cse4 (not (= (mod v_~a$w_buff1_used~0_446 256) 0)))) 0 v_~a$r_buff1_thd0~0_194)) (= (ite (or .cse2 .cse1) 0 v_~a$w_buff1_used~0_447) v_~a$w_buff1_used~0_446)))) InVars {~a~0=v_~a~0_375, ~a$w_buff1~0=v_~a$w_buff1~0_234, ~a$w_buff0~0=v_~a$w_buff0~0_283, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_194, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_498, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_193, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_447} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_61|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_71|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_497, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_192, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_124, ~a~0=v_~a~0_374, ~a$w_buff1~0=v_~a$w_buff1~0_234, ~a$w_buff0~0=v_~a$w_buff0~0_283, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_95|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_193, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_446, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:06:59,983 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 04:06:59,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1371 [2022-12-06 04:06:59,984 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 21 transitions, 155 flow [2022-12-06 04:06:59,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:06:59,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:06:59,984 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:06:59,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:06:59,984 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:06:59,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:06:59,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2038159968, now seen corresponding path program 1 times [2022-12-06 04:06:59,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:06:59,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976538657] [2022-12-06 04:06:59,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:06:59,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:07:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:07:00,687 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:07:00,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:07:00,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976538657] [2022-12-06 04:07:00,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976538657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:07:00,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:07:00,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:07:00,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056417117] [2022-12-06 04:07:00,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:07:00,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:07:00,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:07:00,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:07:00,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:07:00,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:07:00,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 21 transitions, 155 flow. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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:07:00,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:07:00,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:07:00,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:07:00,871 INFO L130 PetriNetUnfolder]: 116/251 cut-off events. [2022-12-06 04:07:00,871 INFO L131 PetriNetUnfolder]: For 642/642 co-relation queries the response was YES. [2022-12-06 04:07:00,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 251 events. 116/251 cut-off events. For 642/642 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1011 event pairs, 28 based on Foata normal form. 3/254 useless extension candidates. Maximal degree in co-relation 922. Up to 116 conditions per place. [2022-12-06 04:07:00,872 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 26 selfloop transitions, 4 changer transitions 19/49 dead transitions. [2022-12-06 04:07:00,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 392 flow [2022-12-06 04:07:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:07:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:07:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-06 04:07:00,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41228070175438597 [2022-12-06 04:07:00,873 INFO L175 Difference]: Start difference. First operand has 44 places, 21 transitions, 155 flow. Second operand 6 states and 47 transitions. [2022-12-06 04:07:00,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 392 flow [2022-12-06 04:07:00,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 280 flow, removed 22 selfloop flow, removed 11 redundant places. [2022-12-06 04:07:00,875 INFO L231 Difference]: Finished difference. Result has 41 places, 23 transitions, 115 flow [2022-12-06 04:07:00,875 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=41, PETRI_TRANSITIONS=23} [2022-12-06 04:07:00,875 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2022-12-06 04:07:00,876 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:07:00,876 INFO L89 Accepts]: Start accepts. Operand has 41 places, 23 transitions, 115 flow [2022-12-06 04:07:00,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:07:00,876 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:07:00,876 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 23 transitions, 115 flow [2022-12-06 04:07:00,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 23 transitions, 115 flow [2022-12-06 04:07:00,881 INFO L130 PetriNetUnfolder]: 6/42 cut-off events. [2022-12-06 04:07:00,882 INFO L131 PetriNetUnfolder]: For 23/25 co-relation queries the response was YES. [2022-12-06 04:07:00,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 42 events. 6/42 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 109 event pairs, 1 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 93. Up to 12 conditions per place. [2022-12-06 04:07:00,882 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 23 transitions, 115 flow [2022-12-06 04:07:00,882 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 04:07:00,980 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [487] $Ultimate##0-->L772: Formula: (and (= v_~a$r_buff0_thd0~0_190 v_~a$r_buff1_thd0~0_191) (= v_~a$r_buff0_thd1~0_179 v_~a$r_buff1_thd1~0_135) (= |v_P0Thread1of1ForFork1_~arg#1.offset_39| |v_P0Thread1of1ForFork1_#in~arg#1.offset_39|) (= v_~a$w_buff0~0_276 v_~a$w_buff1~0_228) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_41| (ite (not (and (not (= (mod v_~a$w_buff0_used~0_487 256) 0)) (not (= (mod v_~a$w_buff1_used~0_438 256) 0)))) 1 0)) (= v_~a$r_buff0_thd2~0_118 v_~a$r_buff1_thd2~0_124) (= v_~x~0_45 1) (= v_~a$r_buff0_thd3~0_214 v_~a$r_buff1_thd3~0_222) (= v_~a$w_buff0~0_275 1) (= |v_P0Thread1of1ForFork1_~arg#1.base_39| |v_P0Thread1of1ForFork1_#in~arg#1.base_39|) (= v_~a$w_buff0_used~0_488 v_~a$w_buff1_used~0_438) (= v_~a$r_buff0_thd1~0_178 1) (= v_~x~0_45 v_~__unbuffered_p0_EAX~0_111) (= v_~__unbuffered_p0_EBX~0_101 v_~y~0_63) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_41| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_41|) (= v_~a$w_buff0_used~0_487 1) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_41| 0))) InVars {P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_39|, ~a$w_buff0~0=v_~a$w_buff0~0_276, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_118, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_214, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_488, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_179, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_39|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_190, ~y~0=v_~y~0_63} OutVars{~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_101, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_39|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_135, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_222, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_124, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_118, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_214, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_487, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_178, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_39|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_190, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_39|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_39|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_111, ~a$w_buff1~0=v_~a$w_buff1~0_228, ~a$w_buff0~0=v_~a$w_buff0~0_275, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_41|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_191, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_438, ~y~0=v_~y~0_63, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_41|, ~x~0=v_~x~0_45} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0] and [497] $Ultimate##0-->L802: Formula: (let ((.cse1 (not (= (mod v_~a$w_buff0_used~0_531 256) 0))) (.cse2 (not (= (mod v_~a$r_buff1_thd2~0_135 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_129 256) 0)))) (let ((.cse0 (and (not (= 0 (mod v_~a$w_buff0_used~0_532 256))) .cse5)) (.cse4 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_481 256) 0)))) (.cse3 (and .cse5 .cse1))) (and (= (ite .cse0 0 v_~a$w_buff0_used~0_532) v_~a$w_buff0_used~0_531) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_128 256) 0)) .cse1) (and (not (= (mod v_~a$w_buff1_used~0_480 256) 0)) .cse2)) 0 v_~a$r_buff1_thd2~0_135) v_~a$r_buff1_thd2~0_134) (= |v_P1Thread1of1ForFork2_#in~arg.offset_21| v_P1Thread1of1ForFork2_~arg.offset_21) (= v_~y~0_65 v_~__unbuffered_p1_EAX~0_104) (= (ite .cse3 0 v_~a$r_buff0_thd2~0_129) v_~a$r_buff0_thd2~0_128) (= v_~y~0_65 1) (= v_~z~0_61 v_~__unbuffered_p1_EBX~0_107) (= v_~a~0_408 (ite .cse0 v_~a$w_buff0~0_301 (ite .cse4 v_~a$w_buff1~0_252 v_~a~0_409))) (= v_~a$w_buff1_used~0_480 (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_481)) (= |v_P1Thread1of1ForFork2_#in~arg.base_21| v_P1Thread1of1ForFork2_~arg.base_21)))) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_21|, ~a~0=v_~a~0_409, ~a$w_buff1~0=v_~a$w_buff1~0_252, ~a$w_buff0~0=v_~a$w_buff0~0_301, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_135, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_129, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_532, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_21|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_481, ~z~0=v_~z~0_61} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_107, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_134, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_128, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_531, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_21|, ~a~0=v_~a~0_408, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_21, ~a$w_buff1~0=v_~a$w_buff1~0_252, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~a$w_buff0~0=v_~a$w_buff0~0_301, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_21|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_480, ~z~0=v_~z~0_61, ~y~0=v_~y~0_65} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0, ~y~0] [2022-12-06 04:07:01,658 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:07:01,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 783 [2022-12-06 04:07:01,659 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 124 flow [2022-12-06 04:07:01,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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:07:01,659 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:07:01,659 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:07:01,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:07:01,660 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:07:01,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:07:01,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1868139637, now seen corresponding path program 1 times [2022-12-06 04:07:01,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:07:01,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142162326] [2022-12-06 04:07:01,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:07:01,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:07:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:07:02,040 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:07:02,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:07:02,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142162326] [2022-12-06 04:07:02,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142162326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:07:02,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:07:02,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:07:02,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806356903] [2022-12-06 04:07:02,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:07:02,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:07:02,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:07:02,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:07:02,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:07:02,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:07:02,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 22 transitions, 124 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:02,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:07:02,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:07:02,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:07:02,184 INFO L130 PetriNetUnfolder]: 63/153 cut-off events. [2022-12-06 04:07:02,184 INFO L131 PetriNetUnfolder]: For 170/170 co-relation queries the response was YES. [2022-12-06 04:07:02,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 153 events. 63/153 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 577 event pairs, 2 based on Foata normal form. 3/156 useless extension candidates. Maximal degree in co-relation 498. Up to 61 conditions per place. [2022-12-06 04:07:02,185 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 33 selfloop transitions, 8 changer transitions 9/50 dead transitions. [2022-12-06 04:07:02,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 343 flow [2022-12-06 04:07:02,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:07:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:07:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-12-06 04:07:02,186 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 04:07:02,186 INFO L175 Difference]: Start difference. First operand has 38 places, 22 transitions, 124 flow. Second operand 6 states and 45 transitions. [2022-12-06 04:07:02,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 343 flow [2022-12-06 04:07:02,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 309 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-06 04:07:02,188 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 158 flow [2022-12-06 04:07:02,188 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2022-12-06 04:07:02,188 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2022-12-06 04:07:02,188 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:07:02,188 INFO L89 Accepts]: Start accepts. Operand has 40 places, 26 transitions, 158 flow [2022-12-06 04:07:02,189 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:07:02,189 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:07:02,189 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 158 flow [2022-12-06 04:07:02,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 158 flow [2022-12-06 04:07:02,195 INFO L130 PetriNetUnfolder]: 8/46 cut-off events. [2022-12-06 04:07:02,195 INFO L131 PetriNetUnfolder]: For 59/70 co-relation queries the response was YES. [2022-12-06 04:07:02,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 46 events. 8/46 cut-off events. For 59/70 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 2/47 useless extension candidates. Maximal degree in co-relation 119. Up to 10 conditions per place. [2022-12-06 04:07:02,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 26 transitions, 158 flow [2022-12-06 04:07:02,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-06 04:07:02,571 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:07:02,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 384 [2022-12-06 04:07:02,572 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 161 flow [2022-12-06 04:07:02,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:02,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:07:02,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:07:02,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:07:02,572 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:07:02,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:07:02,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1899851331, now seen corresponding path program 2 times [2022-12-06 04:07:02,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:07:02,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421518473] [2022-12-06 04:07:02,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:07:02,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:07:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:07:02,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:07:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:07:02,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:07:02,647 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:07:02,648 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:07:02,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:07:02,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:07:02,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:07:02,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:07:02,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:07:02,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:07:02,651 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:07:02,655 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:07:02,655 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:07:02,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:07:02 BasicIcfg [2022-12-06 04:07:02,713 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:07:02,714 INFO L158 Benchmark]: Toolchain (without parser) took 14752.08ms. Allocated memory was 178.3MB in the beginning and 442.5MB in the end (delta: 264.2MB). Free memory was 152.3MB in the beginning and 170.6MB in the end (delta: -18.2MB). Peak memory consumption was 246.9MB. Max. memory is 8.0GB. [2022-12-06 04:07:02,714 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory is still 154.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:07:02,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 550.00ms. Allocated memory is still 178.3MB. Free memory was 152.3MB in the beginning and 124.9MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:07:02,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.53ms. Allocated memory is still 178.3MB. Free memory was 124.9MB in the beginning and 122.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:07:02,714 INFO L158 Benchmark]: Boogie Preprocessor took 39.34ms. Allocated memory is still 178.3MB. Free memory was 122.5MB in the beginning and 120.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:07:02,717 INFO L158 Benchmark]: RCFGBuilder took 606.20ms. Allocated memory is still 178.3MB. Free memory was 120.4MB in the beginning and 130.6MB in the end (delta: -10.2MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. [2022-12-06 04:07:02,718 INFO L158 Benchmark]: TraceAbstraction took 13488.31ms. Allocated memory was 178.3MB in the beginning and 442.5MB in the end (delta: 264.2MB). Free memory was 129.6MB in the beginning and 170.6MB in the end (delta: -41.0MB). Peak memory consumption was 223.3MB. Max. memory is 8.0GB. [2022-12-06 04:07:02,719 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory is still 154.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 550.00ms. Allocated memory is still 178.3MB. Free memory was 152.3MB in the beginning and 124.9MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.53ms. Allocated memory is still 178.3MB. Free memory was 124.9MB in the beginning and 122.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.34ms. Allocated memory is still 178.3MB. Free memory was 122.5MB in the beginning and 120.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 606.20ms. Allocated memory is still 178.3MB. Free memory was 120.4MB in the beginning and 130.6MB in the end (delta: -10.2MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. * TraceAbstraction took 13488.31ms. Allocated memory was 178.3MB in the beginning and 442.5MB in the end (delta: 264.2MB). Free memory was 129.6MB in the beginning and 170.6MB in the end (delta: -41.0MB). Peak memory consumption was 223.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 122 PlacesBefore, 40 PlacesAfterwards, 114 TransitionsBefore, 31 TransitionsAfterwards, 2348 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 43 ConcurrentYvCompositions, 1 ChoiceCompositions, 88 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1889, independent: 1825, independent conditional: 1825, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1889, independent: 1825, independent conditional: 0, independent unconditional: 1825, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1889, independent: 1825, independent conditional: 0, independent unconditional: 1825, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1889, independent: 1825, independent conditional: 0, independent unconditional: 1825, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1418, independent: 1375, independent conditional: 0, independent unconditional: 1375, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1418, independent: 1367, independent conditional: 0, independent unconditional: 1367, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 215, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1889, independent: 450, independent conditional: 0, independent unconditional: 450, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 1418, unknown conditional: 0, unknown unconditional: 1418] , Statistics on independence cache: Total cache size (in pairs): 2082, Positive cache size: 2039, Positive conditional cache size: 0, Positive unconditional cache size: 2039, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 337, independent: 284, independent conditional: 284, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 337, independent: 284, independent conditional: 29, independent unconditional: 255, dependent: 53, dependent conditional: 5, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 337, independent: 284, independent conditional: 29, independent unconditional: 255, dependent: 53, dependent conditional: 5, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 337, independent: 284, independent conditional: 29, independent unconditional: 255, dependent: 53, dependent conditional: 5, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 169, independent: 145, independent conditional: 20, independent unconditional: 125, dependent: 24, dependent conditional: 4, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 169, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 24, dependent conditional: 4, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 106, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 105, dependent conditional: 19, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 337, independent: 139, independent conditional: 9, independent unconditional: 130, dependent: 29, dependent conditional: 1, dependent unconditional: 28, unknown: 169, unknown conditional: 24, unknown unconditional: 145] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 145, Positive conditional cache size: 20, Positive unconditional cache size: 125, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, independent: 89, independent conditional: 89, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 110, independent: 89, independent conditional: 8, independent unconditional: 81, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 110, independent: 89, independent conditional: 0, independent unconditional: 89, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 110, independent: 89, independent conditional: 0, independent unconditional: 89, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 163, Positive conditional cache size: 20, Positive unconditional cache size: 143, Negative cache size: 31, Negative conditional cache size: 4, 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, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 83, independent conditional: 83, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104, independent: 83, independent conditional: 13, independent unconditional: 70, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 104, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 163, Positive conditional cache size: 20, Positive unconditional cache size: 143, Negative cache size: 31, Negative conditional cache size: 4, 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.0s, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 106, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 106, independent: 84, independent conditional: 7, independent unconditional: 77, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 106, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 106, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , 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: 0, dependent unconditional: 1, 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: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 164, Positive conditional cache size: 20, Positive unconditional cache size: 144, Negative cache size: 32, Negative conditional cache size: 4, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 106, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 106, independent: 84, independent conditional: 9, independent unconditional: 75, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 164, Positive conditional cache size: 20, Positive unconditional cache size: 144, Negative cache size: 32, Negative conditional cache size: 4, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 232, independent: 190, independent conditional: 190, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 232, independent: 190, independent conditional: 45, independent unconditional: 145, dependent: 42, dependent conditional: 4, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 232, independent: 190, independent conditional: 6, independent unconditional: 184, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 232, independent: 190, independent conditional: 6, independent unconditional: 184, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 232, independent: 185, independent conditional: 6, independent unconditional: 179, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 178, Positive conditional cache size: 20, Positive unconditional cache size: 158, Negative cache size: 33, Negative conditional cache size: 4, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 43, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183, independent: 135, independent conditional: 135, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 183, independent: 135, independent conditional: 79, independent unconditional: 56, dependent: 48, dependent conditional: 23, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 187, independent: 135, independent conditional: 4, independent unconditional: 131, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 187, independent: 135, independent conditional: 4, independent unconditional: 131, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 71, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 187, independent: 124, independent conditional: 4, independent unconditional: 120, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 198, Positive conditional cache size: 20, Positive unconditional cache size: 178, Negative cache size: 44, Negative conditional cache size: 4, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 102, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 46 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 232, independent: 193, independent conditional: 193, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 232, independent: 193, independent conditional: 145, independent unconditional: 48, dependent: 39, dependent conditional: 12, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 232, independent: 193, independent conditional: 78, independent unconditional: 115, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 232, independent: 193, independent conditional: 78, independent unconditional: 115, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 11, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 232, independent: 181, independent conditional: 67, independent unconditional: 114, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 15, unknown conditional: 11, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 216, Positive conditional cache size: 31, Positive unconditional cache size: 185, Negative cache size: 47, Negative conditional cache size: 4, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 79, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 51 PlacesBefore, 51 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 261, independent: 210, independent conditional: 210, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 261, independent: 210, independent conditional: 166, independent unconditional: 44, dependent: 51, dependent conditional: 6, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 261, independent: 210, independent conditional: 110, independent unconditional: 100, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 261, independent: 210, independent conditional: 110, independent unconditional: 100, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 11, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 261, independent: 198, independent conditional: 99, independent unconditional: 99, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 12, unknown conditional: 11, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 261, Positive conditional cache size: 42, Positive unconditional cache size: 219, Negative cache size: 47, Negative conditional cache size: 4, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 62, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 54 PlacesAfterwards, 34 TransitionsBefore, 32 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 124, independent conditional: 124, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 152, independent: 124, independent conditional: 8, independent unconditional: 116, dependent: 28, dependent conditional: 4, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, independent: 124, independent conditional: 4, independent unconditional: 120, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, independent: 124, independent conditional: 4, independent unconditional: 120, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 152, independent: 122, independent conditional: 4, independent unconditional: 118, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 364, Positive cache size: 317, Positive conditional cache size: 46, Positive unconditional cache size: 271, Negative cache size: 47, Negative conditional cache size: 4, Negative unconditional cache size: 43, 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: 1.4s, 50 PlacesBefore, 44 PlacesAfterwards, 28 TransitionsBefore, 21 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 95, independent: 74, independent conditional: 22, independent unconditional: 52, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 95, independent: 74, independent conditional: 21, independent unconditional: 53, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95, independent: 74, independent conditional: 21, independent unconditional: 53, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, independent: 67, independent conditional: 15, independent unconditional: 52, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 9, unknown conditional: 6, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 468, Positive cache size: 419, Positive conditional cache size: 54, Positive unconditional cache size: 365, Negative cache size: 49, Negative conditional cache size: 4, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 39 PlacesBefore, 38 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31, independent: 23, independent conditional: 21, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 23, independent conditional: 21, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 23, independent conditional: 21, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, independent: 15, independent conditional: 13, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 511, Positive cache size: 462, Positive conditional cache size: 62, Positive unconditional cache size: 400, Negative cache size: 49, Negative conditional cache size: 4, Negative unconditional cache size: 45, 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.4s, 39 PlacesBefore, 39 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 62 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 517, Positive cache size: 466, Positive conditional cache size: 65, Positive unconditional cache size: 401, Negative cache size: 51, Negative conditional cache size: 4, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool a$flush_delayed; [L725] 0 int a$mem_tmp; [L726] 0 _Bool a$r_buff0_thd0; [L727] 0 _Bool a$r_buff0_thd1; [L728] 0 _Bool a$r_buff0_thd2; [L729] 0 _Bool a$r_buff0_thd3; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$read_delayed; [L735] 0 int *a$read_delayed_var; [L736] 0 int a$w_buff0; [L737] 0 _Bool a$w_buff0_used; [L738] 0 int a$w_buff1; [L739] 0 _Bool a$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t38; [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t38, ((void *)0), P0, ((void *)0))=-2, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t39; [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t39, ((void *)0), P1, ((void *)0))=-1, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t40; [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t40, ((void *)0), P2, ((void *)0))=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 [L765] 1 x = 1 [L768] 1 __unbuffered_p0_EAX = x [L771] 1 __unbuffered_p0_EBX = y [L788] 1 y = 1 [L791] 1 __unbuffered_p1_EAX = y [L794] 1 __unbuffered_p1_EBX = z [L797] 1 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] 1 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 1 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 3 z = 1 [L814] 3 __unbuffered_p2_EAX = z [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L862] 3 main$tmp_guard0 = __unbuffered_cnt == 3 [L864] CALL 3 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 3 !(!cond) [L864] RET 3 assume_abort_if_not(main$tmp_guard0) [L866] 3 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] 3 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] 3 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L873] 3 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L875] CALL 3 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 3 !expression [L18] 3 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 856]: 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: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 385 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 970 IncrementalHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 28 mSDtfsCounter, 970 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=9, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 1268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:07:02,754 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...