/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/mix027_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:11:16,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:11:16,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:11:16,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:11:16,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:11:16,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:11:16,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:11:16,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:11:16,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:11:16,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:11:16,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:11:16,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:11:16,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:11:16,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:11:16,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:11:16,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:11:16,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:11:16,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:11:16,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:11:16,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:11:16,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:11:16,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:11:16,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:11:16,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:11:16,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:11:16,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:11:16,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:11:16,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:11:16,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:11:16,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:11:16,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:11:16,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:11:16,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:11:16,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:11:16,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:11:16,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:11:16,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:11:16,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:11:16,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:11:16,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:11:16,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:11:16,650 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:11:16,675 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:11:16,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:11:16,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:11:16,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:11:16,677 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:11:16,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:11:16,677 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:11:16,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:11:16,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:11:16,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:11:16,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:11:16,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:11:16,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:11:16,678 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:11:16,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:11:16,678 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:11:16,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:11:16,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:11:16,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:11:16,679 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:11:16,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:11:16,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:11:16,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:11:16,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:11:16,680 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:11:16,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:11:16,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:11:16,680 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:11:16,680 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:11:16,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:11:16,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:11:16,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:11:16,988 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:11:16,989 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:11:16,989 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i [2022-12-06 04:11:18,066 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:11:18,309 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:11:18,310 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i [2022-12-06 04:11:18,342 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23fcd35c2/9b7866565cb14d999f6471792fe60b7e/FLAG4917e2e4b [2022-12-06 04:11:18,353 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23fcd35c2/9b7866565cb14d999f6471792fe60b7e [2022-12-06 04:11:18,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:11:18,356 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:11:18,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:11:18,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:11:18,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:11:18,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:11:18" (1/1) ... [2022-12-06 04:11:18,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a391208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:18, skipping insertion in model container [2022-12-06 04:11:18,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:11:18" (1/1) ... [2022-12-06 04:11:18,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:11:18,401 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:11:18,504 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/mix027_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-06 04:11:18,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:11:18,718 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:11:18,726 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/mix027_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-06 04:11:18,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:11:18,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:11:18,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:11:18,838 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:11:18,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:18 WrapperNode [2022-12-06 04:11:18,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:11:18,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:11:18,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:11:18,840 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:11:18,846 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:11:18" (1/1) ... [2022-12-06 04:11:18,874 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:11:18" (1/1) ... [2022-12-06 04:11:18,898 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-06 04:11:18,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:11:18,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:11:18,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:11:18,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:11:18,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:18" (1/1) ... [2022-12-06 04:11:18,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:18" (1/1) ... [2022-12-06 04:11:18,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:18" (1/1) ... [2022-12-06 04:11:18,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:18" (1/1) ... [2022-12-06 04:11:18,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:18" (1/1) ... [2022-12-06 04:11:18,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:18" (1/1) ... [2022-12-06 04:11:18,938 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:18" (1/1) ... [2022-12-06 04:11:18,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:18" (1/1) ... [2022-12-06 04:11:18,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:11:18,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:11:18,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:11:18,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:11:18,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:18" (1/1) ... [2022-12-06 04:11:18,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:11:18,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:11:18,997 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:11:19,062 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:11:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:11:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:11:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:11:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:11:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:11:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:11:19,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:11:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:11:19,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:11:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:11:19,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:11:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:11:19,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:11:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:11:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:11:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:11:19,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:11:19,125 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:11:19,311 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:11:19,317 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:11:19,582 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:11:19,662 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:11:19,662 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:11:19,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:11:19 BoogieIcfgContainer [2022-12-06 04:11:19,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:11:19,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:11:19,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:11:19,670 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:11:19,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:11:18" (1/3) ... [2022-12-06 04:11:19,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116851e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:11:19, skipping insertion in model container [2022-12-06 04:11:19,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:11:18" (2/3) ... [2022-12-06 04:11:19,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116851e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:11:19, skipping insertion in model container [2022-12-06 04:11:19,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:11:19" (3/3) ... [2022-12-06 04:11:19,672 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_power.opt_pso.opt_rmo.opt.i [2022-12-06 04:11:19,685 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:11:19,685 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:11:19,685 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:11:19,736 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:11:19,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2022-12-06 04:11:19,795 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 04:11:19,796 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:11:19,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-06 04:11:19,800 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2022-12-06 04:11:19,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2022-12-06 04:11:19,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:19,817 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-06 04:11:19,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2022-12-06 04:11:19,871 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 04:11:19,871 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:11:19,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-06 04:11:19,874 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-06 04:11:19,874 INFO L188 LiptonReduction]: Number of co-enabled transitions 2852 [2022-12-06 04:11:24,309 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-06 04:11:24,320 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:11:24,324 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;@28b70f6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:11:24,324 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:11:24,327 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-06 04:11:24,327 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:11:24,327 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:24,327 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:24,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:24,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:24,331 INFO L85 PathProgramCache]: Analyzing trace with hash -51780006, now seen corresponding path program 1 times [2022-12-06 04:11:24,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:24,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826329704] [2022-12-06 04:11:24,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:24,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:24,658 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:11:24,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:24,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826329704] [2022-12-06 04:11:24,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826329704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:24,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:24,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:11:24,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636295101] [2022-12-06 04:11:24,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:24,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:11:24,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:24,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:11:24,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:11:24,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-06 04:11:24,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 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:11:24,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:24,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-06 04:11:24,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:25,340 INFO L130 PetriNetUnfolder]: 3519/5195 cut-off events. [2022-12-06 04:11:25,340 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-06 04:11:25,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10175 conditions, 5195 events. 3519/5195 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 29203 event pairs, 666 based on Foata normal form. 0/4702 useless extension candidates. Maximal degree in co-relation 10163. Up to 3826 conditions per place. [2022-12-06 04:11:25,374 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 33 selfloop transitions, 2 changer transitions 6/45 dead transitions. [2022-12-06 04:11:25,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 187 flow [2022-12-06 04:11:25,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:11:25,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:11:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-06 04:11:25,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2022-12-06 04:11:25,387 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 58 transitions. [2022-12-06 04:11:25,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 187 flow [2022-12-06 04:11:25,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:11:25,393 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 64 flow [2022-12-06 04:11:25,394 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2022-12-06 04:11:25,398 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2022-12-06 04:11:25,398 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:25,398 INFO L89 Accepts]: Start accepts. Operand has 40 places, 26 transitions, 64 flow [2022-12-06 04:11:25,401 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:25,401 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:25,401 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 64 flow [2022-12-06 04:11:25,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 64 flow [2022-12-06 04:11:25,414 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-06 04:11:25,414 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:11:25,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:11:25,414 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 64 flow [2022-12-06 04:11:25,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-06 04:11:25,508 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:25,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-06 04:11:25,510 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 64 flow [2022-12-06 04:11:25,510 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:11:25,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:25,510 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:25,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:11:25,513 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:25,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:25,514 INFO L85 PathProgramCache]: Analyzing trace with hash 316820501, now seen corresponding path program 1 times [2022-12-06 04:11:25,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:25,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516599886] [2022-12-06 04:11:25,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:25,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:25,792 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:11:25,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:25,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516599886] [2022-12-06 04:11:25,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516599886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:25,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:25,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:11:25,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062273711] [2022-12-06 04:11:25,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:25,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:11:25,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:25,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:11:25,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:11:25,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:11:25,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 64 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:25,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:25,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:11:25,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:27,032 INFO L130 PetriNetUnfolder]: 9788/13469 cut-off events. [2022-12-06 04:11:27,032 INFO L131 PetriNetUnfolder]: For 598/598 co-relation queries the response was YES. [2022-12-06 04:11:27,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27860 conditions, 13469 events. 9788/13469 cut-off events. For 598/598 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 68447 event pairs, 3290 based on Foata normal form. 388/13857 useless extension candidates. Maximal degree in co-relation 27850. Up to 8281 conditions per place. [2022-12-06 04:11:27,107 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 39 selfloop transitions, 8 changer transitions 0/47 dead transitions. [2022-12-06 04:11:27,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 206 flow [2022-12-06 04:11:27,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:11:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:11:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 04:11:27,110 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2022-12-06 04:11:27,110 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 64 flow. Second operand 3 states and 48 transitions. [2022-12-06 04:11:27,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 206 flow [2022-12-06 04:11:27,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:11:27,114 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 122 flow [2022-12-06 04:11:27,114 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-12-06 04:11:27,115 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2022-12-06 04:11:27,115 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:27,115 INFO L89 Accepts]: Start accepts. Operand has 39 places, 33 transitions, 122 flow [2022-12-06 04:11:27,116 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:27,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:27,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 33 transitions, 122 flow [2022-12-06 04:11:27,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 122 flow [2022-12-06 04:11:27,160 INFO L130 PetriNetUnfolder]: 241/582 cut-off events. [2022-12-06 04:11:27,160 INFO L131 PetriNetUnfolder]: For 82/95 co-relation queries the response was YES. [2022-12-06 04:11:27,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 582 events. 241/582 cut-off events. For 82/95 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3638 event pairs, 101 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 1170. Up to 263 conditions per place. [2022-12-06 04:11:27,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 33 transitions, 122 flow [2022-12-06 04:11:27,166 INFO L188 LiptonReduction]: Number of co-enabled transitions 418 [2022-12-06 04:11:27,185 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:27,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-06 04:11:27,188 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 122 flow [2022-12-06 04:11:27,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:27,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:27,188 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:27,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:11:27,189 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:27,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:27,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1231500614, now seen corresponding path program 1 times [2022-12-06 04:11:27,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:27,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664508385] [2022-12-06 04:11:27,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:27,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:27,371 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:11:27,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:27,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664508385] [2022-12-06 04:11:27,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664508385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:27,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:27,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:11:27,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486570408] [2022-12-06 04:11:27,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:27,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:11:27,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:27,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:11:27,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:11:27,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:11:27,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 122 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:27,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:27,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:11:27,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:28,688 INFO L130 PetriNetUnfolder]: 9090/12519 cut-off events. [2022-12-06 04:11:28,688 INFO L131 PetriNetUnfolder]: For 6049/6049 co-relation queries the response was YES. [2022-12-06 04:11:28,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32340 conditions, 12519 events. 9090/12519 cut-off events. For 6049/6049 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 61567 event pairs, 2299 based on Foata normal form. 140/12659 useless extension candidates. Maximal degree in co-relation 32328. Up to 5489 conditions per place. [2022-12-06 04:11:28,760 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 51 selfloop transitions, 8 changer transitions 0/59 dead transitions. [2022-12-06 04:11:28,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 316 flow [2022-12-06 04:11:28,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:11:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:11:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-06 04:11:28,764 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2022-12-06 04:11:28,764 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 122 flow. Second operand 4 states and 54 transitions. [2022-12-06 04:11:28,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 316 flow [2022-12-06 04:11:28,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:11:28,786 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 164 flow [2022-12-06 04:11:28,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-12-06 04:11:28,788 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2022-12-06 04:11:28,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:28,789 INFO L89 Accepts]: Start accepts. Operand has 43 places, 37 transitions, 164 flow [2022-12-06 04:11:28,791 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:28,791 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:28,791 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 37 transitions, 164 flow [2022-12-06 04:11:28,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 164 flow [2022-12-06 04:11:28,826 INFO L130 PetriNetUnfolder]: 170/408 cut-off events. [2022-12-06 04:11:28,826 INFO L131 PetriNetUnfolder]: For 244/255 co-relation queries the response was YES. [2022-12-06 04:11:28,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 408 events. 170/408 cut-off events. For 244/255 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2256 event pairs, 54 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 983. Up to 187 conditions per place. [2022-12-06 04:11:28,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 37 transitions, 164 flow [2022-12-06 04:11:28,831 INFO L188 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-06 04:11:28,836 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:28,837 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 04:11:28,837 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 164 flow [2022-12-06 04:11:28,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:28,837 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:28,838 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:28,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:11:28,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:28,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:28,838 INFO L85 PathProgramCache]: Analyzing trace with hash -451569704, now seen corresponding path program 1 times [2022-12-06 04:11:28,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:28,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839040365] [2022-12-06 04:11:28,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:28,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:28,996 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:11:28,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:28,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839040365] [2022-12-06 04:11:28,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839040365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:28,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:28,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:11:28,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505420482] [2022-12-06 04:11:29,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:29,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:11:29,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:29,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:11:29,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:11:29,002 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:11:29,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 164 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:29,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:29,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:11:29,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:30,199 INFO L130 PetriNetUnfolder]: 8854/12203 cut-off events. [2022-12-06 04:11:30,200 INFO L131 PetriNetUnfolder]: For 8598/8598 co-relation queries the response was YES. [2022-12-06 04:11:30,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33459 conditions, 12203 events. 8854/12203 cut-off events. For 8598/8598 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 61401 event pairs, 1673 based on Foata normal form. 40/12243 useless extension candidates. Maximal degree in co-relation 33444. Up to 6932 conditions per place. [2022-12-06 04:11:30,282 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 61 selfloop transitions, 18 changer transitions 0/79 dead transitions. [2022-12-06 04:11:30,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 474 flow [2022-12-06 04:11:30,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:11:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:11:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-06 04:11:30,284 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2022-12-06 04:11:30,284 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 164 flow. Second operand 4 states and 68 transitions. [2022-12-06 04:11:30,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 79 transitions, 474 flow [2022-12-06 04:11:30,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 79 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:11:30,329 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 318 flow [2022-12-06 04:11:30,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2022-12-06 04:11:30,330 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2022-12-06 04:11:30,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:30,330 INFO L89 Accepts]: Start accepts. Operand has 48 places, 48 transitions, 318 flow [2022-12-06 04:11:30,331 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:30,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:30,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 48 transitions, 318 flow [2022-12-06 04:11:30,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 48 transitions, 318 flow [2022-12-06 04:11:30,369 INFO L130 PetriNetUnfolder]: 152/391 cut-off events. [2022-12-06 04:11:30,370 INFO L131 PetriNetUnfolder]: For 629/683 co-relation queries the response was YES. [2022-12-06 04:11:30,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 391 events. 152/391 cut-off events. For 629/683 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2133 event pairs, 31 based on Foata normal form. 2/384 useless extension candidates. Maximal degree in co-relation 1229. Up to 171 conditions per place. [2022-12-06 04:11:30,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 48 transitions, 318 flow [2022-12-06 04:11:30,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-06 04:11:30,382 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:30,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 04:11:30,386 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 318 flow [2022-12-06 04:11:30,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:30,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:30,387 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:30,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:11:30,387 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:30,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:30,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1938858051, now seen corresponding path program 1 times [2022-12-06 04:11:30,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:30,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211072220] [2022-12-06 04:11:30,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:30,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:30,535 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:11:30,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:30,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211072220] [2022-12-06 04:11:30,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211072220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:30,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:30,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:11:30,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440041559] [2022-12-06 04:11:30,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:30,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:11:30,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:30,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:11:30,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:11:30,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 04:11:30,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:30,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:30,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 04:11:30,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:31,127 INFO L130 PetriNetUnfolder]: 4452/6644 cut-off events. [2022-12-06 04:11:31,127 INFO L131 PetriNetUnfolder]: For 11418/11874 co-relation queries the response was YES. [2022-12-06 04:11:31,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19310 conditions, 6644 events. 4452/6644 cut-off events. For 11418/11874 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 38054 event pairs, 968 based on Foata normal form. 282/6634 useless extension candidates. Maximal degree in co-relation 19291. Up to 5583 conditions per place. [2022-12-06 04:11:31,158 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 52 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2022-12-06 04:11:31,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 74 transitions, 568 flow [2022-12-06 04:11:31,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:11:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:11:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 04:11:31,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 04:11:31,160 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 318 flow. Second operand 3 states and 52 transitions. [2022-12-06 04:11:31,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 74 transitions, 568 flow [2022-12-06 04:11:31,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 568 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:11:31,172 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 351 flow [2022-12-06 04:11:31,172 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2022-12-06 04:11:31,173 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2022-12-06 04:11:31,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:31,173 INFO L89 Accepts]: Start accepts. Operand has 51 places, 52 transitions, 351 flow [2022-12-06 04:11:31,173 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:31,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:31,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 52 transitions, 351 flow [2022-12-06 04:11:31,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 52 transitions, 351 flow [2022-12-06 04:11:31,239 INFO L130 PetriNetUnfolder]: 503/1169 cut-off events. [2022-12-06 04:11:31,239 INFO L131 PetriNetUnfolder]: For 1080/1234 co-relation queries the response was YES. [2022-12-06 04:11:31,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3041 conditions, 1169 events. 503/1169 cut-off events. For 1080/1234 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 8645 event pairs, 197 based on Foata normal form. 2/1064 useless extension candidates. Maximal degree in co-relation 3022. Up to 588 conditions per place. [2022-12-06 04:11:31,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 52 transitions, 351 flow [2022-12-06 04:11:31,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 736 [2022-12-06 04:11:31,255 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:31,256 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 04:11:31,256 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 351 flow [2022-12-06 04:11:31,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:31,256 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:31,256 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:11:31,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:11:31,257 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:31,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:31,257 INFO L85 PathProgramCache]: Analyzing trace with hash 914282263, now seen corresponding path program 1 times [2022-12-06 04:11:31,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:31,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597921694] [2022-12-06 04:11:31,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:31,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:31,369 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:11:31,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:31,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597921694] [2022-12-06 04:11:31,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597921694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:31,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:31,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:11:31,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638646529] [2022-12-06 04:11:31,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:31,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:11:31,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:31,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:11:31,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:11:31,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 04:11:31,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 351 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:11:31,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:31,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 04:11:31,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:31,769 INFO L130 PetriNetUnfolder]: 2411/3840 cut-off events. [2022-12-06 04:11:31,769 INFO L131 PetriNetUnfolder]: For 6851/7074 co-relation queries the response was YES. [2022-12-06 04:11:31,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12933 conditions, 3840 events. 2411/3840 cut-off events. For 6851/7074 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 21473 event pairs, 403 based on Foata normal form. 344/4083 useless extension candidates. Maximal degree in co-relation 12911. Up to 1816 conditions per place. [2022-12-06 04:11:31,792 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 70 selfloop transitions, 9 changer transitions 0/96 dead transitions. [2022-12-06 04:11:31,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 96 transitions, 759 flow [2022-12-06 04:11:31,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:11:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:11:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-06 04:11:31,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6826923076923077 [2022-12-06 04:11:31,794 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 351 flow. Second operand 4 states and 71 transitions. [2022-12-06 04:11:31,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 96 transitions, 759 flow [2022-12-06 04:11:31,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 96 transitions, 754 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:11:31,805 INFO L231 Difference]: Finished difference. Result has 54 places, 56 transitions, 398 flow [2022-12-06 04:11:31,805 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=398, PETRI_PLACES=54, PETRI_TRANSITIONS=56} [2022-12-06 04:11:31,806 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2022-12-06 04:11:31,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:31,806 INFO L89 Accepts]: Start accepts. Operand has 54 places, 56 transitions, 398 flow [2022-12-06 04:11:31,807 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:31,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:31,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 56 transitions, 398 flow [2022-12-06 04:11:31,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 398 flow [2022-12-06 04:11:31,868 INFO L130 PetriNetUnfolder]: 305/773 cut-off events. [2022-12-06 04:11:31,868 INFO L131 PetriNetUnfolder]: For 944/1326 co-relation queries the response was YES. [2022-12-06 04:11:31,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2490 conditions, 773 events. 305/773 cut-off events. For 944/1326 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5140 event pairs, 60 based on Foata normal form. 25/752 useless extension candidates. Maximal degree in co-relation 2469. Up to 384 conditions per place. [2022-12-06 04:11:31,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 56 transitions, 398 flow [2022-12-06 04:11:31,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 832 [2022-12-06 04:11:31,884 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:31,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 04:11:31,884 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 56 transitions, 398 flow [2022-12-06 04:11:31,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:11:31,885 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:31,885 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:31,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:11:31,885 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:31,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:31,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1415001237, now seen corresponding path program 1 times [2022-12-06 04:11:31,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:31,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487088794] [2022-12-06 04:11:31,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:31,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:32,052 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:11:32,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:32,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487088794] [2022-12-06 04:11:32,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487088794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:32,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:32,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:11:32,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467428688] [2022-12-06 04:11:32,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:32,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:11:32,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:32,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:11:32,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:11:32,054 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 04:11:32,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 56 transitions, 398 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:32,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:32,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 04:11:32,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:32,310 INFO L130 PetriNetUnfolder]: 1775/2831 cut-off events. [2022-12-06 04:11:32,310 INFO L131 PetriNetUnfolder]: For 6813/7023 co-relation queries the response was YES. [2022-12-06 04:11:32,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10643 conditions, 2831 events. 1775/2831 cut-off events. For 6813/7023 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 15153 event pairs, 312 based on Foata normal form. 220/2982 useless extension candidates. Maximal degree in co-relation 10619. Up to 1065 conditions per place. [2022-12-06 04:11:32,323 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 82 selfloop transitions, 13 changer transitions 0/112 dead transitions. [2022-12-06 04:11:32,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 112 transitions, 906 flow [2022-12-06 04:11:32,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:11:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:11:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 04:11:32,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.676923076923077 [2022-12-06 04:11:32,325 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 398 flow. Second operand 5 states and 88 transitions. [2022-12-06 04:11:32,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 112 transitions, 906 flow [2022-12-06 04:11:32,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 112 transitions, 888 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:11:32,333 INFO L231 Difference]: Finished difference. Result has 57 places, 60 transitions, 448 flow [2022-12-06 04:11:32,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=448, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2022-12-06 04:11:32,333 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places. [2022-12-06 04:11:32,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:32,334 INFO L89 Accepts]: Start accepts. Operand has 57 places, 60 transitions, 448 flow [2022-12-06 04:11:32,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:32,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:32,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 60 transitions, 448 flow [2022-12-06 04:11:32,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 60 transitions, 448 flow [2022-12-06 04:11:32,366 INFO L130 PetriNetUnfolder]: 212/517 cut-off events. [2022-12-06 04:11:32,366 INFO L131 PetriNetUnfolder]: For 942/1185 co-relation queries the response was YES. [2022-12-06 04:11:32,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1869 conditions, 517 events. 212/517 cut-off events. For 942/1185 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2904 event pairs, 18 based on Foata normal form. 34/524 useless extension candidates. Maximal degree in co-relation 1847. Up to 202 conditions per place. [2022-12-06 04:11:32,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 60 transitions, 448 flow [2022-12-06 04:11:32,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 800 [2022-12-06 04:11:32,379 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:32,379 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 04:11:32,379 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 448 flow [2022-12-06 04:11:32,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:32,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:32,379 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:32,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:11:32,380 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:32,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:32,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1614231928, now seen corresponding path program 1 times [2022-12-06 04:11:32,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:32,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317001804] [2022-12-06 04:11:32,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:32,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:32,489 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:11:32,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:32,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317001804] [2022-12-06 04:11:32,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317001804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:32,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:32,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:11:32,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251850405] [2022-12-06 04:11:32,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:32,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:11:32,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:32,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:11:32,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:11:32,491 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:11:32,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 60 transitions, 448 flow. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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:11:32,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:32,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:11:32,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:32,942 INFO L130 PetriNetUnfolder]: 2770/4183 cut-off events. [2022-12-06 04:11:32,942 INFO L131 PetriNetUnfolder]: For 13078/13078 co-relation queries the response was YES. [2022-12-06 04:11:32,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17190 conditions, 4183 events. 2770/4183 cut-off events. For 13078/13078 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 20802 event pairs, 250 based on Foata normal form. 12/4195 useless extension candidates. Maximal degree in co-relation 17165. Up to 1933 conditions per place. [2022-12-06 04:11:32,961 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 107 selfloop transitions, 39 changer transitions 6/152 dead transitions. [2022-12-06 04:11:32,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 152 transitions, 1359 flow [2022-12-06 04:11:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:11:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:11:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 04:11:32,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6692307692307692 [2022-12-06 04:11:32,963 INFO L175 Difference]: Start difference. First operand has 57 places, 60 transitions, 448 flow. Second operand 5 states and 87 transitions. [2022-12-06 04:11:32,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 152 transitions, 1359 flow [2022-12-06 04:11:32,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 152 transitions, 1245 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-12-06 04:11:32,998 INFO L231 Difference]: Finished difference. Result has 61 places, 83 transitions, 786 flow [2022-12-06 04:11:32,998 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=786, PETRI_PLACES=61, PETRI_TRANSITIONS=83} [2022-12-06 04:11:32,998 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2022-12-06 04:11:32,998 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:32,998 INFO L89 Accepts]: Start accepts. Operand has 61 places, 83 transitions, 786 flow [2022-12-06 04:11:32,999 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:32,999 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:33,000 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 83 transitions, 786 flow [2022-12-06 04:11:33,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 83 transitions, 786 flow [2022-12-06 04:11:33,059 INFO L130 PetriNetUnfolder]: 308/737 cut-off events. [2022-12-06 04:11:33,059 INFO L131 PetriNetUnfolder]: For 1701/1969 co-relation queries the response was YES. [2022-12-06 04:11:33,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2714 conditions, 737 events. 308/737 cut-off events. For 1701/1969 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4626 event pairs, 22 based on Foata normal form. 57/762 useless extension candidates. Maximal degree in co-relation 2689. Up to 213 conditions per place. [2022-12-06 04:11:33,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 83 transitions, 786 flow [2022-12-06 04:11:33,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 1052 [2022-12-06 04:11:33,077 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:33,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 04:11:33,079 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 83 transitions, 786 flow [2022-12-06 04:11:33,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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:11:33,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:33,080 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:33,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:11:33,080 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:33,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:33,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1698668354, now seen corresponding path program 2 times [2022-12-06 04:11:33,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:33,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18029736] [2022-12-06 04:11:33,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:33,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:33,258 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:11:33,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:33,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18029736] [2022-12-06 04:11:33,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18029736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:33,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:33,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:11:33,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507371596] [2022-12-06 04:11:33,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:33,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:11:33,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:33,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:11:33,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:11:33,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-06 04:11:33,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 83 transitions, 786 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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:11:33,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:33,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-06 04:11:33,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:33,833 INFO L130 PetriNetUnfolder]: 2710/4369 cut-off events. [2022-12-06 04:11:33,833 INFO L131 PetriNetUnfolder]: For 17483/17698 co-relation queries the response was YES. [2022-12-06 04:11:33,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18686 conditions, 4369 events. 2710/4369 cut-off events. For 17483/17698 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 24904 event pairs, 578 based on Foata normal form. 62/4323 useless extension candidates. Maximal degree in co-relation 18658. Up to 2133 conditions per place. [2022-12-06 04:11:33,863 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 77 selfloop transitions, 3 changer transitions 32/132 dead transitions. [2022-12-06 04:11:33,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 132 transitions, 1280 flow [2022-12-06 04:11:33,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:11:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:11:33,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 04:11:33,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2022-12-06 04:11:33,864 INFO L175 Difference]: Start difference. First operand has 61 places, 83 transitions, 786 flow. Second operand 4 states and 66 transitions. [2022-12-06 04:11:33,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 132 transitions, 1280 flow [2022-12-06 04:11:33,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 132 transitions, 1280 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:11:33,919 INFO L231 Difference]: Finished difference. Result has 65 places, 74 transitions, 685 flow [2022-12-06 04:11:33,919 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=685, PETRI_PLACES=65, PETRI_TRANSITIONS=74} [2022-12-06 04:11:33,920 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2022-12-06 04:11:33,920 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:33,920 INFO L89 Accepts]: Start accepts. Operand has 65 places, 74 transitions, 685 flow [2022-12-06 04:11:33,921 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:33,921 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:33,921 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 74 transitions, 685 flow [2022-12-06 04:11:33,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 74 transitions, 685 flow [2022-12-06 04:11:33,986 INFO L130 PetriNetUnfolder]: 265/665 cut-off events. [2022-12-06 04:11:33,987 INFO L131 PetriNetUnfolder]: For 1878/2174 co-relation queries the response was YES. [2022-12-06 04:11:33,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2452 conditions, 665 events. 265/665 cut-off events. For 1878/2174 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4183 event pairs, 19 based on Foata normal form. 41/675 useless extension candidates. Maximal degree in co-relation 2425. Up to 192 conditions per place. [2022-12-06 04:11:33,996 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 74 transitions, 685 flow [2022-12-06 04:11:33,996 INFO L188 LiptonReduction]: Number of co-enabled transitions 882 [2022-12-06 04:11:34,029 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:34,030 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-06 04:11:34,030 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 74 transitions, 685 flow [2022-12-06 04:11:34,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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:11:34,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:34,031 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:34,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:11:34,031 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:34,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:34,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1066748498, now seen corresponding path program 1 times [2022-12-06 04:11:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:34,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115781301] [2022-12-06 04:11:34,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:34,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:34,599 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:11:34,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:34,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115781301] [2022-12-06 04:11:34,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115781301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:34,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:34,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:11:34,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530865505] [2022-12-06 04:11:34,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:34,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:11:34,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:34,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:11:34,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:11:34,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 04:11:34,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 74 transitions, 685 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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:11:34,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:34,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 04:11:34,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:35,156 INFO L130 PetriNetUnfolder]: 2641/4478 cut-off events. [2022-12-06 04:11:35,156 INFO L131 PetriNetUnfolder]: For 17777/18028 co-relation queries the response was YES. [2022-12-06 04:11:35,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18597 conditions, 4478 events. 2641/4478 cut-off events. For 17777/18028 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 27903 event pairs, 169 based on Foata normal form. 85/4504 useless extension candidates. Maximal degree in co-relation 18567. Up to 1122 conditions per place. [2022-12-06 04:11:35,177 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 136 selfloop transitions, 6 changer transitions 51/217 dead transitions. [2022-12-06 04:11:35,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 217 transitions, 2134 flow [2022-12-06 04:11:35,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:11:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:11:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-12-06 04:11:35,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6043956043956044 [2022-12-06 04:11:35,179 INFO L175 Difference]: Start difference. First operand has 65 places, 74 transitions, 685 flow. Second operand 7 states and 110 transitions. [2022-12-06 04:11:35,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 217 transitions, 2134 flow [2022-12-06 04:11:35,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 217 transitions, 2075 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 04:11:35,270 INFO L231 Difference]: Finished difference. Result has 71 places, 78 transitions, 711 flow [2022-12-06 04:11:35,271 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=711, PETRI_PLACES=71, PETRI_TRANSITIONS=78} [2022-12-06 04:11:35,272 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2022-12-06 04:11:35,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:35,272 INFO L89 Accepts]: Start accepts. Operand has 71 places, 78 transitions, 711 flow [2022-12-06 04:11:35,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:35,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:35,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 78 transitions, 711 flow [2022-12-06 04:11:35,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 78 transitions, 711 flow [2022-12-06 04:11:35,336 INFO L130 PetriNetUnfolder]: 420/1037 cut-off events. [2022-12-06 04:11:35,336 INFO L131 PetriNetUnfolder]: For 2622/3016 co-relation queries the response was YES. [2022-12-06 04:11:35,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3782 conditions, 1037 events. 420/1037 cut-off events. For 2622/3016 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7263 event pairs, 27 based on Foata normal form. 103/1082 useless extension candidates. Maximal degree in co-relation 3752. Up to 331 conditions per place. [2022-12-06 04:11:35,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 78 transitions, 711 flow [2022-12-06 04:11:35,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 966 [2022-12-06 04:11:35,351 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:35,352 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 04:11:35,352 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 78 transitions, 711 flow [2022-12-06 04:11:35,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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:11:35,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:35,352 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:35,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:11:35,352 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:35,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:35,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1608250220, now seen corresponding path program 3 times [2022-12-06 04:11:35,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:35,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510487891] [2022-12-06 04:11:35,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:35,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:35,477 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:11:35,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:35,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510487891] [2022-12-06 04:11:35,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510487891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:35,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:35,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:11:35,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783123644] [2022-12-06 04:11:35,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:35,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:11:35,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:35,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:11:35,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:11:35,478 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:11:35,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 78 transitions, 711 flow. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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:11:35,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:35,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:11:35,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:35,967 INFO L130 PetriNetUnfolder]: 3569/5848 cut-off events. [2022-12-06 04:11:35,967 INFO L131 PetriNetUnfolder]: For 22945/22945 co-relation queries the response was YES. [2022-12-06 04:11:35,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26608 conditions, 5848 events. 3569/5848 cut-off events. For 22945/22945 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 35118 event pairs, 675 based on Foata normal form. 14/5862 useless extension candidates. Maximal degree in co-relation 26575. Up to 2432 conditions per place. [2022-12-06 04:11:35,994 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 98 selfloop transitions, 33 changer transitions 18/149 dead transitions. [2022-12-06 04:11:35,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 149 transitions, 1458 flow [2022-12-06 04:11:35,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:11:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:11:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 04:11:35,995 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6634615384615384 [2022-12-06 04:11:35,995 INFO L175 Difference]: Start difference. First operand has 69 places, 78 transitions, 711 flow. Second operand 4 states and 69 transitions. [2022-12-06 04:11:35,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 149 transitions, 1458 flow [2022-12-06 04:11:36,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 149 transitions, 1430 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 04:11:36,081 INFO L231 Difference]: Finished difference. Result has 71 places, 79 transitions, 864 flow [2022-12-06 04:11:36,082 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=864, PETRI_PLACES=71, PETRI_TRANSITIONS=79} [2022-12-06 04:11:36,082 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2022-12-06 04:11:36,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:36,082 INFO L89 Accepts]: Start accepts. Operand has 71 places, 79 transitions, 864 flow [2022-12-06 04:11:36,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:36,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:36,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 79 transitions, 864 flow [2022-12-06 04:11:36,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 79 transitions, 864 flow [2022-12-06 04:11:36,151 INFO L130 PetriNetUnfolder]: 448/1124 cut-off events. [2022-12-06 04:11:36,151 INFO L131 PetriNetUnfolder]: For 3725/4071 co-relation queries the response was YES. [2022-12-06 04:11:36,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4168 conditions, 1124 events. 448/1124 cut-off events. For 3725/4071 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8189 event pairs, 32 based on Foata normal form. 114/1172 useless extension candidates. Maximal degree in co-relation 4137. Up to 389 conditions per place. [2022-12-06 04:11:36,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 79 transitions, 864 flow [2022-12-06 04:11:36,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 912 [2022-12-06 04:11:36,163 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:36,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 04:11:36,163 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 864 flow [2022-12-06 04:11:36,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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:11:36,163 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:36,163 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:36,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:11:36,164 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:36,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:36,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1947853304, now seen corresponding path program 4 times [2022-12-06 04:11:36,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:36,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072286592] [2022-12-06 04:11:36,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:36,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:36,307 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:11:36,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:36,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072286592] [2022-12-06 04:11:36,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072286592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:36,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:36,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:11:36,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978520698] [2022-12-06 04:11:36,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:36,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:11:36,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:36,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:11:36,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:11:36,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 04:11:36,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 864 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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:11:36,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:36,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 04:11:36,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:36,639 INFO L130 PetriNetUnfolder]: 1918/3296 cut-off events. [2022-12-06 04:11:36,639 INFO L131 PetriNetUnfolder]: For 16756/17039 co-relation queries the response was YES. [2022-12-06 04:11:36,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14589 conditions, 3296 events. 1918/3296 cut-off events. For 16756/17039 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 20755 event pairs, 245 based on Foata normal form. 209/3452 useless extension candidates. Maximal degree in co-relation 14555. Up to 1249 conditions per place. [2022-12-06 04:11:36,653 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 53 selfloop transitions, 17 changer transitions 67/148 dead transitions. [2022-12-06 04:11:36,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 148 transitions, 1774 flow [2022-12-06 04:11:36,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:11:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:11:36,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-12-06 04:11:36,655 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-06 04:11:36,655 INFO L175 Difference]: Start difference. First operand has 71 places, 79 transitions, 864 flow. Second operand 6 states and 92 transitions. [2022-12-06 04:11:36,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 148 transitions, 1774 flow [2022-12-06 04:11:36,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 148 transitions, 1742 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 04:11:36,730 INFO L231 Difference]: Finished difference. Result has 75 places, 51 transitions, 447 flow [2022-12-06 04:11:36,730 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=447, PETRI_PLACES=75, PETRI_TRANSITIONS=51} [2022-12-06 04:11:36,730 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places. [2022-12-06 04:11:36,730 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:36,730 INFO L89 Accepts]: Start accepts. Operand has 75 places, 51 transitions, 447 flow [2022-12-06 04:11:36,731 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:36,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:36,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 51 transitions, 447 flow [2022-12-06 04:11:36,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 51 transitions, 447 flow [2022-12-06 04:11:36,751 INFO L130 PetriNetUnfolder]: 132/330 cut-off events. [2022-12-06 04:11:36,751 INFO L131 PetriNetUnfolder]: For 999/1074 co-relation queries the response was YES. [2022-12-06 04:11:36,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 330 events. 132/330 cut-off events. For 999/1074 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1726 event pairs, 4 based on Foata normal form. 4/307 useless extension candidates. Maximal degree in co-relation 1341. Up to 119 conditions per place. [2022-12-06 04:11:36,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 51 transitions, 447 flow [2022-12-06 04:11:36,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-06 04:11:37,502 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:11:37,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 772 [2022-12-06 04:11:37,502 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 49 transitions, 479 flow [2022-12-06 04:11:37,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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:11:37,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:37,503 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:37,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:11:37,503 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:37,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:37,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1536707127, now seen corresponding path program 1 times [2022-12-06 04:11:37,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:37,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128609042] [2022-12-06 04:11:37,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:37,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:37,613 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:11:37,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:37,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128609042] [2022-12-06 04:11:37,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128609042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:37,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:37,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:11:37,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104953195] [2022-12-06 04:11:37,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:37,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:11:37,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:37,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:11:37,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:11:37,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:11:37,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 49 transitions, 479 flow. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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:11:37,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:37,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:11:37,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:37,811 INFO L130 PetriNetUnfolder]: 829/1461 cut-off events. [2022-12-06 04:11:37,811 INFO L131 PetriNetUnfolder]: For 11553/11553 co-relation queries the response was YES. [2022-12-06 04:11:37,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7940 conditions, 1461 events. 829/1461 cut-off events. For 11553/11553 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7700 event pairs, 182 based on Foata normal form. 2/1463 useless extension candidates. Maximal degree in co-relation 7905. Up to 872 conditions per place. [2022-12-06 04:11:37,818 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 48 selfloop transitions, 5 changer transitions 41/94 dead transitions. [2022-12-06 04:11:37,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 94 transitions, 1020 flow [2022-12-06 04:11:37,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:11:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:11:37,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 04:11:37,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2022-12-06 04:11:37,819 INFO L175 Difference]: Start difference. First operand has 72 places, 49 transitions, 479 flow. Second operand 4 states and 52 transitions. [2022-12-06 04:11:37,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 94 transitions, 1020 flow [2022-12-06 04:11:37,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 94 transitions, 783 flow, removed 33 selfloop flow, removed 13 redundant places. [2022-12-06 04:11:37,834 INFO L231 Difference]: Finished difference. Result has 63 places, 36 transitions, 223 flow [2022-12-06 04:11:37,834 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=63, PETRI_TRANSITIONS=36} [2022-12-06 04:11:37,835 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2022-12-06 04:11:37,835 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:37,835 INFO L89 Accepts]: Start accepts. Operand has 63 places, 36 transitions, 223 flow [2022-12-06 04:11:37,835 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:37,835 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:37,835 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 36 transitions, 223 flow [2022-12-06 04:11:37,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 36 transitions, 223 flow [2022-12-06 04:11:37,842 INFO L130 PetriNetUnfolder]: 34/92 cut-off events. [2022-12-06 04:11:37,842 INFO L131 PetriNetUnfolder]: For 126/139 co-relation queries the response was YES. [2022-12-06 04:11:37,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 92 events. 34/92 cut-off events. For 126/139 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 292 event pairs, 1 based on Foata normal form. 6/93 useless extension candidates. Maximal degree in co-relation 283. Up to 32 conditions per place. [2022-12-06 04:11:37,843 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 36 transitions, 223 flow [2022-12-06 04:11:37,843 INFO L188 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-06 04:11:37,967 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:11:37,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-06 04:11:37,968 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 34 transitions, 226 flow [2022-12-06 04:11:37,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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:11:37,968 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:37,968 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:37,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:11:37,968 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:37,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:37,968 INFO L85 PathProgramCache]: Analyzing trace with hash 574804157, now seen corresponding path program 1 times [2022-12-06 04:11:37,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:37,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053346255] [2022-12-06 04:11:37,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:37,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:38,326 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:11:38,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:38,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053346255] [2022-12-06 04:11:38,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053346255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:38,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:38,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:11:38,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111367868] [2022-12-06 04:11:38,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:38,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:11:38,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:38,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:11:38,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:11:38,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:11:38,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 34 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:38,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:38,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:11:38,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:38,442 INFO L130 PetriNetUnfolder]: 114/211 cut-off events. [2022-12-06 04:11:38,442 INFO L131 PetriNetUnfolder]: For 1031/1031 co-relation queries the response was YES. [2022-12-06 04:11:38,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 211 events. 114/211 cut-off events. For 1031/1031 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 663 event pairs, 18 based on Foata normal form. 1/212 useless extension candidates. Maximal degree in co-relation 902. Up to 118 conditions per place. [2022-12-06 04:11:38,443 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 39 selfloop transitions, 5 changer transitions 21/65 dead transitions. [2022-12-06 04:11:38,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 65 transitions, 542 flow [2022-12-06 04:11:38,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:11:38,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:11:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-12-06 04:11:38,444 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2022-12-06 04:11:38,445 INFO L175 Difference]: Start difference. First operand has 59 places, 34 transitions, 226 flow. Second operand 6 states and 41 transitions. [2022-12-06 04:11:38,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 65 transitions, 542 flow [2022-12-06 04:11:38,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 468 flow, removed 6 selfloop flow, removed 14 redundant places. [2022-12-06 04:11:38,447 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 183 flow [2022-12-06 04:11:38,447 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2022-12-06 04:11:38,447 INFO L294 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2022-12-06 04:11:38,447 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:38,447 INFO L89 Accepts]: Start accepts. Operand has 50 places, 33 transitions, 183 flow [2022-12-06 04:11:38,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:38,451 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:38,451 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 33 transitions, 183 flow [2022-12-06 04:11:38,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 33 transitions, 183 flow [2022-12-06 04:11:38,456 INFO L130 PetriNetUnfolder]: 28/71 cut-off events. [2022-12-06 04:11:38,456 INFO L131 PetriNetUnfolder]: For 83/88 co-relation queries the response was YES. [2022-12-06 04:11:38,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 71 events. 28/71 cut-off events. For 83/88 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 196 event pairs, 0 based on Foata normal form. 3/70 useless extension candidates. Maximal degree in co-relation 203. Up to 24 conditions per place. [2022-12-06 04:11:38,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 33 transitions, 183 flow [2022-12-06 04:11:38,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 04:11:38,513 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [370] L807-->L814: Formula: (let ((.cse2 (not (= 0 (mod v_~y$r_buff1_thd3~0_24 256)))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_83 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_33 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_84 256) 0)))) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_83 (ite .cse0 0 v_~y$w_buff0_used~0_84)) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd3~0_32 256) 0))) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_80 256) 0)))) 0 v_~y$r_buff1_thd3~0_24) v_~y$r_buff1_thd3~0_23) (= v_~y~0_44 (ite .cse0 v_~y$w_buff0~0_34 (ite .cse3 v_~y$w_buff1~0_33 v_~y~0_45))) (= (ite .cse4 0 v_~y$r_buff0_thd3~0_33) v_~y$r_buff0_thd3~0_32) (= v_~y$w_buff1_used~0_80 (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_81))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$w_buff1~0=v_~y$w_buff1~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_33, ~y$w_buff0~0=v_~y$w_buff0~0_34, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_32, ~y$w_buff0~0=v_~y$w_buff0~0_34, ~y~0=v_~y~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] and [503] L861-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_126 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_307 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_135 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_308 256) 0)))) (.cse0 (and .cse2 .cse5)) (.cse4 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_274 256) 0))))) (and (= v_~y$r_buff0_thd0~0_134 (ite .cse0 0 v_~y$r_buff0_thd0~0_135)) (= v_~main$tmp_guard1~0_68 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_68) (= v_~z~0_90 2) (= v_~x~0_94 2) (= 2 v_~__unbuffered_p3_EAX~0_64) (= v_~__unbuffered_p1_EAX~0_87 0))) 1 0) 0) 0 1)) (= v_~y$r_buff1_thd0~0_125 (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_273 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_134 256) 0)) .cse2)) 0 v_~y$r_buff1_thd0~0_126)) (= v_~y$w_buff0_used~0_307 (ite .cse3 0 v_~y$w_buff0_used~0_308)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= (mod v_~main$tmp_guard0~0_82 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_297 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_82) (= (mod v_~main$tmp_guard1~0_68 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|) (= v_~y~0_234 (ite .cse3 v_~y$w_buff0~0_189 (ite .cse4 v_~y$w_buff1~0_168 v_~y~0_235))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_55|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_55| 0) (= (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_274) v_~y$w_buff1_used~0_273)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_308, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_168, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, ~y$w_buff0~0=v_~y$w_buff0~0_189, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_64, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_297, ~z~0=v_~z~0_90, ~y~0=v_~y~0_235, ~x~0=v_~x~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_126, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_274} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_55|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_307, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_53|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_68, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_82, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_61|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_168, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_189, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_64, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_297, ~z~0=v_~z~0_90, ~y~0=v_~y~0_234, ~x~0=v_~x~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_273, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:11:38,771 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [503] L861-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_126 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_307 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_135 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_308 256) 0)))) (.cse0 (and .cse2 .cse5)) (.cse4 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_274 256) 0))))) (and (= v_~y$r_buff0_thd0~0_134 (ite .cse0 0 v_~y$r_buff0_thd0~0_135)) (= v_~main$tmp_guard1~0_68 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_68) (= v_~z~0_90 2) (= v_~x~0_94 2) (= 2 v_~__unbuffered_p3_EAX~0_64) (= v_~__unbuffered_p1_EAX~0_87 0))) 1 0) 0) 0 1)) (= v_~y$r_buff1_thd0~0_125 (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_273 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_134 256) 0)) .cse2)) 0 v_~y$r_buff1_thd0~0_126)) (= v_~y$w_buff0_used~0_307 (ite .cse3 0 v_~y$w_buff0_used~0_308)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= (mod v_~main$tmp_guard0~0_82 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_297 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_82) (= (mod v_~main$tmp_guard1~0_68 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|) (= v_~y~0_234 (ite .cse3 v_~y$w_buff0~0_189 (ite .cse4 v_~y$w_buff1~0_168 v_~y~0_235))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_55|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_55| 0) (= (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_274) v_~y$w_buff1_used~0_273)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_308, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_168, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, ~y$w_buff0~0=v_~y$w_buff0~0_189, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_64, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_297, ~z~0=v_~z~0_90, ~y~0=v_~y~0_235, ~x~0=v_~x~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_126, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_274} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_55|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_307, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_53|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_68, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_82, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_61|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_168, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_189, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_64, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_297, ~z~0=v_~z~0_90, ~y~0=v_~y~0_234, ~x~0=v_~x~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_273, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [509] $Ultimate##0-->L807: Formula: (and (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_30| 0)) (= |v_P2Thread1of1ForFork0_#in~arg#1.base_26| |v_P2Thread1of1ForFork0_~arg#1.base_26|) (= v_~y$w_buff0~0_203 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_30| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_325 256) 0)) (not (= (mod v_~y$w_buff1_used~0_290 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_325 1) (= v_~y$r_buff0_thd3~0_114 1) (= v_~y$w_buff1~0_181 v_~y$w_buff0~0_204) (= v_~y$r_buff0_thd3~0_115 v_~y$r_buff1_thd3~0_90) (= v_~y$r_buff0_thd0~0_144 v_~y$r_buff1_thd0~0_135) (= |v_P2Thread1of1ForFork0_~arg#1.offset_26| |v_P2Thread1of1ForFork0_#in~arg#1.offset_26|) (= v_~y$w_buff0_used~0_326 v_~y$w_buff1_used~0_290) (= v_~z~0_98 1) (= v_~y$r_buff0_thd2~0_147 v_~y$r_buff1_thd2~0_149) (= v_~y$r_buff0_thd4~0_90 v_~y$r_buff1_thd4~0_96) (= v_~y$r_buff0_thd1~0_52 v_~y$r_buff1_thd1~0_54) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_30| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_30|)) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_26|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_90, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_326, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_26|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_115, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_144, ~y$w_buff0~0=v_~y$w_buff0~0_204, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_147, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_52} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_325, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_26|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_149, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_26|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_90, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_54, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_96, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_90, ~y$w_buff1~0=v_~y$w_buff1~0_181, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_26|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_114, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_144, ~y$w_buff0~0=v_~y$w_buff0~0_203, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_147, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_52, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_30|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_26|, ~z~0=v_~z~0_98, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_135, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_290} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-06 04:11:39,141 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [510] L807-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse14 (not (= (mod v_~y$r_buff0_thd3~0_119 256) 0)))) (let ((.cse5 (and (not (= (mod v_~y$w_buff0_used~0_331 256) 0)) .cse14))) (let ((.cse9 (ite .cse5 0 v_~y$w_buff0_used~0_331))) (let ((.cse2 (not (= (mod .cse9 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd3~0_93 256) 0)))) (let ((.cse6 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_294 256) 0)))) (.cse12 (and .cse2 .cse14))) (let ((.cse8 (ite (or .cse6 .cse12) 0 v_~y$w_buff1_used~0_294))) (let ((.cse11 (not (= (mod v_~y$w_buff0_used~0_329 256) 0))) (.cse13 (not (= (mod v_~y$r_buff0_thd0~0_147 256) 0))) (.cse1 (not (= (mod .cse8 256) 0))) (.cse10 (not (= (mod v_~y$r_buff1_thd0~0_138 256) 0)))) (let ((.cse4 (and .cse1 .cse10)) (.cse3 (and .cse2 .cse13)) (.cse7 (and .cse11 .cse13))) (and (= (mod v_~main$tmp_guard1~0_72 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59| 0) (= (ite (or (and .cse0 .cse1) (and (not (= (mod v_~y$r_buff0_thd3~0_118 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_93) v_~y$r_buff1_thd3~0_92) (= v_~y~0_250 (ite .cse3 v_~y$w_buff0~0_207 (ite .cse4 v_~y$w_buff1~0_183 (ite .cse5 v_~y$w_buff0~0_207 (ite .cse6 v_~y$w_buff1~0_183 v_~y~0_252))))) (= v_~main$tmp_guard0~0_86 (ite (= (ite (= v_~__unbuffered_cnt~0_301 4) 1 0) 0) 0 1)) (= v_~y$w_buff1_used~0_292 (ite (or .cse4 .cse7) 0 .cse8)) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_72) (= 2 v_~x~0_104) (= v_~z~0_100 2) (= v_~__unbuffered_p1_EAX~0_95 0) (= 0 v_~__unbuffered_p3_EBX~0_74))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_72) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|) (= v_~y$w_buff0_used~0_329 (ite .cse3 0 .cse9)) (= v_~y$r_buff1_thd0~0_137 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_292 256) 0)) .cse10) (and .cse11 (not (= (mod v_~y$r_buff0_thd0~0_146 256) 0)))) 0 v_~y$r_buff1_thd0~0_138)) (= v_~y$r_buff0_thd0~0_146 (ite .cse7 0 v_~y$r_buff0_thd0~0_147)) (= v_~y$r_buff0_thd3~0_118 (ite .cse12 0 v_~y$r_buff0_thd3~0_119)) (= (mod v_~main$tmp_guard0~0_86 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_55| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_55| 0))))))))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_331, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_74, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_93, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, ~y$w_buff1~0=v_~y$w_buff1~0_183, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_147, ~y$w_buff0~0=v_~y$w_buff0~0_207, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_119, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_301, ~z~0=v_~z~0_100, ~y~0=v_~y~0_252, ~x~0=v_~x~0_104, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_138, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_294} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_329, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_72, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_74, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_86, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_65|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_92, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, ~y$w_buff1~0=v_~y$w_buff1~0_183, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_146, ~y$w_buff0~0=v_~y$w_buff0~0_207, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_55|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_118, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_301, ~z~0=v_~z~0_100, ~y~0=v_~y~0_250, ~x~0=v_~x~0_104, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_137, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_292, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_47|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~y$r_buff1_thd3~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$r_buff0_thd3~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [509] $Ultimate##0-->L807: Formula: (and (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_30| 0)) (= |v_P2Thread1of1ForFork0_#in~arg#1.base_26| |v_P2Thread1of1ForFork0_~arg#1.base_26|) (= v_~y$w_buff0~0_203 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_30| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_325 256) 0)) (not (= (mod v_~y$w_buff1_used~0_290 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_325 1) (= v_~y$r_buff0_thd3~0_114 1) (= v_~y$w_buff1~0_181 v_~y$w_buff0~0_204) (= v_~y$r_buff0_thd3~0_115 v_~y$r_buff1_thd3~0_90) (= v_~y$r_buff0_thd0~0_144 v_~y$r_buff1_thd0~0_135) (= |v_P2Thread1of1ForFork0_~arg#1.offset_26| |v_P2Thread1of1ForFork0_#in~arg#1.offset_26|) (= v_~y$w_buff0_used~0_326 v_~y$w_buff1_used~0_290) (= v_~z~0_98 1) (= v_~y$r_buff0_thd2~0_147 v_~y$r_buff1_thd2~0_149) (= v_~y$r_buff0_thd4~0_90 v_~y$r_buff1_thd4~0_96) (= v_~y$r_buff0_thd1~0_52 v_~y$r_buff1_thd1~0_54) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_30| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_30|)) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_26|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_90, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_326, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_26|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_115, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_144, ~y$w_buff0~0=v_~y$w_buff0~0_204, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_147, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_52} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_325, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_26|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_149, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_26|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_90, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_54, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_96, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_90, ~y$w_buff1~0=v_~y$w_buff1~0_181, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_26|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_114, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_144, ~y$w_buff0~0=v_~y$w_buff0~0_203, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_147, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_52, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_30|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_26|, ~z~0=v_~z~0_98, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_135, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_290} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-06 04:11:39,636 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:11:39,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1190 [2022-12-06 04:11:39,637 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 245 flow [2022-12-06 04:11:39,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:39,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:39,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:39,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:11:39,637 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:39,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:39,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2080023499, now seen corresponding path program 2 times [2022-12-06 04:11:39,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:39,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517944594] [2022-12-06 04:11:39,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:39,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:11:39,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:11:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:11:39,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:11:39,730 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:11:39,731 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:11:39,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:11:39,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:11:39,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:11:39,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:11:39,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:11:39,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:11:39,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:11:39,735 INFO L458 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:39,739 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:11:39,739 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:11:39,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:11:39 BasicIcfg [2022-12-06 04:11:39,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:11:39,832 INFO L158 Benchmark]: Toolchain (without parser) took 21475.37ms. Allocated memory was 209.7MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 184.6MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 579.0MB. Max. memory is 8.0GB. [2022-12-06 04:11:39,832 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 209.7MB. Free memory was 187.5MB in the beginning and 187.4MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:11:39,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.03ms. Allocated memory is still 209.7MB. Free memory was 184.6MB in the beginning and 156.8MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 04:11:39,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.35ms. Allocated memory is still 209.7MB. Free memory was 156.8MB in the beginning and 154.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:11:39,832 INFO L158 Benchmark]: Boogie Preprocessor took 52.93ms. Allocated memory is still 209.7MB. Free memory was 154.7MB in the beginning and 152.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:11:39,833 INFO L158 Benchmark]: RCFGBuilder took 710.01ms. Allocated memory is still 209.7MB. Free memory was 152.6MB in the beginning and 119.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-06 04:11:39,833 INFO L158 Benchmark]: TraceAbstraction took 20163.85ms. Allocated memory was 209.7MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 118.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 513.0MB. Max. memory is 8.0GB. [2022-12-06 04:11:39,835 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 209.7MB. Free memory was 187.5MB in the beginning and 187.4MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 482.03ms. Allocated memory is still 209.7MB. Free memory was 184.6MB in the beginning and 156.8MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.35ms. Allocated memory is still 209.7MB. Free memory was 156.8MB in the beginning and 154.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.93ms. Allocated memory is still 209.7MB. Free memory was 154.7MB in the beginning and 152.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 710.01ms. Allocated memory is still 209.7MB. Free memory was 152.6MB in the beginning and 119.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 20163.85ms. Allocated memory was 209.7MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 118.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 513.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 135 PlacesBefore, 44 PlacesAfterwards, 124 TransitionsBefore, 32 TransitionsAfterwards, 2852 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2304, independent: 2239, independent conditional: 2239, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2304, independent: 2239, independent conditional: 0, independent unconditional: 2239, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2304, independent: 2239, independent conditional: 0, independent unconditional: 2239, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2304, independent: 2239, independent conditional: 0, independent unconditional: 2239, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1921, independent: 1880, independent conditional: 0, independent unconditional: 1880, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1921, independent: 1859, independent conditional: 0, independent unconditional: 1859, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 175, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2304, independent: 359, independent conditional: 0, independent unconditional: 359, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 1921, unknown conditional: 0, unknown unconditional: 1921] , Statistics on independence cache: Total cache size (in pairs): 3210, Positive cache size: 3169, Positive conditional cache size: 0, Positive unconditional cache size: 3169, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, 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, 37 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 145, independent conditional: 145, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 171, independent: 145, independent conditional: 11, independent unconditional: 134, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 171, independent: 145, independent conditional: 11, independent unconditional: 134, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 171, independent: 145, independent conditional: 11, independent unconditional: 134, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 153, independent: 132, independent conditional: 10, independent unconditional: 122, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 153, independent: 125, independent conditional: 0, independent unconditional: 125, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 82, dependent conditional: 14, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 171, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 153, unknown conditional: 12, unknown unconditional: 141] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 132, Positive conditional cache size: 10, Positive unconditional cache size: 122, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 418 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123, independent: 112, independent conditional: 112, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123, independent: 112, independent conditional: 19, independent unconditional: 93, dependent: 11, dependent conditional: 8, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 123, independent: 112, independent conditional: 2, independent unconditional: 110, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 123, independent: 112, independent conditional: 2, independent unconditional: 110, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 123, independent: 102, independent conditional: 2, independent unconditional: 100, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 142, Positive conditional cache size: 10, Positive unconditional cache size: 132, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 202, independent: 183, independent conditional: 183, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 202, independent: 183, independent conditional: 24, independent unconditional: 159, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 202, independent: 183, independent conditional: 0, independent unconditional: 183, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 202, independent: 183, independent conditional: 0, independent unconditional: 183, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 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: 202, independent: 179, independent conditional: 0, independent unconditional: 179, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 146, Positive conditional cache size: 10, Positive unconditional cache size: 136, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 370, independent: 343, independent conditional: 343, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 370, independent: 343, independent conditional: 89, independent unconditional: 254, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 370, independent: 343, independent conditional: 0, independent unconditional: 343, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 370, independent: 343, independent conditional: 0, independent unconditional: 343, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 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: 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: 370, independent: 338, independent conditional: 0, independent unconditional: 338, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 151, Positive conditional cache size: 10, Positive unconditional cache size: 141, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 89, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 736 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 226, independent: 207, independent conditional: 207, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 226, independent: 207, independent conditional: 79, independent unconditional: 128, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 226, independent: 207, independent conditional: 24, independent unconditional: 183, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 226, independent: 207, independent conditional: 24, independent unconditional: 183, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 226, independent: 207, independent conditional: 24, independent unconditional: 183, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 151, Positive conditional cache size: 10, Positive unconditional cache size: 141, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, 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, 54 PlacesBefore, 54 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 832 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 222, independent: 201, independent conditional: 201, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 222, independent: 201, independent conditional: 90, independent unconditional: 111, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 222, independent: 201, independent conditional: 32, independent unconditional: 169, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222, independent: 201, independent conditional: 32, independent unconditional: 169, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 222, independent: 201, independent conditional: 32, independent unconditional: 169, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 151, Positive conditional cache size: 10, Positive unconditional cache size: 141, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 58, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 800 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 227, independent: 204, independent conditional: 204, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 227, independent: 204, independent conditional: 95, independent unconditional: 109, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 227, independent: 204, independent conditional: 35, independent unconditional: 169, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 227, independent: 204, independent conditional: 35, independent unconditional: 169, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 227, independent: 202, independent conditional: 34, independent unconditional: 168, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 153, Positive conditional cache size: 11, Positive unconditional cache size: 142, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 60, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 1052 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 161, independent: 133, independent conditional: 133, 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: 161, independent: 133, independent conditional: 105, independent unconditional: 28, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 203, independent: 133, independent conditional: 18, independent unconditional: 115, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203, independent: 133, independent conditional: 18, independent unconditional: 115, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 203, independent: 133, independent conditional: 18, independent unconditional: 115, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 153, Positive conditional cache size: 11, Positive unconditional cache size: 142, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 157, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 882 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 172, independent: 145, independent conditional: 145, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 172, independent: 145, independent conditional: 113, independent unconditional: 32, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 172, independent: 145, independent conditional: 46, independent unconditional: 99, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 172, independent: 145, independent conditional: 46, independent unconditional: 99, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 3, independent unconditional: 6, 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: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 172, independent: 136, independent conditional: 43, independent unconditional: 93, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 11, unknown conditional: 3, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 162, Positive conditional cache size: 14, Positive unconditional cache size: 148, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 67, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 966 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 162, Positive conditional cache size: 14, Positive unconditional cache size: 148, 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: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 912 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 54, independent conditional: 48, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 54, independent conditional: 30, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 54, independent conditional: 30, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 54, independent conditional: 30, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 162, Positive conditional cache size: 14, Positive unconditional cache size: 148, 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: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 74 PlacesBefore, 72 PlacesAfterwards, 51 TransitionsBefore, 49 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 43, independent conditional: 36, independent unconditional: 7, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 43, independent conditional: 21, independent unconditional: 22, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 43, independent conditional: 21, independent unconditional: 22, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 2, independent unconditional: 6, 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: 9, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 35, independent conditional: 19, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 9, unknown conditional: 2, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 199, Positive conditional cache size: 17, Positive unconditional cache size: 182, Negative cache size: 27, Negative conditional cache size: 3, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 61 PlacesBefore, 59 PlacesAfterwards, 36 TransitionsBefore, 34 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 9, independent unconditional: 3, 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: 12, independent: 12, independent conditional: 7, independent unconditional: 5, 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: 12, independent: 12, independent conditional: 7, independent unconditional: 5, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 10, independent conditional: 7, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 238, Positive conditional cache size: 18, Positive unconditional cache size: 220, Negative cache size: 27, Negative conditional cache size: 3, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 49 PlacesBefore, 51 PlacesAfterwards, 33 TransitionsBefore, 35 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 16, independent unconditional: 2, 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: 18, independent: 18, independent conditional: 16, independent unconditional: 2, 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: 5, independent: 5, independent conditional: 4, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 13, independent conditional: 12, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 246, Positive conditional cache size: 22, Positive unconditional cache size: 224, Negative cache size: 27, Negative conditional cache size: 3, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L854] 0 pthread_t t717; [L855] FCALL, FORK 0 pthread_create(&t717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t717, ((void *)0), P0, ((void *)0))=-4, t717={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L856] 0 pthread_t t718; [L857] FCALL, FORK 0 pthread_create(&t718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t718, ((void *)0), P1, ((void *)0))=-3, t717={5:0}, t718={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L858] 0 pthread_t t719; [L859] FCALL, FORK 0 pthread_create(&t719, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t719, ((void *)0), P2, ((void *)0))=-2, t717={5:0}, t718={6:0}, t719={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t720; [L861] FCALL, FORK 0 pthread_create(&t720, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t720, ((void *)0), P3, ((void *)0))=-1, t717={5:0}, t718={6:0}, t719={7:0}, t720={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L797] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L797] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L803] 3 y$r_buff0_thd3 = (_Bool)1 [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 4 z = 2 [L826] 4 __unbuffered_p3_EAX = z [L829] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 1 a = 1 [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 x = 2 [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EAX = y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L874] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 163 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1273 IncrementalHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 33 mSDtfsCounter, 1273 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=864occurred in iteration=11, InterpolantAutomatonStates: 62, 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, 2.5s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 1532 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:11:39,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...