/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/safe004_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:25:12,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:25:12,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:25:12,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:25:12,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:25:12,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:25:12,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:25:12,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:25:12,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:25:12,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:25:12,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:25:12,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:25:12,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:25:12,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:25:12,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:25:12,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:25:12,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:25:12,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:25:12,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:25:12,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:25:12,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:25:12,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:25:12,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:25:12,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:25:12,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:25:12,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:25:12,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:25:12,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:25:12,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:25:12,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:25:12,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:25:12,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:25:12,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:25:12,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:25:12,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:25:12,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:25:12,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:25:12,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:25:12,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:25:12,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:25:12,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:25:12,469 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:25:12,496 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:25:12,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:25:12,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:25:12,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:25:12,498 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:25:12,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:25:12,499 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:25:12,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:25:12,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:25:12,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:25:12,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:25:12,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:25:12,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:25:12,500 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:25:12,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:25:12,501 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:25:12,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:25:12,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:25:12,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:25:12,501 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:25:12,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:25:12,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:25:12,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:25:12,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:25:12,502 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:25:12,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:25:12,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:25:12,502 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:25:12,502 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:25:12,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:25:12,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:25:12,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:25:12,804 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:25:12,804 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:25:12,806 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:25:13,773 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:25:14,019 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:25:14,019 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:25:14,028 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/117dd6442/a01d823f20e747c49a31a74827d25190/FLAGfd4620c85 [2022-12-06 04:25:14,042 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/117dd6442/a01d823f20e747c49a31a74827d25190 [2022-12-06 04:25:14,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:25:14,044 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:25:14,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:25:14,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:25:14,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:25:14,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:25:14" (1/1) ... [2022-12-06 04:25:14,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1baf90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:14, skipping insertion in model container [2022-12-06 04:25:14,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:25:14" (1/1) ... [2022-12-06 04:25:14,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:25:14,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:25:14,178 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/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-06 04:25:14,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:25:14,375 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:25:14,382 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/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-06 04:25:14,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:14,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:14,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:25:14,458 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:25:14,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:14 WrapperNode [2022-12-06 04:25:14,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:25:14,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:25:14,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:25:14,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:25:14,465 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:25:14" (1/1) ... [2022-12-06 04:25:14,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:14" (1/1) ... [2022-12-06 04:25:14,521 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-06 04:25:14,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:25:14,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:25:14,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:25:14,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:25:14,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:14" (1/1) ... [2022-12-06 04:25:14,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:14" (1/1) ... [2022-12-06 04:25:14,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:14" (1/1) ... [2022-12-06 04:25:14,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:14" (1/1) ... [2022-12-06 04:25:14,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:14" (1/1) ... [2022-12-06 04:25:14,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:14" (1/1) ... [2022-12-06 04:25:14,573 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:14" (1/1) ... [2022-12-06 04:25:14,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:14" (1/1) ... [2022-12-06 04:25:14,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:25:14,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:25:14,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:25:14,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:25:14,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:14" (1/1) ... [2022-12-06 04:25:14,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:25:14,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:25:14,639 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:25:14,647 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:25:14,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:25:14,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:25:14,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:25:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:25:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:25:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:25:14,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:25:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:25:14,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:25:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:25:14,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:25:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:25:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:25:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:25:14,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:25:14,680 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:25:14,836 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:25:14,838 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:25:15,181 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:25:15,342 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:25:15,342 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:25:15,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:25:15 BoogieIcfgContainer [2022-12-06 04:25:15,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:25:15,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:25:15,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:25:15,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:25:15,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:25:14" (1/3) ... [2022-12-06 04:25:15,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc5fc7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:25:15, skipping insertion in model container [2022-12-06 04:25:15,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:14" (2/3) ... [2022-12-06 04:25:15,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc5fc7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:25:15, skipping insertion in model container [2022-12-06 04:25:15,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:25:15" (3/3) ... [2022-12-06 04:25:15,353 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:25:15,366 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:25:15,366 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:25:15,366 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:25:15,410 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:25:15,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 04:25:15,498 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 04:25:15,499 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:15,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:25:15,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 04:25:15,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-06 04:25:15,509 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:15,535 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 04:25:15,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-06 04:25:15,565 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 04:25:15,565 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:15,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:25:15,567 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 04:25:15,567 INFO L188 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-06 04:25:19,533 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-06 04:25:19,565 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:25:19,571 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;@3a17c095, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:25:19,571 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:25:19,574 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 04:25:19,574 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:19,574 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:19,575 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:25:19,576 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:25:19,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:19,579 INFO L85 PathProgramCache]: Analyzing trace with hash 525357, now seen corresponding path program 1 times [2022-12-06 04:25:19,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:19,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338187115] [2022-12-06 04:25:19,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:19,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:19,856 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:25:19,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:19,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338187115] [2022-12-06 04:25:19,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338187115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:19,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:19,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:25:19,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620969431] [2022-12-06 04:25:19,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:19,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:25:19,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:19,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:25:19,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:25:19,882 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 04:25:19,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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:25:19,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:19,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 04:25:19,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:20,141 INFO L130 PetriNetUnfolder]: 1106/1785 cut-off events. [2022-12-06 04:25:20,141 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 04:25:20,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3479 conditions, 1785 events. 1106/1785 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9636 event pairs, 176 based on Foata normal form. 0/1604 useless extension candidates. Maximal degree in co-relation 3468. Up to 1336 conditions per place. [2022-12-06 04:25:20,150 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 31 selfloop transitions, 2 changer transitions 8/43 dead transitions. [2022-12-06 04:25:20,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 183 flow [2022-12-06 04:25:20,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:25:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:25:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 04:25:20,158 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-06 04:25:20,159 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 52 transitions. [2022-12-06 04:25:20,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 183 flow [2022-12-06 04:25:20,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:25:20,163 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 52 flow [2022-12-06 04:25:20,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2022-12-06 04:25:20,166 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-06 04:25:20,166 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:20,167 INFO L89 Accepts]: Start accepts. Operand has 34 places, 21 transitions, 52 flow [2022-12-06 04:25:20,169 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:20,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:20,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 52 flow [2022-12-06 04:25:20,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 04:25:20,174 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:25:20,174 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:20,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:25:20,174 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 04:25:20,174 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 04:25:20,256 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:20,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 04:25:20,258 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 04:25:20,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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:25:20,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:20,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:20,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:25:20,259 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:25:20,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash -42487648, now seen corresponding path program 1 times [2022-12-06 04:25:20,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:20,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644389591] [2022-12-06 04:25:20,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:20,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:20,894 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:25:20,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:20,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644389591] [2022-12-06 04:25:20,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644389591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:20,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:20,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:25:20,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953979514] [2022-12-06 04:25:20,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:20,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:25:20,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:20,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:25:20,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:25:20,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:25:20,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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:25:20,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:20,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:25:20,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:21,210 INFO L130 PetriNetUnfolder]: 1345/1997 cut-off events. [2022-12-06 04:25:21,211 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-06 04:25:21,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4175 conditions, 1997 events. 1345/1997 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8890 event pairs, 213 based on Foata normal form. 35/2032 useless extension candidates. Maximal degree in co-relation 4165. Up to 1718 conditions per place. [2022-12-06 04:25:21,220 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 38 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2022-12-06 04:25:21,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 49 transitions, 216 flow [2022-12-06 04:25:21,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:25:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:25:21,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 04:25:21,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 04:25:21,222 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 4 states and 51 transitions. [2022-12-06 04:25:21,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 49 transitions, 216 flow [2022-12-06 04:25:21,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 49 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:25:21,224 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 118 flow [2022-12-06 04:25:21,224 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2022-12-06 04:25:21,224 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -4 predicate places. [2022-12-06 04:25:21,225 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:21,225 INFO L89 Accepts]: Start accepts. Operand has 33 places, 30 transitions, 118 flow [2022-12-06 04:25:21,225 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:21,226 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:21,226 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 30 transitions, 118 flow [2022-12-06 04:25:21,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 118 flow [2022-12-06 04:25:21,270 INFO L130 PetriNetUnfolder]: 208/382 cut-off events. [2022-12-06 04:25:21,270 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-06 04:25:21,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 382 events. 208/382 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1821 event pairs, 99 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 847. Up to 297 conditions per place. [2022-12-06 04:25:21,272 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 30 transitions, 118 flow [2022-12-06 04:25:21,273 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 04:25:21,293 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:21,294 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 04:25:21,295 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 118 flow [2022-12-06 04:25:21,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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:25:21,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:21,295 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:21,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:25:21,296 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:25:21,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:21,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1317116783, now seen corresponding path program 1 times [2022-12-06 04:25:21,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:21,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959002132] [2022-12-06 04:25:21,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:21,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:21,814 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:25:21,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:21,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959002132] [2022-12-06 04:25:21,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959002132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:21,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:21,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:25:21,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034107040] [2022-12-06 04:25:21,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:21,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:25:21,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:21,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:25:21,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:25:21,817 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:25:21,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 118 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:25:21,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:21,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:25:21,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:22,092 INFO L130 PetriNetUnfolder]: 1213/1811 cut-off events. [2022-12-06 04:25:22,093 INFO L131 PetriNetUnfolder]: For 531/531 co-relation queries the response was YES. [2022-12-06 04:25:22,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5064 conditions, 1811 events. 1213/1811 cut-off events. For 531/531 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7363 event pairs, 365 based on Foata normal form. 46/1857 useless extension candidates. Maximal degree in co-relation 5052. Up to 1029 conditions per place. [2022-12-06 04:25:22,101 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 40 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2022-12-06 04:25:22,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 50 transitions, 288 flow [2022-12-06 04:25:22,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:25:22,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:25:22,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 04:25:22,103 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2022-12-06 04:25:22,103 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 118 flow. Second operand 4 states and 41 transitions. [2022-12-06 04:25:22,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 50 transitions, 288 flow [2022-12-06 04:25:22,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 50 transitions, 288 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:25:22,106 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 203 flow [2022-12-06 04:25:22,106 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2022-12-06 04:25:22,107 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2022-12-06 04:25:22,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:22,107 INFO L89 Accepts]: Start accepts. Operand has 39 places, 36 transitions, 203 flow [2022-12-06 04:25:22,107 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:22,107 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:22,108 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 36 transitions, 203 flow [2022-12-06 04:25:22,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 36 transitions, 203 flow [2022-12-06 04:25:22,141 INFO L130 PetriNetUnfolder]: 169/330 cut-off events. [2022-12-06 04:25:22,141 INFO L131 PetriNetUnfolder]: For 200/204 co-relation queries the response was YES. [2022-12-06 04:25:22,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 330 events. 169/330 cut-off events. For 200/204 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1564 event pairs, 62 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 917. Up to 236 conditions per place. [2022-12-06 04:25:22,145 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 36 transitions, 203 flow [2022-12-06 04:25:22,145 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-06 04:25:22,173 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:22,174 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 04:25:22,174 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 203 flow [2022-12-06 04:25:22,175 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:25:22,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:22,175 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:22,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:25:22,175 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:25:22,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:22,175 INFO L85 PathProgramCache]: Analyzing trace with hash -24442079, now seen corresponding path program 1 times [2022-12-06 04:25:22,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:22,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711368938] [2022-12-06 04:25:22,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:22,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:22,686 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:25:22,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:22,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711368938] [2022-12-06 04:25:22,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711368938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:22,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:22,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:25:22,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660472616] [2022-12-06 04:25:22,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:22,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:25:22,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:22,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:25:22,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:25:22,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:25:22,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 203 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:22,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:22,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:25:22,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:23,047 INFO L130 PetriNetUnfolder]: 1901/2841 cut-off events. [2022-12-06 04:25:23,047 INFO L131 PetriNetUnfolder]: For 2246/2246 co-relation queries the response was YES. [2022-12-06 04:25:23,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9066 conditions, 2841 events. 1901/2841 cut-off events. For 2246/2246 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13216 event pairs, 416 based on Foata normal form. 69/2910 useless extension candidates. Maximal degree in co-relation 9049. Up to 1437 conditions per place. [2022-12-06 04:25:23,061 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 45 selfloop transitions, 20 changer transitions 14/79 dead transitions. [2022-12-06 04:25:23,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 79 transitions, 573 flow [2022-12-06 04:25:23,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:25:23,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:25:23,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 04:25:23,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2022-12-06 04:25:23,065 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 203 flow. Second operand 5 states and 57 transitions. [2022-12-06 04:25:23,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 79 transitions, 573 flow [2022-12-06 04:25:23,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 79 transitions, 567 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:25:23,088 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 353 flow [2022-12-06 04:25:23,088 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=353, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2022-12-06 04:25:23,090 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2022-12-06 04:25:23,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:23,092 INFO L89 Accepts]: Start accepts. Operand has 46 places, 45 transitions, 353 flow [2022-12-06 04:25:23,094 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:23,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:23,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 45 transitions, 353 flow [2022-12-06 04:25:23,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 353 flow [2022-12-06 04:25:23,173 INFO L130 PetriNetUnfolder]: 246/460 cut-off events. [2022-12-06 04:25:23,174 INFO L131 PetriNetUnfolder]: For 625/650 co-relation queries the response was YES. [2022-12-06 04:25:23,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 460 events. 246/460 cut-off events. For 625/650 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2304 event pairs, 108 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 1640. Up to 339 conditions per place. [2022-12-06 04:25:23,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 45 transitions, 353 flow [2022-12-06 04:25:23,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-06 04:25:23,182 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:23,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 04:25:23,188 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 353 flow [2022-12-06 04:25:23,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:23,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:23,188 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:23,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:25:23,189 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:25:23,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:23,189 INFO L85 PathProgramCache]: Analyzing trace with hash -24557399, now seen corresponding path program 2 times [2022-12-06 04:25:23,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:23,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212244551] [2022-12-06 04:25:23,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:23,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:23,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:25:23,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:23,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212244551] [2022-12-06 04:25:23,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212244551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:23,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:23,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:25:23,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608639422] [2022-12-06 04:25:23,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:23,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:25:23,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:23,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:25:23,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:25:23,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:25:23,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 353 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:23,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:23,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:25:23,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:23,990 INFO L130 PetriNetUnfolder]: 1557/2388 cut-off events. [2022-12-06 04:25:23,990 INFO L131 PetriNetUnfolder]: For 4080/4187 co-relation queries the response was YES. [2022-12-06 04:25:23,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9267 conditions, 2388 events. 1557/2388 cut-off events. For 4080/4187 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11776 event pairs, 183 based on Foata normal form. 181/2553 useless extension candidates. Maximal degree in co-relation 9245. Up to 1227 conditions per place. [2022-12-06 04:25:24,002 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 57 selfloop transitions, 12 changer transitions 31/106 dead transitions. [2022-12-06 04:25:24,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 106 transitions, 969 flow [2022-12-06 04:25:24,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:25:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:25:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-06 04:25:24,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2022-12-06 04:25:24,006 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 353 flow. Second operand 5 states and 66 transitions. [2022-12-06 04:25:24,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 106 transitions, 969 flow [2022-12-06 04:25:24,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 106 transitions, 939 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-06 04:25:24,028 INFO L231 Difference]: Finished difference. Result has 52 places, 52 transitions, 441 flow [2022-12-06 04:25:24,029 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=52, PETRI_TRANSITIONS=52} [2022-12-06 04:25:24,030 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2022-12-06 04:25:24,030 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:24,030 INFO L89 Accepts]: Start accepts. Operand has 52 places, 52 transitions, 441 flow [2022-12-06 04:25:24,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:24,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:24,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 52 transitions, 441 flow [2022-12-06 04:25:24,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 52 transitions, 441 flow [2022-12-06 04:25:24,077 INFO L130 PetriNetUnfolder]: 224/416 cut-off events. [2022-12-06 04:25:24,077 INFO L131 PetriNetUnfolder]: For 1037/1082 co-relation queries the response was YES. [2022-12-06 04:25:24,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 416 events. 224/416 cut-off events. For 1037/1082 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1933 event pairs, 91 based on Foata normal form. 3/407 useless extension candidates. Maximal degree in co-relation 1742. Up to 306 conditions per place. [2022-12-06 04:25:24,080 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 52 transitions, 441 flow [2022-12-06 04:25:24,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 288 [2022-12-06 04:25:24,088 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:24,091 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 04:25:24,091 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 441 flow [2022-12-06 04:25:24,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:24,091 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:24,091 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:24,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:25:24,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:25:24,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:24,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1296139533, now seen corresponding path program 1 times [2022-12-06 04:25:24,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:24,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006734476] [2022-12-06 04:25:24,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:24,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:24,600 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:25:24,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:24,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006734476] [2022-12-06 04:25:24,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006734476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:24,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:24,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:25:24,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541290678] [2022-12-06 04:25:24,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:24,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:25:24,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:24,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:25:24,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:25:24,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:25:24,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 441 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:24,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:24,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:25:24,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:24,866 INFO L130 PetriNetUnfolder]: 1349/2090 cut-off events. [2022-12-06 04:25:24,867 INFO L131 PetriNetUnfolder]: For 4840/4840 co-relation queries the response was YES. [2022-12-06 04:25:24,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8377 conditions, 2090 events. 1349/2090 cut-off events. For 4840/4840 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9531 event pairs, 507 based on Foata normal form. 45/2135 useless extension candidates. Maximal degree in co-relation 8351. Up to 1095 conditions per place. [2022-12-06 04:25:24,877 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 56 selfloop transitions, 12 changer transitions 8/76 dead transitions. [2022-12-06 04:25:24,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 76 transitions, 703 flow [2022-12-06 04:25:24,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:25:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:25:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 04:25:24,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 04:25:24,879 INFO L175 Difference]: Start difference. First operand has 52 places, 52 transitions, 441 flow. Second operand 4 states and 46 transitions. [2022-12-06 04:25:24,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 76 transitions, 703 flow [2022-12-06 04:25:24,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 76 transitions, 672 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 04:25:24,893 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 406 flow [2022-12-06 04:25:24,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=406, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2022-12-06 04:25:24,896 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2022-12-06 04:25:24,896 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:24,896 INFO L89 Accepts]: Start accepts. Operand has 54 places, 48 transitions, 406 flow [2022-12-06 04:25:24,897 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:24,897 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:24,897 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 48 transitions, 406 flow [2022-12-06 04:25:24,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 48 transitions, 406 flow [2022-12-06 04:25:24,941 INFO L130 PetriNetUnfolder]: 203/437 cut-off events. [2022-12-06 04:25:24,941 INFO L131 PetriNetUnfolder]: For 1084/1113 co-relation queries the response was YES. [2022-12-06 04:25:24,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 437 events. 203/437 cut-off events. For 1084/1113 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2318 event pairs, 103 based on Foata normal form. 1/427 useless extension candidates. Maximal degree in co-relation 1618. Up to 303 conditions per place. [2022-12-06 04:25:24,944 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 48 transitions, 406 flow [2022-12-06 04:25:24,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-06 04:25:24,947 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:24,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 04:25:24,948 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 406 flow [2022-12-06 04:25:24,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:24,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:24,948 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:24,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:25:24,948 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:25:24,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:24,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1310766914, now seen corresponding path program 1 times [2022-12-06 04:25:24,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:24,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932230734] [2022-12-06 04:25:24,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:24,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:25,519 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:25:25,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:25,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932230734] [2022-12-06 04:25:25,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932230734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:25,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:25,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:25:25,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725373510] [2022-12-06 04:25:25,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:25,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:25:25,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:25,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:25:25,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:25:25,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:25:25,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 406 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:25,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:25,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:25:25,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:25,819 INFO L130 PetriNetUnfolder]: 1139/1838 cut-off events. [2022-12-06 04:25:25,819 INFO L131 PetriNetUnfolder]: For 4456/4501 co-relation queries the response was YES. [2022-12-06 04:25:25,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6970 conditions, 1838 events. 1139/1838 cut-off events. For 4456/4501 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8966 event pairs, 191 based on Foata normal form. 89/1923 useless extension candidates. Maximal degree in co-relation 6942. Up to 977 conditions per place. [2022-12-06 04:25:25,828 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 49 selfloop transitions, 9 changer transitions 19/79 dead transitions. [2022-12-06 04:25:25,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 79 transitions, 737 flow [2022-12-06 04:25:25,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:25:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:25:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 04:25:25,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 04:25:25,829 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 406 flow. Second operand 5 states and 56 transitions. [2022-12-06 04:25:25,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 79 transitions, 737 flow [2022-12-06 04:25:25,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 725 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:25:25,838 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 335 flow [2022-12-06 04:25:25,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2022-12-06 04:25:25,838 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 22 predicate places. [2022-12-06 04:25:25,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:25,838 INFO L89 Accepts]: Start accepts. Operand has 59 places, 41 transitions, 335 flow [2022-12-06 04:25:25,839 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:25,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:25,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 41 transitions, 335 flow [2022-12-06 04:25:25,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 41 transitions, 335 flow [2022-12-06 04:25:25,873 INFO L130 PetriNetUnfolder]: 151/337 cut-off events. [2022-12-06 04:25:25,873 INFO L131 PetriNetUnfolder]: For 986/1000 co-relation queries the response was YES. [2022-12-06 04:25:25,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 337 events. 151/337 cut-off events. For 986/1000 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1652 event pairs, 86 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 1263. Up to 237 conditions per place. [2022-12-06 04:25:25,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 41 transitions, 335 flow [2022-12-06 04:25:25,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 04:25:25,954 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [399] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_131 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_68 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd3~0_64 256) 0)))) (let ((.cse1 (and (not (= 0 (mod v_~y$w_buff1_used~0_115 256))) .cse4)) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_132 256) 0)) .cse5))) (and (= v_~y~0_83 (ite .cse0 v_~y$w_buff0~0_41 (ite .cse1 v_~y$w_buff1~0_50 v_~y~0_84))) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_115) v_~y$w_buff1_used~0_114) (= v_~y$r_buff0_thd3~0_67 (ite .cse2 0 v_~y$r_buff0_thd3~0_68)) (= (ite .cse0 0 v_~y$w_buff0_used~0_132) v_~y$w_buff0_used~0_131) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_67 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_114 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_64) v_~y$r_buff1_thd3~0_63)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_64, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_50, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_68, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_84, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_63, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_131, ~y$w_buff1~0=v_~y$w_buff1~0_50, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_41, ~y~0=v_~y~0_83, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:25:26,110 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [392] L774-->L781: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_173 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0)))) (let ((.cse0 (and (not (= 0 (mod v_~y$w_buff0_used~0_174 256))) .cse5)) (.cse2 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_157 256) 0)) .cse4))) (and (= v_~y~0_133 (ite .cse0 v_~y$w_buff0~0_71 (ite .cse1 v_~y$w_buff1~0_80 v_~y~0_134))) (= (ite .cse2 0 v_~y$r_buff0_thd2~0_22) v_~y$r_buff0_thd2~0_21) (= v_~y$w_buff0_used~0_173 (ite .cse0 0 v_~y$w_buff0_used~0_174)) (= v_~y$w_buff1_used~0_156 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_157)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_156 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_174, ~y$w_buff1~0=v_~y$w_buff1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_71, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_134, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_157} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_173, ~y$w_buff1~0=v_~y$w_buff1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_71, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_133, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_156} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:25:26,334 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [472] L852-->L860: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_102 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_108 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_307 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_308 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_279 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_279) v_~y$w_buff1_used~0_278) (= v_~y$w_buff0_used~0_307 (ite .cse2 0 v_~y$w_buff0_used~0_308)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| 0)) (= v_~y$r_buff1_thd0~0_101 (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_278 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd0~0_107 256) 0)))) 0 v_~y$r_buff1_thd0~0_102)) (= v_~y$r_buff0_thd0~0_107 (ite .cse1 0 v_~y$r_buff0_thd0~0_108)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= v_~y~0_248 (ite .cse2 v_~y$w_buff0~0_175 (ite .cse0 v_~y$w_buff1~0_166 v_~y~0_249))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13| (mod v_~main$tmp_guard0~0_28 256))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_308, ~y$w_buff1~0=v_~y$w_buff1~0_166, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_108, ~y$w_buff0~0=v_~y$w_buff0~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ~y~0=v_~y~0_249, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_279} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_307, ~y$w_buff1~0=v_~y$w_buff1~0_166, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~y$w_buff0~0=v_~y$w_buff0~0_175, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ~y~0=v_~y~0_248, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_101, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_278, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:25:26,422 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [485] $Ultimate##0-->L771: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x~0_42 2)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] [2022-12-06 04:25:26,440 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [509] L751-->L761: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd1~0_142 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_201 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_701 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_702 256) 0)) .cse5)) (.cse4 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_633 256) 0))))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_702) v_~y$w_buff0_used~0_701) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd1~0_200 256) 0)) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_632 256) 0)))) 0 v_~y$r_buff1_thd1~0_142) v_~y$r_buff1_thd1~0_141) (= (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_633) v_~y$w_buff1_used~0_632) (= (ite .cse3 0 v_~y$r_buff0_thd1~0_201) v_~y$r_buff0_thd1~0_200) (= v_~x~0_103 1) (= v_~y~0_591 (ite .cse0 v_~y$w_buff0~0_473 (ite .cse4 v_~y$w_buff1~0_429 v_~y~0_592)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_142, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_702, ~y$w_buff1~0=v_~y$w_buff1~0_429, ~y$w_buff0~0=v_~y$w_buff0~0_473, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_201, ~y~0=v_~y~0_592, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_633} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_141, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_701, ~y$w_buff1~0=v_~y$w_buff1~0_429, ~y$w_buff0~0=v_~y$w_buff0~0_473, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_200, ~y~0=v_~y~0_591, ~x~0=v_~x~0_103, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_632} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~x~0, ~y$w_buff1_used~0] and [485] $Ultimate##0-->L771: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x~0_42 2)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] [2022-12-06 04:25:26,521 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] L751-->L860: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_709 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd0~0_267 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_270 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_710 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_641 256) 0)))) (.cse4 (and .cse5 .cse3))) (and (= v_~y~0_599 (ite .cse0 v_~y$w_buff0~0_477 (ite .cse1 v_~y$w_buff1~0_433 v_~y~0_600))) (= v_~y$w_buff0_used~0_709 (ite .cse0 0 v_~y$w_buff0_used~0_710)) (= v_~y$r_buff1_thd0~0_266 (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_640 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd0~0_269 256))) .cse3)) 0 v_~y$r_buff1_thd0~0_267)) (= (mod v_~main$tmp_guard0~0_78 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|) (= v_~y$r_buff0_thd0~0_269 (ite .cse4 0 v_~y$r_buff0_thd0~0_270)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_43| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_43| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|) (= (ite (or .cse1 .cse4) 0 v_~y$w_buff1_used~0_641) v_~y$w_buff1_used~0_640) (= v_~x~0_107 1)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_710, ~y$w_buff1~0=v_~y$w_buff1~0_433, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_270, ~y$w_buff0~0=v_~y$w_buff0~0_477, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_78, ~y~0=v_~y~0_600, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_267, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_641} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_709, ~y$w_buff1~0=v_~y$w_buff1~0_433, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_269, ~y$w_buff0~0=v_~y$w_buff0~0_477, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_78, ~y~0=v_~y~0_599, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_266, ~x~0=v_~x~0_107, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_640, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_35|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [485] $Ultimate##0-->L771: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x~0_42 2)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] [2022-12-06 04:25:26,630 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:25:26,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 792 [2022-12-06 04:25:26,630 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 353 flow [2022-12-06 04:25:26,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:26,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:26,631 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:26,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:25:26,631 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:25:26,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:26,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1449688056, now seen corresponding path program 1 times [2022-12-06 04:25:26,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:26,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858611041] [2022-12-06 04:25:26,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:26,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:27,167 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:25:27,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:27,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858611041] [2022-12-06 04:25:27,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858611041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:27,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:27,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:25:27,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915090979] [2022-12-06 04:25:27,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:27,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:25:27,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:27,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:25:27,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:25:27,169 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:25:27,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 353 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:27,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:27,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:25:27,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:27,519 INFO L130 PetriNetUnfolder]: 839/1314 cut-off events. [2022-12-06 04:25:27,519 INFO L131 PetriNetUnfolder]: For 4488/4488 co-relation queries the response was YES. [2022-12-06 04:25:27,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5255 conditions, 1314 events. 839/1314 cut-off events. For 4488/4488 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5516 event pairs, 402 based on Foata normal form. 3/1317 useless extension candidates. Maximal degree in co-relation 5224. Up to 1136 conditions per place. [2022-12-06 04:25:27,527 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 48 selfloop transitions, 14 changer transitions 0/62 dead transitions. [2022-12-06 04:25:27,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 596 flow [2022-12-06 04:25:27,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:25:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:25:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-06 04:25:27,528 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:25:27,529 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 353 flow. Second operand 4 states and 54 transitions. [2022-12-06 04:25:27,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 596 flow [2022-12-06 04:25:27,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 479 flow, removed 31 selfloop flow, removed 12 redundant places. [2022-12-06 04:25:27,538 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 348 flow [2022-12-06 04:25:27,538 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=348, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2022-12-06 04:25:27,539 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2022-12-06 04:25:27,539 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:27,539 INFO L89 Accepts]: Start accepts. Operand has 49 places, 45 transitions, 348 flow [2022-12-06 04:25:27,539 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:27,540 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:27,540 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 45 transitions, 348 flow [2022-12-06 04:25:27,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 348 flow [2022-12-06 04:25:27,586 INFO L130 PetriNetUnfolder]: 167/347 cut-off events. [2022-12-06 04:25:27,586 INFO L131 PetriNetUnfolder]: For 682/711 co-relation queries the response was YES. [2022-12-06 04:25:27,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 347 events. 167/347 cut-off events. For 682/711 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1645 event pairs, 74 based on Foata normal form. 2/345 useless extension candidates. Maximal degree in co-relation 1294. Up to 246 conditions per place. [2022-12-06 04:25:27,590 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 45 transitions, 348 flow [2022-12-06 04:25:27,590 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 04:25:27,592 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:27,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 04:25:27,592 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 348 flow [2022-12-06 04:25:27,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:27,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:27,593 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:27,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:25:27,593 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:25:27,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:27,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1335135952, now seen corresponding path program 1 times [2022-12-06 04:25:27,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:27,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371812793] [2022-12-06 04:25:27,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:27,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:28,245 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:25:28,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:28,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371812793] [2022-12-06 04:25:28,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371812793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:28,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:28,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:25:28,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732682497] [2022-12-06 04:25:28,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:28,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:25:28,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:28,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:25:28,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:25:28,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:25:28,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 348 flow. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:25:28,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:28,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:25:28,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:28,765 INFO L130 PetriNetUnfolder]: 1034/1619 cut-off events. [2022-12-06 04:25:28,765 INFO L131 PetriNetUnfolder]: For 3449/3449 co-relation queries the response was YES. [2022-12-06 04:25:28,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6532 conditions, 1619 events. 1034/1619 cut-off events. For 3449/3449 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7217 event pairs, 217 based on Foata normal form. 12/1631 useless extension candidates. Maximal degree in co-relation 6508. Up to 1134 conditions per place. [2022-12-06 04:25:28,775 INFO L137 encePairwiseOnDemand]: 11/27 looper letters, 65 selfloop transitions, 30 changer transitions 3/98 dead transitions. [2022-12-06 04:25:28,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 98 transitions, 837 flow [2022-12-06 04:25:28,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:25:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:25:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2022-12-06 04:25:28,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39351851851851855 [2022-12-06 04:25:28,786 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 348 flow. Second operand 8 states and 85 transitions. [2022-12-06 04:25:28,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 98 transitions, 837 flow [2022-12-06 04:25:28,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 98 transitions, 828 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 04:25:28,792 INFO L231 Difference]: Finished difference. Result has 58 places, 61 transitions, 580 flow [2022-12-06 04:25:28,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=580, PETRI_PLACES=58, PETRI_TRANSITIONS=61} [2022-12-06 04:25:28,792 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2022-12-06 04:25:28,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:28,793 INFO L89 Accepts]: Start accepts. Operand has 58 places, 61 transitions, 580 flow [2022-12-06 04:25:28,793 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:28,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:28,793 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 61 transitions, 580 flow [2022-12-06 04:25:28,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 580 flow [2022-12-06 04:25:28,839 INFO L130 PetriNetUnfolder]: 205/428 cut-off events. [2022-12-06 04:25:28,839 INFO L131 PetriNetUnfolder]: For 1571/1645 co-relation queries the response was YES. [2022-12-06 04:25:28,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2156 conditions, 428 events. 205/428 cut-off events. For 1571/1645 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2199 event pairs, 14 based on Foata normal form. 2/425 useless extension candidates. Maximal degree in co-relation 2131. Up to 321 conditions per place. [2022-12-06 04:25:28,842 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 61 transitions, 580 flow [2022-12-06 04:25:28,842 INFO L188 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-06 04:25:28,852 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] $Ultimate##0-->L804: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd3~0_156 256) 0)) (.cse2 (= (mod v_~y$r_buff0_thd3~0_160 256) 0))) (let ((.cse5 (not .cse2)) (.cse12 (= (mod v_~y$w_buff0_used~0_314 256) 0)) (.cse9 (and .cse2 (= (mod v_~y$w_buff1_used~0_283 256) 0))) (.cse4 (and .cse2 .cse11))) (let ((.cse7 (or .cse12 .cse9 .cse4)) (.cse8 (and .cse5 (not .cse12)))) (let ((.cse6 (ite .cse7 v_~y~0_255 (ite .cse8 v_~y$w_buff0~0_180 v_~y$w_buff1~0_169))) (.cse0 (not (= (mod v_~weak$$choice2~0_124 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_313 256) 0)) (.cse3 (= (mod v_~y$w_buff1_used~0_282 256) 0))) (and (= (ite .cse0 v_~y$r_buff0_thd3~0_160 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~y$r_buff0_thd3~0_160 (ite (and (not .cse1) .cse5) 0 v_~y$r_buff0_thd3~0_160))) v_~y$r_buff0_thd3~0_159) (= v_~weak$$choice2~0_124 |v_P2Thread1of1ForFork1_#t~nondet4_22|) (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_254 (ite .cse0 v_~y$mem_tmp~0_90 .cse6)) (= v_~y$w_buff1~0_169 v_~y$w_buff1~0_168) (= |v_P2Thread1of1ForFork1_#t~nondet3_22| v_~weak$$choice0~0_53) (= v_~y$w_buff0_used~0_313 (ite .cse0 v_~y$w_buff0_used~0_314 (ite .cse7 v_~y$w_buff0_used~0_314 (ite .cse8 0 v_~y$w_buff0_used~0_314)))) (= .cse6 v_~__unbuffered_p2_EAX~0_54) (= (ite .cse0 v_~y$w_buff1_used~0_283 (ite (or .cse1 .cse9 .cse4) v_~y$w_buff1_used~0_283 0)) v_~y$w_buff1_used~0_282) (= v_~y$flush_delayed~0_115 0) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= v_~y$r_buff1_thd3~0_155 (ite .cse0 v_~y$r_buff1_thd3~0_156 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_159 256) 0))) (or .cse1 (and .cse10 .cse3) (and .cse10 .cse11))) v_~y$r_buff1_thd3~0_156 0))) (= v_~y~0_255 v_~y$mem_tmp~0_90) (= v_~y$w_buff0~0_180 v_~y$w_buff0~0_179)))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_156, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_314, ~y$w_buff1~0=v_~y$w_buff1~0_169, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_160, ~y$w_buff0~0=v_~y$w_buff0~0_180, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_22|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_22|, ~y~0=v_~y~0_255, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_283} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_313, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_53, ~y$mem_tmp~0=v_~y$mem_tmp~0_90, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_155, ~y$w_buff1~0=v_~y$w_buff1~0_168, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_159, ~y$w_buff0~0=v_~y$w_buff0~0_179, ~y$flush_delayed~0=v_~y$flush_delayed~0_115, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_254, ~weak$$choice2~0=v_~weak$$choice2~0_124, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_282} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#t~nondet3, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork1_~arg.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] and [497] $Ultimate##0-->L751: Formula: (and (= v_~y$w_buff0_used~0_404 1) (= |v_P0Thread1of1ForFork2_~arg#1.offset_7| |v_P0Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_185 v_~y$r_buff1_thd3~0_181) (= v_~y$r_buff0_thd1~0_71 v_~y$r_buff1_thd1~0_49) (= v_~y$r_buff0_thd2~0_53 v_~y$r_buff1_thd2~0_55) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_15| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_404 256) 0)) (not (= (mod v_~y$w_buff1_used~0_370 256) 0)))) 1 0)) (= v_~y$r_buff0_thd0~0_172 v_~y$r_buff1_thd0~0_164) (= |v_P0Thread1of1ForFork2_~arg#1.base_7| |v_P0Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~y$r_buff0_thd1~0_70 1) (= v_~y$w_buff1~0_231 v_~y$w_buff0~0_248) (= 2 v_~y$w_buff0~0_247) (= v_~y$w_buff0_used~0_405 v_~y$w_buff1_used~0_370) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_15| 0)) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_15| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_15|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_405, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_172, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_71, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_404, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_15|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_7|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_55, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_49, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_181, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_15|, ~y$w_buff1~0=v_~y$w_buff1~0_231, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_172, ~y$w_buff0~0=v_~y$w_buff0~0_247, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_70, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_164, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_370} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:25:29,115 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:25:29,116 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 324 [2022-12-06 04:25:29,116 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 61 transitions, 587 flow [2022-12-06 04:25:29,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:25:29,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:29,116 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:29,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:25:29,117 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:25:29,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:29,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1514767854, now seen corresponding path program 2 times [2022-12-06 04:25:29,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:29,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932201286] [2022-12-06 04:25:29,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:29,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:25:29,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:29,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932201286] [2022-12-06 04:25:29,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932201286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:29,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:29,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:25:29,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995961274] [2022-12-06 04:25:29,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:29,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:25:29,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:29,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:25:29,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:25:29,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:25:29,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 587 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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:25:29,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:29,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:25:29,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:29,845 INFO L130 PetriNetUnfolder]: 987/1565 cut-off events. [2022-12-06 04:25:29,845 INFO L131 PetriNetUnfolder]: For 6325/6325 co-relation queries the response was YES. [2022-12-06 04:25:29,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7680 conditions, 1565 events. 987/1565 cut-off events. For 6325/6325 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7155 event pairs, 250 based on Foata normal form. 9/1574 useless extension candidates. Maximal degree in co-relation 7652. Up to 1404 conditions per place. [2022-12-06 04:25:29,854 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 65 selfloop transitions, 24 changer transitions 0/89 dead transitions. [2022-12-06 04:25:29,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 89 transitions, 951 flow [2022-12-06 04:25:29,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:25:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:25:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-06 04:25:29,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-06 04:25:29,856 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 587 flow. Second operand 6 states and 66 transitions. [2022-12-06 04:25:29,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 89 transitions, 951 flow [2022-12-06 04:25:29,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 89 transitions, 914 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-12-06 04:25:29,865 INFO L231 Difference]: Finished difference. Result has 65 places, 69 transitions, 734 flow [2022-12-06 04:25:29,865 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=734, PETRI_PLACES=65, PETRI_TRANSITIONS=69} [2022-12-06 04:25:29,865 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 28 predicate places. [2022-12-06 04:25:29,865 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:29,865 INFO L89 Accepts]: Start accepts. Operand has 65 places, 69 transitions, 734 flow [2022-12-06 04:25:29,866 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:29,866 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:29,866 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 69 transitions, 734 flow [2022-12-06 04:25:29,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 69 transitions, 734 flow [2022-12-06 04:25:29,924 INFO L130 PetriNetUnfolder]: 202/422 cut-off events. [2022-12-06 04:25:29,924 INFO L131 PetriNetUnfolder]: For 1991/2043 co-relation queries the response was YES. [2022-12-06 04:25:29,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 422 events. 202/422 cut-off events. For 1991/2043 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2211 event pairs, 23 based on Foata normal form. 2/422 useless extension candidates. Maximal degree in co-relation 2214. Up to 307 conditions per place. [2022-12-06 04:25:29,927 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 69 transitions, 734 flow [2022-12-06 04:25:29,927 INFO L188 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-06 04:25:29,949 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:29,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 04:25:29,950 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 69 transitions, 734 flow [2022-12-06 04:25:29,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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:25:29,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:29,950 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:29,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:25:29,950 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:25:29,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:29,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1450965225, now seen corresponding path program 1 times [2022-12-06 04:25:29,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:29,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143762948] [2022-12-06 04:25:29,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:29,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:30,538 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:25:30,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:30,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143762948] [2022-12-06 04:25:30,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143762948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:30,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:30,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:25:30,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449549242] [2022-12-06 04:25:30,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:30,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:25:30,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:30,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:25:30,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:25:30,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:25:30,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 69 transitions, 734 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:25:30,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:30,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:25:30,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:30,915 INFO L130 PetriNetUnfolder]: 1079/1695 cut-off events. [2022-12-06 04:25:30,915 INFO L131 PetriNetUnfolder]: For 8896/8896 co-relation queries the response was YES. [2022-12-06 04:25:30,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8736 conditions, 1695 events. 1079/1695 cut-off events. For 8896/8896 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7788 event pairs, 269 based on Foata normal form. 12/1707 useless extension candidates. Maximal degree in co-relation 8704. Up to 1338 conditions per place. [2022-12-06 04:25:30,925 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 80 selfloop transitions, 25 changer transitions 6/111 dead transitions. [2022-12-06 04:25:30,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 111 transitions, 1283 flow [2022-12-06 04:25:30,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:25:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:25:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-06 04:25:30,926 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:25:30,926 INFO L175 Difference]: Start difference. First operand has 65 places, 69 transitions, 734 flow. Second operand 5 states and 70 transitions. [2022-12-06 04:25:30,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 111 transitions, 1283 flow [2022-12-06 04:25:30,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 111 transitions, 1189 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-06 04:25:30,942 INFO L231 Difference]: Finished difference. Result has 68 places, 80 transitions, 861 flow [2022-12-06 04:25:30,943 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=861, PETRI_PLACES=68, PETRI_TRANSITIONS=80} [2022-12-06 04:25:30,943 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 31 predicate places. [2022-12-06 04:25:30,943 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:30,943 INFO L89 Accepts]: Start accepts. Operand has 68 places, 80 transitions, 861 flow [2022-12-06 04:25:30,946 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:30,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:30,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 80 transitions, 861 flow [2022-12-06 04:25:30,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 80 transitions, 861 flow [2022-12-06 04:25:30,997 INFO L130 PetriNetUnfolder]: 198/427 cut-off events. [2022-12-06 04:25:30,997 INFO L131 PetriNetUnfolder]: For 2708/2740 co-relation queries the response was YES. [2022-12-06 04:25:30,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2513 conditions, 427 events. 198/427 cut-off events. For 2708/2740 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2276 event pairs, 15 based on Foata normal form. 2/427 useless extension candidates. Maximal degree in co-relation 2482. Up to 300 conditions per place. [2022-12-06 04:25:31,001 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 80 transitions, 861 flow [2022-12-06 04:25:31,001 INFO L188 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-06 04:25:31,004 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:31,004 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 04:25:31,004 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 80 transitions, 861 flow [2022-12-06 04:25:31,004 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:25:31,004 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:31,005 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:31,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:25:31,005 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:25:31,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:31,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1617648028, now seen corresponding path program 1 times [2022-12-06 04:25:31,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:31,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672485576] [2022-12-06 04:25:31,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:31,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:31,530 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:25:31,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:31,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672485576] [2022-12-06 04:25:31,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672485576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:31,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:31,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:25:31,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190141227] [2022-12-06 04:25:31,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:31,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:25:31,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:31,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:25:31,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:25:31,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:25:31,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 80 transitions, 861 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:31,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:31,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:25:31,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:31,973 INFO L130 PetriNetUnfolder]: 1046/1680 cut-off events. [2022-12-06 04:25:31,973 INFO L131 PetriNetUnfolder]: For 11256/11256 co-relation queries the response was YES. [2022-12-06 04:25:31,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9254 conditions, 1680 events. 1046/1680 cut-off events. For 11256/11256 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8030 event pairs, 184 based on Foata normal form. 12/1692 useless extension candidates. Maximal degree in co-relation 9220. Up to 1069 conditions per place. [2022-12-06 04:25:31,984 INFO L137 encePairwiseOnDemand]: 12/28 looper letters, 76 selfloop transitions, 51 changer transitions 3/130 dead transitions. [2022-12-06 04:25:31,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 130 transitions, 1550 flow [2022-12-06 04:25:31,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:25:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:25:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-12-06 04:25:31,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36607142857142855 [2022-12-06 04:25:31,986 INFO L175 Difference]: Start difference. First operand has 68 places, 80 transitions, 861 flow. Second operand 8 states and 82 transitions. [2022-12-06 04:25:31,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 130 transitions, 1550 flow [2022-12-06 04:25:32,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 130 transitions, 1507 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 04:25:32,007 INFO L231 Difference]: Finished difference. Result has 75 places, 93 transitions, 1165 flow [2022-12-06 04:25:32,007 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1165, PETRI_PLACES=75, PETRI_TRANSITIONS=93} [2022-12-06 04:25:32,008 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2022-12-06 04:25:32,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:32,008 INFO L89 Accepts]: Start accepts. Operand has 75 places, 93 transitions, 1165 flow [2022-12-06 04:25:32,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:32,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:32,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 93 transitions, 1165 flow [2022-12-06 04:25:32,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 93 transitions, 1165 flow [2022-12-06 04:25:32,063 INFO L130 PetriNetUnfolder]: 192/424 cut-off events. [2022-12-06 04:25:32,063 INFO L131 PetriNetUnfolder]: For 3296/3330 co-relation queries the response was YES. [2022-12-06 04:25:32,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2818 conditions, 424 events. 192/424 cut-off events. For 3296/3330 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2337 event pairs, 16 based on Foata normal form. 2/424 useless extension candidates. Maximal degree in co-relation 2785. Up to 298 conditions per place. [2022-12-06 04:25:32,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 93 transitions, 1165 flow [2022-12-06 04:25:32,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 04:25:32,072 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:32,073 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-06 04:25:32,073 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 93 transitions, 1165 flow [2022-12-06 04:25:32,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:32,073 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:32,073 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:32,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:25:32,074 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:25:32,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:32,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1560461243, now seen corresponding path program 1 times [2022-12-06 04:25:32,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:32,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155589454] [2022-12-06 04:25:32,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:32,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:32,235 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:25:32,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:32,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155589454] [2022-12-06 04:25:32,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155589454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:32,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:32,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:25:32,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382312964] [2022-12-06 04:25:32,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:32,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:25:32,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:32,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:25:32,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:25:32,236 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 04:25:32,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 93 transitions, 1165 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:32,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:32,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 04:25:32,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:32,466 INFO L130 PetriNetUnfolder]: 799/1399 cut-off events. [2022-12-06 04:25:32,466 INFO L131 PetriNetUnfolder]: For 16442/16470 co-relation queries the response was YES. [2022-12-06 04:25:32,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8285 conditions, 1399 events. 799/1399 cut-off events. For 16442/16470 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7540 event pairs, 105 based on Foata normal form. 179/1571 useless extension candidates. Maximal degree in co-relation 8249. Up to 685 conditions per place. [2022-12-06 04:25:32,472 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 139 selfloop transitions, 5 changer transitions 9/156 dead transitions. [2022-12-06 04:25:32,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 156 transitions, 2271 flow [2022-12-06 04:25:32,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:25:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:25:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 04:25:32,474 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5803571428571429 [2022-12-06 04:25:32,474 INFO L175 Difference]: Start difference. First operand has 75 places, 93 transitions, 1165 flow. Second operand 4 states and 65 transitions. [2022-12-06 04:25:32,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 156 transitions, 2271 flow [2022-12-06 04:25:32,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 156 transitions, 2172 flow, removed 39 selfloop flow, removed 4 redundant places. [2022-12-06 04:25:32,492 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 948 flow [2022-12-06 04:25:32,492 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=948, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2022-12-06 04:25:32,493 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 39 predicate places. [2022-12-06 04:25:32,493 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:32,493 INFO L89 Accepts]: Start accepts. Operand has 76 places, 80 transitions, 948 flow [2022-12-06 04:25:32,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:32,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:32,494 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 80 transitions, 948 flow [2022-12-06 04:25:32,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 80 transitions, 948 flow [2022-12-06 04:25:32,546 INFO L130 PetriNetUnfolder]: 208/479 cut-off events. [2022-12-06 04:25:32,546 INFO L131 PetriNetUnfolder]: For 4235/4330 co-relation queries the response was YES. [2022-12-06 04:25:32,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3046 conditions, 479 events. 208/479 cut-off events. For 4235/4330 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 2882 event pairs, 49 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 3012. Up to 298 conditions per place. [2022-12-06 04:25:32,550 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 80 transitions, 948 flow [2022-12-06 04:25:32,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 326 [2022-12-06 04:26:03,148 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [391] L771-->L774: Formula: (= v_~y~0_3 1) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] and [497] $Ultimate##0-->L751: Formula: (and (= v_~y$w_buff0_used~0_404 1) (= |v_P0Thread1of1ForFork2_~arg#1.offset_7| |v_P0Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_185 v_~y$r_buff1_thd3~0_181) (= v_~y$r_buff0_thd1~0_71 v_~y$r_buff1_thd1~0_49) (= v_~y$r_buff0_thd2~0_53 v_~y$r_buff1_thd2~0_55) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_15| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_404 256) 0)) (not (= (mod v_~y$w_buff1_used~0_370 256) 0)))) 1 0)) (= v_~y$r_buff0_thd0~0_172 v_~y$r_buff1_thd0~0_164) (= |v_P0Thread1of1ForFork2_~arg#1.base_7| |v_P0Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~y$r_buff0_thd1~0_70 1) (= v_~y$w_buff1~0_231 v_~y$w_buff0~0_248) (= 2 v_~y$w_buff0~0_247) (= v_~y$w_buff0_used~0_405 v_~y$w_buff1_used~0_370) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_15| 0)) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_15| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_15|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_405, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_172, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_71, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_404, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_15|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_7|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_55, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_49, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_181, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_15|, ~y$w_buff1~0=v_~y$w_buff1~0_231, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_172, ~y$w_buff0~0=v_~y$w_buff0~0_247, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_70, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_164, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_370} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:26:03,237 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [391] L771-->L774: Formula: (= v_~y~0_3 1) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] and [515] $Ultimate##0-->L751: Formula: (let ((.cse3 (= (mod v_~y$r_buff0_thd3~0_329 256) 0))) (let ((.cse7 (not .cse3)) (.cse4 (and .cse3 (= (mod v_~y$r_buff1_thd3~0_330 256) 0))) (.cse5 (and (= (mod v_~y$w_buff1_used~0_661 256) 0) .cse3)) (.cse10 (= (mod v_~y$w_buff0_used~0_731 256) 0))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_225 256) 0))) (.cse8 (or .cse4 .cse5 .cse10)) (.cse9 (and (not .cse10) .cse7))) (let ((.cse1 (ite .cse8 v_~y~0_619 (ite .cse9 v_~y$w_buff0~0_494 v_~y$w_buff1~0_449))) (.cse2 (ite .cse0 v_~y$w_buff0_used~0_731 (ite .cse8 v_~y$w_buff0_used~0_731 (ite .cse9 0 v_~y$w_buff0_used~0_731))))) (and (= v_~y~0_619 v_~y$mem_tmp~0_193) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_70| 0)) (= (ite .cse0 v_~y$mem_tmp~0_193 .cse1) v_~y~0_618) (= v_~y$w_buff1~0_447 v_~y$w_buff0~0_494) (= .cse1 v_~__unbuffered_p2_EAX~0_114) (= (ite (not (and (not (= 0 (mod v_~y$w_buff0_used~0_729 256))) (not (= (mod v_~y$w_buff1_used~0_659 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_70|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_70| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_70|) (= v_P2Thread1of1ForFork1_~arg.offset_21 |v_P2Thread1of1ForFork1_#in~arg.offset_21|) (= v_~y$r_buff0_thd0~0_280 v_~y$r_buff1_thd0~0_277) (= 2 v_~y$w_buff0~0_492) (= v_~y$w_buff1_used~0_659 .cse2) (= v_~y$w_buff0_used~0_729 1) (= |v_P2Thread1of1ForFork1_#t~nondet3_54| v_~weak$$choice0~0_154) (= v_~y$r_buff0_thd1~0_218 1) (= v_~y$r_buff0_thd3~0_328 v_~y$r_buff1_thd3~0_328) (= (ite .cse0 v_~y$r_buff0_thd3~0_329 (let ((.cse6 (= (mod .cse2 256) 0))) (ite (or (and .cse3 (= (mod (ite .cse0 v_~y$w_buff1_used~0_661 (ite (or .cse4 .cse5 .cse6) v_~y$w_buff1_used~0_661 0)) 256) 0)) .cse4 .cse6) v_~y$r_buff0_thd3~0_329 (ite (and (not .cse6) .cse7) 0 v_~y$r_buff0_thd3~0_329)))) v_~y$r_buff0_thd3~0_328) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_62| |v_P0Thread1of1ForFork2_~arg#1.base_62|) (= v_~y$r_buff0_thd2~0_118 v_~y$r_buff1_thd2~0_121) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_62| |v_P0Thread1of1ForFork2_~arg#1.offset_62|) (= v_P2Thread1of1ForFork1_~arg.base_21 |v_P2Thread1of1ForFork1_#in~arg.base_21|) (= v_~weak$$choice2~0_225 |v_P2Thread1of1ForFork1_#t~nondet4_54|) (= v_~y$flush_delayed~0_218 0) (= v_~y$r_buff0_thd1~0_219 v_~y$r_buff1_thd1~0_156)))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_731, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_62|, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_54|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_62|, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_54|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_330, ~y$w_buff1~0=v_~y$w_buff1~0_449, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_329, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_280, ~y$w_buff0~0=v_~y$w_buff0~0_494, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_118, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_619, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_661} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_729, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_70|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_62|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_62|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_156, ~y$mem_tmp~0=v_~y$mem_tmp~0_193, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_328, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_70|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_21, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_328, ~y$w_buff0~0=v_~y$w_buff0~0_492, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_218, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, ~y~0=v_~y~0_618, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_21, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_62|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_62|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ~weak$$choice0~0=v_~weak$$choice0~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_447, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_280, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_118, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~weak$$choice2~0=v_~weak$$choice2~0_225, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_277, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_659} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#t~nondet3, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P2Thread1of1ForFork1_#t~nondet4, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1~0, P2Thread1of1ForFork1_~arg.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:26:03,456 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [391] L771-->L774: Formula: (= v_~y~0_3 1) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] and [476] $Ultimate##0-->L804: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd3~0_156 256) 0)) (.cse2 (= (mod v_~y$r_buff0_thd3~0_160 256) 0))) (let ((.cse5 (not .cse2)) (.cse12 (= (mod v_~y$w_buff0_used~0_314 256) 0)) (.cse9 (and .cse2 (= (mod v_~y$w_buff1_used~0_283 256) 0))) (.cse4 (and .cse2 .cse11))) (let ((.cse7 (or .cse12 .cse9 .cse4)) (.cse8 (and .cse5 (not .cse12)))) (let ((.cse6 (ite .cse7 v_~y~0_255 (ite .cse8 v_~y$w_buff0~0_180 v_~y$w_buff1~0_169))) (.cse0 (not (= (mod v_~weak$$choice2~0_124 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_313 256) 0)) (.cse3 (= (mod v_~y$w_buff1_used~0_282 256) 0))) (and (= (ite .cse0 v_~y$r_buff0_thd3~0_160 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~y$r_buff0_thd3~0_160 (ite (and (not .cse1) .cse5) 0 v_~y$r_buff0_thd3~0_160))) v_~y$r_buff0_thd3~0_159) (= v_~weak$$choice2~0_124 |v_P2Thread1of1ForFork1_#t~nondet4_22|) (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_254 (ite .cse0 v_~y$mem_tmp~0_90 .cse6)) (= v_~y$w_buff1~0_169 v_~y$w_buff1~0_168) (= |v_P2Thread1of1ForFork1_#t~nondet3_22| v_~weak$$choice0~0_53) (= v_~y$w_buff0_used~0_313 (ite .cse0 v_~y$w_buff0_used~0_314 (ite .cse7 v_~y$w_buff0_used~0_314 (ite .cse8 0 v_~y$w_buff0_used~0_314)))) (= .cse6 v_~__unbuffered_p2_EAX~0_54) (= (ite .cse0 v_~y$w_buff1_used~0_283 (ite (or .cse1 .cse9 .cse4) v_~y$w_buff1_used~0_283 0)) v_~y$w_buff1_used~0_282) (= v_~y$flush_delayed~0_115 0) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= v_~y$r_buff1_thd3~0_155 (ite .cse0 v_~y$r_buff1_thd3~0_156 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_159 256) 0))) (or .cse1 (and .cse10 .cse3) (and .cse10 .cse11))) v_~y$r_buff1_thd3~0_156 0))) (= v_~y~0_255 v_~y$mem_tmp~0_90) (= v_~y$w_buff0~0_180 v_~y$w_buff0~0_179)))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_156, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_314, ~y$w_buff1~0=v_~y$w_buff1~0_169, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_160, ~y$w_buff0~0=v_~y$w_buff0~0_180, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_22|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_22|, ~y~0=v_~y~0_255, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_283} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_313, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_53, ~y$mem_tmp~0=v_~y$mem_tmp~0_90, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_155, ~y$w_buff1~0=v_~y$w_buff1~0_168, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_159, ~y$w_buff0~0=v_~y$w_buff0~0_179, ~y$flush_delayed~0=v_~y$flush_delayed~0_115, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_254, ~weak$$choice2~0=v_~weak$$choice2~0_124, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_282} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#t~nondet3, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork1_~arg.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 04:26:03,604 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:26:03,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31111 [2022-12-06 04:26:03,605 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 950 flow [2022-12-06 04:26:03,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:26:03,605 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:26:03,605 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:26:03,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:26:03,605 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:26:03,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:26:03,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1607577078, now seen corresponding path program 1 times [2022-12-06 04:26:03,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:26:03,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744599685] [2022-12-06 04:26:03,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:26:03,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:26:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:26:04,229 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:26:04,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:26:04,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744599685] [2022-12-06 04:26:04,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744599685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:26:04,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:26:04,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:26:04,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723396801] [2022-12-06 04:26:04,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:26:04,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:26:04,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:26:04,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:26:04,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:26:04,231 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 04:26:04,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 950 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:26:04,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:26:04,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 04:26:04,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:26:04,612 INFO L130 PetriNetUnfolder]: 613/1090 cut-off events. [2022-12-06 04:26:04,612 INFO L131 PetriNetUnfolder]: For 9761/9761 co-relation queries the response was YES. [2022-12-06 04:26:04,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7001 conditions, 1090 events. 613/1090 cut-off events. For 9761/9761 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5302 event pairs, 98 based on Foata normal form. 5/1095 useless extension candidates. Maximal degree in co-relation 6964. Up to 712 conditions per place. [2022-12-06 04:26:04,620 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 74 selfloop transitions, 31 changer transitions 6/111 dead transitions. [2022-12-06 04:26:04,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 111 transitions, 1456 flow [2022-12-06 04:26:04,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:26:04,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:26:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-12-06 04:26:04,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-06 04:26:04,621 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 950 flow. Second operand 6 states and 65 transitions. [2022-12-06 04:26:04,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 111 transitions, 1456 flow [2022-12-06 04:26:04,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 111 transitions, 1369 flow, removed 35 selfloop flow, removed 3 redundant places. [2022-12-06 04:26:04,638 INFO L231 Difference]: Finished difference. Result has 79 places, 81 transitions, 1050 flow [2022-12-06 04:26:04,638 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1050, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2022-12-06 04:26:04,638 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 42 predicate places. [2022-12-06 04:26:04,638 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:26:04,638 INFO L89 Accepts]: Start accepts. Operand has 79 places, 81 transitions, 1050 flow [2022-12-06 04:26:04,639 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:26:04,639 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:04,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 81 transitions, 1050 flow [2022-12-06 04:26:04,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 81 transitions, 1050 flow [2022-12-06 04:26:04,694 INFO L130 PetriNetUnfolder]: 202/478 cut-off events. [2022-12-06 04:26:04,694 INFO L131 PetriNetUnfolder]: For 4081/4137 co-relation queries the response was YES. [2022-12-06 04:26:04,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 478 events. 202/478 cut-off events. For 4081/4137 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2954 event pairs, 51 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 2932. Up to 262 conditions per place. [2022-12-06 04:26:04,699 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 81 transitions, 1050 flow [2022-12-06 04:26:04,699 INFO L188 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-06 04:26:04,702 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:26:04,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-06 04:26:04,703 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 1050 flow [2022-12-06 04:26:04,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:26:04,703 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:26:04,703 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:26:04,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:26:04,703 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:26:04,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:26:04,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1601648669, now seen corresponding path program 1 times [2022-12-06 04:26:04,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:26:04,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10285117] [2022-12-06 04:26:04,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:26:04,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:26:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:26:05,527 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:26:05,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:26:05,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10285117] [2022-12-06 04:26:05,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10285117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:26:05,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:26:05,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:26:05,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287135267] [2022-12-06 04:26:05,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:26:05,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:26:05,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:26:05,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:26:05,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:26:05,529 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:26:05,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 1050 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:26:05,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:26:05,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:26:05,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:26:05,865 INFO L130 PetriNetUnfolder]: 656/1174 cut-off events. [2022-12-06 04:26:05,865 INFO L131 PetriNetUnfolder]: For 11413/11413 co-relation queries the response was YES. [2022-12-06 04:26:05,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7426 conditions, 1174 events. 656/1174 cut-off events. For 11413/11413 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5888 event pairs, 113 based on Foata normal form. 18/1192 useless extension candidates. Maximal degree in co-relation 7388. Up to 762 conditions per place. [2022-12-06 04:26:05,871 INFO L137 encePairwiseOnDemand]: 15/29 looper letters, 71 selfloop transitions, 27 changer transitions 25/123 dead transitions. [2022-12-06 04:26:05,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 123 transitions, 1646 flow [2022-12-06 04:26:05,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:26:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:26:05,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-12-06 04:26:05,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 04:26:05,873 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 1050 flow. Second operand 6 states and 68 transitions. [2022-12-06 04:26:05,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 123 transitions, 1646 flow [2022-12-06 04:26:05,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 123 transitions, 1631 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:26:05,889 INFO L231 Difference]: Finished difference. Result has 84 places, 73 transitions, 1037 flow [2022-12-06 04:26:05,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1037, PETRI_PLACES=84, PETRI_TRANSITIONS=73} [2022-12-06 04:26:05,890 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 47 predicate places. [2022-12-06 04:26:05,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:26:05,890 INFO L89 Accepts]: Start accepts. Operand has 84 places, 73 transitions, 1037 flow [2022-12-06 04:26:05,891 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:26:05,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:05,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 73 transitions, 1037 flow [2022-12-06 04:26:05,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 73 transitions, 1037 flow [2022-12-06 04:26:05,948 INFO L130 PetriNetUnfolder]: 179/449 cut-off events. [2022-12-06 04:26:05,948 INFO L131 PetriNetUnfolder]: For 4285/4367 co-relation queries the response was YES. [2022-12-06 04:26:05,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2872 conditions, 449 events. 179/449 cut-off events. For 4285/4367 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 2891 event pairs, 59 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 2834. Up to 232 conditions per place. [2022-12-06 04:26:05,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 73 transitions, 1037 flow [2022-12-06 04:26:05,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-06 04:26:06,411 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [398] L804-->L820: Formula: (let ((.cse8 (= 0 (mod v_~y$r_buff1_thd3~0_82 256))) (.cse3 (= (mod v_~y$r_buff0_thd3~0_86 256) 0))) (let ((.cse6 (not .cse3)) (.cse11 (and (= (mod v_~y$w_buff1_used~0_139 256) 0) .cse3)) (.cse12 (= (mod v_~y$w_buff0_used~0_156 256) 0)) (.cse5 (and .cse3 .cse8))) (let ((.cse9 (or .cse11 .cse12 .cse5)) (.cse10 (and (not .cse12) .cse6))) (let ((.cse1 (ite .cse9 v_~y~0_120 (ite .cse10 v_~y$w_buff0~0_62 v_~y$w_buff1~0_71))) (.cse4 (= (mod v_~y$w_buff1_used~0_138 256) 0)) (.cse0 (not (= 0 (mod v_~weak$$choice2~0_78 256)))) (.cse2 (= (mod v_~y$w_buff0_used~0_155 256) 0))) (and (= v_~y$w_buff1~0_71 v_~y$w_buff1~0_70) (= v_~y~0_119 (ite .cse0 v_~y$mem_tmp~0_46 .cse1)) (= v_~__unbuffered_p2_EBX~0_20 .cse1) (= 0 v_~y$flush_delayed~0_67) (= v_~y$w_buff0~0_62 v_~y$w_buff0~0_61) (= v_~y$r_buff0_thd3~0_85 (ite .cse0 v_~y$r_buff0_thd3~0_86 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~y$r_buff0_thd3~0_86 (ite (and (not .cse2) .cse6) 0 v_~y$r_buff0_thd3~0_86)))) (= (ite .cse0 v_~y$r_buff1_thd3~0_82 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd3~0_85 256) 0))) (or .cse2 (and .cse7 .cse4) (and .cse7 .cse8))) v_~y$r_buff1_thd3~0_82 0)) v_~y$r_buff1_thd3~0_81) (= |v_P2Thread1of1ForFork1_#t~nondet6_1| v_~weak$$choice2~0_78) (= |v_P2Thread1of1ForFork1_#t~nondet5_1| v_~weak$$choice0~0_15) (= v_~y~0_120 v_~y$mem_tmp~0_46) (= (ite .cse0 v_~y$w_buff0_used~0_156 (ite .cse9 v_~y$w_buff0_used~0_156 (ite .cse10 0 v_~y$w_buff0_used~0_156))) v_~y$w_buff0_used~0_155) (= (ite .cse0 v_~y$w_buff1_used~0_139 (ite (or .cse11 .cse2 .cse5) v_~y$w_buff1_used~0_139 0)) v_~y$w_buff1_used~0_138)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_82, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_156, ~y$w_buff1~0=v_~y$w_buff1~0_71, P2Thread1of1ForFork1_#t~nondet6=|v_P2Thread1of1ForFork1_#t~nondet6_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_62, P2Thread1of1ForFork1_#t~nondet5=|v_P2Thread1of1ForFork1_#t~nondet5_1|, ~y~0=v_~y~0_120, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_139} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_155, ~weak$$choice0~0=v_~weak$$choice0~0_15, ~y$mem_tmp~0=v_~y$mem_tmp~0_46, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_81, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y$flush_delayed~0=v_~y$flush_delayed~0_67, ~y~0=v_~y~0_119, ~weak$$choice2~0=v_~weak$$choice2~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_138} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~nondet6, P2Thread1of1ForFork1_#t~nondet5, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] and [392] L774-->L781: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_173 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0)))) (let ((.cse0 (and (not (= 0 (mod v_~y$w_buff0_used~0_174 256))) .cse5)) (.cse2 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_157 256) 0)) .cse4))) (and (= v_~y~0_133 (ite .cse0 v_~y$w_buff0~0_71 (ite .cse1 v_~y$w_buff1~0_80 v_~y~0_134))) (= (ite .cse2 0 v_~y$r_buff0_thd2~0_22) v_~y$r_buff0_thd2~0_21) (= v_~y$w_buff0_used~0_173 (ite .cse0 0 v_~y$w_buff0_used~0_174)) (= v_~y$w_buff1_used~0_156 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_157)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_156 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_174, ~y$w_buff1~0=v_~y$w_buff1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_71, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_134, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_157} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_173, ~y$w_buff1~0=v_~y$w_buff1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_71, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_133, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_156} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:26:06,880 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] L751-->L771: Formula: (and (= 2 v_~x~0_109) (= v_P1Thread1of1ForFork0_~arg.base_19 |v_P1Thread1of1ForFork0_#in~arg.base_19|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_19| v_P1Thread1of1ForFork0_~arg.offset_19)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_19|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_19|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_19, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_19, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_19|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_19|, ~x~0=v_~x~0_109} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] and [385] L754-->L761: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_31 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_207 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_208 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_189 256) 0)) .cse1))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd1~0_30 256)))) (and (not (= (mod v_~y$w_buff1_used~0_188 256) 0)) .cse1)) 0 v_~y$r_buff1_thd1~0_20) v_~y$r_buff1_thd1~0_19) (= v_~y$w_buff0_used~0_207 (ite .cse2 0 v_~y$w_buff0_used~0_208)) (= (ite .cse3 0 v_~y$r_buff0_thd1~0_31) v_~y$r_buff0_thd1~0_30) (= v_~y$w_buff1_used~0_188 (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_189)) (= v_~y~0_167 (ite .cse2 v_~y$w_buff0~0_97 (ite .cse4 v_~y$w_buff1~0_102 v_~y~0_168)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_208, ~y$w_buff1~0=v_~y$w_buff1~0_102, ~y$w_buff0~0=v_~y$w_buff0~0_97, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_31, ~y~0=v_~y~0_168, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_189} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_207, ~y$w_buff1~0=v_~y$w_buff1~0_102, ~y$w_buff0~0=v_~y$w_buff0~0_97, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y~0=v_~y~0_167, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_188} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:26:06,957 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:26:06,957 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1067 [2022-12-06 04:26:06,958 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 1042 flow [2022-12-06 04:26:06,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:26:06,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:26:06,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:26:06,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:26:06,958 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:26:06,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:26:06,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1960702071, now seen corresponding path program 1 times [2022-12-06 04:26:06,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:26:06,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021419648] [2022-12-06 04:26:06,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:26:06,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:26:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:26:08,166 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:26:08,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:26:08,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021419648] [2022-12-06 04:26:08,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021419648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:26:08,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:26:08,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:26:08,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73331870] [2022-12-06 04:26:08,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:26:08,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:26:08,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:26:08,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:26:08,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:26:08,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 04:26:08,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 1042 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:26:08,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:26:08,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 04:26:08,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:26:08,667 INFO L130 PetriNetUnfolder]: 608/1152 cut-off events. [2022-12-06 04:26:08,668 INFO L131 PetriNetUnfolder]: For 12349/12349 co-relation queries the response was YES. [2022-12-06 04:26:08,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7711 conditions, 1152 events. 608/1152 cut-off events. For 12349/12349 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6125 event pairs, 176 based on Foata normal form. 3/1155 useless extension candidates. Maximal degree in co-relation 7670. Up to 776 conditions per place. [2022-12-06 04:26:08,674 INFO L137 encePairwiseOnDemand]: 17/30 looper letters, 66 selfloop transitions, 16 changer transitions 48/130 dead transitions. [2022-12-06 04:26:08,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 130 transitions, 1835 flow [2022-12-06 04:26:08,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:26:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:26:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-12-06 04:26:08,675 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-06 04:26:08,675 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 1042 flow. Second operand 7 states and 80 transitions. [2022-12-06 04:26:08,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 130 transitions, 1835 flow [2022-12-06 04:26:08,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 130 transitions, 1736 flow, removed 23 selfloop flow, removed 5 redundant places. [2022-12-06 04:26:08,690 INFO L231 Difference]: Finished difference. Result has 87 places, 58 transitions, 855 flow [2022-12-06 04:26:08,690 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=855, PETRI_PLACES=87, PETRI_TRANSITIONS=58} [2022-12-06 04:26:08,691 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 50 predicate places. [2022-12-06 04:26:08,691 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:26:08,691 INFO L89 Accepts]: Start accepts. Operand has 87 places, 58 transitions, 855 flow [2022-12-06 04:26:08,692 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:26:08,692 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:08,692 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 58 transitions, 855 flow [2022-12-06 04:26:08,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 58 transitions, 855 flow [2022-12-06 04:26:08,737 INFO L130 PetriNetUnfolder]: 169/414 cut-off events. [2022-12-06 04:26:08,738 INFO L131 PetriNetUnfolder]: For 3907/3981 co-relation queries the response was YES. [2022-12-06 04:26:08,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2660 conditions, 414 events. 169/414 cut-off events. For 3907/3981 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 2545 event pairs, 56 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 2623. Up to 215 conditions per place. [2022-12-06 04:26:08,741 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 58 transitions, 855 flow [2022-12-06 04:26:08,741 INFO L188 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-06 04:26:08,744 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:26:08,745 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 04:26:08,745 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 58 transitions, 855 flow [2022-12-06 04:26:08,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:26:08,745 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:26:08,745 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:26:08,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 04:26:08,745 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:26:08,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:26:08,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1242524631, now seen corresponding path program 1 times [2022-12-06 04:26:08,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:26:08,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217903569] [2022-12-06 04:26:08,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:26:08,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:26:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:26:08,888 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:26:08,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:26:08,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217903569] [2022-12-06 04:26:08,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217903569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:26:08,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:26:08,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:26:08,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198808755] [2022-12-06 04:26:08,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:26:08,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:26:08,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:26:08,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:26:08,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:26:08,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:26:08,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 58 transitions, 855 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:26:08,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:26:08,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:26:08,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:26:09,053 INFO L130 PetriNetUnfolder]: 339/679 cut-off events. [2022-12-06 04:26:09,053 INFO L131 PetriNetUnfolder]: For 10831/10847 co-relation queries the response was YES. [2022-12-06 04:26:09,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4430 conditions, 679 events. 339/679 cut-off events. For 10831/10847 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3473 event pairs, 24 based on Foata normal form. 98/774 useless extension candidates. Maximal degree in co-relation 4390. Up to 286 conditions per place. [2022-12-06 04:26:09,057 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 91 selfloop transitions, 8 changer transitions 19/120 dead transitions. [2022-12-06 04:26:09,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 120 transitions, 2005 flow [2022-12-06 04:26:09,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:26:09,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:26:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-06 04:26:09,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 04:26:09,059 INFO L175 Difference]: Start difference. First operand has 80 places, 58 transitions, 855 flow. Second operand 5 states and 65 transitions. [2022-12-06 04:26:09,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 120 transitions, 2005 flow [2022-12-06 04:26:09,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 120 transitions, 1883 flow, removed 15 selfloop flow, removed 14 redundant places. [2022-12-06 04:26:09,067 INFO L231 Difference]: Finished difference. Result has 72 places, 57 transitions, 755 flow [2022-12-06 04:26:09,068 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=755, PETRI_PLACES=72, PETRI_TRANSITIONS=57} [2022-12-06 04:26:09,068 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 35 predicate places. [2022-12-06 04:26:09,068 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:26:09,068 INFO L89 Accepts]: Start accepts. Operand has 72 places, 57 transitions, 755 flow [2022-12-06 04:26:09,069 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:26:09,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:09,069 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 57 transitions, 755 flow [2022-12-06 04:26:09,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 57 transitions, 755 flow [2022-12-06 04:26:09,094 INFO L130 PetriNetUnfolder]: 70/227 cut-off events. [2022-12-06 04:26:09,094 INFO L131 PetriNetUnfolder]: For 1817/1861 co-relation queries the response was YES. [2022-12-06 04:26:09,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 227 events. 70/227 cut-off events. For 1817/1861 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1177 event pairs, 8 based on Foata normal form. 11/231 useless extension candidates. Maximal degree in co-relation 1462. Up to 106 conditions per place. [2022-12-06 04:26:09,096 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 57 transitions, 755 flow [2022-12-06 04:26:09,096 INFO L188 LiptonReduction]: Number of co-enabled transitions 252 [2022-12-06 04:26:09,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [522] L751-->L761: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd1~0_163 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_763 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd1~0_231 256))))) (let ((.cse0 (and .cse3 .cse5)) (.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_692 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_764 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd1~0_231) v_~y$r_buff0_thd1~0_230) (= v_~y$w_buff1_used~0_691 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_692)) (= v_~y~0_648 (ite .cse2 v_~y$w_buff0~0_520 (ite .cse1 v_~y$w_buff1~0_473 v_~y~0_649))) (= (ite .cse2 0 v_~y$w_buff0_used~0_764) v_~y$w_buff0_used~0_763) (= 2 v_~x~0_121) (= |v_P1Thread1of1ForFork0_#in~arg.offset_25| v_P1Thread1of1ForFork0_~arg.offset_25) (= v_P1Thread1of1ForFork0_~arg.base_25 |v_P1Thread1of1ForFork0_#in~arg.base_25|) (= v_~y$r_buff1_thd1~0_162 (ite (or (and (not (= (mod v_~y$r_buff0_thd1~0_230 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_691 256) 0)) .cse4)) 0 v_~y$r_buff1_thd1~0_163))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_163, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_764, ~y$w_buff1~0=v_~y$w_buff1~0_473, ~y$w_buff0~0=v_~y$w_buff0~0_520, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_25|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_231, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_25|, ~y~0=v_~y~0_649, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_692} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_162, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_763, ~y$w_buff1~0=v_~y$w_buff1~0_473, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_25, ~y$w_buff0~0=v_~y$w_buff0~0_520, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_25|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_230, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_25|, ~y~0=v_~y~0_648, ~x~0=v_~x~0_121, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_691} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P1Thread1of1ForFork0_~arg.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, ~y$r_buff0_thd1~0, ~y~0, ~x~0, ~y$w_buff1_used~0] and [391] L771-->L774: Formula: (= v_~y~0_3 1) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] [2022-12-06 04:26:09,208 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:26:09,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-06 04:26:09,208 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 757 flow [2022-12-06 04:26:09,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:26:09,209 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:26:09,209 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:26:09,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 04:26:09,209 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:26:09,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:26:09,209 INFO L85 PathProgramCache]: Analyzing trace with hash -735548524, now seen corresponding path program 1 times [2022-12-06 04:26:09,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:26:09,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948622538] [2022-12-06 04:26:09,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:26:09,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:26:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:26:10,680 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:26:10,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:26:10,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948622538] [2022-12-06 04:26:10,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948622538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:26:10,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:26:10,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 04:26:10,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750222809] [2022-12-06 04:26:10,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:26:10,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 04:26:10,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:26:10,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 04:26:10,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-06 04:26:10,682 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:26:10,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 57 transitions, 757 flow. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:26:10,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:26:10,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:26:10,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:26:11,075 INFO L130 PetriNetUnfolder]: 259/535 cut-off events. [2022-12-06 04:26:11,075 INFO L131 PetriNetUnfolder]: For 5410/5410 co-relation queries the response was YES. [2022-12-06 04:26:11,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3749 conditions, 535 events. 259/535 cut-off events. For 5410/5410 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2436 event pairs, 53 based on Foata normal form. 6/541 useless extension candidates. Maximal degree in co-relation 3716. Up to 220 conditions per place. [2022-12-06 04:26:11,078 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 44 selfloop transitions, 10 changer transitions 42/96 dead transitions. [2022-12-06 04:26:11,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 96 transitions, 1311 flow [2022-12-06 04:26:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:26:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:26:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-12-06 04:26:11,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34523809523809523 [2022-12-06 04:26:11,080 INFO L175 Difference]: Start difference. First operand has 72 places, 57 transitions, 757 flow. Second operand 7 states and 58 transitions. [2022-12-06 04:26:11,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 96 transitions, 1311 flow [2022-12-06 04:26:11,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 96 transitions, 1183 flow, removed 37 selfloop flow, removed 6 redundant places. [2022-12-06 04:26:11,088 INFO L231 Difference]: Finished difference. Result has 75 places, 42 transitions, 515 flow [2022-12-06 04:26:11,088 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=515, PETRI_PLACES=75, PETRI_TRANSITIONS=42} [2022-12-06 04:26:11,089 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2022-12-06 04:26:11,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:26:11,089 INFO L89 Accepts]: Start accepts. Operand has 75 places, 42 transitions, 515 flow [2022-12-06 04:26:11,090 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:26:11,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:11,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 42 transitions, 515 flow [2022-12-06 04:26:11,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 42 transitions, 515 flow [2022-12-06 04:26:11,103 INFO L130 PetriNetUnfolder]: 28/98 cut-off events. [2022-12-06 04:26:11,103 INFO L131 PetriNetUnfolder]: For 722/731 co-relation queries the response was YES. [2022-12-06 04:26:11,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 98 events. 28/98 cut-off events. For 722/731 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 339 event pairs, 2 based on Foata normal form. 6/102 useless extension candidates. Maximal degree in co-relation 549. Up to 43 conditions per place. [2022-12-06 04:26:11,104 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 42 transitions, 515 flow [2022-12-06 04:26:11,104 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 04:26:11,682 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] $Ultimate##0-->L774: Formula: (and (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_76| 0)) (= v_P1Thread1of1ForFork0_~arg.base_33 |v_P1Thread1of1ForFork0_#in~arg.base_33|) (= v_~y$w_buff1~0_481 v_~y$w_buff0~0_529) (= v_~y$w_buff0_used~0_780 v_~y$w_buff1_used~0_707) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_76| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_779 256) 0)) (not (= (mod v_~y$w_buff1_used~0_707 256) 0)))) 1 0)) (= v_~y$r_buff0_thd0~0_286 v_~y$r_buff1_thd0~0_283) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_68| |v_P0Thread1of1ForFork2_~arg#1.offset_68|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_33| v_P1Thread1of1ForFork0_~arg.offset_33) (= v_~y$r_buff0_thd3~0_352 v_~y$r_buff1_thd3~0_354) (= v_~y~0_666 1) (= 2 v_~x~0_129) (= v_~y$r_buff0_thd1~0_239 v_~y$r_buff1_thd1~0_170) (= 2 v_~y$w_buff0~0_528) (= v_~y$r_buff0_thd1~0_238 1) (= v_~y$w_buff0_used~0_779 1) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_68| |v_P0Thread1of1ForFork2_~arg#1.base_68|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_76| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_76|) (= v_~y$r_buff0_thd2~0_140 v_~y$r_buff1_thd2~0_143)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_780, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_68|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_33|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_352, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_286, ~y$w_buff0~0=v_~y$w_buff0~0_529, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_239, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_140, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_33|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_68|} OutVars{P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_33, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_779, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_68|, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_76|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_68|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_68|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_68|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_143, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_170, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_354, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_76|, ~y$w_buff1~0=v_~y$w_buff1~0_481, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_33|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_352, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_286, ~y$w_buff0~0=v_~y$w_buff0~0_528, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_238, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_140, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_33|, ~y~0=v_~y~0_666, ~x~0=v_~x~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_283, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_707} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.base, ~y$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork0_~arg.offset, ~y$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [476] $Ultimate##0-->L804: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd3~0_156 256) 0)) (.cse2 (= (mod v_~y$r_buff0_thd3~0_160 256) 0))) (let ((.cse5 (not .cse2)) (.cse12 (= (mod v_~y$w_buff0_used~0_314 256) 0)) (.cse9 (and .cse2 (= (mod v_~y$w_buff1_used~0_283 256) 0))) (.cse4 (and .cse2 .cse11))) (let ((.cse7 (or .cse12 .cse9 .cse4)) (.cse8 (and .cse5 (not .cse12)))) (let ((.cse6 (ite .cse7 v_~y~0_255 (ite .cse8 v_~y$w_buff0~0_180 v_~y$w_buff1~0_169))) (.cse0 (not (= (mod v_~weak$$choice2~0_124 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_313 256) 0)) (.cse3 (= (mod v_~y$w_buff1_used~0_282 256) 0))) (and (= (ite .cse0 v_~y$r_buff0_thd3~0_160 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~y$r_buff0_thd3~0_160 (ite (and (not .cse1) .cse5) 0 v_~y$r_buff0_thd3~0_160))) v_~y$r_buff0_thd3~0_159) (= v_~weak$$choice2~0_124 |v_P2Thread1of1ForFork1_#t~nondet4_22|) (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_254 (ite .cse0 v_~y$mem_tmp~0_90 .cse6)) (= v_~y$w_buff1~0_169 v_~y$w_buff1~0_168) (= |v_P2Thread1of1ForFork1_#t~nondet3_22| v_~weak$$choice0~0_53) (= v_~y$w_buff0_used~0_313 (ite .cse0 v_~y$w_buff0_used~0_314 (ite .cse7 v_~y$w_buff0_used~0_314 (ite .cse8 0 v_~y$w_buff0_used~0_314)))) (= .cse6 v_~__unbuffered_p2_EAX~0_54) (= (ite .cse0 v_~y$w_buff1_used~0_283 (ite (or .cse1 .cse9 .cse4) v_~y$w_buff1_used~0_283 0)) v_~y$w_buff1_used~0_282) (= v_~y$flush_delayed~0_115 0) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= v_~y$r_buff1_thd3~0_155 (ite .cse0 v_~y$r_buff1_thd3~0_156 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_159 256) 0))) (or .cse1 (and .cse10 .cse3) (and .cse10 .cse11))) v_~y$r_buff1_thd3~0_156 0))) (= v_~y~0_255 v_~y$mem_tmp~0_90) (= v_~y$w_buff0~0_180 v_~y$w_buff0~0_179)))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_156, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_314, ~y$w_buff1~0=v_~y$w_buff1~0_169, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_160, ~y$w_buff0~0=v_~y$w_buff0~0_180, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_22|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_22|, ~y~0=v_~y~0_255, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_283} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_313, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, ~weak$$choice0~0=v_~weak$$choice0~0_53, ~y$mem_tmp~0=v_~y$mem_tmp~0_90, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_155, ~y$w_buff1~0=v_~y$w_buff1~0_168, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_159, ~y$w_buff0~0=v_~y$w_buff0~0_179, ~y$flush_delayed~0=v_~y$flush_delayed~0_115, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_254, ~weak$$choice2~0=v_~weak$$choice2~0_124, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_282} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#t~nondet3, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork1_~arg.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-06 04:26:11,940 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L804: Formula: (let ((.cse5 (= 0 (mod v_~y$w_buff0_used~0_791 256))) (.cse4 (= (mod v_~y$r_buff0_thd3~0_357 256) 0))) (let ((.cse2 (and .cse5 .cse4))) (let ((.cse8 (or .cse2 .cse4)) (.cse7 (not .cse4))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_235 256) 0))) (.cse6 (= (mod v_~y$w_buff1_used~0_713 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_789 256) 0)) (.cse1 (ite .cse8 1 (ite .cse7 2 v_~y$w_buff0~0_538)))) (and (= v_~y$r_buff0_thd2~0_146 v_~y$r_buff1_thd2~0_149) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_80| 0)) (= v_P2Thread1of1ForFork1_~arg.base_27 |v_P2Thread1of1ForFork1_#in~arg.base_27|) (= 2 v_~x~0_133) (= v_~y~0_670 (ite .cse0 v_~y$mem_tmp~0_203 .cse1)) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_72| |v_P0Thread1of1ForFork2_~arg#1.offset_72|) (= (ite .cse0 v_~y$w_buff0_used~0_791 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff0_used~0_791 0)) v_~y$w_buff1_used~0_713) (= v_~weak$$choice2~0_235 |v_P2Thread1of1ForFork1_#t~nondet4_66|) (= v_~y$r_buff0_thd1~0_247 v_~y$r_buff1_thd1~0_174) (= v_~y$flush_delayed~0_228 0) (= |v_P1Thread1of1ForFork0_#in~arg.offset_37| v_P1Thread1of1ForFork0_~arg.offset_37) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_72| |v_P0Thread1of1ForFork2_~arg#1.base_72|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_80| (ite .cse5 1 0)) (= v_~y$mem_tmp~0_203 1) (= v_P1Thread1of1ForFork0_~arg.base_37 |v_P1Thread1of1ForFork0_#in~arg.base_37|) (= v_~y$r_buff0_thd1~0_246 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_80| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_80|) (= v_~y$w_buff1~0_485 v_~y$w_buff0~0_538) (= 2 v_~y$w_buff0~0_536) (= (ite .cse0 v_~y$r_buff0_thd3~0_357 (ite (or (and .cse6 .cse4) .cse3 .cse4) v_~y$r_buff0_thd3~0_357 (ite (and (not .cse3) .cse7) 0 v_~y$r_buff0_thd3~0_357))) v_~y$r_buff0_thd3~0_356) (= (ite .cse0 1 (ite .cse8 1 (ite .cse7 0 1))) v_~y$w_buff0_used~0_789) (= (ite .cse0 v_~y$r_buff0_thd3~0_357 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd3~0_356 256) 0))) (or (and .cse9 .cse4) (and .cse6 .cse9) .cse3)) v_~y$r_buff0_thd3~0_357 0)) v_~y$r_buff1_thd3~0_358) (= v_~__unbuffered_p2_EAX~0_120 .cse1) (= v_~y$r_buff0_thd0~0_290 v_~y$r_buff1_thd0~0_287) (= v_P2Thread1of1ForFork1_~arg.offset_27 |v_P2Thread1of1ForFork1_#in~arg.offset_27|) (= |v_P2Thread1of1ForFork1_#t~nondet3_66| v_~weak$$choice0~0_164)))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_27|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_791, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_72|, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_66|, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_66|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_72|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_357, ~y$w_buff0~0=v_~y$w_buff0~0_538, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_37|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_290, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_247, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_146, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_27|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_789, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_80|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_72|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_72|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ~y$mem_tmp~0=v_~y$mem_tmp~0_203, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_358, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_80|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_356, ~y$w_buff0~0=v_~y$w_buff0~0_536, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_37|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_246, ~y$flush_delayed~0=v_~y$flush_delayed~0_228, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_120, ~y~0=v_~y~0_670, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_27|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_27, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_37, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_72|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_72|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_149, ~weak$$choice0~0=v_~weak$$choice0~0_164, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_37, ~y$w_buff1~0=v_~y$w_buff1~0_485, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_290, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_146, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_27|, ~weak$$choice2~0=v_~weak$$choice2~0_235, ~x~0=v_~x~0_133, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_287, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_713} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~nondet3, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P2Thread1of1ForFork1_#t~nondet4, P0Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork1_~arg.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, P2Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork2_~arg#1.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork0_~arg.offset, ~y$w_buff1~0, ~weak$$choice2~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [392] L774-->L781: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_173 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0)))) (let ((.cse0 (and (not (= 0 (mod v_~y$w_buff0_used~0_174 256))) .cse5)) (.cse2 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_157 256) 0)) .cse4))) (and (= v_~y~0_133 (ite .cse0 v_~y$w_buff0~0_71 (ite .cse1 v_~y$w_buff1~0_80 v_~y~0_134))) (= (ite .cse2 0 v_~y$r_buff0_thd2~0_22) v_~y$r_buff0_thd2~0_21) (= v_~y$w_buff0_used~0_173 (ite .cse0 0 v_~y$w_buff0_used~0_174)) (= v_~y$w_buff1_used~0_156 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_157)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_156 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_174, ~y$w_buff1~0=v_~y$w_buff1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_71, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_134, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_157} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_173, ~y$w_buff1~0=v_~y$w_buff1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_71, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_133, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_156} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:26:12,335 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:26:12,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1247 [2022-12-06 04:26:12,336 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 534 flow [2022-12-06 04:26:12,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:26:12,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:26:12,336 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:26:12,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 04:26:12,336 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:26:12,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:26:12,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1831886720, now seen corresponding path program 1 times [2022-12-06 04:26:12,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:26:12,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041438142] [2022-12-06 04:26:12,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:26:12,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:26:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:26:12,455 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:26:12,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:26:12,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041438142] [2022-12-06 04:26:12,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041438142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:26:12,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:26:12,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:26:12,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087579121] [2022-12-06 04:26:12,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:26:12,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:26:12,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:26:12,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:26:12,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:26:12,456 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:26:12,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 39 transitions, 534 flow. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:26:12,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:26:12,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:26:12,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:26:12,544 INFO L130 PetriNetUnfolder]: 69/150 cut-off events. [2022-12-06 04:26:12,545 INFO L131 PetriNetUnfolder]: For 2124/2124 co-relation queries the response was YES. [2022-12-06 04:26:12,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 150 events. 69/150 cut-off events. For 2124/2124 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 495 event pairs, 4 based on Foata normal form. 10/160 useless extension candidates. Maximal degree in co-relation 966. Up to 60 conditions per place. [2022-12-06 04:26:12,545 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 49 selfloop transitions, 11 changer transitions 3/63 dead transitions. [2022-12-06 04:26:12,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 1005 flow [2022-12-06 04:26:12,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:26:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:26:12,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-12-06 04:26:12,546 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2022-12-06 04:26:12,547 INFO L175 Difference]: Start difference. First operand has 66 places, 39 transitions, 534 flow. Second operand 6 states and 41 transitions. [2022-12-06 04:26:12,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 1005 flow [2022-12-06 04:26:12,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 770 flow, removed 83 selfloop flow, removed 14 redundant places. [2022-12-06 04:26:12,550 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 407 flow [2022-12-06 04:26:12,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=407, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2022-12-06 04:26:12,550 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 22 predicate places. [2022-12-06 04:26:12,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:26:12,550 INFO L89 Accepts]: Start accepts. Operand has 59 places, 39 transitions, 407 flow [2022-12-06 04:26:12,551 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:26:12,551 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:12,551 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 39 transitions, 407 flow [2022-12-06 04:26:12,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 39 transitions, 407 flow [2022-12-06 04:26:12,558 INFO L130 PetriNetUnfolder]: 19/66 cut-off events. [2022-12-06 04:26:12,558 INFO L131 PetriNetUnfolder]: For 265/267 co-relation queries the response was YES. [2022-12-06 04:26:12,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 66 events. 19/66 cut-off events. For 265/267 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 194 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 327. Up to 21 conditions per place. [2022-12-06 04:26:12,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 39 transitions, 407 flow [2022-12-06 04:26:12,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 04:26:13,256 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] L827-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P2Thread1of1ForFork1_#res.base_9| 0) (= |v_P2Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [498] L849-3-->L852: Formula: (= v_~main$tmp_guard0~0_50 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_93) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 04:26:13,275 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [440] L761-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res#1.base_7| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (= |v_P0Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_7|, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, P0Thread1of1ForFork2_#res#1.base, ~__unbuffered_cnt~0] and [498] L849-3-->L852: Formula: (= v_~main$tmp_guard0~0_50 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_93) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 04:26:13,294 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L781-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.base_11| 0) (= |v_P1Thread1of1ForFork0_#res.offset_11| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_11|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_11|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] and [498] L849-3-->L852: Formula: (= v_~main$tmp_guard0~0_50 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_93) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_37|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 04:30:45,436 WARN L233 SmtUtils]: Spent 10.62s on a formula simplification that was a NOOP. DAG size: 2137 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-06 04:34:59,305 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:34:59,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 526755 [2022-12-06 04:34:59,306 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 417 flow [2022-12-06 04:34:59,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:34:59,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:59,306 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:59,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 04:34:59,306 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:34:59,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:59,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1012266601, now seen corresponding path program 1 times [2022-12-06 04:34:59,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:59,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981088741] [2022-12-06 04:34:59,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:59,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:34:59,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:34:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:34:59,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:34:59,387 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:34:59,388 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:34:59,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:34:59,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:34:59,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:34:59,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:34:59,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:34:59,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 04:34:59,390 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:59,394 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:34:59,394 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:34:59,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:34:59 BasicIcfg [2022-12-06 04:34:59,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:34:59,459 INFO L158 Benchmark]: Toolchain (without parser) took 585414.84ms. Allocated memory was 226.5MB in the beginning and 1.1GB in the end (delta: 867.2MB). Free memory was 200.9MB in the beginning and 704.9MB in the end (delta: -504.0MB). Peak memory consumption was 363.9MB. Max. memory is 8.0GB. [2022-12-06 04:34:59,459 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 226.5MB. Free memory is still 203.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:34:59,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.45ms. Allocated memory is still 226.5MB. Free memory was 200.9MB in the beginning and 172.3MB in the end (delta: 28.6MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 04:34:59,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.39ms. Allocated memory is still 226.5MB. Free memory was 172.3MB in the beginning and 169.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:34:59,460 INFO L158 Benchmark]: Boogie Preprocessor took 54.79ms. Allocated memory is still 226.5MB. Free memory was 169.2MB in the beginning and 167.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:34:59,460 INFO L158 Benchmark]: RCFGBuilder took 767.54ms. Allocated memory was 226.5MB in the beginning and 272.6MB in the end (delta: 46.1MB). Free memory was 167.1MB in the beginning and 237.3MB in the end (delta: -70.3MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2022-12-06 04:34:59,460 INFO L158 Benchmark]: TraceAbstraction took 584112.00ms. Allocated memory was 272.6MB in the beginning and 1.1GB in the end (delta: 821.0MB). Free memory was 236.8MB in the beginning and 704.9MB in the end (delta: -468.1MB). Peak memory consumption was 352.4MB. Max. memory is 8.0GB. [2022-12-06 04:34:59,461 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.11ms. Allocated memory is still 226.5MB. Free memory is still 203.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 413.45ms. Allocated memory is still 226.5MB. Free memory was 200.9MB in the beginning and 172.3MB in the end (delta: 28.6MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.39ms. Allocated memory is still 226.5MB. Free memory was 172.3MB in the beginning and 169.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.79ms. Allocated memory is still 226.5MB. Free memory was 169.2MB in the beginning and 167.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 767.54ms. Allocated memory was 226.5MB in the beginning and 272.6MB in the end (delta: 46.1MB). Free memory was 167.1MB in the beginning and 237.3MB in the end (delta: -70.3MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. * TraceAbstraction took 584112.00ms. Allocated memory was 272.6MB in the beginning and 1.1GB in the end (delta: 821.0MB). Free memory was 236.8MB in the beginning and 704.9MB in the end (delta: -468.1MB). Peak memory consumption was 352.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 112 PlacesBefore, 37 PlacesAfterwards, 104 TransitionsBefore, 28 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1413, independent: 1360, independent conditional: 1360, 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: 1413, independent: 1360, independent conditional: 0, independent unconditional: 1360, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1413, independent: 1360, independent conditional: 0, independent unconditional: 1360, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1413, independent: 1360, independent conditional: 0, independent unconditional: 1360, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1173, independent: 1129, independent conditional: 0, independent unconditional: 1129, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1173, independent: 1106, independent conditional: 0, independent unconditional: 1106, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 347, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 319, dependent conditional: 0, dependent unconditional: 319, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1413, independent: 231, independent conditional: 0, independent unconditional: 231, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1173, unknown conditional: 0, unknown unconditional: 1173] , Statistics on independence cache: Total cache size (in pairs): 1723, Positive cache size: 1679, Positive conditional cache size: 0, Positive unconditional cache size: 1679, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 54, independent conditional: 54, 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: 76, independent: 54, independent conditional: 12, independent unconditional: 42, dependent: 22, dependent conditional: 8, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 54, independent conditional: 12, independent unconditional: 42, dependent: 22, dependent conditional: 8, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 54, independent conditional: 12, independent unconditional: 42, dependent: 22, dependent conditional: 8, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 71, independent: 53, independent conditional: 11, independent unconditional: 42, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 71, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 18, dependent conditional: 8, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 78, dependent conditional: 37, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 71, unknown conditional: 19, unknown unconditional: 52] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 53, Positive conditional cache size: 11, Positive unconditional cache size: 42, Negative cache size: 18, Negative conditional cache size: 8, Negative unconditional cache size: 10, 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, 30 TransitionsBefore, 30 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 59, independent conditional: 59, 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: 69, independent: 59, independent conditional: 15, independent unconditional: 44, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, independent: 59, independent conditional: 4, independent unconditional: 55, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, independent: 59, independent conditional: 4, independent unconditional: 55, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 1, independent unconditional: 14, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 9, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, independent: 44, independent conditional: 3, independent unconditional: 41, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 18, unknown conditional: 3, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 68, Positive conditional cache size: 12, Positive unconditional cache size: 56, Negative cache size: 21, Negative conditional cache size: 10, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 63, independent: 50, independent conditional: 23, independent unconditional: 27, dependent: 13, dependent conditional: 4, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 50, independent conditional: 14, independent unconditional: 36, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 50, independent conditional: 14, independent unconditional: 36, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 24, dependent conditional: 11, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, independent: 48, independent conditional: 14, independent unconditional: 34, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 70, Positive conditional cache size: 12, Positive unconditional cache size: 58, Negative cache size: 26, Negative conditional cache size: 12, Negative unconditional cache size: 14, 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.0s, 46 PlacesBefore, 46 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 122, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 122, independent: 110, independent conditional: 60, independent unconditional: 50, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 122, independent: 110, independent conditional: 42, independent unconditional: 68, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 122, independent: 110, independent conditional: 42, independent unconditional: 68, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 3, independent unconditional: 5, 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: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 122, independent: 102, independent conditional: 39, independent unconditional: 63, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 78, Positive conditional cache size: 15, Positive unconditional cache size: 63, Negative cache size: 26, Negative conditional cache size: 12, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 184, independent: 164, independent conditional: 164, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 184, independent: 164, independent conditional: 65, independent unconditional: 99, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 184, independent: 164, independent conditional: 48, independent unconditional: 116, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 184, independent: 164, independent conditional: 48, independent unconditional: 116, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 184, independent: 163, independent conditional: 48, independent unconditional: 115, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 79, Positive conditional cache size: 15, Positive unconditional cache size: 64, Negative cache size: 27, Negative conditional cache size: 12, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 75, independent: 66, independent conditional: 30, independent unconditional: 36, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, independent: 66, independent conditional: 15, independent unconditional: 51, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 75, independent: 66, independent conditional: 15, independent unconditional: 51, dependent: 9, dependent conditional: 0, dependent unconditional: 9, 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: 75, independent: 66, independent conditional: 15, independent unconditional: 51, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 79, Positive conditional cache size: 15, Positive unconditional cache size: 64, Negative cache size: 27, Negative conditional cache size: 12, Negative unconditional cache size: 15, 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.8s, 59 PlacesBefore, 56 PlacesAfterwards, 41 TransitionsBefore, 39 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 187, independent: 159, independent conditional: 159, 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: 187, independent: 159, independent conditional: 87, independent unconditional: 72, dependent: 28, dependent conditional: 6, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 193, independent: 159, independent conditional: 18, independent unconditional: 141, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 193, independent: 159, independent conditional: 18, independent unconditional: 141, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 193, independent: 152, independent conditional: 18, independent unconditional: 134, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 122, Positive conditional cache size: 15, Positive unconditional cache size: 107, Negative cache size: 27, Negative conditional cache size: 12, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 81, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 32, independent conditional: 32, 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: 40, independent: 32, independent conditional: 14, independent unconditional: 18, 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: 40, independent: 32, independent conditional: 12, independent unconditional: 20, 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: 40, independent: 32, independent conditional: 12, independent unconditional: 20, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 31, independent conditional: 12, independent unconditional: 19, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 123, Positive conditional cache size: 15, Positive unconditional cache size: 108, Negative cache size: 27, Negative conditional cache size: 12, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 58 PlacesBefore, 58 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 85, independent: 61, independent conditional: 61, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 85, independent: 61, independent conditional: 39, independent unconditional: 22, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 85, independent: 61, independent conditional: 35, independent unconditional: 26, 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: 85, independent: 61, independent conditional: 35, independent unconditional: 26, 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: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 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: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 85, independent: 59, independent conditional: 33, independent unconditional: 26, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 127, Positive conditional cache size: 17, Positive unconditional cache size: 110, Negative cache size: 27, Negative conditional cache size: 12, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 94, independent: 78, independent conditional: 46, independent unconditional: 32, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 94, independent: 78, independent conditional: 44, independent unconditional: 34, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 94, independent: 78, independent conditional: 44, independent unconditional: 34, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, independent: 76, independent conditional: 42, independent unconditional: 34, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 129, Positive conditional cache size: 19, Positive unconditional cache size: 110, Negative cache size: 27, Negative conditional cache size: 12, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, independent: 182, independent conditional: 182, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 206, independent: 182, independent conditional: 98, independent unconditional: 84, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 206, independent: 182, independent conditional: 82, independent unconditional: 100, 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: 206, independent: 182, independent conditional: 82, independent unconditional: 100, 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: 2, independent: 2, independent conditional: 1, 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: 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: 206, independent: 180, independent conditional: 81, independent unconditional: 99, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 131, Positive conditional cache size: 20, Positive unconditional cache size: 111, Negative cache size: 27, Negative conditional cache size: 12, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 260, independent: 227, independent conditional: 227, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 260, independent: 227, independent conditional: 162, independent unconditional: 65, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 260, independent: 227, independent conditional: 143, independent unconditional: 84, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 260, independent: 227, independent conditional: 143, independent unconditional: 84, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 260, independent: 227, independent conditional: 143, independent unconditional: 84, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 131, Positive conditional cache size: 20, Positive unconditional cache size: 111, Negative cache size: 27, Negative conditional cache size: 12, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.1s, 76 PlacesBefore, 75 PlacesAfterwards, 80 TransitionsBefore, 78 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 73, independent conditional: 73, 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: 83, independent: 73, independent conditional: 73, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 83, independent: 73, independent conditional: 4, independent unconditional: 69, 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: 83, independent: 73, independent conditional: 4, independent unconditional: 69, 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: 13, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, independent: 61, independent conditional: 2, independent unconditional: 59, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 13, unknown conditional: 2, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 149, Positive conditional cache size: 22, Positive unconditional cache size: 127, Negative cache size: 28, Negative conditional cache size: 12, Negative unconditional cache size: 16, 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.0s, 79 PlacesBefore, 79 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 149, Positive conditional cache size: 22, Positive unconditional cache size: 127, Negative cache size: 29, Negative conditional cache size: 12, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 84 PlacesBefore, 84 PlacesAfterwards, 73 TransitionsBefore, 72 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 35, independent conditional: 35, 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: 45, independent: 35, independent conditional: 32, independent unconditional: 3, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 35, independent conditional: 0, independent unconditional: 35, 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: 45, independent: 35, independent conditional: 0, independent unconditional: 35, 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: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 45, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 195, Positive cache size: 166, Positive conditional cache size: 22, Positive unconditional cache size: 144, Negative cache size: 29, Negative conditional cache size: 12, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 36, independent conditional: 3, independent unconditional: 33, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 36, independent conditional: 3, independent unconditional: 33, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 1, independent unconditional: 4, 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: 39, independent: 31, independent conditional: 2, independent unconditional: 29, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 171, Positive conditional cache size: 23, Positive unconditional cache size: 148, Negative cache size: 30, Negative conditional cache size: 12, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 72 PlacesBefore, 72 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 11, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 178, Positive conditional cache size: 23, Positive unconditional cache size: 155, Negative cache size: 30, Negative conditional cache size: 12, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 72 PlacesBefore, 66 PlacesAfterwards, 42 TransitionsBefore, 39 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 28, independent conditional: 16, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 28, independent conditional: 16, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, 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: 34, independent: 28, independent conditional: 16, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 196, Positive conditional cache size: 23, Positive unconditional cache size: 173, Negative cache size: 30, Negative conditional cache size: 12, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 526.7s, 59 PlacesBefore, 56 PlacesAfterwards, 39 TransitionsBefore, 36 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 228, Positive conditional cache size: 25, Positive unconditional cache size: 203, Negative cache size: 30, Negative conditional cache size: 12, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1873; [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1873, ((void *)0), P0, ((void *)0))=-1, t1873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 pthread_t t1874; [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1874, ((void *)0), P1, ((void *)0))=0, t1873={5:0}, t1874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1875; [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1875, ((void *)0), P2, ((void *)0))=1, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 [L753] 1 x = 1 [L770] 1 x = 2 [L773] 1 y = 1 [L790] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 1 y$flush_delayed = weak$$choice2 [L793] 1 y$mem_tmp = y [L794] 1 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 1 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 1 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 1 __unbuffered_p2_EAX = y [L802] 1 y = y$flush_delayed ? y$mem_tmp : y [L803] 1 y$flush_delayed = (_Bool)0 [L776] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L851] 3 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 3 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 3 !(!cond) [L853] RET 3 assume_abort_if_not(main$tmp_guard0) [L855] 3 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 3 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 3 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L862] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 3 y$flush_delayed = weak$$choice2 [L865] 3 y$mem_tmp = y [L866] 3 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L867] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L868] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L869] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L870] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 3 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L872] 3 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 3 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] 3 y = y$flush_delayed ? y$mem_tmp : y [L875] 3 y$flush_delayed = (_Bool)0 [L877] 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_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: 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, 134 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: 583.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 919 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 919 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 399 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2021 IncrementalHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 399 mSolverCounterUnsat, 27 mSDtfsCounter, 2021 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1165occurred in iteration=12, InterpolantAutomatonStates: 102, 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.4s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 4032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:34:59,486 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...