/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/mix045_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:18:03,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:18:03,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:18:03,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:18:03,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:18:03,406 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:18:03,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:18:03,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:18:03,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:18:03,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:18:03,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:18:03,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:18:03,425 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:18:03,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:18:03,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:18:03,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:18:03,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:18:03,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:18:03,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:18:03,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:18:03,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:18:03,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:18:03,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:18:03,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:18:03,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:18:03,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:18:03,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:18:03,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:18:03,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:18:03,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:18:03,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:18:03,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:18:03,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:18:03,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:18:03,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:18:03,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:18:03,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:18:03,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:18:03,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:18:03,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:18:03,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:18:03,456 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:18:03,487 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:18:03,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:18:03,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:18:03,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:18:03,490 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:18:03,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:18:03,490 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:18:03,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:18:03,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:18:03,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:18:03,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:18:03,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:18:03,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:18:03,492 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:18:03,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:18:03,492 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:18:03,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:18:03,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:18:03,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:18:03,493 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:18:03,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:18:03,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:18:03,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:18:03,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:18:03,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:18:03,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:18:03,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:18:03,494 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:18:03,494 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:18:03,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:18:03,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:18:03,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:18:03,844 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:18:03,845 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:18:03,846 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 04:18:04,932 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:18:05,190 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:18:05,191 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 04:18:05,204 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1c909e7/2f85c02500ea408ebdbf6a43ac1ca75a/FLAG99dbb5910 [2022-12-06 04:18:05,224 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1c909e7/2f85c02500ea408ebdbf6a43ac1ca75a [2022-12-06 04:18:05,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:18:05,228 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:18:05,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:18:05,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:18:05,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:18:05,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:18:05" (1/1) ... [2022-12-06 04:18:05,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48a5337b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:05, skipping insertion in model container [2022-12-06 04:18:05,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:18:05" (1/1) ... [2022-12-06 04:18:05,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:18:05,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:18:05,436 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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-06 04:18:05,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:18:05,685 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:18:05,697 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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-06 04:18:05,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:18:05,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:18:05,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:18:05,810 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:18:05,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:05 WrapperNode [2022-12-06 04:18:05,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:18:05,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:18:05,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:18:05,813 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:18:05,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:05" (1/1) ... [2022-12-06 04:18:05,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:05" (1/1) ... [2022-12-06 04:18:05,893 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-12-06 04:18:05,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:18:05,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:18:05,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:18:05,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:18:05,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:05" (1/1) ... [2022-12-06 04:18:05,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:05" (1/1) ... [2022-12-06 04:18:05,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:05" (1/1) ... [2022-12-06 04:18:05,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:05" (1/1) ... [2022-12-06 04:18:05,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:05" (1/1) ... [2022-12-06 04:18:05,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:05" (1/1) ... [2022-12-06 04:18:05,930 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:05" (1/1) ... [2022-12-06 04:18:05,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:05" (1/1) ... [2022-12-06 04:18:05,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:18:05,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:18:05,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:18:05,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:18:05,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:05" (1/1) ... [2022-12-06 04:18:05,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:18:05,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:18:05,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:18:05,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:18:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:18:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:18:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:18:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:18:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:18:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:18:06,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:18:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:18:06,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:18:06,024 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:18:06,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:18:06,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:18:06,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:18:06,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:18:06,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:18:06,025 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:18:06,231 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:18:06,233 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:18:06,530 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:18:06,676 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:18:06,677 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:18:06,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:18:06 BoogieIcfgContainer [2022-12-06 04:18:06,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:18:06,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:18:06,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:18:06,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:18:06,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:18:05" (1/3) ... [2022-12-06 04:18:06,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41fc301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:18:06, skipping insertion in model container [2022-12-06 04:18:06,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:18:05" (2/3) ... [2022-12-06 04:18:06,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41fc301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:18:06, skipping insertion in model container [2022-12-06 04:18:06,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:18:06" (3/3) ... [2022-12-06 04:18:06,686 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-06 04:18:06,706 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:18:06,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:18:06,707 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:18:06,772 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:18:06,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-06 04:18:06,887 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-06 04:18:06,888 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:18:06,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-06 04:18:06,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-06 04:18:06,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-06 04:18:06,901 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:06,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-06 04:18:06,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2022-12-06 04:18:06,976 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-06 04:18:06,977 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:18:06,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-06 04:18:06,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-06 04:18:06,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 1944 [2022-12-06 04:18:12,616 INFO L203 LiptonReduction]: Total number of compositions: 84 [2022-12-06 04:18:12,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:18:12,635 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;@4e2bcb9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:18:12,635 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:18:12,639 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 04:18:12,639 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:18:12,639 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:12,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:12,640 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:18:12,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:12,644 INFO L85 PathProgramCache]: Analyzing trace with hash 465213775, now seen corresponding path program 1 times [2022-12-06 04:18:12,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:12,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369332194] [2022-12-06 04:18:12,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:12,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:18:13,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:13,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369332194] [2022-12-06 04:18:13,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369332194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:13,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:13,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:18:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113840145] [2022-12-06 04:18:13,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:13,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:18:13,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:13,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:18:13,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:18:13,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 04:18:13,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:13,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:13,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 04:18:13,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:13,338 INFO L130 PetriNetUnfolder]: 615/1086 cut-off events. [2022-12-06 04:18:13,338 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 04:18:13,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 1086 events. 615/1086 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5822 event pairs, 129 based on Foata normal form. 0/986 useless extension candidates. Maximal degree in co-relation 2046. Up to 703 conditions per place. [2022-12-06 04:18:13,348 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 23 selfloop transitions, 2 changer transitions 4/33 dead transitions. [2022-12-06 04:18:13,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 133 flow [2022-12-06 04:18:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:18:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:18:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 04:18:13,358 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-06 04:18:13,360 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 46 transitions. [2022-12-06 04:18:13,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 133 flow [2022-12-06 04:18:13,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:18:13,364 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2022-12-06 04:18:13,366 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-06 04:18:13,369 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-06 04:18:13,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:13,369 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 52 flow [2022-12-06 04:18:13,372 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:13,372 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:13,372 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 52 flow [2022-12-06 04:18:13,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 04:18:13,378 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:18:13,378 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:18:13,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:18:13,379 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 04:18:13,379 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 04:18:13,479 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:13,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-06 04:18:13,481 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 04:18:13,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:13,481 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:13,481 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:13,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:18:13,482 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:18:13,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash 393879830, now seen corresponding path program 1 times [2022-12-06 04:18:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:13,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357892510] [2022-12-06 04:18:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:13,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:18:13,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:13,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357892510] [2022-12-06 04:18:13,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357892510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:13,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:13,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:18:13,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113338758] [2022-12-06 04:18:13,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:13,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:18:13,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:13,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:18:13,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:18:13,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-06 04:18:13,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:13,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:13,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-06 04:18:13,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:13,842 INFO L130 PetriNetUnfolder]: 453/744 cut-off events. [2022-12-06 04:18:13,843 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 04:18:13,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 744 events. 453/744 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3272 event pairs, 177 based on Foata normal form. 24/764 useless extension candidates. Maximal degree in co-relation 1506. Up to 445 conditions per place. [2022-12-06 04:18:13,849 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 23 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-06 04:18:13,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 116 flow [2022-12-06 04:18:13,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:18:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:18:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 04:18:13,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 04:18:13,852 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 35 transitions. [2022-12-06 04:18:13,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 116 flow [2022-12-06 04:18:13,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:18:13,854 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2022-12-06 04:18:13,854 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-06 04:18:13,855 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2022-12-06 04:18:13,855 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:13,855 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 04:18:13,855 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:13,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:13,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 04:18:13,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 04:18:13,860 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:18:13,861 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:18:13,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:18:13,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 04:18:13,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-06 04:18:14,012 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:18:14,014 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 04:18:14,014 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2022-12-06 04:18:14,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:14,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:14,014 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:14,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:18:14,015 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:18:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:14,015 INFO L85 PathProgramCache]: Analyzing trace with hash -674619365, now seen corresponding path program 1 times [2022-12-06 04:18:14,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:14,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178953594] [2022-12-06 04:18:14,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:14,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:18:14,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:14,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178953594] [2022-12-06 04:18:14,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178953594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:14,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:14,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:18:14,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245871201] [2022-12-06 04:18:14,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:14,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:18:14,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:14,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:18:14,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:18:14,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:18:14,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:14,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:14,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:18:14,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:14,420 INFO L130 PetriNetUnfolder]: 511/822 cut-off events. [2022-12-06 04:18:14,420 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2022-12-06 04:18:14,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 822 events. 511/822 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3415 event pairs, 205 based on Foata normal form. 6/824 useless extension candidates. Maximal degree in co-relation 1782. Up to 727 conditions per place. [2022-12-06 04:18:14,425 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 27 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2022-12-06 04:18:14,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 145 flow [2022-12-06 04:18:14,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:18:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:18:14,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 04:18:14,427 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-06 04:18:14,427 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 3 states and 37 transitions. [2022-12-06 04:18:14,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 145 flow [2022-12-06 04:18:14,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 139 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:18:14,429 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 69 flow [2022-12-06 04:18:14,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2022-12-06 04:18:14,429 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2022-12-06 04:18:14,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:14,430 INFO L89 Accepts]: Start accepts. Operand has 31 places, 22 transitions, 69 flow [2022-12-06 04:18:14,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:14,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:14,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 22 transitions, 69 flow [2022-12-06 04:18:14,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 69 flow [2022-12-06 04:18:14,437 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-06 04:18:14,438 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:18:14,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 32 events. 3/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 67 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2022-12-06 04:18:14,438 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 69 flow [2022-12-06 04:18:14,438 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 04:18:14,441 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:14,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 04:18:14,442 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 69 flow [2022-12-06 04:18:14,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:14,443 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:14,443 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:14,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:18:14,443 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:18:14,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:14,444 INFO L85 PathProgramCache]: Analyzing trace with hash 561637386, now seen corresponding path program 1 times [2022-12-06 04:18:14,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:14,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229798471] [2022-12-06 04:18:14,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:14,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:18:14,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:14,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229798471] [2022-12-06 04:18:14,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229798471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:14,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:14,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:18:14,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146013991] [2022-12-06 04:18:14,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:14,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:18:14,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:14,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:18:14,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:18:14,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:18:14,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 69 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:14,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:14,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:18:14,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:15,047 INFO L130 PetriNetUnfolder]: 567/947 cut-off events. [2022-12-06 04:18:15,047 INFO L131 PetriNetUnfolder]: For 179/180 co-relation queries the response was YES. [2022-12-06 04:18:15,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2132 conditions, 947 events. 567/947 cut-off events. For 179/180 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4184 event pairs, 164 based on Foata normal form. 6/952 useless extension candidates. Maximal degree in co-relation 2120. Up to 737 conditions per place. [2022-12-06 04:18:15,053 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 32 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2022-12-06 04:18:15,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 192 flow [2022-12-06 04:18:15,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:18:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:18:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 04:18:15,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5375 [2022-12-06 04:18:15,055 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 69 flow. Second operand 4 states and 43 transitions. [2022-12-06 04:18:15,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 192 flow [2022-12-06 04:18:15,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 187 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:18:15,057 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 99 flow [2022-12-06 04:18:15,057 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-06 04:18:15,058 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2022-12-06 04:18:15,058 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:15,058 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 99 flow [2022-12-06 04:18:15,059 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:15,059 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:15,059 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 99 flow [2022-12-06 04:18:15,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 99 flow [2022-12-06 04:18:15,067 INFO L130 PetriNetUnfolder]: 12/50 cut-off events. [2022-12-06 04:18:15,067 INFO L131 PetriNetUnfolder]: For 25/28 co-relation queries the response was YES. [2022-12-06 04:18:15,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 50 events. 12/50 cut-off events. For 25/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 155 event pairs, 3 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 105. Up to 16 conditions per place. [2022-12-06 04:18:15,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 99 flow [2022-12-06 04:18:15,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 04:18:15,096 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:15,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-06 04:18:15,098 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 99 flow [2022-12-06 04:18:15,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:15,098 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:15,098 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:15,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:18:15,099 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:18:15,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:15,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1002007132, now seen corresponding path program 1 times [2022-12-06 04:18:15,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:15,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825002328] [2022-12-06 04:18:15,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:15,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:18:15,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:15,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825002328] [2022-12-06 04:18:15,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825002328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:15,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:15,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:18:15,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085700383] [2022-12-06 04:18:15,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:15,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:18:15,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:15,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:18:15,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:18:15,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:18:15,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:15,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:15,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:18:15,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:15,709 INFO L130 PetriNetUnfolder]: 599/995 cut-off events. [2022-12-06 04:18:15,709 INFO L131 PetriNetUnfolder]: For 433/434 co-relation queries the response was YES. [2022-12-06 04:18:15,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2533 conditions, 995 events. 599/995 cut-off events. For 433/434 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4454 event pairs, 118 based on Foata normal form. 4/998 useless extension candidates. Maximal degree in co-relation 2518. Up to 678 conditions per place. [2022-12-06 04:18:15,719 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 35 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2022-12-06 04:18:15,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 244 flow [2022-12-06 04:18:15,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:18:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:18:15,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 04:18:15,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.51 [2022-12-06 04:18:15,721 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 99 flow. Second operand 5 states and 51 transitions. [2022-12-06 04:18:15,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 244 flow [2022-12-06 04:18:15,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:18:15,724 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 156 flow [2022-12-06 04:18:15,724 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2022-12-06 04:18:15,724 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2022-12-06 04:18:15,725 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:15,725 INFO L89 Accepts]: Start accepts. Operand has 41 places, 32 transitions, 156 flow [2022-12-06 04:18:15,726 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:15,726 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:15,726 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 32 transitions, 156 flow [2022-12-06 04:18:15,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 156 flow [2022-12-06 04:18:15,746 INFO L130 PetriNetUnfolder]: 48/128 cut-off events. [2022-12-06 04:18:15,746 INFO L131 PetriNetUnfolder]: For 144/156 co-relation queries the response was YES. [2022-12-06 04:18:15,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 128 events. 48/128 cut-off events. For 144/156 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 570 event pairs, 9 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 357. Up to 59 conditions per place. [2022-12-06 04:18:15,748 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 156 flow [2022-12-06 04:18:15,748 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-06 04:18:15,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [443] $Ultimate##0-->L796: Formula: (and (= v_~y$r_buff0_thd0~0_307 v_~y$r_buff1_thd0~0_307) (= v_~y$r_buff0_thd1~0_50 v_~y$r_buff1_thd1~0_48) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_36| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_36|) (= v_~y$r_buff0_thd3~0_136 1) (= v_~y$w_buff1~0_281 v_~y$w_buff0~0_317) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_36| 0)) (= |v_P2Thread1of1ForFork1_~arg#1.base_30| |v_P2Thread1of1ForFork1_#in~arg#1.base_30|) (= 2 v_~y$w_buff0~0_316) (= v_~z~0_49 v_~__unbuffered_p2_EAX~0_105) (= v_~z~0_49 1) (= v_~y$r_buff0_thd2~0_126 v_~y$r_buff1_thd2~0_126) (= v_~y$w_buff0_used~0_452 1) (= v_~y$w_buff0_used~0_453 v_~y$w_buff1_used~0_410) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_30| |v_P2Thread1of1ForFork1_~arg#1.offset_30|) (= v_~y$r_buff0_thd3~0_137 v_~y$r_buff1_thd3~0_98) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_410 256) 0)) (not (= (mod v_~y$w_buff0_used~0_452 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_36|)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_30|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_453, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_307, ~y$w_buff0~0=v_~y$w_buff0~0_317, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_50, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_30|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_452, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_30|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_30|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_126, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_48, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_98, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_30|, ~y$w_buff1~0=v_~y$w_buff1~0_281, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_136, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_307, ~y$w_buff0~0=v_~y$w_buff0~0_316, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_30|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_50, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_36|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~z~0=v_~z~0_49, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_36|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_410} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [327] L764-->L771: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_109 256) 0)))) (let ((.cse2 (and .cse5 .cse0)) (.cse3 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_110 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_97 256) 0)) .cse1))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_96 256) 0)) .cse1)) 0 v_~y$r_buff1_thd2~0_24) v_~y$r_buff1_thd2~0_23) (= v_~y$r_buff0_thd2~0_25 (ite .cse2 0 v_~y$r_buff0_thd2~0_26)) (= (ite .cse3 0 v_~y$w_buff0_used~0_110) v_~y$w_buff0_used~0_109) (= v_~y$w_buff1_used~0_96 (ite (or .cse2 .cse4) 0 v_~y$w_buff1_used~0_97)) (= v_~y~0_71 (ite .cse3 v_~y$w_buff0~0_54 (ite .cse4 v_~y$w_buff1~0_47 v_~y~0_72)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:18:16,067 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [326] L761-->L764: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [444] $Ultimate##0-->L771: Formula: (let ((.cse4 (= (mod v_~y$w_buff0_used~0_506 256) 0)) (.cse0 (not (= (mod v_~y$r_buff0_thd2~0_145 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_504 256) 0)))) (let ((.cse3 (and .cse0 .cse1)) (.cse2 (and (not .cse4) .cse0))) (and (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_36| |v_P2Thread1of1ForFork1_~arg#1.offset_36|) (= v_~y$r_buff0_thd0~0_349 v_~y$r_buff1_thd0~0_349) (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_458 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_144 256) 0)))) 0 v_~y$r_buff0_thd2~0_145) v_~y$r_buff1_thd2~0_146) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_42| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|) (= v_~y~0_428 (ite .cse0 v_~y$w_buff0~0_345 (ite .cse2 v_~y$w_buff1~0_309 v_~y~0_429))) (= v_~y$r_buff0_thd2~0_144 (ite .cse3 0 v_~y$r_buff0_thd2~0_145)) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_42| 0)) (= v_~y$r_buff0_thd3~0_148 1) (= v_~y$r_buff0_thd1~0_56 v_~y$r_buff1_thd1~0_54) (= v_~y$w_buff1~0_309 v_~y$w_buff0~0_346) (= 2 v_~y$w_buff0~0_345) (= |v_P2Thread1of1ForFork1_~arg#1.base_36| |v_P2Thread1of1ForFork1_#in~arg#1.base_36|) (= v_~y$w_buff0_used~0_504 (ite .cse0 0 1)) (= v_~z~0_55 v_~__unbuffered_p2_EAX~0_111) (= v_~y$r_buff0_thd3~0_149 v_~y$r_buff1_thd3~0_104) (= v_~z~0_55 1) (= (ite .cse4 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|) (= (ite (or .cse3 .cse2) 0 v_~y$w_buff0_used~0_506) v_~y$w_buff1_used~0_458)))) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_36|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_506, ~y$w_buff0~0=v_~y$w_buff0~0_346, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_149, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_349, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_145, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_56, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_36|, ~y~0=v_~y~0_429} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_504, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_36|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_36|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_146, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_54, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_104, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_36|, ~y$w_buff1~0=v_~y$w_buff1~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_345, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_148, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_349, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_36|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_144, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_56, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_42|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_111, ~z~0=v_~z~0_55, ~y~0=v_~y~0_428, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_349, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_458, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_~arg#1.base, ~y$r_buff0_thd2~0, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] [2022-12-06 04:18:16,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [326] L761-->L764: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [436] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_277 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd0~0_181 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd0~0_183 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_278 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_248 256) 0)) .cse3)) (.cse4 (and .cse5 .cse2))) (and (= v_~y~0_213 (ite .cse0 v_~y$w_buff0~0_192 (ite .cse1 v_~y$w_buff1~0_168 v_~y~0_214))) (= v_~y$r_buff1_thd0~0_180 (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd0~0_182 256) 0))) (and .cse3 (not (= 0 (mod v_~y$w_buff1_used~0_247 256))))) 0 v_~y$r_buff1_thd0~0_181)) (= (ite .cse0 0 v_~y$w_buff0_used~0_278) v_~y$w_buff0_used~0_277) (= v_~y$r_buff0_thd0~0_182 (ite .cse4 0 v_~y$r_buff0_thd0~0_183)) (= (ite (or .cse1 .cse4) 0 v_~y$w_buff1_used~0_248) v_~y$w_buff1_used~0_247) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_278, ~y$w_buff1~0=v_~y$w_buff1~0_168, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_183, ~y$w_buff0~0=v_~y$w_buff0~0_192, ~y~0=v_~y~0_214, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_181, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_248, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$w_buff1~0=v_~y$w_buff1~0_168, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_182, ~y$w_buff0~0=v_~y$w_buff0~0_192, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_25|, ~y~0=v_~y~0_213, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_180, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_247, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:18:16,348 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [326] L761-->L764: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [443] $Ultimate##0-->L796: Formula: (and (= v_~y$r_buff0_thd0~0_307 v_~y$r_buff1_thd0~0_307) (= v_~y$r_buff0_thd1~0_50 v_~y$r_buff1_thd1~0_48) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_36| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_36|) (= v_~y$r_buff0_thd3~0_136 1) (= v_~y$w_buff1~0_281 v_~y$w_buff0~0_317) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_36| 0)) (= |v_P2Thread1of1ForFork1_~arg#1.base_30| |v_P2Thread1of1ForFork1_#in~arg#1.base_30|) (= 2 v_~y$w_buff0~0_316) (= v_~z~0_49 v_~__unbuffered_p2_EAX~0_105) (= v_~z~0_49 1) (= v_~y$r_buff0_thd2~0_126 v_~y$r_buff1_thd2~0_126) (= v_~y$w_buff0_used~0_452 1) (= v_~y$w_buff0_used~0_453 v_~y$w_buff1_used~0_410) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_30| |v_P2Thread1of1ForFork1_~arg#1.offset_30|) (= v_~y$r_buff0_thd3~0_137 v_~y$r_buff1_thd3~0_98) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_410 256) 0)) (not (= (mod v_~y$w_buff0_used~0_452 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_36|)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_30|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_453, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_307, ~y$w_buff0~0=v_~y$w_buff0~0_317, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_50, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_30|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_452, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_30|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_30|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_126, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_48, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_98, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_30|, ~y$w_buff1~0=v_~y$w_buff1~0_281, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_136, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_307, ~y$w_buff0~0=v_~y$w_buff0~0_316, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_30|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_50, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_36|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~z~0=v_~z~0_49, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_36|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_410} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-06 04:18:16,542 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:18:16,543 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 818 [2022-12-06 04:18:16,544 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 171 flow [2022-12-06 04:18:16,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:16,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:16,544 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:16,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:18:16,544 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:18:16,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:16,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1002140196, now seen corresponding path program 1 times [2022-12-06 04:18:16,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:16,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199369991] [2022-12-06 04:18:16,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:16,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:18:17,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:17,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199369991] [2022-12-06 04:18:17,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199369991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:17,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:17,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:18:17,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291258473] [2022-12-06 04:18:17,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:17,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:18:17,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:17,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:18:17,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:18:17,551 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:18:17,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 171 flow. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:17,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:17,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:18:17,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:17,947 INFO L130 PetriNetUnfolder]: 1143/1750 cut-off events. [2022-12-06 04:18:17,947 INFO L131 PetriNetUnfolder]: For 2291/2291 co-relation queries the response was YES. [2022-12-06 04:18:17,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5548 conditions, 1750 events. 1143/1750 cut-off events. For 2291/2291 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7911 event pairs, 155 based on Foata normal form. 40/1772 useless extension candidates. Maximal degree in co-relation 5529. Up to 1113 conditions per place. [2022-12-06 04:18:17,962 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 49 selfloop transitions, 28 changer transitions 0/77 dead transitions. [2022-12-06 04:18:17,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 77 transitions, 532 flow [2022-12-06 04:18:17,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:18:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:18:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-12-06 04:18:17,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2022-12-06 04:18:17,966 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 171 flow. Second operand 6 states and 67 transitions. [2022-12-06 04:18:17,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 77 transitions, 532 flow [2022-12-06 04:18:17,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 77 transitions, 513 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 04:18:17,974 INFO L231 Difference]: Finished difference. Result has 47 places, 54 transitions, 412 flow [2022-12-06 04:18:17,974 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=412, PETRI_PLACES=47, PETRI_TRANSITIONS=54} [2022-12-06 04:18:17,977 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2022-12-06 04:18:17,977 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:17,977 INFO L89 Accepts]: Start accepts. Operand has 47 places, 54 transitions, 412 flow [2022-12-06 04:18:17,978 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:17,978 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:17,978 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 54 transitions, 412 flow [2022-12-06 04:18:17,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 54 transitions, 412 flow [2022-12-06 04:18:18,022 INFO L130 PetriNetUnfolder]: 148/335 cut-off events. [2022-12-06 04:18:18,022 INFO L131 PetriNetUnfolder]: For 1014/1050 co-relation queries the response was YES. [2022-12-06 04:18:18,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 335 events. 148/335 cut-off events. For 1014/1050 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1780 event pairs, 17 based on Foata normal form. 5/333 useless extension candidates. Maximal degree in co-relation 1226. Up to 127 conditions per place. [2022-12-06 04:18:18,026 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 54 transitions, 412 flow [2022-12-06 04:18:18,027 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-06 04:18:18,041 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:18,042 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-06 04:18:18,043 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 54 transitions, 412 flow [2022-12-06 04:18:18,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:18,043 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:18,043 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:18,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:18:18,043 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:18:18,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:18,044 INFO L85 PathProgramCache]: Analyzing trace with hash 561577928, now seen corresponding path program 1 times [2022-12-06 04:18:18,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:18,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21359205] [2022-12-06 04:18:18,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:18,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:18:18,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:18,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21359205] [2022-12-06 04:18:18,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21359205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:18,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:18,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:18:18,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140623565] [2022-12-06 04:18:18,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:18,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:18:18,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:18,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:18:18,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:18:18,674 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 04:18:18,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 54 transitions, 412 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:18,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:18,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 04:18:18,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:18,946 INFO L130 PetriNetUnfolder]: 1009/1626 cut-off events. [2022-12-06 04:18:18,946 INFO L131 PetriNetUnfolder]: For 5266/5290 co-relation queries the response was YES. [2022-12-06 04:18:18,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6332 conditions, 1626 events. 1009/1626 cut-off events. For 5266/5290 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8186 event pairs, 181 based on Foata normal form. 16/1610 useless extension candidates. Maximal degree in co-relation 6309. Up to 1110 conditions per place. [2022-12-06 04:18:18,965 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 46 selfloop transitions, 15 changer transitions 0/69 dead transitions. [2022-12-06 04:18:18,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 69 transitions, 610 flow [2022-12-06 04:18:18,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:18:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:18:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 04:18:18,967 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-06 04:18:18,967 INFO L175 Difference]: Start difference. First operand has 47 places, 54 transitions, 412 flow. Second operand 4 states and 44 transitions. [2022-12-06 04:18:18,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 69 transitions, 610 flow [2022-12-06 04:18:18,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 559 flow, removed 21 selfloop flow, removed 1 redundant places. [2022-12-06 04:18:18,982 INFO L231 Difference]: Finished difference. Result has 50 places, 58 transitions, 447 flow [2022-12-06 04:18:18,982 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=447, PETRI_PLACES=50, PETRI_TRANSITIONS=58} [2022-12-06 04:18:18,982 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2022-12-06 04:18:18,983 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:18,983 INFO L89 Accepts]: Start accepts. Operand has 50 places, 58 transitions, 447 flow [2022-12-06 04:18:18,983 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:18,983 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:18,984 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 58 transitions, 447 flow [2022-12-06 04:18:18,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 58 transitions, 447 flow [2022-12-06 04:18:19,027 INFO L130 PetriNetUnfolder]: 158/361 cut-off events. [2022-12-06 04:18:19,028 INFO L131 PetriNetUnfolder]: For 1164/1212 co-relation queries the response was YES. [2022-12-06 04:18:19,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 361 events. 158/361 cut-off events. For 1164/1212 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 1960 event pairs, 20 based on Foata normal form. 5/358 useless extension candidates. Maximal degree in co-relation 1362. Up to 140 conditions per place. [2022-12-06 04:18:19,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 58 transitions, 447 flow [2022-12-06 04:18:19,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 04:18:19,040 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:19,043 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 04:18:19,043 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 58 transitions, 447 flow [2022-12-06 04:18:19,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:19,043 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:19,043 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:19,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:18:19,043 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:18:19,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1572697534, now seen corresponding path program 2 times [2022-12-06 04:18:19,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:19,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671871653] [2022-12-06 04:18:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:19,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:18:19,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:19,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671871653] [2022-12-06 04:18:19,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671871653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:19,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:19,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:18:19,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555615900] [2022-12-06 04:18:19,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:19,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:18:19,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:19,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:18:19,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:18:19,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 04:18:19,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 58 transitions, 447 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:19,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:19,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 04:18:19,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:19,806 INFO L130 PetriNetUnfolder]: 1027/1667 cut-off events. [2022-12-06 04:18:19,806 INFO L131 PetriNetUnfolder]: For 6047/6071 co-relation queries the response was YES. [2022-12-06 04:18:19,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6710 conditions, 1667 events. 1027/1667 cut-off events. For 6047/6071 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8518 event pairs, 191 based on Foata normal form. 20/1653 useless extension candidates. Maximal degree in co-relation 6685. Up to 1086 conditions per place. [2022-12-06 04:18:19,825 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 47 selfloop transitions, 16 changer transitions 0/71 dead transitions. [2022-12-06 04:18:19,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 634 flow [2022-12-06 04:18:19,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:18:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:18:19,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 04:18:19,827 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 04:18:19,827 INFO L175 Difference]: Start difference. First operand has 50 places, 58 transitions, 447 flow. Second operand 4 states and 45 transitions. [2022-12-06 04:18:19,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 634 flow [2022-12-06 04:18:19,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 606 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:18:19,844 INFO L231 Difference]: Finished difference. Result has 52 places, 60 transitions, 487 flow [2022-12-06 04:18:19,844 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=487, PETRI_PLACES=52, PETRI_TRANSITIONS=60} [2022-12-06 04:18:19,845 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2022-12-06 04:18:19,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:19,845 INFO L89 Accepts]: Start accepts. Operand has 52 places, 60 transitions, 487 flow [2022-12-06 04:18:19,846 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:19,846 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:19,846 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 60 transitions, 487 flow [2022-12-06 04:18:19,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 60 transitions, 487 flow [2022-12-06 04:18:19,912 INFO L130 PetriNetUnfolder]: 160/371 cut-off events. [2022-12-06 04:18:19,912 INFO L131 PetriNetUnfolder]: For 1539/1587 co-relation queries the response was YES. [2022-12-06 04:18:19,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1469 conditions, 371 events. 160/371 cut-off events. For 1539/1587 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2065 event pairs, 22 based on Foata normal form. 5/368 useless extension candidates. Maximal degree in co-relation 1446. Up to 144 conditions per place. [2022-12-06 04:18:19,916 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 60 transitions, 487 flow [2022-12-06 04:18:19,916 INFO L188 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-06 04:18:19,921 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:19,922 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 04:18:19,922 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 60 transitions, 487 flow [2022-12-06 04:18:19,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:19,923 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:19,923 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:19,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:18:19,923 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:18:19,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:19,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1572698712, now seen corresponding path program 1 times [2022-12-06 04:18:19,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:19,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812357188] [2022-12-06 04:18:19,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:19,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:18:20,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:20,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812357188] [2022-12-06 04:18:20,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812357188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:20,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:20,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:18:20,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589252878] [2022-12-06 04:18:20,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:20,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:18:20,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:20,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:18:20,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:18:20,243 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 04:18:20,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 60 transitions, 487 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:20,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:20,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 04:18:20,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:20,561 INFO L130 PetriNetUnfolder]: 1046/1694 cut-off events. [2022-12-06 04:18:20,562 INFO L131 PetriNetUnfolder]: For 7321/7349 co-relation queries the response was YES. [2022-12-06 04:18:20,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7032 conditions, 1694 events. 1046/1694 cut-off events. For 7321/7349 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 8723 event pairs, 231 based on Foata normal form. 12/1662 useless extension candidates. Maximal degree in co-relation 7006. Up to 1229 conditions per place. [2022-12-06 04:18:20,583 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 49 selfloop transitions, 21 changer transitions 0/78 dead transitions. [2022-12-06 04:18:20,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 78 transitions, 726 flow [2022-12-06 04:18:20,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:18:20,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:18:20,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 04:18:20,586 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2022-12-06 04:18:20,586 INFO L175 Difference]: Start difference. First operand has 52 places, 60 transitions, 487 flow. Second operand 5 states and 49 transitions. [2022-12-06 04:18:20,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 78 transitions, 726 flow [2022-12-06 04:18:20,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 78 transitions, 690 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 04:18:20,601 INFO L231 Difference]: Finished difference. Result has 54 places, 66 transitions, 568 flow [2022-12-06 04:18:20,601 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=568, PETRI_PLACES=54, PETRI_TRANSITIONS=66} [2022-12-06 04:18:20,602 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2022-12-06 04:18:20,602 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:20,602 INFO L89 Accepts]: Start accepts. Operand has 54 places, 66 transitions, 568 flow [2022-12-06 04:18:20,603 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:20,603 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:20,603 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 66 transitions, 568 flow [2022-12-06 04:18:20,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 66 transitions, 568 flow [2022-12-06 04:18:20,672 INFO L130 PetriNetUnfolder]: 158/371 cut-off events. [2022-12-06 04:18:20,673 INFO L131 PetriNetUnfolder]: For 1582/1633 co-relation queries the response was YES. [2022-12-06 04:18:20,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 371 events. 158/371 cut-off events. For 1582/1633 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2067 event pairs, 22 based on Foata normal form. 5/367 useless extension candidates. Maximal degree in co-relation 1497. Up to 142 conditions per place. [2022-12-06 04:18:20,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 66 transitions, 568 flow [2022-12-06 04:18:20,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-06 04:18:20,691 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:20,692 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 04:18:20,692 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 66 transitions, 568 flow [2022-12-06 04:18:20,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:20,693 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:20,693 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:20,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:18:20,693 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:18:20,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:20,694 INFO L85 PathProgramCache]: Analyzing trace with hash 145541058, now seen corresponding path program 1 times [2022-12-06 04:18:20,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:20,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31715763] [2022-12-06 04:18:20,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:20,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:21,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:18:21,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:21,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31715763] [2022-12-06 04:18:21,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31715763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:21,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:21,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:18:21,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571145000] [2022-12-06 04:18:21,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:21,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:18:21,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:21,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:18:21,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:18:21,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 04:18:21,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 66 transitions, 568 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:21,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:21,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 04:18:21,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:21,600 INFO L130 PetriNetUnfolder]: 1144/1854 cut-off events. [2022-12-06 04:18:21,601 INFO L131 PetriNetUnfolder]: For 9523/9557 co-relation queries the response was YES. [2022-12-06 04:18:21,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7969 conditions, 1854 events. 1144/1854 cut-off events. For 9523/9557 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 9835 event pairs, 139 based on Foata normal form. 33/1824 useless extension candidates. Maximal degree in co-relation 7943. Up to 942 conditions per place. [2022-12-06 04:18:21,619 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 54 selfloop transitions, 34 changer transitions 0/96 dead transitions. [2022-12-06 04:18:21,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 96 transitions, 918 flow [2022-12-06 04:18:21,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:18:21,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:18:21,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 04:18:21,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-06 04:18:21,621 INFO L175 Difference]: Start difference. First operand has 54 places, 66 transitions, 568 flow. Second operand 5 states and 57 transitions. [2022-12-06 04:18:21,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 96 transitions, 918 flow [2022-12-06 04:18:21,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 96 transitions, 889 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 04:18:21,633 INFO L231 Difference]: Finished difference. Result has 59 places, 74 transitions, 736 flow [2022-12-06 04:18:21,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=736, PETRI_PLACES=59, PETRI_TRANSITIONS=74} [2022-12-06 04:18:21,634 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 24 predicate places. [2022-12-06 04:18:21,634 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:21,635 INFO L89 Accepts]: Start accepts. Operand has 59 places, 74 transitions, 736 flow [2022-12-06 04:18:21,636 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:21,636 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:21,636 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 74 transitions, 736 flow [2022-12-06 04:18:21,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 74 transitions, 736 flow [2022-12-06 04:18:21,683 INFO L130 PetriNetUnfolder]: 161/391 cut-off events. [2022-12-06 04:18:21,683 INFO L131 PetriNetUnfolder]: For 2285/2326 co-relation queries the response was YES. [2022-12-06 04:18:21,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1771 conditions, 391 events. 161/391 cut-off events. For 2285/2326 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2301 event pairs, 18 based on Foata normal form. 8/386 useless extension candidates. Maximal degree in co-relation 1745. Up to 145 conditions per place. [2022-12-06 04:18:21,689 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 74 transitions, 736 flow [2022-12-06 04:18:21,689 INFO L188 LiptonReduction]: Number of co-enabled transitions 424 [2022-12-06 04:18:21,697 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:21,698 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 04:18:21,698 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 74 transitions, 736 flow [2022-12-06 04:18:21,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:21,699 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:21,699 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:21,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:18:21,699 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:18:21,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:21,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1509040567, now seen corresponding path program 1 times [2022-12-06 04:18:21,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:21,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743904190] [2022-12-06 04:18:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:21,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:22,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:18:22,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:22,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743904190] [2022-12-06 04:18:22,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743904190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:22,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:22,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:18:22,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45362658] [2022-12-06 04:18:22,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:22,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:18:22,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:22,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:18:22,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:18:22,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 04:18:22,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 74 transitions, 736 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:22,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:22,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 04:18:22,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:22,641 INFO L130 PetriNetUnfolder]: 1148/1885 cut-off events. [2022-12-06 04:18:22,641 INFO L131 PetriNetUnfolder]: For 13267/13298 co-relation queries the response was YES. [2022-12-06 04:18:22,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8712 conditions, 1885 events. 1148/1885 cut-off events. For 13267/13298 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 10175 event pairs, 123 based on Foata normal form. 47/1880 useless extension candidates. Maximal degree in co-relation 8683. Up to 778 conditions per place. [2022-12-06 04:18:22,660 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 59 selfloop transitions, 41 changer transitions 0/108 dead transitions. [2022-12-06 04:18:22,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 108 transitions, 1150 flow [2022-12-06 04:18:22,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:18:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:18:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-06 04:18:22,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-06 04:18:22,662 INFO L175 Difference]: Start difference. First operand has 59 places, 74 transitions, 736 flow. Second operand 6 states and 66 transitions. [2022-12-06 04:18:22,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 108 transitions, 1150 flow [2022-12-06 04:18:22,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 108 transitions, 1082 flow, removed 23 selfloop flow, removed 1 redundant places. [2022-12-06 04:18:22,682 INFO L231 Difference]: Finished difference. Result has 65 places, 80 transitions, 887 flow [2022-12-06 04:18:22,682 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=887, PETRI_PLACES=65, PETRI_TRANSITIONS=80} [2022-12-06 04:18:22,683 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2022-12-06 04:18:22,683 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:22,683 INFO L89 Accepts]: Start accepts. Operand has 65 places, 80 transitions, 887 flow [2022-12-06 04:18:22,684 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:22,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:22,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 80 transitions, 887 flow [2022-12-06 04:18:22,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 80 transitions, 887 flow [2022-12-06 04:18:22,740 INFO L130 PetriNetUnfolder]: 167/418 cut-off events. [2022-12-06 04:18:22,740 INFO L131 PetriNetUnfolder]: For 3067/3100 co-relation queries the response was YES. [2022-12-06 04:18:22,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1979 conditions, 418 events. 167/418 cut-off events. For 3067/3100 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2549 event pairs, 18 based on Foata normal form. 10/417 useless extension candidates. Maximal degree in co-relation 1950. Up to 151 conditions per place. [2022-12-06 04:18:22,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 80 transitions, 887 flow [2022-12-06 04:18:22,748 INFO L188 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-06 04:18:22,755 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:22,756 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 04:18:22,756 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 80 transitions, 887 flow [2022-12-06 04:18:22,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:22,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:22,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:22,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:18:22,757 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:18:22,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:22,757 INFO L85 PathProgramCache]: Analyzing trace with hash -474207063, now seen corresponding path program 1 times [2022-12-06 04:18:22,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:22,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946952385] [2022-12-06 04:18:22,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:22,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:18:22,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:22,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946952385] [2022-12-06 04:18:22,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946952385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:22,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:22,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:18:22,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622165997] [2022-12-06 04:18:22,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:22,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:18:22,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:22,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:18:22,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:18:22,894 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 04:18:22,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 80 transitions, 887 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:22,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:22,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 04:18:22,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:23,172 INFO L130 PetriNetUnfolder]: 794/1370 cut-off events. [2022-12-06 04:18:23,172 INFO L131 PetriNetUnfolder]: For 16004/16089 co-relation queries the response was YES. [2022-12-06 04:18:23,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6694 conditions, 1370 events. 794/1370 cut-off events. For 16004/16089 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7668 event pairs, 110 based on Foata normal form. 236/1570 useless extension candidates. Maximal degree in co-relation 6662. Up to 809 conditions per place. [2022-12-06 04:18:23,191 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 110 selfloop transitions, 7 changer transitions 48/174 dead transitions. [2022-12-06 04:18:23,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 174 transitions, 2360 flow [2022-12-06 04:18:23,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:18:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:18:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-12-06 04:18:23,194 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-06 04:18:23,194 INFO L175 Difference]: Start difference. First operand has 65 places, 80 transitions, 887 flow. Second operand 5 states and 78 transitions. [2022-12-06 04:18:23,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 174 transitions, 2360 flow [2022-12-06 04:18:23,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 174 transitions, 2219 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-06 04:18:23,218 INFO L231 Difference]: Finished difference. Result has 69 places, 81 transitions, 877 flow [2022-12-06 04:18:23,219 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=877, PETRI_PLACES=69, PETRI_TRANSITIONS=81} [2022-12-06 04:18:23,220 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 34 predicate places. [2022-12-06 04:18:23,220 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:23,220 INFO L89 Accepts]: Start accepts. Operand has 69 places, 81 transitions, 877 flow [2022-12-06 04:18:23,221 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:23,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:23,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 81 transitions, 877 flow [2022-12-06 04:18:23,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 81 transitions, 877 flow [2022-12-06 04:18:23,322 INFO L130 PetriNetUnfolder]: 281/634 cut-off events. [2022-12-06 04:18:23,322 INFO L131 PetriNetUnfolder]: For 4813/5004 co-relation queries the response was YES. [2022-12-06 04:18:23,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2918 conditions, 634 events. 281/634 cut-off events. For 4813/5004 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 4286 event pairs, 64 based on Foata normal form. 49/636 useless extension candidates. Maximal degree in co-relation 2886. Up to 326 conditions per place. [2022-12-06 04:18:23,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 81 transitions, 877 flow [2022-12-06 04:18:23,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 576 [2022-12-06 04:18:23,339 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L828-3-->L832: Formula: (and (= (mod v_~main$tmp_guard0~0_14 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= v_~main$tmp_guard0~0_14 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_29) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_14, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [440] L749-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_114 1) v_~__unbuffered_cnt~0_113) (= |v_P0Thread1of1ForFork2_#res.base_11| 0) (= |v_P0Thread1of1ForFork2_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_11|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] [2022-12-06 04:18:23,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L828-3-->L832: Formula: (and (= (mod v_~main$tmp_guard0~0_14 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= v_~main$tmp_guard0~0_14 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_29) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_14, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [377] L771-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_7| 0) (= |v_P1Thread1of1ForFork0_#res.base_7| 0) (= v_~__unbuffered_cnt~0_23 (+ v_~__unbuffered_cnt~0_24 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] [2022-12-06 04:18:23,406 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:18:23,407 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 04:18:23,407 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 80 transitions, 879 flow [2022-12-06 04:18:23,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:23,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:23,408 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:23,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:18:23,408 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:18:23,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:23,408 INFO L85 PathProgramCache]: Analyzing trace with hash -690721990, now seen corresponding path program 1 times [2022-12-06 04:18:23,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:23,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567928643] [2022-12-06 04:18:23,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:23,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:18:23,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:23,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567928643] [2022-12-06 04:18:23,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567928643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:23,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:23,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:18:23,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890520851] [2022-12-06 04:18:23,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:23,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:18:23,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:23,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:18:23,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:18:23,585 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-06 04:18:23,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 80 transitions, 879 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:23,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:23,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-06 04:18:23,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:23,819 INFO L130 PetriNetUnfolder]: 493/917 cut-off events. [2022-12-06 04:18:23,819 INFO L131 PetriNetUnfolder]: For 10441/10651 co-relation queries the response was YES. [2022-12-06 04:18:23,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4819 conditions, 917 events. 493/917 cut-off events. For 10441/10651 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5058 event pairs, 39 based on Foata normal form. 182/1081 useless extension candidates. Maximal degree in co-relation 4784. Up to 388 conditions per place. [2022-12-06 04:18:23,827 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 110 selfloop transitions, 13 changer transitions 32/164 dead transitions. [2022-12-06 04:18:23,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 164 transitions, 2073 flow [2022-12-06 04:18:23,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:18:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:18:23,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-12-06 04:18:23,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-06 04:18:23,829 INFO L175 Difference]: Start difference. First operand has 68 places, 80 transitions, 879 flow. Second operand 6 states and 88 transitions. [2022-12-06 04:18:23,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 164 transitions, 2073 flow [2022-12-06 04:18:23,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 164 transitions, 1950 flow, removed 31 selfloop flow, removed 5 redundant places. [2022-12-06 04:18:23,848 INFO L231 Difference]: Finished difference. Result has 70 places, 73 transitions, 766 flow [2022-12-06 04:18:23,848 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=766, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2022-12-06 04:18:23,849 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 35 predicate places. [2022-12-06 04:18:23,849 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:23,849 INFO L89 Accepts]: Start accepts. Operand has 70 places, 73 transitions, 766 flow [2022-12-06 04:18:23,851 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:23,851 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:23,851 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 73 transitions, 766 flow [2022-12-06 04:18:23,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 73 transitions, 766 flow [2022-12-06 04:18:23,892 INFO L130 PetriNetUnfolder]: 132/400 cut-off events. [2022-12-06 04:18:23,892 INFO L131 PetriNetUnfolder]: For 3512/3780 co-relation queries the response was YES. [2022-12-06 04:18:23,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2001 conditions, 400 events. 132/400 cut-off events. For 3512/3780 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 2799 event pairs, 6 based on Foata normal form. 29/407 useless extension candidates. Maximal degree in co-relation 1967. Up to 252 conditions per place. [2022-12-06 04:18:23,898 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 73 transitions, 766 flow [2022-12-06 04:18:23,898 INFO L188 LiptonReduction]: Number of co-enabled transitions 554 [2022-12-06 04:18:23,900 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:18:23,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 04:18:23,901 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 766 flow [2022-12-06 04:18:23,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:23,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:23,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:23,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:18:23,902 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:18:23,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:23,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2025322163, now seen corresponding path program 1 times [2022-12-06 04:18:23,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:23,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579068374] [2022-12-06 04:18:23,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:23,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:18:24,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:24,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579068374] [2022-12-06 04:18:24,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579068374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:24,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:24,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:18:24,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941841779] [2022-12-06 04:18:24,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:24,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:18:24,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:24,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:18:24,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:18:24,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 04:18:24,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 766 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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:18:24,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:24,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 04:18:24,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:24,282 INFO L130 PetriNetUnfolder]: 450/845 cut-off events. [2022-12-06 04:18:24,283 INFO L131 PetriNetUnfolder]: For 8031/8226 co-relation queries the response was YES. [2022-12-06 04:18:24,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4674 conditions, 845 events. 450/845 cut-off events. For 8031/8226 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4713 event pairs, 32 based on Foata normal form. 125/955 useless extension candidates. Maximal degree in co-relation 4637. Up to 368 conditions per place. [2022-12-06 04:18:24,290 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 97 selfloop transitions, 17 changer transitions 32/155 dead transitions. [2022-12-06 04:18:24,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 155 transitions, 1873 flow [2022-12-06 04:18:24,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:18:24,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:18:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-12-06 04:18:24,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47 [2022-12-06 04:18:24,292 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 766 flow. Second operand 8 states and 94 transitions. [2022-12-06 04:18:24,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 155 transitions, 1873 flow [2022-12-06 04:18:24,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 155 transitions, 1621 flow, removed 39 selfloop flow, removed 10 redundant places. [2022-12-06 04:18:24,348 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 562 flow [2022-12-06 04:18:24,348 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=562, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2022-12-06 04:18:24,349 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 35 predicate places. [2022-12-06 04:18:24,349 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:24,349 INFO L89 Accepts]: Start accepts. Operand has 70 places, 64 transitions, 562 flow [2022-12-06 04:18:24,350 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:24,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:24,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 64 transitions, 562 flow [2022-12-06 04:18:24,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 64 transitions, 562 flow [2022-12-06 04:18:24,387 INFO L130 PetriNetUnfolder]: 98/341 cut-off events. [2022-12-06 04:18:24,388 INFO L131 PetriNetUnfolder]: For 1549/1633 co-relation queries the response was YES. [2022-12-06 04:18:24,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1475 conditions, 341 events. 98/341 cut-off events. For 1549/1633 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 2490 event pairs, 0 based on Foata normal form. 12/334 useless extension candidates. Maximal degree in co-relation 1444. Up to 101 conditions per place. [2022-12-06 04:18:24,393 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 64 transitions, 562 flow [2022-12-06 04:18:24,394 INFO L188 LiptonReduction]: Number of co-enabled transitions 538 [2022-12-06 04:18:25,497 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:18:25,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1148 [2022-12-06 04:18:25,498 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 560 flow [2022-12-06 04:18:25,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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:18:25,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:25,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:25,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:18:25,498 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:18:25,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash 65424411, now seen corresponding path program 1 times [2022-12-06 04:18:25,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:25,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896311283] [2022-12-06 04:18:25,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:25,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:18:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:18:25,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:18:25,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896311283] [2022-12-06 04:18:25,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896311283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:18:25,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:18:25,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:18:25,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357265740] [2022-12-06 04:18:25,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:18:25,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:18:25,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:18:25,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:18:25,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:18:25,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 04:18:25,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 560 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:25,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:18:25,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 04:18:25,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:18:25,912 INFO L130 PetriNetUnfolder]: 728/1386 cut-off events. [2022-12-06 04:18:25,912 INFO L131 PetriNetUnfolder]: For 7655/7691 co-relation queries the response was YES. [2022-12-06 04:18:25,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6976 conditions, 1386 events. 728/1386 cut-off events. For 7655/7691 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 8679 event pairs, 80 based on Foata normal form. 13/1391 useless extension candidates. Maximal degree in co-relation 6942. Up to 693 conditions per place. [2022-12-06 04:18:25,925 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 60 selfloop transitions, 1 changer transitions 59/125 dead transitions. [2022-12-06 04:18:25,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 125 transitions, 1344 flow [2022-12-06 04:18:25,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:18:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:18:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 04:18:25,949 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.58 [2022-12-06 04:18:25,949 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 560 flow. Second operand 4 states and 58 transitions. [2022-12-06 04:18:25,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 125 transitions, 1344 flow [2022-12-06 04:18:25,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 125 transitions, 1207 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-12-06 04:18:25,978 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 410 flow [2022-12-06 04:18:25,978 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=410, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2022-12-06 04:18:25,979 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2022-12-06 04:18:25,979 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:18:25,979 INFO L89 Accepts]: Start accepts. Operand has 65 places, 53 transitions, 410 flow [2022-12-06 04:18:25,982 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:18:25,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:18:25,982 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 53 transitions, 410 flow [2022-12-06 04:18:25,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 410 flow [2022-12-06 04:18:26,006 INFO L130 PetriNetUnfolder]: 51/251 cut-off events. [2022-12-06 04:18:26,007 INFO L131 PetriNetUnfolder]: For 724/744 co-relation queries the response was YES. [2022-12-06 04:18:26,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 251 events. 51/251 cut-off events. For 724/744 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 1836 event pairs, 0 based on Foata normal form. 8/255 useless extension candidates. Maximal degree in co-relation 875. Up to 70 conditions per place. [2022-12-06 04:18:26,010 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 53 transitions, 410 flow [2022-12-06 04:18:26,010 INFO L188 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-06 04:18:26,343 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [441] $Ultimate##0-->L761: Formula: (and (= v_~x~0_72 2) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_72} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] and [443] $Ultimate##0-->L796: Formula: (and (= v_~y$r_buff0_thd0~0_307 v_~y$r_buff1_thd0~0_307) (= v_~y$r_buff0_thd1~0_50 v_~y$r_buff1_thd1~0_48) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_36| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_36|) (= v_~y$r_buff0_thd3~0_136 1) (= v_~y$w_buff1~0_281 v_~y$w_buff0~0_317) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_36| 0)) (= |v_P2Thread1of1ForFork1_~arg#1.base_30| |v_P2Thread1of1ForFork1_#in~arg#1.base_30|) (= 2 v_~y$w_buff0~0_316) (= v_~z~0_49 v_~__unbuffered_p2_EAX~0_105) (= v_~z~0_49 1) (= v_~y$r_buff0_thd2~0_126 v_~y$r_buff1_thd2~0_126) (= v_~y$w_buff0_used~0_452 1) (= v_~y$w_buff0_used~0_453 v_~y$w_buff1_used~0_410) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_30| |v_P2Thread1of1ForFork1_~arg#1.offset_30|) (= v_~y$r_buff0_thd3~0_137 v_~y$r_buff1_thd3~0_98) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_410 256) 0)) (not (= (mod v_~y$w_buff0_used~0_452 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_36|)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_30|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_453, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_307, ~y$w_buff0~0=v_~y$w_buff0~0_317, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_50, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_30|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_452, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_30|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_30|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_126, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_48, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_98, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_30|, ~y$w_buff1~0=v_~y$w_buff1~0_281, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_136, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_307, ~y$w_buff0~0=v_~y$w_buff0~0_316, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_30|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_50, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_36|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~z~0=v_~z~0_49, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_36|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_410} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-06 04:18:26,730 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] $Ultimate##0-->L771: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_546 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_547 256) 0)) (.cse3 (not (= (mod v_~y$r_buff0_thd2~0_161 256) 0)))) (let ((.cse1 (and (not .cse2) .cse3)) (.cse0 (and .cse4 .cse3))) (and (= v_~y$w_buff1_used~0_492 (ite (or .cse0 .cse1) 0 v_~y$w_buff0_used~0_547)) (= v_~y$r_buff0_thd0~0_377 v_~y$r_buff1_thd0~0_377) (= |v_P2Thread1of1ForFork1_~arg#1.base_44| |v_P2Thread1of1ForFork1_#in~arg#1.base_44|) (= v_~y$r_buff0_thd1~0_64 v_~y$r_buff1_thd1~0_62) (= v_~y$w_buff1~0_333 v_~y$w_buff0~0_378) (= v_~z~0_63 1) (= (ite .cse2 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_50|) (= v_~y~0_465 (ite .cse3 v_~y$w_buff0~0_377 (ite .cse1 v_~y$w_buff1~0_333 1))) (= v_~y$w_buff0_used~0_546 (ite .cse3 0 1)) (= 2 v_~y$w_buff0~0_377) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_44| |v_P2Thread1of1ForFork1_~arg#1.offset_44|) (= v_P1Thread1of1ForFork0_~arg.base_19 |v_P1Thread1of1ForFork0_#in~arg.base_19|) (= 2 v_~x~0_129) (= v_~z~0_63 v_~__unbuffered_p2_EAX~0_125) (= |v_P1Thread1of1ForFork0_#in~arg.offset_19| v_P1Thread1of1ForFork0_~arg.offset_19) (= v_~y$r_buff1_thd2~0_160 (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_492 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_160 256) 0)))) 0 v_~y$r_buff0_thd2~0_161)) (= v_~y$r_buff0_thd3~0_164 1) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_50| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_50|) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_50| 0)) (= v_~y$r_buff0_thd3~0_165 v_~y$r_buff1_thd3~0_112) (= v_~y$r_buff0_thd2~0_160 (ite .cse0 0 v_~y$r_buff0_thd2~0_161))))) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_44|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_547, ~y$w_buff0~0=v_~y$w_buff0~0_378, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_165, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_377, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_19|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_161, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_64, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_44|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_546, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_44|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_62, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_112, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_44|, ~y$w_buff0~0=v_~y$w_buff0~0_377, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_164, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_44|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_19|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_64, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_125, ~y~0=v_~y~0_465, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_19, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_160, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_19, ~y$w_buff1~0=v_~y$w_buff1~0_333, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_377, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_160, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_50|, ~z~0=v_~z~0_63, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_377, ~x~0=v_~x~0_129, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_492, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_50|} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, P1Thread1of1ForFork0_~arg.offset, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_~arg#1.base, ~y$r_buff0_thd2~0, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [336] L796-->L799: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] [2022-12-06 04:18:27,059 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:18:27,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1081 [2022-12-06 04:18:27,060 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 441 flow [2022-12-06 04:18:27,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:18:27,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:18:27,060 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:18:27,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:18:27,061 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:18:27,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:18:27,061 INFO L85 PathProgramCache]: Analyzing trace with hash -977241600, now seen corresponding path program 1 times [2022-12-06 04:18:27,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:18:27,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21503289] [2022-12-06 04:18:27,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:18:27,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:18:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-12-06 04:32:32,722 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 04:32:32,743 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:32:32,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 04:32:32,745 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-5-4-4-3-4-3-3-4-5-4-4-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-8-4-8-4-8-4-8-4-8-4-4-4-5-4-3-4-5-4-3-4-8-4-4-4-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-12-06 04:32:32,746 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:32:32,746 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:32:32,747 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:32:32,747 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:32:32,747 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:32:32,748 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:32:32,752 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:32:32,753 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:32:32,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:32:32 BasicIcfg [2022-12-06 04:32:32,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:32:32,756 INFO L158 Benchmark]: Toolchain (without parser) took 867528.28ms. Allocated memory was 207.6MB in the beginning and 886.0MB in the end (delta: 678.4MB). Free memory was 168.1MB in the beginning and 377.5MB in the end (delta: -209.4MB). Peak memory consumption was 536.9MB. Max. memory is 8.0GB. [2022-12-06 04:32:32,756 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 207.6MB. Free memory is still 183.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:32:32,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.45ms. Allocated memory is still 207.6MB. Free memory was 167.6MB in the beginning and 141.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 04:32:32,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.97ms. Allocated memory is still 207.6MB. Free memory was 141.4MB in the beginning and 138.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:32:32,757 INFO L158 Benchmark]: Boogie Preprocessor took 40.66ms. Allocated memory is still 207.6MB. Free memory was 138.8MB in the beginning and 137.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:32:32,757 INFO L158 Benchmark]: RCFGBuilder took 743.71ms. Allocated memory is still 207.6MB. Free memory was 136.7MB in the beginning and 104.7MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-06 04:32:32,757 INFO L158 Benchmark]: TraceAbstraction took 866074.48ms. Allocated memory was 207.6MB in the beginning and 886.0MB in the end (delta: 678.4MB). Free memory was 104.2MB in the beginning and 377.5MB in the end (delta: -273.3MB). Peak memory consumption was 474.0MB. Max. memory is 8.0GB. [2022-12-06 04:32:32,759 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 207.6MB. Free memory is still 183.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 581.45ms. Allocated memory is still 207.6MB. Free memory was 167.6MB in the beginning and 141.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 80.97ms. Allocated memory is still 207.6MB. Free memory was 141.4MB in the beginning and 138.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.66ms. Allocated memory is still 207.6MB. Free memory was 138.8MB in the beginning and 137.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 743.71ms. Allocated memory is still 207.6MB. Free memory was 136.7MB in the beginning and 104.7MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 866074.48ms. Allocated memory was 207.6MB in the beginning and 886.0MB in the end (delta: 678.4MB). Free memory was 104.2MB in the beginning and 377.5MB in the end (delta: -273.3MB). Peak memory consumption was 474.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 115 PlacesBefore, 35 PlacesAfterwards, 107 TransitionsBefore, 26 TransitionsAfterwards, 1944 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 43 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1420, independent: 1363, independent conditional: 1363, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1420, independent: 1363, independent conditional: 0, independent unconditional: 1363, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1420, independent: 1363, independent conditional: 0, independent unconditional: 1363, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1420, independent: 1363, independent conditional: 0, independent unconditional: 1363, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1173, independent: 1133, independent conditional: 0, independent unconditional: 1133, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1173, independent: 1113, independent conditional: 0, independent unconditional: 1113, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 351, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 307, dependent conditional: 0, dependent unconditional: 307, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1420, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1173, unknown conditional: 0, unknown unconditional: 1173] , Statistics on independence cache: Total cache size (in pairs): 1676, Positive cache size: 1636, Positive conditional cache size: 0, Positive unconditional cache size: 1636, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 101, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 101, independent: 79, independent conditional: 6, independent unconditional: 73, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 101, independent: 79, independent conditional: 6, independent unconditional: 73, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 101, independent: 79, independent conditional: 6, independent unconditional: 73, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 92, independent: 73, independent conditional: 5, independent unconditional: 68, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 92, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 96, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 92, dependent conditional: 18, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 101, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 92, unknown conditional: 8, unknown unconditional: 84] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 73, Positive conditional cache size: 5, Positive unconditional cache size: 68, Negative cache size: 19, Negative conditional cache size: 3, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 31 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 206, independent: 169, independent conditional: 10, independent unconditional: 159, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 206, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 206, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 206, independent: 142, independent conditional: 0, independent unconditional: 142, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 31, unknown conditional: 0, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 103, Positive conditional cache size: 5, Positive unconditional cache size: 98, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89, independent: 73, independent conditional: 73, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 89, independent: 73, independent conditional: 10, independent unconditional: 63, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 89, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 89, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 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: 89, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 106, Positive conditional cache size: 5, Positive unconditional cache size: 101, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 68, independent conditional: 24, independent unconditional: 44, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 68, independent conditional: 8, independent unconditional: 60, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 68, independent conditional: 8, independent unconditional: 60, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 5, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 58, independent conditional: 3, independent unconditional: 55, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 12, unknown conditional: 5, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 116, Positive conditional cache size: 10, Positive unconditional cache size: 106, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 41 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 197, independent: 169, independent conditional: 169, 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: 197, independent: 169, independent conditional: 83, independent unconditional: 86, 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: 197, independent: 169, independent conditional: 39, independent unconditional: 130, 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: 197, independent: 169, independent conditional: 39, independent unconditional: 130, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 197, independent: 167, independent conditional: 37, independent unconditional: 130, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 145, Positive conditional cache size: 12, Positive unconditional cache size: 133, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 333, independent: 304, independent conditional: 304, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 333, independent: 304, independent conditional: 143, independent unconditional: 161, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 333, independent: 304, independent conditional: 72, independent unconditional: 232, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 333, independent: 304, independent conditional: 72, independent unconditional: 232, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 1, independent unconditional: 3, 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: 5, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 333, independent: 300, independent conditional: 71, independent unconditional: 229, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 149, Positive conditional cache size: 13, Positive unconditional cache size: 136, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 71, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302, independent: 267, independent conditional: 267, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 302, independent: 267, independent conditional: 113, independent unconditional: 154, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 302, independent: 267, independent conditional: 58, independent unconditional: 209, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 302, independent: 267, independent conditional: 58, independent unconditional: 209, dependent: 35, dependent conditional: 0, dependent unconditional: 35, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 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: 302, independent: 266, independent conditional: 58, independent unconditional: 208, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 150, Positive conditional cache size: 13, Positive unconditional cache size: 137, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 55, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 327, independent: 290, independent conditional: 290, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 327, independent: 290, independent conditional: 131, independent unconditional: 159, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 327, independent: 290, independent conditional: 74, independent unconditional: 216, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 327, independent: 290, independent conditional: 74, independent unconditional: 216, dependent: 37, dependent conditional: 0, dependent unconditional: 37, 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: 327, independent: 290, independent conditional: 74, independent unconditional: 216, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 150, Positive conditional cache size: 13, Positive unconditional cache size: 137, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 57, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 386, independent: 345, independent conditional: 345, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 386, independent: 345, independent conditional: 151, independent unconditional: 194, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 386, independent: 345, independent conditional: 88, independent unconditional: 257, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 386, independent: 345, independent conditional: 88, independent unconditional: 257, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 386, independent: 344, independent conditional: 88, independent unconditional: 256, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 151, Positive conditional cache size: 13, Positive unconditional cache size: 138, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 63, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 485, independent: 437, independent conditional: 437, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 485, independent: 437, independent conditional: 217, independent unconditional: 220, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 485, independent: 437, independent conditional: 156, independent unconditional: 281, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 485, independent: 437, independent conditional: 156, independent unconditional: 281, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 485, independent: 435, independent conditional: 154, independent unconditional: 281, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 153, Positive conditional cache size: 15, Positive unconditional cache size: 138, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 61, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 555, independent: 498, independent conditional: 498, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 555, independent: 498, independent conditional: 246, independent unconditional: 252, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 555, independent: 498, independent conditional: 177, independent unconditional: 321, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 555, independent: 498, independent conditional: 177, independent unconditional: 321, dependent: 57, dependent conditional: 0, dependent unconditional: 57, 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: 555, independent: 498, independent conditional: 177, independent unconditional: 321, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 153, Positive conditional cache size: 15, Positive unconditional cache size: 138, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 69 PlacesBefore, 68 PlacesAfterwards, 81 TransitionsBefore, 80 TransitionsAfterwards, 576 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 305, independent: 283, independent conditional: 283, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 305, independent: 283, independent conditional: 201, independent unconditional: 82, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 305, independent: 283, independent conditional: 161, independent unconditional: 122, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 305, independent: 283, independent conditional: 161, independent unconditional: 122, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 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: 305, independent: 280, independent conditional: 158, independent unconditional: 122, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 195, Positive cache size: 169, Positive conditional cache size: 18, Positive unconditional cache size: 151, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 85, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 85, independent: 75, independent conditional: 40, independent unconditional: 35, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 85, independent: 75, independent conditional: 30, independent unconditional: 45, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 85, independent: 75, independent conditional: 30, independent unconditional: 45, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 85, independent: 75, independent conditional: 30, independent unconditional: 45, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 195, Positive cache size: 169, Positive conditional cache size: 18, Positive unconditional cache size: 151, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 69 PlacesBefore, 68 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 130, independent: 120, independent conditional: 120, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 130, independent: 120, independent conditional: 80, independent unconditional: 40, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 130, independent: 120, independent conditional: 60, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 130, independent: 120, independent conditional: 60, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 130, independent: 120, independent conditional: 60, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 179, Positive conditional cache size: 18, Positive unconditional cache size: 161, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 64 PlacesBefore, 63 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 113, independent: 113, independent conditional: 113, 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: 113, independent: 113, independent conditional: 95, independent unconditional: 18, 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: 113, independent: 113, independent conditional: 60, independent unconditional: 53, 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: 113, independent: 113, independent conditional: 60, independent unconditional: 53, 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: 4, independent: 4, independent conditional: 0, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 113, independent: 109, independent conditional: 60, independent unconditional: 49, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 270, Positive cache size: 244, Positive conditional cache size: 18, Positive unconditional cache size: 226, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-5-4-4-3-4-3-3-4-5-4-4-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-8-4-8-4-8-4-8-4-8-4-4-4-5-4-3-4-5-4-3-4-8-4-4-4-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-5-4-4-3-4-3-3-4-5-4-4-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-8-4-8-4-8-4-8-4-8-4-4-4-5-4-3-4-5-4-3-4-8-4-4-4-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 826]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-5-4-4-3-4-3-3-4-5-4-4-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-8-4-8-4-8-4-8-4-8-4-4-4-5-4-3-4-5-4-3-4-8-4-4-4-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 824]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-5-4-4-3-4-3-3-4-5-4-4-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-8-4-8-4-8-4-8-4-8-4-4-4-5-4-3-4-5-4-3-4-8-4-4-4-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 828]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-5-4-4-3-4-3-3-4-5-4-4-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-8-4-8-4-8-4-8-4-8-4-4-4-5-4-3-4-5-4-3-4-8-4-4-4-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 865.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 346 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 346 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1150 IncrementalHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 16 mSDtfsCounter, 1150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=887occurred in iteration=11, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 1281 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown