/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/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:20:38,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:20:38,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:20:38,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:20:38,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:20:38,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:20:38,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:20:38,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:20:38,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:20:38,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:20:38,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:20:38,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:20:38,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:20:38,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:20:38,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:20:38,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:20:38,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:20:38,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:20:38,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:20:38,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:20:38,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:20:38,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:20:38,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:20:38,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:20:38,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:20:38,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:20:38,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:20:38,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:20:38,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:20:38,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:20:38,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:20:38,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:20:38,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:20:38,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:20:38,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:20:38,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:20:38,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:20:38,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:20:38,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:20:38,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:20:38,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:20:38,338 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:20:38,361 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:20:38,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:20:38,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:20:38,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:20:38,363 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:20:38,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:20:38,364 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:20:38,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:20:38,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:20:38,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:20:38,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:20:38,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:20:38,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:20:38,366 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:20:38,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:20:38,366 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:20:38,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:20:38,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:20:38,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:20:38,366 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:20:38,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:20:38,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:20:38,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:20:38,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:20:38,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:20:38,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:20:38,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:20:38,367 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:20:38,367 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:20:38,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:20:38,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:20:38,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:20:38,636 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:20:38,637 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:20:38,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 04:20:39,665 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:20:39,956 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:20:39,957 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 04:20:39,995 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfc337cc/2ec0eee2c02f427dab00197ac439b858/FLAGa3f5bbbb7 [2022-12-06 04:20:40,031 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcfc337cc/2ec0eee2c02f427dab00197ac439b858 [2022-12-06 04:20:40,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:20:40,034 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:20:40,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:20:40,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:20:40,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:20:40,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:20:40" (1/1) ... [2022-12-06 04:20:40,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9bfeaab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:40, skipping insertion in model container [2022-12-06 04:20:40,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:20:40" (1/1) ... [2022-12-06 04:20:40,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:20:40,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:20:40,195 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/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-06 04:20:40,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:20:40,347 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:20:40,357 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/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-06 04:20:40,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:20:40,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:20:40,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:20:40,459 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:20:40,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:40 WrapperNode [2022-12-06 04:20:40,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:20:40,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:20:40,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:20:40,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:20:40,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:20:40" (1/1) ... [2022-12-06 04:20:40,489 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:20:40" (1/1) ... [2022-12-06 04:20:40,516 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 157 [2022-12-06 04:20:40,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:20:40,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:20:40,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:20:40,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:20:40,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:40" (1/1) ... [2022-12-06 04:20:40,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:40" (1/1) ... [2022-12-06 04:20:40,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:40" (1/1) ... [2022-12-06 04:20:40,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:40" (1/1) ... [2022-12-06 04:20:40,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:40" (1/1) ... [2022-12-06 04:20:40,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:40" (1/1) ... [2022-12-06 04:20:40,546 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:40" (1/1) ... [2022-12-06 04:20:40,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:40" (1/1) ... [2022-12-06 04:20:40,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:20:40,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:20:40,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:20:40,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:20:40,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:40" (1/1) ... [2022-12-06 04:20:40,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:20:40,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:20:40,596 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:20:40,643 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:20:40,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:20:40,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:20:40,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:20:40,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:20:40,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:20:40,660 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:20:40,661 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:20:40,661 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:20:40,661 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:20:40,661 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:20:40,661 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:20:40,661 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:20:40,661 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:20:40,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:20:40,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:20:40,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:20:40,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:20:40,663 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:20:40,814 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:20:40,815 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:20:41,075 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:20:41,197 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:20:41,197 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:20:41,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:20:41 BoogieIcfgContainer [2022-12-06 04:20:41,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:20:41,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:20:41,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:20:41,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:20:41,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:20:40" (1/3) ... [2022-12-06 04:20:41,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792301ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:20:41, skipping insertion in model container [2022-12-06 04:20:41,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:20:40" (2/3) ... [2022-12-06 04:20:41,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792301ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:20:41, skipping insertion in model container [2022-12-06 04:20:41,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:20:41" (3/3) ... [2022-12-06 04:20:41,208 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 04:20:41,220 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:20:41,220 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:20:41,220 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:20:41,273 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:20:41,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 270 flow [2022-12-06 04:20:41,350 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-06 04:20:41,351 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:20:41,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-06 04:20:41,358 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 125 transitions, 270 flow [2022-12-06 04:20:41,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 121 transitions, 254 flow [2022-12-06 04:20:41,402 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:20:41,418 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 121 transitions, 254 flow [2022-12-06 04:20:41,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 121 transitions, 254 flow [2022-12-06 04:20:41,457 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-06 04:20:41,458 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:20:41,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-06 04:20:41,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 121 transitions, 254 flow [2022-12-06 04:20:41,461 INFO L188 LiptonReduction]: Number of co-enabled transitions 2736 [2022-12-06 04:20:46,621 INFO L203 LiptonReduction]: Total number of compositions: 94 [2022-12-06 04:20:46,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:20:46,639 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;@4849a4d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:20:46,639 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:20:46,645 INFO L130 PetriNetUnfolder]: 1/21 cut-off events. [2022-12-06 04:20:46,645 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:20:46,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:20:46,646 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:20:46,646 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:20:46,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:20:46,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1051385216, now seen corresponding path program 1 times [2022-12-06 04:20:46,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:20:46,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125860292] [2022-12-06 04:20:46,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:20:46,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:20:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:20:47,007 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:20:47,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:20:47,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125860292] [2022-12-06 04:20:47,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125860292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:20:47,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:20:47,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:20:47,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694187750] [2022-12-06 04:20:47,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:20:47,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:20:47,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:20:47,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:20:47,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:20:47,037 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 04:20:47,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:47,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:20:47,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 04:20:47,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:20:47,511 INFO L130 PetriNetUnfolder]: 2483/3677 cut-off events. [2022-12-06 04:20:47,512 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 04:20:47,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7225 conditions, 3677 events. 2483/3677 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 20156 event pairs, 593 based on Foata normal form. 0/3376 useless extension candidates. Maximal degree in co-relation 7213. Up to 2539 conditions per place. [2022-12-06 04:20:47,531 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 29 selfloop transitions, 2 changer transitions 4/39 dead transitions. [2022-12-06 04:20:47,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 160 flow [2022-12-06 04:20:47,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:20:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:20:47,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 04:20:47,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2022-12-06 04:20:47,541 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 52 transitions. [2022-12-06 04:20:47,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 160 flow [2022-12-06 04:20:47,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:20:47,545 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 62 flow [2022-12-06 04:20:47,546 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-06 04:20:47,549 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2022-12-06 04:20:47,549 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:20:47,549 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 62 flow [2022-12-06 04:20:47,551 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:20:47,551 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:20:47,551 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 62 flow [2022-12-06 04:20:47,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 62 flow [2022-12-06 04:20:47,556 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-06 04:20:47,556 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:20:47,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:20:47,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 62 flow [2022-12-06 04:20:47,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-06 04:20:47,600 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:20:47,602 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 04:20:47,602 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 62 flow [2022-12-06 04:20:47,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:47,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:20:47,602 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:20:47,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:20:47,602 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:20:47,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:20:47,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1063844756, now seen corresponding path program 1 times [2022-12-06 04:20:47,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:20:47,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474912961] [2022-12-06 04:20:47,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:20:47,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:20:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:20:48,268 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:20:48,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:20:48,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474912961] [2022-12-06 04:20:48,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474912961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:20:48,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:20:48,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:20:48,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18409532] [2022-12-06 04:20:48,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:20:48,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:20:48,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:20:48,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:20:48,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:20:48,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:20:48,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 62 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:48,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:20:48,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:20:48,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:20:49,114 INFO L130 PetriNetUnfolder]: 7639/10580 cut-off events. [2022-12-06 04:20:49,114 INFO L131 PetriNetUnfolder]: For 508/508 co-relation queries the response was YES. [2022-12-06 04:20:49,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21978 conditions, 10580 events. 7639/10580 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 54391 event pairs, 511 based on Foata normal form. 320/10900 useless extension candidates. Maximal degree in co-relation 21968. Up to 6753 conditions per place. [2022-12-06 04:20:49,161 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 47 selfloop transitions, 12 changer transitions 0/59 dead transitions. [2022-12-06 04:20:49,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 59 transitions, 258 flow [2022-12-06 04:20:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:20:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:20:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 04:20:49,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-06 04:20:49,164 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 62 flow. Second operand 4 states and 61 transitions. [2022-12-06 04:20:49,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 59 transitions, 258 flow [2022-12-06 04:20:49,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 59 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:20:49,167 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 150 flow [2022-12-06 04:20:49,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2022-12-06 04:20:49,167 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-12-06 04:20:49,167 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:20:49,167 INFO L89 Accepts]: Start accepts. Operand has 40 places, 36 transitions, 150 flow [2022-12-06 04:20:49,169 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:20:49,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:20:49,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 36 transitions, 150 flow [2022-12-06 04:20:49,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 36 transitions, 150 flow [2022-12-06 04:20:49,237 INFO L130 PetriNetUnfolder]: 531/986 cut-off events. [2022-12-06 04:20:49,238 INFO L131 PetriNetUnfolder]: For 227/251 co-relation queries the response was YES. [2022-12-06 04:20:49,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2260 conditions, 986 events. 531/986 cut-off events. For 227/251 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 5944 event pairs, 202 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 2250. Up to 609 conditions per place. [2022-12-06 04:20:49,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 36 transitions, 150 flow [2022-12-06 04:20:49,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 398 [2022-12-06 04:20:49,264 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:20:49,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 04:20:49,266 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 150 flow [2022-12-06 04:20:49,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:49,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:20:49,266 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:20:49,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:20:49,267 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:20:49,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:20:49,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1380552138, now seen corresponding path program 1 times [2022-12-06 04:20:49,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:20:49,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844655128] [2022-12-06 04:20:49,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:20:49,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:20:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:20:49,797 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:20:49,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:20:49,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844655128] [2022-12-06 04:20:49,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844655128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:20:49,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:20:49,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:20:49,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197967852] [2022-12-06 04:20:49,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:20:49,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:20:49,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:20:49,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:20:49,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:20:49,799 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:20:49,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 150 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:49,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:20:49,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:20:49,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:20:50,591 INFO L130 PetriNetUnfolder]: 7595/10520 cut-off events. [2022-12-06 04:20:50,592 INFO L131 PetriNetUnfolder]: For 5479/5479 co-relation queries the response was YES. [2022-12-06 04:20:50,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29645 conditions, 10520 events. 7595/10520 cut-off events. For 5479/5479 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 53657 event pairs, 740 based on Foata normal form. 40/10560 useless extension candidates. Maximal degree in co-relation 29632. Up to 6530 conditions per place. [2022-12-06 04:20:50,659 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 54 selfloop transitions, 21 changer transitions 0/75 dead transitions. [2022-12-06 04:20:50,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 75 transitions, 430 flow [2022-12-06 04:20:50,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:20:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:20:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 04:20:50,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-06 04:20:50,662 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 150 flow. Second operand 4 states and 65 transitions. [2022-12-06 04:20:50,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 75 transitions, 430 flow [2022-12-06 04:20:50,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 75 transitions, 430 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:20:50,666 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 302 flow [2022-12-06 04:20:50,667 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2022-12-06 04:20:50,667 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2022-12-06 04:20:50,668 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:20:50,668 INFO L89 Accepts]: Start accepts. Operand has 46 places, 47 transitions, 302 flow [2022-12-06 04:20:50,669 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:20:50,669 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:20:50,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 47 transitions, 302 flow [2022-12-06 04:20:50,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 47 transitions, 302 flow [2022-12-06 04:20:50,770 INFO L130 PetriNetUnfolder]: 583/1100 cut-off events. [2022-12-06 04:20:50,770 INFO L131 PetriNetUnfolder]: For 1246/1405 co-relation queries the response was YES. [2022-12-06 04:20:50,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 1100 events. 583/1100 cut-off events. For 1246/1405 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6695 event pairs, 208 based on Foata normal form. 0/1077 useless extension candidates. Maximal degree in co-relation 3654. Up to 614 conditions per place. [2022-12-06 04:20:50,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 47 transitions, 302 flow [2022-12-06 04:20:50,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 482 [2022-12-06 04:20:50,794 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:20:50,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-06 04:20:50,795 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 302 flow [2022-12-06 04:20:50,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:50,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:20:50,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:20:50,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:20:50,796 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:20:50,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:20:50,796 INFO L85 PathProgramCache]: Analyzing trace with hash 159167683, now seen corresponding path program 1 times [2022-12-06 04:20:50,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:20:50,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2567586] [2022-12-06 04:20:50,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:20:50,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:20:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:20:51,248 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:20:51,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:20:51,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2567586] [2022-12-06 04:20:51,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2567586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:20:51,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:20:51,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:20:51,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862563783] [2022-12-06 04:20:51,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:20:51,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:20:51,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:20:51,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:20:51,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:20:51,250 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:20:51,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 302 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:20:51,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:20:51,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:20:51,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:20:52,270 INFO L130 PetriNetUnfolder]: 9537/13378 cut-off events. [2022-12-06 04:20:52,271 INFO L131 PetriNetUnfolder]: For 20679/20679 co-relation queries the response was YES. [2022-12-06 04:20:52,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45666 conditions, 13378 events. 9537/13378 cut-off events. For 20679/20679 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 71214 event pairs, 2097 based on Foata normal form. 200/13578 useless extension candidates. Maximal degree in co-relation 45648. Up to 6077 conditions per place. [2022-12-06 04:20:52,339 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 58 selfloop transitions, 27 changer transitions 0/85 dead transitions. [2022-12-06 04:20:52,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 85 transitions, 648 flow [2022-12-06 04:20:52,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:20:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:20:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-06 04:20:52,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 04:20:52,341 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 302 flow. Second operand 4 states and 64 transitions. [2022-12-06 04:20:52,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 85 transitions, 648 flow [2022-12-06 04:20:52,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 646 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 04:20:52,370 INFO L231 Difference]: Finished difference. Result has 52 places, 58 transitions, 528 flow [2022-12-06 04:20:52,370 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=528, PETRI_PLACES=52, PETRI_TRANSITIONS=58} [2022-12-06 04:20:52,371 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2022-12-06 04:20:52,371 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:20:52,371 INFO L89 Accepts]: Start accepts. Operand has 52 places, 58 transitions, 528 flow [2022-12-06 04:20:52,371 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:20:52,371 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:20:52,372 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 58 transitions, 528 flow [2022-12-06 04:20:52,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 58 transitions, 528 flow [2022-12-06 04:20:52,465 INFO L130 PetriNetUnfolder]: 617/1224 cut-off events. [2022-12-06 04:20:52,466 INFO L131 PetriNetUnfolder]: For 2814/3401 co-relation queries the response was YES. [2022-12-06 04:20:52,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5111 conditions, 1224 events. 617/1224 cut-off events. For 2814/3401 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7933 event pairs, 176 based on Foata normal form. 1/1210 useless extension candidates. Maximal degree in co-relation 5091. Up to 691 conditions per place. [2022-12-06 04:20:52,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 58 transitions, 528 flow [2022-12-06 04:20:52,477 INFO L188 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-06 04:20:52,494 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:20:52,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-06 04:20:52,495 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 58 transitions, 528 flow [2022-12-06 04:20:52,496 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:20:52,496 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:20:52,496 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:20:52,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:20:52,496 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:20:52,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:20:52,496 INFO L85 PathProgramCache]: Analyzing trace with hash 159223421, now seen corresponding path program 1 times [2022-12-06 04:20:52,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:20:52,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749257994] [2022-12-06 04:20:52,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:20:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:20:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:20:53,111 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:20:53,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:20:53,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749257994] [2022-12-06 04:20:53,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749257994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:20:53,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:20:53,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:20:53,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724328036] [2022-12-06 04:20:53,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:20:53,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:20:53,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:20:53,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:20:53,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:20:53,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:20:53,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 58 transitions, 528 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:53,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:20:53,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:20:53,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:20:54,363 INFO L130 PetriNetUnfolder]: 10012/14009 cut-off events. [2022-12-06 04:20:54,364 INFO L131 PetriNetUnfolder]: For 43036/43036 co-relation queries the response was YES. [2022-12-06 04:20:54,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54901 conditions, 14009 events. 10012/14009 cut-off events. For 43036/43036 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 73386 event pairs, 957 based on Foata normal form. 56/14065 useless extension candidates. Maximal degree in co-relation 54878. Up to 8546 conditions per place. [2022-12-06 04:20:54,480 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 72 selfloop transitions, 39 changer transitions 3/114 dead transitions. [2022-12-06 04:20:54,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 114 transitions, 1228 flow [2022-12-06 04:20:54,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:20:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:20:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 04:20:54,485 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.58 [2022-12-06 04:20:54,485 INFO L175 Difference]: Start difference. First operand has 52 places, 58 transitions, 528 flow. Second operand 4 states and 58 transitions. [2022-12-06 04:20:54,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 114 transitions, 1228 flow [2022-12-06 04:20:54,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 114 transitions, 1177 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 04:20:54,553 INFO L231 Difference]: Finished difference. Result has 57 places, 83 transitions, 956 flow [2022-12-06 04:20:54,553 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=956, PETRI_PLACES=57, PETRI_TRANSITIONS=83} [2022-12-06 04:20:54,555 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2022-12-06 04:20:54,555 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:20:54,555 INFO L89 Accepts]: Start accepts. Operand has 57 places, 83 transitions, 956 flow [2022-12-06 04:20:54,558 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:20:54,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:20:54,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 83 transitions, 956 flow [2022-12-06 04:20:54,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 83 transitions, 956 flow [2022-12-06 04:20:54,789 INFO L130 PetriNetUnfolder]: 889/1708 cut-off events. [2022-12-06 04:20:54,789 INFO L131 PetriNetUnfolder]: For 5928/6691 co-relation queries the response was YES. [2022-12-06 04:20:54,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8758 conditions, 1708 events. 889/1708 cut-off events. For 5928/6691 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 11383 event pairs, 146 based on Foata normal form. 5/1690 useless extension candidates. Maximal degree in co-relation 8734. Up to 981 conditions per place. [2022-12-06 04:20:54,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 83 transitions, 956 flow [2022-12-06 04:20:54,818 INFO L188 LiptonReduction]: Number of co-enabled transitions 728 [2022-12-06 04:20:56,517 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:20:56,518 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1963 [2022-12-06 04:20:56,518 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 83 transitions, 972 flow [2022-12-06 04:20:56,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:56,518 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:20:56,518 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:20:56,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:20:56,518 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:20:56,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:20:56,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1517548901, now seen corresponding path program 1 times [2022-12-06 04:20:56,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:20:56,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238425572] [2022-12-06 04:20:56,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:20:56,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:20:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:20:56,860 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:20:56,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:20:56,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238425572] [2022-12-06 04:20:56,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238425572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:20:56,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:20:56,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:20:56,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525547163] [2022-12-06 04:20:56,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:20:56,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:20:56,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:20:56,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:20:56,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:20:56,864 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:20:56,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 83 transitions, 972 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:56,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:20:56,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:20:56,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:20:57,969 INFO L130 PetriNetUnfolder]: 8315/12140 cut-off events. [2022-12-06 04:20:57,969 INFO L131 PetriNetUnfolder]: For 57830/59733 co-relation queries the response was YES. [2022-12-06 04:20:58,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56980 conditions, 12140 events. 8315/12140 cut-off events. For 57830/59733 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 71685 event pairs, 1186 based on Foata normal form. 777/12791 useless extension candidates. Maximal degree in co-relation 56953. Up to 8182 conditions per place. [2022-12-06 04:20:58,061 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 84 selfloop transitions, 27 changer transitions 0/133 dead transitions. [2022-12-06 04:20:58,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 133 transitions, 1649 flow [2022-12-06 04:20:58,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:20:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:20:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-06 04:20:58,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4962962962962963 [2022-12-06 04:20:58,063 INFO L175 Difference]: Start difference. First operand has 57 places, 83 transitions, 972 flow. Second operand 5 states and 67 transitions. [2022-12-06 04:20:58,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 133 transitions, 1649 flow [2022-12-06 04:20:58,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 133 transitions, 1649 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:20:58,089 INFO L231 Difference]: Finished difference. Result has 63 places, 97 transitions, 1232 flow [2022-12-06 04:20:58,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1232, PETRI_PLACES=63, PETRI_TRANSITIONS=97} [2022-12-06 04:20:58,091 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2022-12-06 04:20:58,091 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:20:58,091 INFO L89 Accepts]: Start accepts. Operand has 63 places, 97 transitions, 1232 flow [2022-12-06 04:20:58,093 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:20:58,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:20:58,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 97 transitions, 1232 flow [2022-12-06 04:20:58,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 97 transitions, 1232 flow [2022-12-06 04:20:58,236 INFO L130 PetriNetUnfolder]: 954/1802 cut-off events. [2022-12-06 04:20:58,236 INFO L131 PetriNetUnfolder]: For 8005/8696 co-relation queries the response was YES. [2022-12-06 04:20:58,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10316 conditions, 1802 events. 954/1802 cut-off events. For 8005/8696 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 11922 event pairs, 102 based on Foata normal form. 18/1797 useless extension candidates. Maximal degree in co-relation 10288. Up to 1066 conditions per place. [2022-12-06 04:20:58,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 97 transitions, 1232 flow [2022-12-06 04:20:58,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 832 [2022-12-06 04:20:58,314 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [474] $Ultimate##0-->L807: Formula: (and (= v_~z$r_buff0_thd4~0_56 1) (= v_~z$r_buff0_thd4~0_57 v_~z$r_buff1_thd4~0_49) (= v_~z$w_buff0_used~0_218 v_~z$w_buff1_used~0_194) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_13| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_13|) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_53) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_13| 0)) (= v_~z$w_buff0~0_137 v_~z$w_buff1~0_117) (= v_~z$w_buff0~0_136 2) (= v_~z$r_buff0_thd2~0_19 v_~z$r_buff1_thd2~0_23) (= (ite (not (and (not (= 0 (mod v_~z$w_buff1_used~0_194 256))) (not (= (mod v_~z$w_buff0_used~0_217 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_13|) (= v_~z$r_buff0_thd0~0_145 v_~z$r_buff1_thd0~0_144) (= |v_P3Thread1of1ForFork2_~arg#1.offset_7| |v_P3Thread1of1ForFork2_#in~arg#1.offset_7|) (= |v_P3Thread1of1ForFork2_#in~arg#1.base_7| |v_P3Thread1of1ForFork2_~arg#1.base_7|) (= v_~z$w_buff0_used~0_217 1) (= v_~z$r_buff0_thd1~0_25 v_~z$r_buff1_thd1~0_21)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_145, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_218, ~z$w_buff0~0=v_~z$w_buff0~0_137, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_57, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_49, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_217, ~z$w_buff0~0=v_~z$w_buff0~0_136, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_53, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_194, ~z$w_buff1~0=v_~z$w_buff1~0_117, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_13|, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_13|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_145, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_7|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_7|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_21, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_56, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0] [2022-12-06 04:20:59,714 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:20:59,715 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1624 [2022-12-06 04:20:59,715 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 97 transitions, 1260 flow [2022-12-06 04:20:59,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:20:59,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:20:59,715 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:20:59,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:20:59,715 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:20:59,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:20:59,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1517656533, now seen corresponding path program 1 times [2022-12-06 04:20:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:20:59,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616708477] [2022-12-06 04:20:59,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:20:59,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:20:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:21:00,200 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:21:00,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:21:00,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616708477] [2022-12-06 04:21:00,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616708477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:21:00,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:21:00,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:21:00,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042046661] [2022-12-06 04:21:00,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:21:00,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:21:00,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:21:00,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:21:00,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:21:00,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 04:21:00,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 97 transitions, 1260 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:00,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:21:00,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 04:21:00,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:21:01,576 INFO L130 PetriNetUnfolder]: 8881/12986 cut-off events. [2022-12-06 04:21:01,577 INFO L131 PetriNetUnfolder]: For 77587/79239 co-relation queries the response was YES. [2022-12-06 04:21:01,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66842 conditions, 12986 events. 8881/12986 cut-off events. For 77587/79239 co-relation queries the response was YES. Maximal size of possible extension queue 742. Compared 77984 event pairs, 1562 based on Foata normal form. 679/13507 useless extension candidates. Maximal degree in co-relation 66811. Up to 9311 conditions per place. [2022-12-06 04:21:01,678 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 116 selfloop transitions, 31 changer transitions 0/169 dead transitions. [2022-12-06 04:21:01,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 169 transitions, 2371 flow [2022-12-06 04:21:01,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:21:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:21:01,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 04:21:01,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2022-12-06 04:21:01,680 INFO L175 Difference]: Start difference. First operand has 63 places, 97 transitions, 1260 flow. Second operand 5 states and 73 transitions. [2022-12-06 04:21:01,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 169 transitions, 2371 flow [2022-12-06 04:21:01,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 169 transitions, 2349 flow, removed 11 selfloop flow, removed 0 redundant places. [2022-12-06 04:21:01,736 INFO L231 Difference]: Finished difference. Result has 70 places, 122 transitions, 1740 flow [2022-12-06 04:21:01,736 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1740, PETRI_PLACES=70, PETRI_TRANSITIONS=122} [2022-12-06 04:21:01,737 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2022-12-06 04:21:01,737 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:21:01,737 INFO L89 Accepts]: Start accepts. Operand has 70 places, 122 transitions, 1740 flow [2022-12-06 04:21:01,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:21:01,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:21:01,738 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 122 transitions, 1740 flow [2022-12-06 04:21:01,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 122 transitions, 1740 flow [2022-12-06 04:21:01,987 INFO L130 PetriNetUnfolder]: 1074/2000 cut-off events. [2022-12-06 04:21:01,987 INFO L131 PetriNetUnfolder]: For 10936/11879 co-relation queries the response was YES. [2022-12-06 04:21:01,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12447 conditions, 2000 events. 1074/2000 cut-off events. For 10936/11879 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 13304 event pairs, 88 based on Foata normal form. 68/2052 useless extension candidates. Maximal degree in co-relation 12414. Up to 1184 conditions per place. [2022-12-06 04:21:02,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 122 transitions, 1740 flow [2022-12-06 04:21:02,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 1040 [2022-12-06 04:21:02,052 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:21:02,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 315 [2022-12-06 04:21:02,053 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 122 transitions, 1740 flow [2022-12-06 04:21:02,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:02,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:21:02,053 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:21:02,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:21:02,053 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:21:02,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:21:02,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1517670948, now seen corresponding path program 1 times [2022-12-06 04:21:02,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:21:02,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96164227] [2022-12-06 04:21:02,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:21:02,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:21:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:21:02,423 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:21:02,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:21:02,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96164227] [2022-12-06 04:21:02,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96164227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:21:02,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:21:02,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:21:02,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002779533] [2022-12-06 04:21:02,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:21:02,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:21:02,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:21:02,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:21:02,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:21:02,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 04:21:02,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 122 transitions, 1740 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:02,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:21:02,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 04:21:02,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:21:03,788 INFO L130 PetriNetUnfolder]: 8931/13067 cut-off events. [2022-12-06 04:21:03,789 INFO L131 PetriNetUnfolder]: For 94320/95898 co-relation queries the response was YES. [2022-12-06 04:21:03,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72451 conditions, 13067 events. 8931/13067 cut-off events. For 94320/95898 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 78593 event pairs, 1081 based on Foata normal form. 511/13342 useless extension candidates. Maximal degree in co-relation 72415. Up to 9256 conditions per place. [2022-12-06 04:21:03,877 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 103 selfloop transitions, 32 changer transitions 0/157 dead transitions. [2022-12-06 04:21:03,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 157 transitions, 2364 flow [2022-12-06 04:21:03,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:21:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:21:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-06 04:21:03,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-06 04:21:03,879 INFO L175 Difference]: Start difference. First operand has 70 places, 122 transitions, 1740 flow. Second operand 4 states and 60 transitions. [2022-12-06 04:21:03,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 157 transitions, 2364 flow [2022-12-06 04:21:03,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 157 transitions, 2358 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-06 04:21:03,951 INFO L231 Difference]: Finished difference. Result has 75 places, 132 transitions, 2014 flow [2022-12-06 04:21:03,951 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2014, PETRI_PLACES=75, PETRI_TRANSITIONS=132} [2022-12-06 04:21:03,952 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2022-12-06 04:21:03,952 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:21:03,952 INFO L89 Accepts]: Start accepts. Operand has 75 places, 132 transitions, 2014 flow [2022-12-06 04:21:03,953 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:21:03,953 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:21:03,953 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 132 transitions, 2014 flow [2022-12-06 04:21:03,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 132 transitions, 2014 flow [2022-12-06 04:21:04,134 INFO L130 PetriNetUnfolder]: 1081/2018 cut-off events. [2022-12-06 04:21:04,135 INFO L131 PetriNetUnfolder]: For 12797/13972 co-relation queries the response was YES. [2022-12-06 04:21:04,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13109 conditions, 2018 events. 1081/2018 cut-off events. For 12797/13972 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 13444 event pairs, 75 based on Foata normal form. 97/2099 useless extension candidates. Maximal degree in co-relation 13072. Up to 1195 conditions per place. [2022-12-06 04:21:04,159 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 132 transitions, 2014 flow [2022-12-06 04:21:04,159 INFO L188 LiptonReduction]: Number of co-enabled transitions 1104 [2022-12-06 04:21:04,486 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:21:04,487 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 535 [2022-12-06 04:21:04,487 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 130 transitions, 1970 flow [2022-12-06 04:21:04,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:04,487 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:21:04,487 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:21:04,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:21:04,487 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:21:04,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:21:04,488 INFO L85 PathProgramCache]: Analyzing trace with hash 584935353, now seen corresponding path program 2 times [2022-12-06 04:21:04,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:21:04,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236278057] [2022-12-06 04:21:04,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:21:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:21:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:21:04,794 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:21:04,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:21:04,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236278057] [2022-12-06 04:21:04,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236278057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:21:04,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:21:04,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:21:04,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070542279] [2022-12-06 04:21:04,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:21:04,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:21:04,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:21:04,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:21:04,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:21:04,796 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 04:21:04,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 130 transitions, 1970 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:04,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:21:04,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 04:21:04,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:21:06,232 INFO L130 PetriNetUnfolder]: 9468/14071 cut-off events. [2022-12-06 04:21:06,232 INFO L131 PetriNetUnfolder]: For 113577/115178 co-relation queries the response was YES. [2022-12-06 04:21:06,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80094 conditions, 14071 events. 9468/14071 cut-off events. For 113577/115178 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 87991 event pairs, 1593 based on Foata normal form. 622/14493 useless extension candidates. Maximal degree in co-relation 80054. Up to 10616 conditions per place. [2022-12-06 04:21:06,366 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 113 selfloop transitions, 26 changer transitions 1/162 dead transitions. [2022-12-06 04:21:06,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 162 transitions, 2569 flow [2022-12-06 04:21:06,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:21:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:21:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 04:21:06,368 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2022-12-06 04:21:06,368 INFO L175 Difference]: Start difference. First operand has 76 places, 130 transitions, 1970 flow. Second operand 4 states and 58 transitions. [2022-12-06 04:21:06,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 162 transitions, 2569 flow [2022-12-06 04:21:06,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 162 transitions, 2541 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 04:21:06,526 INFO L231 Difference]: Finished difference. Result has 79 places, 133 transitions, 2063 flow [2022-12-06 04:21:06,527 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1942, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2063, PETRI_PLACES=79, PETRI_TRANSITIONS=133} [2022-12-06 04:21:06,527 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2022-12-06 04:21:06,528 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:21:06,528 INFO L89 Accepts]: Start accepts. Operand has 79 places, 133 transitions, 2063 flow [2022-12-06 04:21:06,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:21:06,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:21:06,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 133 transitions, 2063 flow [2022-12-06 04:21:06,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 133 transitions, 2063 flow [2022-12-06 04:21:06,718 INFO L130 PetriNetUnfolder]: 1037/1946 cut-off events. [2022-12-06 04:21:06,718 INFO L131 PetriNetUnfolder]: For 13148/14411 co-relation queries the response was YES. [2022-12-06 04:21:06,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12799 conditions, 1946 events. 1037/1946 cut-off events. For 13148/14411 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 12892 event pairs, 69 based on Foata normal form. 94/2025 useless extension candidates. Maximal degree in co-relation 12760. Up to 1146 conditions per place. [2022-12-06 04:21:06,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 133 transitions, 2063 flow [2022-12-06 04:21:06,743 INFO L188 LiptonReduction]: Number of co-enabled transitions 1112 [2022-12-06 04:21:06,759 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:21:06,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 04:21:06,760 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 133 transitions, 2063 flow [2022-12-06 04:21:06,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:06,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:21:06,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:21:06,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:21:06,760 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:21:06,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:21:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash -196627244, now seen corresponding path program 1 times [2022-12-06 04:21:06,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:21:06,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631113562] [2022-12-06 04:21:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:21:06,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:21:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:21:07,420 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:21:07,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:21:07,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631113562] [2022-12-06 04:21:07,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631113562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:21:07,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:21:07,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:21:07,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221310742] [2022-12-06 04:21:07,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:21:07,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:21:07,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:21:07,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:21:07,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:21:07,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 04:21:07,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 133 transitions, 2063 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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:21:07,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:21:07,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 04:21:07,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:21:09,001 INFO L130 PetriNetUnfolder]: 9783/14398 cut-off events. [2022-12-06 04:21:09,001 INFO L131 PetriNetUnfolder]: For 131561/133543 co-relation queries the response was YES. [2022-12-06 04:21:09,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84325 conditions, 14398 events. 9783/14398 cut-off events. For 131561/133543 co-relation queries the response was YES. Maximal size of possible extension queue 915. Compared 89858 event pairs, 1079 based on Foata normal form. 701/14905 useless extension candidates. Maximal degree in co-relation 84283. Up to 8862 conditions per place. [2022-12-06 04:21:09,155 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 111 selfloop transitions, 53 changer transitions 0/186 dead transitions. [2022-12-06 04:21:09,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 186 transitions, 2979 flow [2022-12-06 04:21:09,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:21:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:21:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-06 04:21:09,157 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2022-12-06 04:21:09,157 INFO L175 Difference]: Start difference. First operand has 78 places, 133 transitions, 2063 flow. Second operand 5 states and 71 transitions. [2022-12-06 04:21:09,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 186 transitions, 2979 flow [2022-12-06 04:21:09,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 186 transitions, 2940 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 04:21:09,306 INFO L231 Difference]: Finished difference. Result has 81 places, 150 transitions, 2496 flow [2022-12-06 04:21:09,307 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2002, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2496, PETRI_PLACES=81, PETRI_TRANSITIONS=150} [2022-12-06 04:21:09,307 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2022-12-06 04:21:09,307 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:21:09,307 INFO L89 Accepts]: Start accepts. Operand has 81 places, 150 transitions, 2496 flow [2022-12-06 04:21:09,310 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:21:09,310 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:21:09,310 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 150 transitions, 2496 flow [2022-12-06 04:21:09,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 150 transitions, 2496 flow [2022-12-06 04:21:09,501 INFO L130 PetriNetUnfolder]: 1140/2163 cut-off events. [2022-12-06 04:21:09,501 INFO L131 PetriNetUnfolder]: For 16329/17439 co-relation queries the response was YES. [2022-12-06 04:21:09,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14689 conditions, 2163 events. 1140/2163 cut-off events. For 16329/17439 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 14947 event pairs, 73 based on Foata normal form. 98/2246 useless extension candidates. Maximal degree in co-relation 14649. Up to 1276 conditions per place. [2022-12-06 04:21:09,525 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 150 transitions, 2496 flow [2022-12-06 04:21:09,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 1212 [2022-12-06 04:21:09,548 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:21:09,549 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-06 04:21:09,549 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 150 transitions, 2496 flow [2022-12-06 04:21:09,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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:21:09,549 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:21:09,549 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:21:09,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:21:09,549 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:21:09,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:21:09,549 INFO L85 PathProgramCache]: Analyzing trace with hash -196840214, now seen corresponding path program 2 times [2022-12-06 04:21:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:21:09,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112347458] [2022-12-06 04:21:09,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:21:09,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:21:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:21:10,102 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:21:10,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:21:10,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112347458] [2022-12-06 04:21:10,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112347458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:21:10,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:21:10,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:21:10,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072385537] [2022-12-06 04:21:10,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:21:10,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:21:10,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:21:10,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:21:10,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:21:10,104 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:21:10,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 150 transitions, 2496 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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:21:10,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:21:10,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:21:10,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:21:11,811 INFO L130 PetriNetUnfolder]: 10185/15114 cut-off events. [2022-12-06 04:21:11,812 INFO L131 PetriNetUnfolder]: For 152993/154968 co-relation queries the response was YES. [2022-12-06 04:21:11,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91336 conditions, 15114 events. 10185/15114 cut-off events. For 152993/154968 co-relation queries the response was YES. Maximal size of possible extension queue 985. Compared 96674 event pairs, 1263 based on Foata normal form. 634/15522 useless extension candidates. Maximal degree in co-relation 91293. Up to 9506 conditions per place. [2022-12-06 04:21:11,978 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 109 selfloop transitions, 56 changer transitions 0/187 dead transitions. [2022-12-06 04:21:11,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 187 transitions, 3179 flow [2022-12-06 04:21:11,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:21:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:21:11,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 04:21:11,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2022-12-06 04:21:11,979 INFO L175 Difference]: Start difference. First operand has 81 places, 150 transitions, 2496 flow. Second operand 5 states and 68 transitions. [2022-12-06 04:21:11,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 187 transitions, 3179 flow [2022-12-06 04:21:12,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 187 transitions, 3090 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 04:21:12,246 INFO L231 Difference]: Finished difference. Result has 83 places, 159 transitions, 2764 flow [2022-12-06 04:21:12,246 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=2416, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2764, PETRI_PLACES=83, PETRI_TRANSITIONS=159} [2022-12-06 04:21:12,247 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2022-12-06 04:21:12,247 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:21:12,247 INFO L89 Accepts]: Start accepts. Operand has 83 places, 159 transitions, 2764 flow [2022-12-06 04:21:12,248 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:21:12,248 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:21:12,248 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 159 transitions, 2764 flow [2022-12-06 04:21:12,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 159 transitions, 2764 flow [2022-12-06 04:21:12,496 INFO L130 PetriNetUnfolder]: 1186/2281 cut-off events. [2022-12-06 04:21:12,496 INFO L131 PetriNetUnfolder]: For 18556/19666 co-relation queries the response was YES. [2022-12-06 04:21:12,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15863 conditions, 2281 events. 1186/2281 cut-off events. For 18556/19666 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 16114 event pairs, 75 based on Foata normal form. 98/2364 useless extension candidates. Maximal degree in co-relation 15822. Up to 1340 conditions per place. [2022-12-06 04:21:12,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 159 transitions, 2764 flow [2022-12-06 04:21:12,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 1278 [2022-12-06 04:21:13,729 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:21:13,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1482 [2022-12-06 04:21:13,730 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 159 transitions, 2800 flow [2022-12-06 04:21:13,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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:21:13,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:21:13,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:21:13,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:21:13,730 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:21:13,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:21:13,730 INFO L85 PathProgramCache]: Analyzing trace with hash -196704124, now seen corresponding path program 1 times [2022-12-06 04:21:13,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:21:13,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824569195] [2022-12-06 04:21:13,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:21:13,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:21:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:21:14,270 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:21:14,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:21:14,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824569195] [2022-12-06 04:21:14,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824569195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:21:14,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:21:14,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:21:14,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498317029] [2022-12-06 04:21:14,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:21:14,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:21:14,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:21:14,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:21:14,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:21:14,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 04:21:14,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 159 transitions, 2800 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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:21:14,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:21:14,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 04:21:14,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:21:15,970 INFO L130 PetriNetUnfolder]: 11141/16538 cut-off events. [2022-12-06 04:21:15,970 INFO L131 PetriNetUnfolder]: For 191593/193751 co-relation queries the response was YES. [2022-12-06 04:21:16,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101717 conditions, 16538 events. 11141/16538 cut-off events. For 191593/193751 co-relation queries the response was YES. Maximal size of possible extension queue 1117. Compared 107452 event pairs, 2028 based on Foata normal form. 644/16926 useless extension candidates. Maximal degree in co-relation 101673. Up to 10709 conditions per place. [2022-12-06 04:21:16,108 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 132 selfloop transitions, 36 changer transitions 0/190 dead transitions. [2022-12-06 04:21:16,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 190 transitions, 3473 flow [2022-12-06 04:21:16,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:21:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:21:16,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 04:21:16,109 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2022-12-06 04:21:16,109 INFO L175 Difference]: Start difference. First operand has 83 places, 159 transitions, 2800 flow. Second operand 4 states and 56 transitions. [2022-12-06 04:21:16,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 190 transitions, 3473 flow [2022-12-06 04:21:16,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 190 transitions, 3404 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 04:21:16,308 INFO L231 Difference]: Finished difference. Result has 85 places, 163 transitions, 2889 flow [2022-12-06 04:21:16,309 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2656, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2889, PETRI_PLACES=85, PETRI_TRANSITIONS=163} [2022-12-06 04:21:16,309 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2022-12-06 04:21:16,309 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:21:16,309 INFO L89 Accepts]: Start accepts. Operand has 85 places, 163 transitions, 2889 flow [2022-12-06 04:21:16,310 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:21:16,310 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:21:16,310 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 163 transitions, 2889 flow [2022-12-06 04:21:16,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 163 transitions, 2889 flow [2022-12-06 04:21:16,606 INFO L130 PetriNetUnfolder]: 1276/2482 cut-off events. [2022-12-06 04:21:16,606 INFO L131 PetriNetUnfolder]: For 21177/22293 co-relation queries the response was YES. [2022-12-06 04:21:16,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17191 conditions, 2482 events. 1276/2482 cut-off events. For 21177/22293 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 18073 event pairs, 78 based on Foata normal form. 98/2565 useless extension candidates. Maximal degree in co-relation 17149. Up to 1456 conditions per place. [2022-12-06 04:21:16,635 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 163 transitions, 2889 flow [2022-12-06 04:21:16,636 INFO L188 LiptonReduction]: Number of co-enabled transitions 1306 [2022-12-06 04:21:16,664 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:21:16,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 356 [2022-12-06 04:21:16,665 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 163 transitions, 2889 flow [2022-12-06 04:21:16,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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:21:16,665 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:21:16,665 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:21:16,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:21:16,666 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:21:16,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:21:16,666 INFO L85 PathProgramCache]: Analyzing trace with hash 953123941, now seen corresponding path program 1 times [2022-12-06 04:21:16,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:21:16,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094315680] [2022-12-06 04:21:16,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:21:16,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:21:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:21:17,004 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:21:17,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:21:17,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094315680] [2022-12-06 04:21:17,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094315680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:21:17,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:21:17,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:21:17,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056699485] [2022-12-06 04:21:17,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:21:17,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:21:17,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:21:17,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:21:17,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:21:17,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:21:17,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 163 transitions, 2889 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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:21:17,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:21:17,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:21:17,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:21:19,575 INFO L130 PetriNetUnfolder]: 11493/17016 cut-off events. [2022-12-06 04:21:19,575 INFO L131 PetriNetUnfolder]: For 214478/217089 co-relation queries the response was YES. [2022-12-06 04:21:19,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104544 conditions, 17016 events. 11493/17016 cut-off events. For 214478/217089 co-relation queries the response was YES. Maximal size of possible extension queue 1150. Compared 110793 event pairs, 1868 based on Foata normal form. 1006/17869 useless extension candidates. Maximal degree in co-relation 104499. Up to 10971 conditions per place. [2022-12-06 04:21:19,803 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 118 selfloop transitions, 59 changer transitions 0/199 dead transitions. [2022-12-06 04:21:19,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 199 transitions, 3689 flow [2022-12-06 04:21:19,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:21:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:21:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-06 04:21:19,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43703703703703706 [2022-12-06 04:21:19,805 INFO L175 Difference]: Start difference. First operand has 85 places, 163 transitions, 2889 flow. Second operand 5 states and 59 transitions. [2022-12-06 04:21:19,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 199 transitions, 3689 flow [2022-12-06 04:21:20,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 199 transitions, 3625 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 04:21:20,147 INFO L231 Difference]: Finished difference. Result has 88 places, 172 transitions, 3195 flow [2022-12-06 04:21:20,148 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=2825, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3195, PETRI_PLACES=88, PETRI_TRANSITIONS=172} [2022-12-06 04:21:20,148 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places. [2022-12-06 04:21:20,148 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:21:20,148 INFO L89 Accepts]: Start accepts. Operand has 88 places, 172 transitions, 3195 flow [2022-12-06 04:21:20,150 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:21:20,150 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:21:20,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 172 transitions, 3195 flow [2022-12-06 04:21:20,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 172 transitions, 3195 flow [2022-12-06 04:21:20,583 INFO L130 PetriNetUnfolder]: 1247/2434 cut-off events. [2022-12-06 04:21:20,584 INFO L131 PetriNetUnfolder]: For 21820/23158 co-relation queries the response was YES. [2022-12-06 04:21:20,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17484 conditions, 2434 events. 1247/2434 cut-off events. For 21820/23158 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 17754 event pairs, 76 based on Foata normal form. 164/2583 useless extension candidates. Maximal degree in co-relation 17441. Up to 1435 conditions per place. [2022-12-06 04:21:20,629 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 172 transitions, 3195 flow [2022-12-06 04:21:20,629 INFO L188 LiptonReduction]: Number of co-enabled transitions 1364 [2022-12-06 04:21:21,271 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:21:21,272 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1124 [2022-12-06 04:21:21,272 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 173 transitions, 3238 flow [2022-12-06 04:21:21,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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:21:21,272 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:21:21,272 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:21:21,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:21:21,272 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:21:21,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:21:21,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1817313706, now seen corresponding path program 1 times [2022-12-06 04:21:21,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:21:21,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970057355] [2022-12-06 04:21:21,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:21:21,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:21:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:21:21,376 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:21:21,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:21:21,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970057355] [2022-12-06 04:21:21,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970057355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:21:21,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:21:21,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:21:21,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602279137] [2022-12-06 04:21:21,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:21:21,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:21:21,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:21:21,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:21:21,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:21:21,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-06 04:21:21,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 173 transitions, 3238 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:21,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:21:21,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-06 04:21:21,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:21:22,721 INFO L130 PetriNetUnfolder]: 6823/10414 cut-off events. [2022-12-06 04:21:22,721 INFO L131 PetriNetUnfolder]: For 164463/167057 co-relation queries the response was YES. [2022-12-06 04:21:22,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66966 conditions, 10414 events. 6823/10414 cut-off events. For 164463/167057 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 67598 event pairs, 1187 based on Foata normal form. 1345/11505 useless extension candidates. Maximal degree in co-relation 66920. Up to 8523 conditions per place. [2022-12-06 04:21:22,801 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 203 selfloop transitions, 5 changer transitions 9/244 dead transitions. [2022-12-06 04:21:22,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 244 transitions, 4928 flow [2022-12-06 04:21:22,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:21:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:21:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 04:21:22,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-06 04:21:22,803 INFO L175 Difference]: Start difference. First operand has 89 places, 173 transitions, 3238 flow. Second operand 3 states and 54 transitions. [2022-12-06 04:21:22,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 244 transitions, 4928 flow [2022-12-06 04:21:22,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 244 transitions, 4886 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:21:22,888 INFO L231 Difference]: Finished difference. Result has 89 places, 160 transitions, 2807 flow [2022-12-06 04:21:22,888 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3004, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2807, PETRI_PLACES=89, PETRI_TRANSITIONS=160} [2022-12-06 04:21:22,889 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2022-12-06 04:21:22,889 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:21:22,889 INFO L89 Accepts]: Start accepts. Operand has 89 places, 160 transitions, 2807 flow [2022-12-06 04:21:22,891 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:21:22,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:21:22,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 160 transitions, 2807 flow [2022-12-06 04:21:22,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 160 transitions, 2807 flow [2022-12-06 04:21:23,317 INFO L130 PetriNetUnfolder]: 2478/4736 cut-off events. [2022-12-06 04:21:23,317 INFO L131 PetriNetUnfolder]: For 41330/43572 co-relation queries the response was YES. [2022-12-06 04:21:23,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27441 conditions, 4736 events. 2478/4736 cut-off events. For 41330/43572 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 39564 event pairs, 526 based on Foata normal form. 383/4829 useless extension candidates. Maximal degree in co-relation 27397. Up to 2115 conditions per place. [2022-12-06 04:21:23,404 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 160 transitions, 2807 flow [2022-12-06 04:21:23,405 INFO L188 LiptonReduction]: Number of co-enabled transitions 1584 [2022-12-06 04:21:23,537 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:21:23,538 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 649 [2022-12-06 04:21:23,538 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 160 transitions, 2809 flow [2022-12-06 04:21:23,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:23,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:21:23,538 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:21:23,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:21:23,538 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:21:23,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:21:23,539 INFO L85 PathProgramCache]: Analyzing trace with hash 978702976, now seen corresponding path program 1 times [2022-12-06 04:21:23,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:21:23,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418376488] [2022-12-06 04:21:23,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:21:23,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:21:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:21:23,834 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:21:23,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:21:23,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418376488] [2022-12-06 04:21:23,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418376488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:21:23,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:21:23,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:21:23,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592252542] [2022-12-06 04:21:23,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:21:23,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:21:23,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:21:23,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:21:23,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:21:23,837 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 04:21:23,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 160 transitions, 2809 flow. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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:21:23,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:21:23,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 04:21:23,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:21:25,279 INFO L130 PetriNetUnfolder]: 8239/12810 cut-off events. [2022-12-06 04:21:25,280 INFO L131 PetriNetUnfolder]: For 161208/163099 co-relation queries the response was YES. [2022-12-06 04:21:25,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81949 conditions, 12810 events. 8239/12810 cut-off events. For 161208/163099 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 87051 event pairs, 970 based on Foata normal form. 815/13582 useless extension candidates. Maximal degree in co-relation 81902. Up to 5362 conditions per place. [2022-12-06 04:21:25,395 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 114 selfloop transitions, 90 changer transitions 8/234 dead transitions. [2022-12-06 04:21:25,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 234 transitions, 4015 flow [2022-12-06 04:21:25,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:21:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:21:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-12-06 04:21:25,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44387755102040816 [2022-12-06 04:21:25,397 INFO L175 Difference]: Start difference. First operand has 89 places, 160 transitions, 2809 flow. Second operand 7 states and 87 transitions. [2022-12-06 04:21:25,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 234 transitions, 4015 flow [2022-12-06 04:21:25,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 234 transitions, 3998 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:21:25,570 INFO L231 Difference]: Finished difference. Result has 97 places, 169 transitions, 3280 flow [2022-12-06 04:21:25,570 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2804, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3280, PETRI_PLACES=97, PETRI_TRANSITIONS=169} [2022-12-06 04:21:25,571 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 55 predicate places. [2022-12-06 04:21:25,571 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:21:25,571 INFO L89 Accepts]: Start accepts. Operand has 97 places, 169 transitions, 3280 flow [2022-12-06 04:21:25,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:21:25,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:21:25,572 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 169 transitions, 3280 flow [2022-12-06 04:21:25,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 169 transitions, 3280 flow [2022-12-06 04:21:26,003 INFO L130 PetriNetUnfolder]: 2736/5223 cut-off events. [2022-12-06 04:21:26,004 INFO L131 PetriNetUnfolder]: For 48928/50906 co-relation queries the response was YES. [2022-12-06 04:21:26,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29206 conditions, 5223 events. 2736/5223 cut-off events. For 48928/50906 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 44887 event pairs, 715 based on Foata normal form. 345/5129 useless extension candidates. Maximal degree in co-relation 29158. Up to 2605 conditions per place. [2022-12-06 04:21:26,116 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 169 transitions, 3280 flow [2022-12-06 04:21:26,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 1606 [2022-12-06 04:21:26,134 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:26,200 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:26,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:26,334 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:26,392 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:26,455 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:26,517 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:26,575 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:26,627 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:26,687 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:26,753 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:26,809 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:26,867 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:26,930 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:26,998 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:27,065 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:27,127 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:27,181 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:27,233 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:27,281 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:27,333 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:27,384 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:28,414 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:21:28,415 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2844 [2022-12-06 04:21:28,415 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 170 transitions, 3456 flow [2022-12-06 04:21:28,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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:21:28,415 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:21:28,415 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:21:28,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:21:28,416 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:21:28,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:21:28,416 INFO L85 PathProgramCache]: Analyzing trace with hash 808579928, now seen corresponding path program 1 times [2022-12-06 04:21:28,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:21:28,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502430907] [2022-12-06 04:21:28,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:21:28,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:21:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:21:28,537 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:21:28,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:21:28,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502430907] [2022-12-06 04:21:28,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502430907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:21:28,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:21:28,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:21:28,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006365023] [2022-12-06 04:21:28,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:21:28,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:21:28,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:21:28,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:21:28,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:21:28,539 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 52 [2022-12-06 04:21:28,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 170 transitions, 3456 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:28,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:21:28,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 52 [2022-12-06 04:21:28,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:21:30,626 INFO L130 PetriNetUnfolder]: 10787/16957 cut-off events. [2022-12-06 04:21:30,626 INFO L131 PetriNetUnfolder]: For 279736/282595 co-relation queries the response was YES. [2022-12-06 04:21:30,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114407 conditions, 16957 events. 10787/16957 cut-off events. For 279736/282595 co-relation queries the response was YES. Maximal size of possible extension queue 1235. Compared 123060 event pairs, 2173 based on Foata normal form. 1865/18679 useless extension candidates. Maximal degree in co-relation 114356. Up to 8108 conditions per place. [2022-12-06 04:21:30,722 INFO L137 encePairwiseOnDemand]: 49/52 looper letters, 135 selfloop transitions, 1 changer transitions 145/296 dead transitions. [2022-12-06 04:21:30,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 296 transitions, 6085 flow [2022-12-06 04:21:30,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:21:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:21:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-06 04:21:30,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3557692307692308 [2022-12-06 04:21:30,729 INFO L175 Difference]: Start difference. First operand has 98 places, 170 transitions, 3456 flow. Second operand 4 states and 74 transitions. [2022-12-06 04:21:30,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 296 transitions, 6085 flow [2022-12-06 04:21:30,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 296 transitions, 5939 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-06 04:21:30,911 INFO L231 Difference]: Finished difference. Result has 100 places, 112 transitions, 1976 flow [2022-12-06 04:21:30,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2697, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1976, PETRI_PLACES=100, PETRI_TRANSITIONS=112} [2022-12-06 04:21:30,912 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places. [2022-12-06 04:21:30,913 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:21:30,913 INFO L89 Accepts]: Start accepts. Operand has 100 places, 112 transitions, 1976 flow [2022-12-06 04:21:30,913 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:21:30,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:21:30,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 112 transitions, 1976 flow [2022-12-06 04:21:30,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 112 transitions, 1976 flow [2022-12-06 04:21:31,240 INFO L130 PetriNetUnfolder]: 1955/4060 cut-off events. [2022-12-06 04:21:31,241 INFO L131 PetriNetUnfolder]: For 35543/36852 co-relation queries the response was YES. [2022-12-06 04:21:31,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20323 conditions, 4060 events. 1955/4060 cut-off events. For 35543/36852 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 36286 event pairs, 610 based on Foata normal form. 183/3865 useless extension candidates. Maximal degree in co-relation 20274. Up to 2337 conditions per place. [2022-12-06 04:21:31,298 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 112 transitions, 1976 flow [2022-12-06 04:21:31,298 INFO L188 LiptonReduction]: Number of co-enabled transitions 1124 [2022-12-06 04:21:31,802 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:21:31,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 890 [2022-12-06 04:21:31,803 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 111 transitions, 1989 flow [2022-12-06 04:21:31,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:31,803 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:21:31,803 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:21:31,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 04:21:31,803 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:21:31,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:21:31,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1214022085, now seen corresponding path program 1 times [2022-12-06 04:21:31,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:21:31,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296269938] [2022-12-06 04:21:31,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:21:31,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:21:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:21:32,013 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:21:32,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:21:32,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296269938] [2022-12-06 04:21:32,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296269938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:21:32,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:21:32,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:21:32,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205091983] [2022-12-06 04:21:32,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:21:32,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:21:32,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:21:32,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:21:32,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:21:32,015 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-06 04:21:32,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 111 transitions, 1989 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:32,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:21:32,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-06 04:21:32,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:21:32,549 INFO L130 PetriNetUnfolder]: 2592/4526 cut-off events. [2022-12-06 04:21:32,549 INFO L131 PetriNetUnfolder]: For 76537/76869 co-relation queries the response was YES. [2022-12-06 04:21:32,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29433 conditions, 4526 events. 2592/4526 cut-off events. For 76537/76869 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 30176 event pairs, 242 based on Foata normal form. 549/5044 useless extension candidates. Maximal degree in co-relation 29381. Up to 2922 conditions per place. [2022-12-06 04:21:32,595 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 153 selfloop transitions, 9 changer transitions 39/212 dead transitions. [2022-12-06 04:21:32,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 212 transitions, 4365 flow [2022-12-06 04:21:32,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:21:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:21:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-06 04:21:32,597 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6532258064516129 [2022-12-06 04:21:32,597 INFO L175 Difference]: Start difference. First operand has 98 places, 111 transitions, 1989 flow. Second operand 4 states and 81 transitions. [2022-12-06 04:21:32,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 212 transitions, 4365 flow [2022-12-06 04:21:32,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 212 transitions, 4255 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-06 04:21:32,660 INFO L231 Difference]: Finished difference. Result has 97 places, 98 transitions, 1649 flow [2022-12-06 04:21:32,660 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1835, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1649, PETRI_PLACES=97, PETRI_TRANSITIONS=98} [2022-12-06 04:21:32,660 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 55 predicate places. [2022-12-06 04:21:32,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:21:32,660 INFO L89 Accepts]: Start accepts. Operand has 97 places, 98 transitions, 1649 flow [2022-12-06 04:21:32,661 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:21:32,661 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:21:32,661 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 98 transitions, 1649 flow [2022-12-06 04:21:32,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 98 transitions, 1649 flow [2022-12-06 04:21:32,841 INFO L130 PetriNetUnfolder]: 1014/2285 cut-off events. [2022-12-06 04:21:32,841 INFO L131 PetriNetUnfolder]: For 22508/23767 co-relation queries the response was YES. [2022-12-06 04:21:32,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13121 conditions, 2285 events. 1014/2285 cut-off events. For 22508/23767 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 18811 event pairs, 136 based on Foata normal form. 186/2364 useless extension candidates. Maximal degree in co-relation 13072. Up to 1361 conditions per place. [2022-12-06 04:21:32,867 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 98 transitions, 1649 flow [2022-12-06 04:21:32,867 INFO L188 LiptonReduction]: Number of co-enabled transitions 1018 [2022-12-06 04:21:32,871 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:32,922 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:32,972 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:33,023 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] L810-->L817: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_100 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_40 (ite .cse1 v_~z$w_buff1~0_31 v_~z~0_58))) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86) (= v_~z$w_buff0_used~0_99 (ite .cse0 0 v_~z$w_buff0_used~0_100)) (= (ite .cse2 0 v_~z$r_buff0_thd4~0_33) v_~z$r_buff0_thd4~0_32) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [362] L777-->L780: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 04:21:33,091 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:21:33,091 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 431 [2022-12-06 04:21:33,092 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 98 transitions, 1681 flow [2022-12-06 04:21:33,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:33,092 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:21:33,092 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:21:33,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 04:21:33,092 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:21:33,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:21:33,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1140404898, now seen corresponding path program 1 times [2022-12-06 04:21:33,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:21:33,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785777525] [2022-12-06 04:21:33,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:21:33,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:21:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:21:33,462 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:21:33,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:21:33,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785777525] [2022-12-06 04:21:33,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785777525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:21:33,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:21:33,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:21:33,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937203121] [2022-12-06 04:21:33,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:21:33,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:21:33,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:21:33,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:21:33,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:21:33,464 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 04:21:33,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 98 transitions, 1681 flow. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:33,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:21:33,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 04:21:33,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:21:34,193 INFO L130 PetriNetUnfolder]: 3983/6758 cut-off events. [2022-12-06 04:21:34,194 INFO L131 PetriNetUnfolder]: For 87502/87502 co-relation queries the response was YES. [2022-12-06 04:21:34,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46106 conditions, 6758 events. 3983/6758 cut-off events. For 87502/87502 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 45161 event pairs, 677 based on Foata normal form. 25/6783 useless extension candidates. Maximal degree in co-relation 46054. Up to 3772 conditions per place. [2022-12-06 04:21:34,243 INFO L137 encePairwiseOnDemand]: 19/35 looper letters, 91 selfloop transitions, 21 changer transitions 55/167 dead transitions. [2022-12-06 04:21:34,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 167 transitions, 2878 flow [2022-12-06 04:21:34,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:21:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:21:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-06 04:21:34,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2022-12-06 04:21:34,244 INFO L175 Difference]: Start difference. First operand has 96 places, 98 transitions, 1681 flow. Second operand 4 states and 68 transitions. [2022-12-06 04:21:34,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 167 transitions, 2878 flow [2022-12-06 04:21:34,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 167 transitions, 2759 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-12-06 04:21:34,324 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 1198 flow [2022-12-06 04:21:34,324 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1503, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1198, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2022-12-06 04:21:34,325 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places. [2022-12-06 04:21:34,325 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:21:34,325 INFO L89 Accepts]: Start accepts. Operand has 95 places, 78 transitions, 1198 flow [2022-12-06 04:21:34,326 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:21:34,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:21:34,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 78 transitions, 1198 flow [2022-12-06 04:21:34,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 78 transitions, 1198 flow [2022-12-06 04:21:34,500 INFO L130 PetriNetUnfolder]: 997/2324 cut-off events. [2022-12-06 04:21:34,500 INFO L131 PetriNetUnfolder]: For 19237/20058 co-relation queries the response was YES. [2022-12-06 04:21:34,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11523 conditions, 2324 events. 997/2324 cut-off events. For 19237/20058 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 19758 event pairs, 181 based on Foata normal form. 117/2321 useless extension candidates. Maximal degree in co-relation 11474. Up to 1406 conditions per place. [2022-12-06 04:21:34,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 78 transitions, 1198 flow [2022-12-06 04:21:34,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 736 [2022-12-06 04:21:34,528 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:21:34,532 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 207 [2022-12-06 04:21:34,532 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 1198 flow [2022-12-06 04:21:34,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:34,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:21:34,532 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:21:34,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 04:21:34,532 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:21:34,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:21:34,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1352134697, now seen corresponding path program 1 times [2022-12-06 04:21:34,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:21:34,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925796822] [2022-12-06 04:21:34,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:21:34,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:21:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:21:34,617 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:21:34,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:21:34,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925796822] [2022-12-06 04:21:34,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925796822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:21:34,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:21:34,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:21:34,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107143928] [2022-12-06 04:21:34,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:21:34,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:21:34,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:21:34,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:21:34,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:21:34,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 04:21:34,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 1198 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:34,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:21:34,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 04:21:34,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:21:34,926 INFO L130 PetriNetUnfolder]: 1438/2748 cut-off events. [2022-12-06 04:21:34,926 INFO L131 PetriNetUnfolder]: For 34100/34428 co-relation queries the response was YES. [2022-12-06 04:21:34,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16971 conditions, 2748 events. 1438/2748 cut-off events. For 34100/34428 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 18755 event pairs, 70 based on Foata normal form. 439/3154 useless extension candidates. Maximal degree in co-relation 16919. Up to 1141 conditions per place. [2022-12-06 04:21:34,942 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 109 selfloop transitions, 13 changer transitions 37/168 dead transitions. [2022-12-06 04:21:34,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 168 transitions, 3111 flow [2022-12-06 04:21:34,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:21:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:21:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-06 04:21:34,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6137931034482759 [2022-12-06 04:21:34,944 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 1198 flow. Second operand 5 states and 89 transitions. [2022-12-06 04:21:34,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 168 transitions, 3111 flow [2022-12-06 04:21:34,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 168 transitions, 2945 flow, removed 10 selfloop flow, removed 9 redundant places. [2022-12-06 04:21:34,969 INFO L231 Difference]: Finished difference. Result has 91 places, 75 transitions, 1069 flow [2022-12-06 04:21:34,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1069, PETRI_PLACES=91, PETRI_TRANSITIONS=75} [2022-12-06 04:21:34,969 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2022-12-06 04:21:34,969 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:21:34,970 INFO L89 Accepts]: Start accepts. Operand has 91 places, 75 transitions, 1069 flow [2022-12-06 04:21:34,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:21:34,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:21:34,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 75 transitions, 1069 flow [2022-12-06 04:21:34,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 75 transitions, 1069 flow [2022-12-06 04:21:35,057 INFO L130 PetriNetUnfolder]: 465/1202 cut-off events. [2022-12-06 04:21:35,057 INFO L131 PetriNetUnfolder]: For 9146/9712 co-relation queries the response was YES. [2022-12-06 04:21:35,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6683 conditions, 1202 events. 465/1202 cut-off events. For 9146/9712 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 9273 event pairs, 28 based on Foata normal form. 105/1250 useless extension candidates. Maximal degree in co-relation 6638. Up to 660 conditions per place. [2022-12-06 04:21:35,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 75 transitions, 1069 flow [2022-12-06 04:21:35,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 586 [2022-12-06 04:21:35,070 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:21:35,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 04:21:35,071 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 1069 flow [2022-12-06 04:21:35,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:35,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:21:35,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:21:35,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 04:21:35,072 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:21:35,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:21:35,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1032635284, now seen corresponding path program 1 times [2022-12-06 04:21:35,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:21:35,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876674106] [2022-12-06 04:21:35,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:21:35,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:21:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:21:35,182 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:21:35,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:21:35,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876674106] [2022-12-06 04:21:35,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876674106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:21:35,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:21:35,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:21:35,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990852718] [2022-12-06 04:21:35,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:21:35,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:21:35,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:21:35,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:21:35,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:21:35,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 04:21:35,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 75 transitions, 1069 flow. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:35,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:21:35,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 04:21:35,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:21:35,418 INFO L130 PetriNetUnfolder]: 1025/1955 cut-off events. [2022-12-06 04:21:35,418 INFO L131 PetriNetUnfolder]: For 24616/24765 co-relation queries the response was YES. [2022-12-06 04:21:35,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13426 conditions, 1955 events. 1025/1955 cut-off events. For 24616/24765 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 12778 event pairs, 44 based on Foata normal form. 176/2113 useless extension candidates. Maximal degree in co-relation 13378. Up to 743 conditions per place. [2022-12-06 04:21:35,429 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 24 selfloop transitions, 17 changer transitions 105/149 dead transitions. [2022-12-06 04:21:35,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 149 transitions, 2633 flow [2022-12-06 04:21:35,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:21:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:21:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-12-06 04:21:35,430 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2022-12-06 04:21:35,430 INFO L175 Difference]: Start difference. First operand has 91 places, 75 transitions, 1069 flow. Second operand 6 states and 86 transitions. [2022-12-06 04:21:35,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 149 transitions, 2633 flow [2022-12-06 04:21:35,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 149 transitions, 2477 flow, removed 45 selfloop flow, removed 6 redundant places. [2022-12-06 04:21:35,467 INFO L231 Difference]: Finished difference. Result has 91 places, 36 transitions, 357 flow [2022-12-06 04:21:35,467 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=357, PETRI_PLACES=91, PETRI_TRANSITIONS=36} [2022-12-06 04:21:35,467 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2022-12-06 04:21:35,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:21:35,467 INFO L89 Accepts]: Start accepts. Operand has 91 places, 36 transitions, 357 flow [2022-12-06 04:21:35,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:21:35,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:21:35,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 36 transitions, 357 flow [2022-12-06 04:21:35,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 36 transitions, 357 flow [2022-12-06 04:21:35,474 INFO L130 PetriNetUnfolder]: 17/52 cut-off events. [2022-12-06 04:21:35,474 INFO L131 PetriNetUnfolder]: For 170/180 co-relation queries the response was YES. [2022-12-06 04:21:35,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 52 events. 17/52 cut-off events. For 170/180 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 73 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 224. Up to 18 conditions per place. [2022-12-06 04:21:35,475 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 36 transitions, 357 flow [2022-12-06 04:21:35,475 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 04:21:35,619 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [356] L762-->L765: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [532] $Ultimate##0-->L787: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_538 256) 0))) (.cse5 (not (= 0 (mod v_~z$r_buff0_thd3~0_84 256)))) (.cse1 (not (= (mod v_~z$r_buff1_thd3~0_91 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_503 256) 0)) .cse1)) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_539 256) 0)) .cse5)) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_83 256) 0)) .cse0) (and (not (= (mod v_~z$w_buff1_used~0_502 256) 0)) .cse1)) 0 v_~z$r_buff1_thd3~0_91) v_~z$r_buff1_thd3~0_90) (= (ite .cse2 v_~z$w_buff0~0_342 (ite .cse3 v_~z$w_buff1~0_312 1)) v_~z~0_530) (= |v_P2Thread1of1ForFork0_#in~arg.base_17| v_P2Thread1of1ForFork0_~arg.base_17) (= v_~y~0_115 2) (= v_~z$w_buff1_used~0_502 (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_503)) (= v_~z$w_buff0_used~0_538 (ite .cse2 0 v_~z$w_buff0_used~0_539)) (= v_~z$r_buff0_thd3~0_83 (ite .cse4 0 v_~z$r_buff0_thd3~0_84)) (= |v_P2Thread1of1ForFork0_#in~arg.offset_17| v_P2Thread1of1ForFork0_~arg.offset_17)))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_539, ~z$w_buff0~0=v_~z$w_buff0~0_342, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_91, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_503, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_84, ~z$w_buff1~0=v_~z$w_buff1~0_312, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_17, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_538, ~z$w_buff0~0=v_~z$w_buff0~0_342, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_90, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_502, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_83, ~z$w_buff1~0=v_~z$w_buff1~0_312, ~z~0=v_~z~0_530, ~y~0=v_~y~0_115, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, ~z$w_buff0_used~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0, ~y~0] [2022-12-06 04:21:36,103 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [521] $Ultimate##0-->L750: Formula: (and (= v_~x~0_116 1) (= v_~a~0_40 1) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{~a~0=v_~a~0_40, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_116, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [535] $Ultimate##0-->L787: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd3~0_101 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_94 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_550 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_551 256) 0)) .cse5)) (.cse4 (and .cse0 (not (= (mod v_~z$w_buff1_used~0_513 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_512 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd3~0_93 256) 0)))) 0 v_~z$r_buff1_thd3~0_101) v_~z$r_buff1_thd3~0_100) (= v_~y~0_121 2) (= |v_P2Thread1of1ForFork0_#in~arg.offset_21| v_P2Thread1of1ForFork0_~arg.offset_21) (= (ite .cse2 0 v_~z$w_buff0_used~0_551) v_~z$w_buff0_used~0_550) (= |v_P2Thread1of1ForFork0_#in~arg.base_21| v_P2Thread1of1ForFork0_~arg.base_21) (= 2 v_~x~0_128) (= v_~z$r_buff0_thd3~0_93 (ite .cse3 0 v_~z$r_buff0_thd3~0_94)) (= |v_P1Thread1of1ForFork3_#in~arg.offset_17| v_P1Thread1of1ForFork3_~arg.offset_17) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_513) v_~z$w_buff1_used~0_512) (= v_~z~0_536 (ite .cse2 v_~z$w_buff0~0_350 (ite .cse4 v_~z$w_buff1~0_318 1))) (= |v_P1Thread1of1ForFork3_#in~arg.base_17| v_P1Thread1of1ForFork3_~arg.base_17)))) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_551, ~z$w_buff0~0=v_~z$w_buff0~0_350, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_101, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_513, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_94, ~z$w_buff1~0=v_~z$w_buff1~0_318, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} OutVars{P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_17, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_550, ~z$w_buff0~0=v_~z$w_buff0~0_350, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_100, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_512, ~z$w_buff1~0=v_~z$w_buff1~0_318, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_17, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_21, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_93, ~z~0=v_~z~0_536, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_121, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|, ~x~0=v_~x~0_128} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P2Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork3_~arg.base, ~z$w_buff0_used~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0, ~y~0, ~x~0] [2022-12-06 04:21:36,558 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [537] $Ultimate##0-->L787: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd3~0_105 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_98 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_558 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse1 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_559 256) 0)))) (.cse4 (and .cse3 (not (= 0 (mod v_~z$w_buff1_used~0_521 256)))))) (and (= v_~z$r_buff0_thd3~0_97 (ite .cse0 0 v_~z$r_buff0_thd3~0_98)) (= (ite .cse1 0 v_~z$w_buff0_used~0_559) v_~z$w_buff0_used~0_558) (= v_P0Thread1of1ForFork1_~arg.offset_27 |v_P0Thread1of1ForFork1_#in~arg.offset_27|) (= 2 v_~x~0_130) (= v_~a~0_54 1) (= |v_P1Thread1of1ForFork3_#in~arg.base_19| v_P1Thread1of1ForFork3_~arg.base_19) (= |v_P2Thread1of1ForFork0_#in~arg.base_23| v_P2Thread1of1ForFork0_~arg.base_23) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_97 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_520 256) 0)))) 0 v_~z$r_buff1_thd3~0_105) v_~z$r_buff1_thd3~0_104) (= v_~z$w_buff1_used~0_520 (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_521)) (= |v_P1Thread1of1ForFork3_#in~arg.offset_19| v_P1Thread1of1ForFork3_~arg.offset_19) (= (ite .cse1 v_~z$w_buff0~0_354 (ite .cse4 v_~z$w_buff1~0_322 1)) v_~z~0_542) (= |v_P0Thread1of1ForFork1_#in~arg.base_27| v_P0Thread1of1ForFork1_~arg.base_27) (= |v_P2Thread1of1ForFork0_#in~arg.offset_23| v_P2Thread1of1ForFork0_~arg.offset_23) (= v_~y~0_123 2)))) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_19|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_559, ~z$w_buff0~0=v_~z$w_buff0~0_354, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_105, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_521, ~z$w_buff1~0=v_~z$w_buff1~0_322, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_98, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_19|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|} OutVars{P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_558, ~z$w_buff0~0=v_~z$w_buff0~0_354, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_104, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_520, ~z$w_buff1~0=v_~z$w_buff1~0_322, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_27, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_19, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_19|, ~a~0=v_~a~0_54, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_23, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_97, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_27, ~z~0=v_~z~0_542, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_19|, ~y~0=v_~y~0_123, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|, ~x~0=v_~x~0_130} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.base, ~z$w_buff0_used~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, P0Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork3_~arg.offset, ~a~0, P2Thread1of1ForFork0_~arg.base, ~z$r_buff0_thd3~0, P0Thread1of1ForFork1_~arg.offset, ~z~0, ~y~0, ~x~0] and [401] L750-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_17| 0) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= |v_P0Thread1of1ForFork1_#res.offset_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-06 04:21:36,721 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] $Ultimate##0-->L810: Formula: (and (= v_~z$w_buff0~0_347 v_~z$w_buff1~0_316) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_510 256) 0)) (not (= (mod v_~z$w_buff0_used~0_546 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_31|) (= v_~z$r_buff0_thd4~0_224 1) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_31| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_31|) (= v_~z$w_buff0_used~0_546 1) (= |v_P3Thread1of1ForFork2_~arg#1.base_25| |v_P3Thread1of1ForFork2_#in~arg#1.base_25|) (= v_~z$r_buff0_thd1~0_45 v_~z$r_buff1_thd1~0_43) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_31| 0)) (= v_~z$w_buff0~0_346 2) (= v_~z$r_buff0_thd4~0_225 v_~z$r_buff1_thd4~0_203) (= |v_P3Thread1of1ForFork2_~arg#1.offset_25| |v_P3Thread1of1ForFork2_#in~arg#1.offset_25|) (= v_~z$r_buff0_thd2~0_39 v_~z$r_buff1_thd2~0_45) (= v_~a~0_52 v_~__unbuffered_p3_EAX~0_102) (= v_~z$r_buff0_thd3~0_91 v_~z$r_buff1_thd3~0_98) (= v_~z$w_buff0_used~0_547 v_~z$w_buff1_used~0_510) (= v_~z$r_buff0_thd0~0_306 v_~z$r_buff1_thd0~0_309)) InVars {~a~0=v_~a~0_52, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_306, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_547, ~z$w_buff0~0=v_~z$w_buff0~0_347, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_25|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_25|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_225, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_91, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_45, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_39} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_203, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_546, ~z$w_buff0~0=v_~z$w_buff0~0_346, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_98, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_25|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_45, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_510, ~z$w_buff1~0=v_~z$w_buff1~0_316, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_31|, ~a~0=v_~a~0_52, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_31|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_306, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_25|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_25|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_309, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_43, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_25|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_102, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_224, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_91, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_45, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_39} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] and [537] $Ultimate##0-->L787: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd3~0_105 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_98 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_558 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse1 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_559 256) 0)))) (.cse4 (and .cse3 (not (= 0 (mod v_~z$w_buff1_used~0_521 256)))))) (and (= v_~z$r_buff0_thd3~0_97 (ite .cse0 0 v_~z$r_buff0_thd3~0_98)) (= (ite .cse1 0 v_~z$w_buff0_used~0_559) v_~z$w_buff0_used~0_558) (= v_P0Thread1of1ForFork1_~arg.offset_27 |v_P0Thread1of1ForFork1_#in~arg.offset_27|) (= 2 v_~x~0_130) (= v_~a~0_54 1) (= |v_P1Thread1of1ForFork3_#in~arg.base_19| v_P1Thread1of1ForFork3_~arg.base_19) (= |v_P2Thread1of1ForFork0_#in~arg.base_23| v_P2Thread1of1ForFork0_~arg.base_23) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_97 256) 0)) .cse2) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_520 256) 0)))) 0 v_~z$r_buff1_thd3~0_105) v_~z$r_buff1_thd3~0_104) (= v_~z$w_buff1_used~0_520 (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_521)) (= |v_P1Thread1of1ForFork3_#in~arg.offset_19| v_P1Thread1of1ForFork3_~arg.offset_19) (= (ite .cse1 v_~z$w_buff0~0_354 (ite .cse4 v_~z$w_buff1~0_322 1)) v_~z~0_542) (= |v_P0Thread1of1ForFork1_#in~arg.base_27| v_P0Thread1of1ForFork1_~arg.base_27) (= |v_P2Thread1of1ForFork0_#in~arg.offset_23| v_P2Thread1of1ForFork0_~arg.offset_23) (= v_~y~0_123 2)))) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_19|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_559, ~z$w_buff0~0=v_~z$w_buff0~0_354, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_105, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_521, ~z$w_buff1~0=v_~z$w_buff1~0_322, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_98, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_19|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|} OutVars{P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_558, ~z$w_buff0~0=v_~z$w_buff0~0_354, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_104, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_520, ~z$w_buff1~0=v_~z$w_buff1~0_322, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_27, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_19, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_19|, ~a~0=v_~a~0_54, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_23, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_97, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_27, ~z~0=v_~z~0_542, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_19|, ~y~0=v_~y~0_123, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|, ~x~0=v_~x~0_130} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.base, ~z$w_buff0_used~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, P0Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork3_~arg.offset, ~a~0, P2Thread1of1ForFork0_~arg.base, ~z$r_buff0_thd3~0, P0Thread1of1ForFork1_~arg.offset, ~z~0, ~y~0, ~x~0] [2022-12-06 04:21:36,936 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] $Ultimate##0-->L810: Formula: (and (= v_~z$w_buff0~0_347 v_~z$w_buff1~0_316) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_510 256) 0)) (not (= (mod v_~z$w_buff0_used~0_546 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_31|) (= v_~z$r_buff0_thd4~0_224 1) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_31| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_31|) (= v_~z$w_buff0_used~0_546 1) (= |v_P3Thread1of1ForFork2_~arg#1.base_25| |v_P3Thread1of1ForFork2_#in~arg#1.base_25|) (= v_~z$r_buff0_thd1~0_45 v_~z$r_buff1_thd1~0_43) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_31| 0)) (= v_~z$w_buff0~0_346 2) (= v_~z$r_buff0_thd4~0_225 v_~z$r_buff1_thd4~0_203) (= |v_P3Thread1of1ForFork2_~arg#1.offset_25| |v_P3Thread1of1ForFork2_#in~arg#1.offset_25|) (= v_~z$r_buff0_thd2~0_39 v_~z$r_buff1_thd2~0_45) (= v_~a~0_52 v_~__unbuffered_p3_EAX~0_102) (= v_~z$r_buff0_thd3~0_91 v_~z$r_buff1_thd3~0_98) (= v_~z$w_buff0_used~0_547 v_~z$w_buff1_used~0_510) (= v_~z$r_buff0_thd0~0_306 v_~z$r_buff1_thd0~0_309)) InVars {~a~0=v_~a~0_52, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_306, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_547, ~z$w_buff0~0=v_~z$w_buff0~0_347, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_25|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_25|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_225, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_91, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_45, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_39} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_203, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_546, ~z$w_buff0~0=v_~z$w_buff0~0_346, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_98, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_25|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_45, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_510, ~z$w_buff1~0=v_~z$w_buff1~0_316, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_31|, ~a~0=v_~a~0_52, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_31|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_306, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_25|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_25|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_309, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_43, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_25|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_102, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_224, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_91, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_45, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_39} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] and [542] $Ultimate##0-->P0EXIT: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd3~0_109 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_578 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_102 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_579 256) 0)) .cse5)) (.cse4 (and .cse5 .cse2)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_541 256) 0))))) (and (= |v_P0Thread1of1ForFork1_#res.base_49| 0) (= |v_P0Thread1of1ForFork1_#res.offset_49| 0) (= |v_P2Thread1of1ForFork0_#in~arg.base_25| v_P2Thread1of1ForFork0_~arg.base_25) (= v_~z~0_560 (ite .cse0 v_~z$w_buff0~0_364 (ite .cse1 v_~z$w_buff1~0_332 1))) (= 2 v_~x~0_134) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_101 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_540 256) 0)) .cse3)) 0 v_~z$r_buff1_thd3~0_109) v_~z$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_383 (+ v_~__unbuffered_cnt~0_384 1)) (= v_~a~0_56 1) (= (ite .cse0 0 v_~z$w_buff0_used~0_579) v_~z$w_buff0_used~0_578) (= |v_P1Thread1of1ForFork3_#in~arg.offset_21| v_P1Thread1of1ForFork3_~arg.offset_21) (= v_P0Thread1of1ForFork1_~arg.offset_29 |v_P0Thread1of1ForFork1_#in~arg.offset_29|) (= |v_P1Thread1of1ForFork3_#in~arg.base_21| v_P1Thread1of1ForFork3_~arg.base_21) (= v_~z$r_buff0_thd3~0_101 (ite .cse4 0 v_~z$r_buff0_thd3~0_102)) (= |v_P2Thread1of1ForFork0_#in~arg.offset_25| v_P2Thread1of1ForFork0_~arg.offset_25) (= |v_P0Thread1of1ForFork1_#in~arg.base_29| v_P0Thread1of1ForFork1_~arg.base_29) (= v_~z$w_buff1_used~0_540 (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_541)) (= v_~y~0_125 2)))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_25|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_579, ~z$w_buff0~0=v_~z$w_buff0~0_364, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_109, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_541, ~z$w_buff1~0=v_~z$w_buff1~0_332, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_21|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_102, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_384, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_21|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_25|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_49|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_49|, ~z$w_buff1~0=v_~z$w_buff1~0_332, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_29, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_21|, ~a~0=v_~a~0_56, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_25, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_29, ~y~0=v_~y~0_125, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_25|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_578, ~z$w_buff0~0=v_~z$w_buff0~0_364, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_108, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_25, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_540, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_21, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_101, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~z~0=v_~z~0_560, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_21|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_25|, ~x~0=v_~x~0_134} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork1_#res.offset, ~z$w_buff0_used~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork0_~arg.offset, P0Thread1of1ForFork1_#res.base, ~z$w_buff1_used~0, P0Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork3_~arg.offset, ~a~0, P2Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork1_~arg.offset, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~y~0, ~x~0] [2022-12-06 04:21:37,845 INFO L203 LiptonReduction]: Total number of compositions: 11 [2022-12-06 04:21:37,845 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2378 [2022-12-06 04:21:37,846 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 26 transitions, 364 flow [2022-12-06 04:21:37,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:37,846 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:21:37,846 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:21:37,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 04:21:37,846 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:21:37,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:21:37,846 INFO L85 PathProgramCache]: Analyzing trace with hash -490186188, now seen corresponding path program 1 times [2022-12-06 04:21:37,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:21:37,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15144789] [2022-12-06 04:21:37,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:21:37,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:21:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:21:37,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:21:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:21:37,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:21:37,925 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:21:37,926 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:21:37,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:21:37,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:21:37,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:21:37,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:21:37,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:21:37,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:21:37,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 04:21:37,928 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:21:37,932 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:21:37,932 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:21:37,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:21:37 BasicIcfg [2022-12-06 04:21:37,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:21:37,997 INFO L158 Benchmark]: Toolchain (without parser) took 57962.40ms. Allocated memory was 177.2MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 152.5MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-06 04:21:37,997 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 177.2MB. Free memory was 154.1MB in the beginning and 154.0MB in the end (delta: 85.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:21:37,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.71ms. Allocated memory is still 177.2MB. Free memory was 152.1MB in the beginning and 124.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:21:37,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.22ms. Allocated memory is still 177.2MB. Free memory was 124.8MB in the beginning and 122.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:21:37,997 INFO L158 Benchmark]: Boogie Preprocessor took 31.70ms. Allocated memory is still 177.2MB. Free memory was 122.2MB in the beginning and 120.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:21:37,997 INFO L158 Benchmark]: RCFGBuilder took 651.27ms. Allocated memory is still 177.2MB. Free memory was 120.1MB in the beginning and 88.1MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 04:21:37,998 INFO L158 Benchmark]: TraceAbstraction took 56793.67ms. Allocated memory was 177.2MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 87.1MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-06 04:21:37,998 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 177.2MB. Free memory was 154.1MB in the beginning and 154.0MB in the end (delta: 85.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 424.71ms. Allocated memory is still 177.2MB. Free memory was 152.1MB in the beginning and 124.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.22ms. Allocated memory is still 177.2MB. Free memory was 124.8MB in the beginning and 122.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.70ms. Allocated memory is still 177.2MB. Free memory was 122.2MB in the beginning and 120.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 651.27ms. Allocated memory is still 177.2MB. Free memory was 120.1MB in the beginning and 88.1MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 56793.67ms. Allocated memory was 177.2MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 87.1MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 132 PlacesBefore, 42 PlacesAfterwards, 121 TransitionsBefore, 30 TransitionsAfterwards, 2736 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2181, independent: 2118, independent conditional: 2118, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2181, independent: 2118, independent conditional: 0, independent unconditional: 2118, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2181, independent: 2118, independent conditional: 0, independent unconditional: 2118, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2181, independent: 2118, independent conditional: 0, independent unconditional: 2118, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1847, independent: 1804, independent conditional: 0, independent unconditional: 1804, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1847, independent: 1773, independent conditional: 0, independent unconditional: 1773, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 217, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 175, dependent conditional: 0, dependent unconditional: 175, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2181, independent: 314, independent conditional: 0, independent unconditional: 314, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 1847, unknown conditional: 0, unknown unconditional: 1847] , Statistics on independence cache: Total cache size (in pairs): 2744, Positive cache size: 2701, Positive conditional cache size: 0, Positive unconditional cache size: 2701, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 181, independent: 157, independent conditional: 157, 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: 181, independent: 157, independent conditional: 14, independent unconditional: 143, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 181, independent: 157, independent conditional: 14, independent unconditional: 143, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 181, independent: 157, independent conditional: 14, independent unconditional: 143, dependent: 24, dependent conditional: 3, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 160, independent: 143, independent conditional: 11, independent unconditional: 132, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 160, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 33, dependent conditional: 8, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 181, independent: 14, independent conditional: 3, independent unconditional: 11, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 160, unknown conditional: 13, unknown unconditional: 147] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 143, Positive conditional cache size: 11, Positive unconditional cache size: 132, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 127, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 127, independent: 116, independent conditional: 34, independent unconditional: 82, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 127, independent: 116, independent conditional: 12, independent unconditional: 104, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 127, independent: 116, independent conditional: 12, independent unconditional: 104, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 127, independent: 111, independent conditional: 10, independent unconditional: 101, dependent: 9, dependent conditional: 1, dependent unconditional: 8, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 148, Positive conditional cache size: 13, Positive unconditional cache size: 135, Negative cache size: 19, Negative conditional cache size: 4, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 278, independent: 258, independent conditional: 258, 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: 278, independent: 258, independent conditional: 84, independent unconditional: 174, 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: 278, independent: 258, independent conditional: 3, independent unconditional: 255, 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: 278, independent: 258, independent conditional: 3, independent unconditional: 255, 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: 6, independent: 6, independent conditional: 1, 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: 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: 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: 278, independent: 252, independent conditional: 2, independent unconditional: 250, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 154, Positive conditional cache size: 14, Positive unconditional cache size: 140, Negative cache size: 19, Negative conditional cache size: 4, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 568 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 428, independent: 400, independent conditional: 400, 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: 428, independent: 400, independent conditional: 144, independent unconditional: 256, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 428, independent: 400, independent conditional: 7, independent unconditional: 393, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 428, independent: 400, independent conditional: 7, independent unconditional: 393, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , 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: 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 428, independent: 393, independent conditional: 7, independent unconditional: 386, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 161, Positive conditional cache size: 14, Positive unconditional cache size: 147, Negative cache size: 20, Negative conditional cache size: 4, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 137, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 57 PlacesBefore, 57 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 728 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 983, independent: 913, independent conditional: 913, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 983, independent: 913, independent conditional: 529, independent unconditional: 384, dependent: 70, dependent conditional: 24, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1031, independent: 913, independent conditional: 119, independent unconditional: 794, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1031, independent: 913, independent conditional: 119, independent unconditional: 794, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 2, 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: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1031, independent: 906, independent conditional: 117, independent unconditional: 789, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 180, Positive conditional cache size: 16, Positive unconditional cache size: 164, Negative cache size: 20, Negative conditional cache size: 4, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 482, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 63 PlacesBefore, 63 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 832 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1698, independent: 1600, independent conditional: 1600, independent unconditional: 0, dependent: 98, dependent conditional: 98, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1698, independent: 1600, independent conditional: 904, independent unconditional: 696, dependent: 98, dependent conditional: 24, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1698, independent: 1600, independent conditional: 310, independent unconditional: 1290, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1698, independent: 1600, independent conditional: 310, independent unconditional: 1290, dependent: 98, dependent conditional: 0, dependent unconditional: 98, 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: 1698, independent: 1600, independent conditional: 310, independent unconditional: 1290, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 212, Positive conditional cache size: 16, Positive unconditional cache size: 196, Negative cache size: 20, Negative conditional cache size: 4, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 618, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 122 TransitionsBefore, 122 TransitionsAfterwards, 1040 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1115, independent: 1049, independent conditional: 1049, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1115, independent: 1049, independent conditional: 599, independent unconditional: 450, dependent: 66, dependent conditional: 13, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1117, independent: 1049, independent conditional: 202, independent unconditional: 847, dependent: 68, dependent conditional: 3, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1117, independent: 1049, independent conditional: 202, independent unconditional: 847, dependent: 68, dependent conditional: 3, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 19, independent conditional: 3, independent unconditional: 16, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1117, independent: 1045, independent conditional: 201, independent unconditional: 844, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 216, Positive conditional cache size: 17, Positive unconditional cache size: 199, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 409, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 75 PlacesBefore, 76 PlacesAfterwards, 132 TransitionsBefore, 130 TransitionsAfterwards, 1104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2217, independent: 2081, independent conditional: 2081, independent unconditional: 0, dependent: 136, dependent conditional: 136, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2217, independent: 2081, independent conditional: 1210, independent unconditional: 871, dependent: 136, dependent conditional: 26, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2221, independent: 2081, independent conditional: 484, independent unconditional: 1597, dependent: 140, dependent conditional: 6, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2221, independent: 2081, independent conditional: 484, independent unconditional: 1597, dependent: 140, dependent conditional: 6, dependent unconditional: 134, 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: 2221, independent: 2079, independent conditional: 483, independent unconditional: 1596, dependent: 140, dependent conditional: 6, dependent unconditional: 134, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 218, Positive conditional cache size: 18, Positive unconditional cache size: 200, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 750, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 133 TransitionsBefore, 133 TransitionsAfterwards, 1112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1159, independent: 1091, independent conditional: 1091, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1159, independent: 1091, independent conditional: 636, independent unconditional: 455, dependent: 68, dependent conditional: 13, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1161, independent: 1091, independent conditional: 244, independent unconditional: 847, dependent: 70, dependent conditional: 3, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1161, independent: 1091, independent conditional: 244, independent unconditional: 847, dependent: 70, dependent conditional: 3, dependent unconditional: 67, 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: 1161, independent: 1091, independent conditional: 244, independent unconditional: 847, dependent: 70, dependent conditional: 3, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 218, Positive conditional cache size: 18, Positive unconditional cache size: 200, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 404, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 150 TransitionsBefore, 150 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1636, independent: 1553, independent conditional: 1553, independent unconditional: 0, dependent: 83, dependent conditional: 83, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1636, independent: 1553, independent conditional: 977, independent unconditional: 576, dependent: 83, dependent conditional: 13, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1638, independent: 1553, independent conditional: 487, independent unconditional: 1066, dependent: 85, dependent conditional: 3, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1638, independent: 1553, independent conditional: 487, independent unconditional: 1066, dependent: 85, dependent conditional: 3, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1638, independent: 1552, independent conditional: 486, independent unconditional: 1066, dependent: 85, dependent conditional: 3, dependent unconditional: 82, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 219, Positive conditional cache size: 19, Positive unconditional cache size: 200, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 502, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 83 PlacesBefore, 83 PlacesAfterwards, 159 TransitionsBefore, 159 TransitionsAfterwards, 1278 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3386, independent: 3208, independent conditional: 3208, independent unconditional: 0, dependent: 178, dependent conditional: 178, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3386, independent: 3208, independent conditional: 1930, independent unconditional: 1278, dependent: 178, dependent conditional: 26, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3390, independent: 3208, independent conditional: 890, independent unconditional: 2318, dependent: 182, dependent conditional: 6, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3390, independent: 3208, independent conditional: 890, independent unconditional: 2318, dependent: 182, dependent conditional: 6, dependent unconditional: 176, 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: 3390, independent: 3208, independent conditional: 890, independent unconditional: 2318, dependent: 182, dependent conditional: 6, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 233, Positive conditional cache size: 19, Positive unconditional cache size: 214, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1064, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 85 PlacesBefore, 85 PlacesAfterwards, 163 TransitionsBefore, 163 TransitionsAfterwards, 1306 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1756, independent: 1662, independent conditional: 1662, independent unconditional: 0, dependent: 94, dependent conditional: 94, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1756, independent: 1662, independent conditional: 952, independent unconditional: 710, dependent: 94, dependent conditional: 13, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1758, independent: 1662, independent conditional: 368, independent unconditional: 1294, dependent: 96, dependent conditional: 3, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1758, independent: 1662, independent conditional: 368, independent unconditional: 1294, dependent: 96, dependent conditional: 3, dependent unconditional: 93, 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: 1758, independent: 1662, independent conditional: 368, independent unconditional: 1294, dependent: 96, dependent conditional: 3, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 233, Positive conditional cache size: 19, Positive unconditional cache size: 214, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 596, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 88 PlacesBefore, 89 PlacesAfterwards, 172 TransitionsBefore, 173 TransitionsAfterwards, 1364 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4069, independent: 3864, independent conditional: 3864, independent unconditional: 0, dependent: 205, dependent conditional: 205, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4069, independent: 3864, independent conditional: 2282, independent unconditional: 1582, dependent: 205, dependent conditional: 24, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4069, independent: 3864, independent conditional: 1016, independent unconditional: 2848, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4069, independent: 3864, independent conditional: 1016, independent unconditional: 2848, dependent: 205, dependent conditional: 0, dependent unconditional: 205, 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: 4069, independent: 3864, independent conditional: 1016, independent unconditional: 2848, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 240, Positive conditional cache size: 19, Positive unconditional cache size: 221, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1290, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 89 PlacesBefore, 89 PlacesAfterwards, 160 TransitionsBefore, 160 TransitionsAfterwards, 1584 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1122, independent: 1098, independent conditional: 1098, 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: 1122, independent: 1098, independent conditional: 847, independent unconditional: 251, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1122, independent: 1098, independent conditional: 579, independent unconditional: 519, 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: 1122, independent: 1098, independent conditional: 579, independent unconditional: 519, 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: 11, independent: 11, independent conditional: 7, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 1122, independent: 1087, independent conditional: 572, independent unconditional: 515, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 11, unknown conditional: 7, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 280, Positive cache size: 257, Positive conditional cache size: 26, Positive unconditional cache size: 231, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 292, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 97 PlacesBefore, 98 PlacesAfterwards, 169 TransitionsBefore, 170 TransitionsAfterwards, 1606 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1098, independent: 1074, independent conditional: 1074, 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: 1098, independent: 1074, independent conditional: 862, independent unconditional: 212, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1098, independent: 1074, independent conditional: 233, independent unconditional: 841, 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: 1098, independent: 1074, independent conditional: 233, independent unconditional: 841, 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: 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: 1098, independent: 1073, independent conditional: 233, independent unconditional: 840, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 580, Positive cache size: 557, Positive conditional cache size: 26, Positive unconditional cache size: 531, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 653, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 98 PlacesBefore, 98 PlacesAfterwards, 112 TransitionsBefore, 111 TransitionsAfterwards, 1124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 480, independent: 480, independent conditional: 480, 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: 480, independent: 480, independent conditional: 390, independent unconditional: 90, 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: 480, independent: 480, independent conditional: 294, independent unconditional: 186, 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: 480, independent: 480, independent conditional: 294, independent unconditional: 186, 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: 480, independent: 480, independent conditional: 294, independent unconditional: 186, 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): 1036, Positive cache size: 1013, Positive conditional cache size: 32, Positive unconditional cache size: 981, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 96, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 96 PlacesBefore, 96 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 1018 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 76, independent conditional: 76, 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: 76, independent: 76, independent conditional: 76, 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: 76, independent: 76, independent conditional: 12, independent unconditional: 64, 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: 76, independent: 76, independent conditional: 12, independent unconditional: 64, 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: 76, independent: 76, independent conditional: 12, independent unconditional: 64, 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): 1136, Positive cache size: 1113, Positive conditional cache size: 32, Positive unconditional cache size: 1081, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 64, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 95 PlacesBefore, 95 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 736 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 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): 1136, Positive cache size: 1113, Positive conditional cache size: 32, Positive unconditional cache size: 1081, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, 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.0s, 91 PlacesBefore, 91 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 586 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 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): 1136, Positive cache size: 1113, Positive conditional cache size: 32, Positive unconditional cache size: 1081, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, 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: 2.4s, 85 PlacesBefore, 71 PlacesAfterwards, 36 TransitionsBefore, 26 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 50, 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: 50, independent: 50, independent conditional: 50, 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: 50, independent: 50, independent conditional: 40, independent unconditional: 10, 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: 50, independent: 50, independent conditional: 40, independent unconditional: 10, 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: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 47, independent conditional: 38, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1265, Positive cache size: 1242, Positive conditional cache size: 35, Positive unconditional cache size: 1207, Negative cache size: 23, Negative conditional cache size: 7, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1517; [L835] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1517, ((void *)0), P0, ((void *)0))=-2, t1517={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1518; [L837] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1518, ((void *)0), P1, ((void *)0))=-1, t1517={5:0}, t1518={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1519; [L839] FCALL, FORK 0 pthread_create(&t1519, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1519, ((void *)0), P2, ((void *)0))=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1520; [L841] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1520, ((void *)0), P3, ((void *)0))=1, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L800] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L800] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 [L809] 4 __unbuffered_p3_EAX = a [L746] 4 a = 1 [L749] 4 x = 1 [L761] 4 x = 2 [L764] 4 y = 1 [L776] 4 y = 2 [L779] 4 z = 1 [L782] 4 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 4 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] 4 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L869] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 837]: 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: 835]: 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: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 159 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 56.6s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 643 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 643 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1800 IncrementalHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 42 mSDtfsCounter, 1800 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3456occurred in iteration=15, InterpolantAutomatonStates: 89, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 4370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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:21:38,041 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...