/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix010.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:45:58,707 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:45:58,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:45:58,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:45:58,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:45:58,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:45:58,747 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:45:58,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:45:58,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:45:58,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:45:58,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:45:58,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:45:58,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:45:58,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:45:58,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:45:58,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:45:58,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:45:58,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:45:58,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:45:58,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:45:58,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:45:58,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:45:58,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:45:58,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:45:58,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:45:58,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:45:58,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:45:58,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:45:58,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:45:58,768 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:45:58,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:45:58,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:45:58,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:45:58,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:45:58,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:45:58,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:45:58,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:45:58,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:45:58,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:45:58,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:45:58,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:45:58,773 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:45:58,791 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:45:58,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:45:58,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:45:58,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:45:58,792 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:45:58,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:45:58,793 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:45:58,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:45:58,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:45:58,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:45:58,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:45:58,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:45:58,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:45:58,793 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:45:58,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:45:58,793 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:45:58,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:45:58,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:45:58,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:45:58,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:45:58,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:45:58,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:45:58,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:45:58,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:45:58,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:45:58,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:45:58,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:45:58,795 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:45:58,795 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-13 11:45:59,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:45:59,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:45:59,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:45:59,062 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:45:59,063 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:45:59,064 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010.opt.i [2022-12-13 11:46:00,040 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:46:00,265 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:46:00,265 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.opt.i [2022-12-13 11:46:00,274 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9accafef4/304c0eaa500341b1987d5955a1443955/FLAG726b90ead [2022-12-13 11:46:00,287 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9accafef4/304c0eaa500341b1987d5955a1443955 [2022-12-13 11:46:00,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:46:00,290 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:46:00,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:46:00,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:46:00,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:46:00,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:46:00" (1/1) ... [2022-12-13 11:46:00,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@165ec8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:00, skipping insertion in model container [2022-12-13 11:46:00,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:46:00" (1/1) ... [2022-12-13 11:46:00,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:46:00,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:46:00,492 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/mix010.opt.i[944,957] [2022-12-13 11:46:00,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:46:00,684 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:46:00,693 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/mix010.opt.i[944,957] [2022-12-13 11:46:00,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:00,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:00,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:46:00,778 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:46:00,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:00 WrapperNode [2022-12-13 11:46:00,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:46:00,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:46:00,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:46:00,780 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:46:00,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:00" (1/1) ... [2022-12-13 11:46:00,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:00" (1/1) ... [2022-12-13 11:46:00,838 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-12-13 11:46:00,838 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:46:00,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:46:00,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:46:00,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:46:00,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:00" (1/1) ... [2022-12-13 11:46:00,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:00" (1/1) ... [2022-12-13 11:46:00,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:00" (1/1) ... [2022-12-13 11:46:00,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:00" (1/1) ... [2022-12-13 11:46:00,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:00" (1/1) ... [2022-12-13 11:46:00,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:00" (1/1) ... [2022-12-13 11:46:00,869 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:00" (1/1) ... [2022-12-13 11:46:00,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:00" (1/1) ... [2022-12-13 11:46:00,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:46:00,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:46:00,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:46:00,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:46:00,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:00" (1/1) ... [2022-12-13 11:46:00,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:46:00,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:46:00,922 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-13 11:46:00,942 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-13 11:46:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:46:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:46:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:46:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:46:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:46:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:46:00,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:46:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:46:00,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:46:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:46:00,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:46:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:46:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:46:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:46:00,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:46:00,961 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:46:01,090 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:46:01,092 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:46:01,332 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:46:01,415 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:46:01,416 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:46:01,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:46:01 BoogieIcfgContainer [2022-12-13 11:46:01,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:46:01,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:46:01,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:46:01,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:46:01,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:46:00" (1/3) ... [2022-12-13 11:46:01,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115fc8ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:46:01, skipping insertion in model container [2022-12-13 11:46:01,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:00" (2/3) ... [2022-12-13 11:46:01,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115fc8ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:46:01, skipping insertion in model container [2022-12-13 11:46:01,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:46:01" (3/3) ... [2022-12-13 11:46:01,425 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.opt.i [2022-12-13 11:46:01,438 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:46:01,439 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:46:01,439 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:46:01,487 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:46:01,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-12-13 11:46:01,571 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-13 11:46:01,571 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:01,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 11:46:01,579 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-12-13 11:46:01,582 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-12-13 11:46:01,583 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:01,595 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 110 transitions, 229 flow [2022-12-13 11:46:01,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 229 flow [2022-12-13 11:46:01,615 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-13 11:46:01,615 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:01,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 11:46:01,618 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 110 transitions, 229 flow [2022-12-13 11:46:01,618 INFO L226 LiptonReduction]: Number of co-enabled transitions 1962 [2022-12-13 11:46:05,510 INFO L241 LiptonReduction]: Total number of compositions: 90 [2022-12-13 11:46:05,521 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:46:05,525 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;@1e0e8d6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:46:05,526 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 11:46:05,529 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-13 11:46:05,529 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:05,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:05,530 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:05,530 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:05,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:05,533 INFO L85 PathProgramCache]: Analyzing trace with hash -76616971, now seen corresponding path program 1 times [2022-12-13 11:46:05,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:05,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910742269] [2022-12-13 11:46:05,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:05,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:05,788 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-13 11:46:05,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:05,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910742269] [2022-12-13 11:46:05,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910742269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:05,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:05,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:46:05,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407374248] [2022-12-13 11:46:05,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:05,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:46:05,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:05,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:46:05,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:46:05,810 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 58 [2022-12-13 11:46:05,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-13 11:46:05,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:05,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 58 [2022-12-13 11:46:05,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:06,979 INFO L130 PetriNetUnfolder]: 10179/15925 cut-off events. [2022-12-13 11:46:06,980 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 11:46:07,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30440 conditions, 15925 events. 10179/15925 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 117955 event pairs, 1194 based on Foata normal form. 0/9414 useless extension candidates. Maximal degree in co-relation 30429. Up to 12486 conditions per place. [2022-12-13 11:46:07,025 INFO L137 encePairwiseOnDemand]: 52/58 looper letters, 33 selfloop transitions, 2 changer transitions 42/87 dead transitions. [2022-12-13 11:46:07,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 337 flow [2022-12-13 11:46:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:46:07,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:46:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-12-13 11:46:07,039 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2022-12-13 11:46:07,040 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 125 flow. Second operand 3 states and 114 transitions. [2022-12-13 11:46:07,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 337 flow [2022-12-13 11:46:07,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 87 transitions, 334 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:46:07,046 INFO L231 Difference]: Finished difference. Result has 63 places, 33 transitions, 76 flow [2022-12-13 11:46:07,048 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=63, PETRI_TRANSITIONS=33} [2022-12-13 11:46:07,052 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -4 predicate places. [2022-12-13 11:46:07,052 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:07,053 INFO L89 Accepts]: Start accepts. Operand has 63 places, 33 transitions, 76 flow [2022-12-13 11:46:07,055 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:07,056 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:07,056 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 33 transitions, 76 flow [2022-12-13 11:46:07,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 76 flow [2022-12-13 11:46:07,061 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-12-13 11:46:07,061 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:07,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 77 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:46:07,063 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 76 flow [2022-12-13 11:46:07,063 INFO L226 LiptonReduction]: Number of co-enabled transitions 620 [2022-12-13 11:46:07,192 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:07,194 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 11:46:07,194 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 76 flow [2022-12-13 11:46:07,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-13 11:46:07,194 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:07,195 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:07,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:46:07,198 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:07,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:07,198 INFO L85 PathProgramCache]: Analyzing trace with hash -614381923, now seen corresponding path program 1 times [2022-12-13 11:46:07,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:07,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668672564] [2022-12-13 11:46:07,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:07,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:07,408 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-13 11:46:07,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:07,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668672564] [2022-12-13 11:46:07,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668672564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:07,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:07,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:46:07,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123461066] [2022-12-13 11:46:07,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:07,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:46:07,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:07,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:46:07,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:46:07,410 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 11:46:07,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-13 11:46:07,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:07,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 11:46:07,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:07,739 INFO L130 PetriNetUnfolder]: 2924/4455 cut-off events. [2022-12-13 11:46:07,739 INFO L131 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2022-12-13 11:46:07,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8928 conditions, 4455 events. 2924/4455 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 23005 event pairs, 1198 based on Foata normal form. 0/3420 useless extension candidates. Maximal degree in co-relation 8918. Up to 4069 conditions per place. [2022-12-13 11:46:07,759 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 34 selfloop transitions, 4 changer transitions 2/47 dead transitions. [2022-12-13 11:46:07,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 190 flow [2022-12-13 11:46:07,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:46:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:46:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-13 11:46:07,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6262626262626263 [2022-12-13 11:46:07,762 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 76 flow. Second operand 3 states and 62 transitions. [2022-12-13 11:46:07,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 190 flow [2022-12-13 11:46:07,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:46:07,764 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 96 flow [2022-12-13 11:46:07,764 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-12-13 11:46:07,764 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -24 predicate places. [2022-12-13 11:46:07,764 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:07,765 INFO L89 Accepts]: Start accepts. Operand has 43 places, 35 transitions, 96 flow [2022-12-13 11:46:07,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:07,765 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:07,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 96 flow [2022-12-13 11:46:07,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 96 flow [2022-12-13 11:46:07,771 INFO L130 PetriNetUnfolder]: 14/93 cut-off events. [2022-12-13 11:46:07,772 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:07,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 93 events. 14/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 372 event pairs, 6 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 126. Up to 29 conditions per place. [2022-12-13 11:46:07,773 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 96 flow [2022-12-13 11:46:07,773 INFO L226 LiptonReduction]: Number of co-enabled transitions 618 [2022-12-13 11:46:07,792 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:07,793 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 11:46:07,793 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 96 flow [2022-12-13 11:46:07,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-13 11:46:07,794 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:07,794 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:07,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:46:07,794 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:07,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:07,795 INFO L85 PathProgramCache]: Analyzing trace with hash 934594020, now seen corresponding path program 1 times [2022-12-13 11:46:07,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:07,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072338343] [2022-12-13 11:46:07,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:07,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:07,960 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-13 11:46:07,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:07,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072338343] [2022-12-13 11:46:07,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072338343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:07,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:07,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:46:07,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39927535] [2022-12-13 11:46:07,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:07,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:46:07,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:07,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:46:07,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:46:07,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 11:46:07,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 11:46:07,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:07,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 11:46:07,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:08,197 INFO L130 PetriNetUnfolder]: 2065/3219 cut-off events. [2022-12-13 11:46:08,197 INFO L131 PetriNetUnfolder]: For 488/488 co-relation queries the response was YES. [2022-12-13 11:46:08,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6958 conditions, 3219 events. 2065/3219 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16380 event pairs, 870 based on Foata normal form. 93/2731 useless extension candidates. Maximal degree in co-relation 6947. Up to 1986 conditions per place. [2022-12-13 11:46:08,207 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 38 selfloop transitions, 3 changer transitions 1/49 dead transitions. [2022-12-13 11:46:08,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 214 flow [2022-12-13 11:46:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:46:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:46:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-13 11:46:08,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2022-12-13 11:46:08,209 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 96 flow. Second operand 3 states and 61 transitions. [2022-12-13 11:46:08,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 214 flow [2022-12-13 11:46:08,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:46:08,211 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 101 flow [2022-12-13 11:46:08,211 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2022-12-13 11:46:08,212 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -23 predicate places. [2022-12-13 11:46:08,212 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:08,212 INFO L89 Accepts]: Start accepts. Operand has 44 places, 34 transitions, 101 flow [2022-12-13 11:46:08,213 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:08,213 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:08,214 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 34 transitions, 101 flow [2022-12-13 11:46:08,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 101 flow [2022-12-13 11:46:08,219 INFO L130 PetriNetUnfolder]: 9/70 cut-off events. [2022-12-13 11:46:08,219 INFO L131 PetriNetUnfolder]: For 7/13 co-relation queries the response was YES. [2022-12-13 11:46:08,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 70 events. 9/70 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 255 event pairs, 3 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 104. Up to 21 conditions per place. [2022-12-13 11:46:08,220 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 101 flow [2022-12-13 11:46:08,220 INFO L226 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-13 11:46:08,222 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:08,222 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 11:46:08,222 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 101 flow [2022-12-13 11:46:08,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 11:46:08,223 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:08,223 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:08,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:46:08,223 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:08,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:08,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1721088428, now seen corresponding path program 1 times [2022-12-13 11:46:08,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:08,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712424336] [2022-12-13 11:46:08,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:08,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:08,349 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-13 11:46:08,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:08,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712424336] [2022-12-13 11:46:08,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712424336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:08,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:08,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:46:08,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872207819] [2022-12-13 11:46:08,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:08,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:46:08,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:08,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:46:08,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:46:08,353 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 11:46:08,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 11:46:08,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:08,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 11:46:08,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:08,558 INFO L130 PetriNetUnfolder]: 1701/2646 cut-off events. [2022-12-13 11:46:08,558 INFO L131 PetriNetUnfolder]: For 797/797 co-relation queries the response was YES. [2022-12-13 11:46:08,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6022 conditions, 2646 events. 1701/2646 cut-off events. For 797/797 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12422 event pairs, 479 based on Foata normal form. 40/2276 useless extension candidates. Maximal degree in co-relation 6009. Up to 1821 conditions per place. [2022-12-13 11:46:08,570 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 35 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-13 11:46:08,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 206 flow [2022-12-13 11:46:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:46:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:46:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-13 11:46:08,572 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6129032258064516 [2022-12-13 11:46:08,573 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 101 flow. Second operand 3 states and 57 transitions. [2022-12-13 11:46:08,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 206 flow [2022-12-13 11:46:08,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:46:08,575 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 106 flow [2022-12-13 11:46:08,575 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2022-12-13 11:46:08,577 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -23 predicate places. [2022-12-13 11:46:08,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:08,577 INFO L89 Accepts]: Start accepts. Operand has 44 places, 34 transitions, 106 flow [2022-12-13 11:46:08,578 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:08,578 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:08,578 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 34 transitions, 106 flow [2022-12-13 11:46:08,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 34 transitions, 106 flow [2022-12-13 11:46:08,585 INFO L130 PetriNetUnfolder]: 6/60 cut-off events. [2022-12-13 11:46:08,585 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2022-12-13 11:46:08,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 60 events. 6/60 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 213 event pairs, 1 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 93. Up to 16 conditions per place. [2022-12-13 11:46:08,586 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 34 transitions, 106 flow [2022-12-13 11:46:08,586 INFO L226 LiptonReduction]: Number of co-enabled transitions 566 [2022-12-13 11:46:08,594 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:08,600 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 11:46:08,600 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 106 flow [2022-12-13 11:46:08,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 11:46:08,600 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:08,601 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:08,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:46:08,601 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:08,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:08,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1163320857, now seen corresponding path program 1 times [2022-12-13 11:46:08,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:08,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612254769] [2022-12-13 11:46:08,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:08,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:08,725 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-13 11:46:08,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:08,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612254769] [2022-12-13 11:46:08,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612254769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:08,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:08,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:46:08,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856130413] [2022-12-13 11:46:08,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:08,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:46:08,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:08,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:46:08,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:46:08,728 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2022-12-13 11:46:08,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-13 11:46:08,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:08,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2022-12-13 11:46:08,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:08,969 INFO L130 PetriNetUnfolder]: 1828/2868 cut-off events. [2022-12-13 11:46:08,969 INFO L131 PetriNetUnfolder]: For 1020/1020 co-relation queries the response was YES. [2022-12-13 11:46:08,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6757 conditions, 2868 events. 1828/2868 cut-off events. For 1020/1020 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 14537 event pairs, 513 based on Foata normal form. 44/2064 useless extension candidates. Maximal degree in co-relation 6743. Up to 2677 conditions per place. [2022-12-13 11:46:08,985 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 37 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2022-12-13 11:46:08,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 252 flow [2022-12-13 11:46:08,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:46:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:46:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 11:46:08,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6881720430107527 [2022-12-13 11:46:08,986 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 106 flow. Second operand 3 states and 64 transitions. [2022-12-13 11:46:08,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 252 flow [2022-12-13 11:46:08,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:46:08,990 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 168 flow [2022-12-13 11:46:08,990 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2022-12-13 11:46:08,992 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2022-12-13 11:46:08,992 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:08,992 INFO L89 Accepts]: Start accepts. Operand has 45 places, 43 transitions, 168 flow [2022-12-13 11:46:08,993 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:08,993 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:08,993 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 43 transitions, 168 flow [2022-12-13 11:46:08,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 43 transitions, 168 flow [2022-12-13 11:46:09,026 INFO L130 PetriNetUnfolder]: 281/631 cut-off events. [2022-12-13 11:46:09,027 INFO L131 PetriNetUnfolder]: For 132/150 co-relation queries the response was YES. [2022-12-13 11:46:09,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 631 events. 281/631 cut-off events. For 132/150 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 4146 event pairs, 127 based on Foata normal form. 3/349 useless extension candidates. Maximal degree in co-relation 1298. Up to 484 conditions per place. [2022-12-13 11:46:09,030 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 43 transitions, 168 flow [2022-12-13 11:46:09,030 INFO L226 LiptonReduction]: Number of co-enabled transitions 668 [2022-12-13 11:46:09,070 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:09,071 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-13 11:46:09,071 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 168 flow [2022-12-13 11:46:09,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-13 11:46:09,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:09,071 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:09,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:46:09,071 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:09,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:09,072 INFO L85 PathProgramCache]: Analyzing trace with hash -30769470, now seen corresponding path program 1 times [2022-12-13 11:46:09,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:09,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080668904] [2022-12-13 11:46:09,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:09,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:09,231 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-13 11:46:09,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:09,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080668904] [2022-12-13 11:46:09,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080668904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:09,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:09,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:46:09,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221663354] [2022-12-13 11:46:09,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:09,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:46:09,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:09,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:46:09,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:46:09,234 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2022-12-13 11:46:09,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 11:46:09,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:09,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2022-12-13 11:46:09,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:09,405 INFO L130 PetriNetUnfolder]: 952/1704 cut-off events. [2022-12-13 11:46:09,405 INFO L131 PetriNetUnfolder]: For 554/554 co-relation queries the response was YES. [2022-12-13 11:46:09,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5036 conditions, 1704 events. 952/1704 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9231 event pairs, 144 based on Foata normal form. 120/1324 useless extension candidates. Maximal degree in co-relation 5021. Up to 1135 conditions per place. [2022-12-13 11:46:09,411 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 46 selfloop transitions, 19 changer transitions 0/72 dead transitions. [2022-12-13 11:46:09,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 72 transitions, 392 flow [2022-12-13 11:46:09,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:46:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:46:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-13 11:46:09,412 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7096774193548387 [2022-12-13 11:46:09,412 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 168 flow. Second operand 4 states and 88 transitions. [2022-12-13 11:46:09,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 72 transitions, 392 flow [2022-12-13 11:46:09,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 382 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:46:09,414 INFO L231 Difference]: Finished difference. Result has 48 places, 52 transitions, 270 flow [2022-12-13 11:46:09,414 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=270, PETRI_PLACES=48, PETRI_TRANSITIONS=52} [2022-12-13 11:46:09,415 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2022-12-13 11:46:09,415 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:09,415 INFO L89 Accepts]: Start accepts. Operand has 48 places, 52 transitions, 270 flow [2022-12-13 11:46:09,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:09,415 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:09,415 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 52 transitions, 270 flow [2022-12-13 11:46:09,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 52 transitions, 270 flow [2022-12-13 11:46:09,436 INFO L130 PetriNetUnfolder]: 194/469 cut-off events. [2022-12-13 11:46:09,436 INFO L131 PetriNetUnfolder]: For 150/198 co-relation queries the response was YES. [2022-12-13 11:46:09,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 469 events. 194/469 cut-off events. For 150/198 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3001 event pairs, 28 based on Foata normal form. 5/280 useless extension candidates. Maximal degree in co-relation 1388. Up to 346 conditions per place. [2022-12-13 11:46:09,439 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 52 transitions, 270 flow [2022-12-13 11:46:09,439 INFO L226 LiptonReduction]: Number of co-enabled transitions 686 [2022-12-13 11:46:09,441 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:09,442 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 11:46:09,442 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 52 transitions, 270 flow [2022-12-13 11:46:09,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 11:46:09,442 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:09,442 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:09,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:46:09,442 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:09,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:09,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1863571456, now seen corresponding path program 1 times [2022-12-13 11:46:09,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:09,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513661821] [2022-12-13 11:46:09,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:09,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:09,549 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-13 11:46:09,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:09,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513661821] [2022-12-13 11:46:09,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513661821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:09,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:09,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:46:09,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016647871] [2022-12-13 11:46:09,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:09,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:46:09,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:09,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:46:09,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:46:09,551 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 11:46:09,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 52 transitions, 270 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-13 11:46:09,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:09,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 11:46:09,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:09,756 INFO L130 PetriNetUnfolder]: 1340/2510 cut-off events. [2022-12-13 11:46:09,756 INFO L131 PetriNetUnfolder]: For 1980/2168 co-relation queries the response was YES. [2022-12-13 11:46:09,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8689 conditions, 2510 events. 1340/2510 cut-off events. For 1980/2168 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 15889 event pairs, 266 based on Foata normal form. 190/2275 useless extension candidates. Maximal degree in co-relation 8672. Up to 1377 conditions per place. [2022-12-13 11:46:09,765 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 65 selfloop transitions, 3 changer transitions 16/98 dead transitions. [2022-12-13 11:46:09,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 98 transitions, 682 flow [2022-12-13 11:46:09,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:46:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:46:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-13 11:46:09,766 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2022-12-13 11:46:09,766 INFO L175 Difference]: Start difference. First operand has 48 places, 52 transitions, 270 flow. Second operand 4 states and 84 transitions. [2022-12-13 11:46:09,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 98 transitions, 682 flow [2022-12-13 11:46:09,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 98 transitions, 604 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-13 11:46:09,769 INFO L231 Difference]: Finished difference. Result has 51 places, 54 transitions, 257 flow [2022-12-13 11:46:09,769 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=51, PETRI_TRANSITIONS=54} [2022-12-13 11:46:09,770 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -16 predicate places. [2022-12-13 11:46:09,770 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:09,770 INFO L89 Accepts]: Start accepts. Operand has 51 places, 54 transitions, 257 flow [2022-12-13 11:46:09,770 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:09,771 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:09,771 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 54 transitions, 257 flow [2022-12-13 11:46:09,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 54 transitions, 257 flow [2022-12-13 11:46:09,810 INFO L130 PetriNetUnfolder]: 358/852 cut-off events. [2022-12-13 11:46:09,810 INFO L131 PetriNetUnfolder]: For 414/447 co-relation queries the response was YES. [2022-12-13 11:46:09,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2282 conditions, 852 events. 358/852 cut-off events. For 414/447 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 5948 event pairs, 56 based on Foata normal form. 8/478 useless extension candidates. Maximal degree in co-relation 2267. Up to 649 conditions per place. [2022-12-13 11:46:09,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 54 transitions, 257 flow [2022-12-13 11:46:09,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 704 [2022-12-13 11:46:09,816 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] $Ultimate##0-->L767: Formula: (and (= v_~x~0_13 1) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_13} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] and [348] L752-->L755: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-13 11:46:09,839 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:46:09,840 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 11:46:09,840 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 54 transitions, 260 flow [2022-12-13 11:46:09,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-13 11:46:09,840 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:09,840 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:09,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:46:09,840 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:09,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:09,841 INFO L85 PathProgramCache]: Analyzing trace with hash -162734486, now seen corresponding path program 2 times [2022-12-13 11:46:09,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:09,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244019041] [2022-12-13 11:46:09,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:09,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:09,960 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-13 11:46:09,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:09,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244019041] [2022-12-13 11:46:09,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244019041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:09,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:09,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:46:09,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016632812] [2022-12-13 11:46:09,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:09,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:46:09,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:09,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:46:09,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:46:09,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 11:46:09,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-13 11:46:09,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:09,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 11:46:09,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:10,120 INFO L130 PetriNetUnfolder]: 873/1641 cut-off events. [2022-12-13 11:46:10,120 INFO L131 PetriNetUnfolder]: For 938/942 co-relation queries the response was YES. [2022-12-13 11:46:10,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5255 conditions, 1641 events. 873/1641 cut-off events. For 938/942 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9286 event pairs, 79 based on Foata normal form. 171/1234 useless extension candidates. Maximal degree in co-relation 5237. Up to 631 conditions per place. [2022-12-13 11:46:10,126 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 35 selfloop transitions, 28 changer transitions 5/74 dead transitions. [2022-12-13 11:46:10,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 74 transitions, 456 flow [2022-12-13 11:46:10,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:46:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:46:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-13 11:46:10,127 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.59375 [2022-12-13 11:46:10,127 INFO L175 Difference]: Start difference. First operand has 51 places, 54 transitions, 260 flow. Second operand 5 states and 95 transitions. [2022-12-13 11:46:10,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 74 transitions, 456 flow [2022-12-13 11:46:10,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 436 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 11:46:10,130 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 298 flow [2022-12-13 11:46:10,130 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=298, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2022-12-13 11:46:10,130 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -14 predicate places. [2022-12-13 11:46:10,130 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:10,130 INFO L89 Accepts]: Start accepts. Operand has 53 places, 50 transitions, 298 flow [2022-12-13 11:46:10,131 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:10,131 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:10,131 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 50 transitions, 298 flow [2022-12-13 11:46:10,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 50 transitions, 298 flow [2022-12-13 11:46:10,145 INFO L130 PetriNetUnfolder]: 101/298 cut-off events. [2022-12-13 11:46:10,145 INFO L131 PetriNetUnfolder]: For 114/135 co-relation queries the response was YES. [2022-12-13 11:46:10,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 298 events. 101/298 cut-off events. For 114/135 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1730 event pairs, 1 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 978. Up to 199 conditions per place. [2022-12-13 11:46:10,147 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 50 transitions, 298 flow [2022-12-13 11:46:10,147 INFO L226 LiptonReduction]: Number of co-enabled transitions 490 [2022-12-13 11:46:10,517 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:46:10,517 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 387 [2022-12-13 11:46:10,517 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 292 flow [2022-12-13 11:46:10,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-13 11:46:10,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:10,518 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:10,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:46:10,518 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:10,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:10,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1743452130, now seen corresponding path program 1 times [2022-12-13 11:46:10,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:10,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140956035] [2022-12-13 11:46:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:10,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:10,647 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-13 11:46:10,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:10,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140956035] [2022-12-13 11:46:10,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140956035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:10,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:10,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:46:10,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791788391] [2022-12-13 11:46:10,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:10,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:46:10,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:10,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:46:10,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:46:10,649 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 11:46:10,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 11:46:10,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:10,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 11:46:10,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:10,770 INFO L130 PetriNetUnfolder]: 541/1016 cut-off events. [2022-12-13 11:46:10,770 INFO L131 PetriNetUnfolder]: For 1509/1615 co-relation queries the response was YES. [2022-12-13 11:46:10,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3992 conditions, 1016 events. 541/1016 cut-off events. For 1509/1615 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5521 event pairs, 56 based on Foata normal form. 87/860 useless extension candidates. Maximal degree in co-relation 3974. Up to 552 conditions per place. [2022-12-13 11:46:10,773 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 53 selfloop transitions, 10 changer transitions 18/93 dead transitions. [2022-12-13 11:46:10,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 93 transitions, 720 flow [2022-12-13 11:46:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:46:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:46:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-12-13 11:46:10,774 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6148148148148148 [2022-12-13 11:46:10,774 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 292 flow. Second operand 5 states and 83 transitions. [2022-12-13 11:46:10,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 93 transitions, 720 flow [2022-12-13 11:46:10,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 582 flow, removed 32 selfloop flow, removed 4 redundant places. [2022-12-13 11:46:10,782 INFO L231 Difference]: Finished difference. Result has 50 places, 53 transitions, 280 flow [2022-12-13 11:46:10,782 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=50, PETRI_TRANSITIONS=53} [2022-12-13 11:46:10,782 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -17 predicate places. [2022-12-13 11:46:10,782 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:10,782 INFO L89 Accepts]: Start accepts. Operand has 50 places, 53 transitions, 280 flow [2022-12-13 11:46:10,783 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:10,783 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:10,783 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 53 transitions, 280 flow [2022-12-13 11:46:10,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 53 transitions, 280 flow [2022-12-13 11:46:10,806 INFO L130 PetriNetUnfolder]: 223/500 cut-off events. [2022-12-13 11:46:10,806 INFO L131 PetriNetUnfolder]: For 298/334 co-relation queries the response was YES. [2022-12-13 11:46:10,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 500 events. 223/500 cut-off events. For 298/334 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 3078 event pairs, 1 based on Foata normal form. 8/199 useless extension candidates. Maximal degree in co-relation 1363. Up to 244 conditions per place. [2022-12-13 11:46:10,809 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 53 transitions, 280 flow [2022-12-13 11:46:10,809 INFO L226 LiptonReduction]: Number of co-enabled transitions 526 [2022-12-13 11:46:10,811 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:10,811 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 11:46:10,811 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 53 transitions, 280 flow [2022-12-13 11:46:10,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 11:46:10,812 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:10,812 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:10,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:46:10,812 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:10,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1434276592, now seen corresponding path program 2 times [2022-12-13 11:46:10,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:10,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356891160] [2022-12-13 11:46:10,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:10,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:10,938 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-13 11:46:10,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:10,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356891160] [2022-12-13 11:46:10,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356891160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:10,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:10,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:46:10,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205925878] [2022-12-13 11:46:10,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:10,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:46:10,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:10,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:46:10,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:46:10,940 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2022-12-13 11:46:10,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 53 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-13 11:46:10,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:10,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2022-12-13 11:46:10,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:11,063 INFO L130 PetriNetUnfolder]: 692/1297 cut-off events. [2022-12-13 11:46:11,063 INFO L131 PetriNetUnfolder]: For 1732/1839 co-relation queries the response was YES. [2022-12-13 11:46:11,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4498 conditions, 1297 events. 692/1297 cut-off events. For 1732/1839 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 7573 event pairs, 110 based on Foata normal form. 90/1057 useless extension candidates. Maximal degree in co-relation 4479. Up to 502 conditions per place. [2022-12-13 11:46:11,067 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 34 selfloop transitions, 1 changer transitions 43/90 dead transitions. [2022-12-13 11:46:11,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 90 transitions, 616 flow [2022-12-13 11:46:11,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:46:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:46:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-13 11:46:11,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 11:46:11,068 INFO L175 Difference]: Start difference. First operand has 50 places, 53 transitions, 280 flow. Second operand 4 states and 72 transitions. [2022-12-13 11:46:11,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 90 transitions, 616 flow [2022-12-13 11:46:11,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 90 transitions, 616 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 11:46:11,077 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 225 flow [2022-12-13 11:46:11,077 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2022-12-13 11:46:11,078 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -13 predicate places. [2022-12-13 11:46:11,078 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:11,078 INFO L89 Accepts]: Start accepts. Operand has 54 places, 44 transitions, 225 flow [2022-12-13 11:46:11,078 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:11,078 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:11,079 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 44 transitions, 225 flow [2022-12-13 11:46:11,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 44 transitions, 225 flow [2022-12-13 11:46:11,091 INFO L130 PetriNetUnfolder]: 99/238 cut-off events. [2022-12-13 11:46:11,091 INFO L131 PetriNetUnfolder]: For 334/357 co-relation queries the response was YES. [2022-12-13 11:46:11,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 238 events. 99/238 cut-off events. For 334/357 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1297 event pairs, 0 based on Foata normal form. 4/109 useless extension candidates. Maximal degree in co-relation 697. Up to 118 conditions per place. [2022-12-13 11:46:11,092 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 44 transitions, 225 flow [2022-12-13 11:46:11,093 INFO L226 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-13 11:46:11,953 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:46:11,954 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 876 [2022-12-13 11:46:11,954 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 215 flow [2022-12-13 11:46:11,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-13 11:46:11,955 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:11,955 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:11,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:46:11,955 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:11,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:11,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1811124560, now seen corresponding path program 1 times [2022-12-13 11:46:11,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:11,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594294391] [2022-12-13 11:46:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:11,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:12,436 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-13 11:46:12,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:12,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594294391] [2022-12-13 11:46:12,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594294391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:12,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:12,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:46:12,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324081140] [2022-12-13 11:46:12,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:12,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:46:12,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:12,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:46:12,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:46:12,437 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2022-12-13 11:46:12,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-13 11:46:12,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:12,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2022-12-13 11:46:12,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:12,550 INFO L130 PetriNetUnfolder]: 231/461 cut-off events. [2022-12-13 11:46:12,550 INFO L131 PetriNetUnfolder]: For 1018/1038 co-relation queries the response was YES. [2022-12-13 11:46:12,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1634 conditions, 461 events. 231/461 cut-off events. For 1018/1038 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2572 event pairs, 2 based on Foata normal form. 42/366 useless extension candidates. Maximal degree in co-relation 1613. Up to 202 conditions per place. [2022-12-13 11:46:12,552 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 33 selfloop transitions, 4 changer transitions 21/68 dead transitions. [2022-12-13 11:46:12,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 494 flow [2022-12-13 11:46:12,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:46:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:46:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-12-13 11:46:12,553 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2022-12-13 11:46:12,553 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 215 flow. Second operand 6 states and 60 transitions. [2022-12-13 11:46:12,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 494 flow [2022-12-13 11:46:12,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 474 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-13 11:46:12,557 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 211 flow [2022-12-13 11:46:12,557 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2022-12-13 11:46:12,557 INFO L295 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2022-12-13 11:46:12,557 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:12,557 INFO L89 Accepts]: Start accepts. Operand has 48 places, 39 transitions, 211 flow [2022-12-13 11:46:12,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:12,558 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:12,558 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 39 transitions, 211 flow [2022-12-13 11:46:12,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 211 flow [2022-12-13 11:46:12,570 INFO L130 PetriNetUnfolder]: 99/230 cut-off events. [2022-12-13 11:46:12,570 INFO L131 PetriNetUnfolder]: For 319/322 co-relation queries the response was YES. [2022-12-13 11:46:12,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 230 events. 99/230 cut-off events. For 319/322 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1272 event pairs, 0 based on Foata normal form. 1/103 useless extension candidates. Maximal degree in co-relation 707. Up to 118 conditions per place. [2022-12-13 11:46:12,571 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 39 transitions, 211 flow [2022-12-13 11:46:12,571 INFO L226 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-13 11:46:13,879 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] L829-->L839: Formula: (let ((.cse5 (not (= (mod v_~z$r_buff0_thd3~0_221 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_386 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_186 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_356 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_387 256) 0)) .cse5))) (and (= (ite .cse0 v_~z$w_buff0~0_254 (ite .cse1 v_~z$w_buff1~0_228 v_~z~0_325)) v_~z~0_324) (= (ite .cse2 0 v_~z$r_buff0_thd3~0_221) v_~z$r_buff0_thd3~0_220) (= v_~z$w_buff1_used~0_355 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_356)) (= v_~z$w_buff0_used~0_386 (ite .cse0 0 v_~z$w_buff0_used~0_387)) (= v_~z$r_buff1_thd3~0_185 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_355 256) 0))) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_220 256) 0)))) 0 v_~z$r_buff1_thd3~0_186)) (= v_~__unbuffered_cnt~0_411 (+ v_~__unbuffered_cnt~0_412 1))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_387, ~z$w_buff0~0=v_~z$w_buff0~0_254, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_186, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_356, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_221, ~z$w_buff1~0=v_~z$w_buff1~0_228, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_412, ~z~0=v_~z~0_325} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_386, ~z$w_buff0~0=v_~z$w_buff0~0_254, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_185, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_355, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_220, ~z$w_buff1~0=v_~z$w_buff1~0_228, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_411, ~z~0=v_~z~0_324} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0] and [522] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_340 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd0~0_130 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_125 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_341 256) 0)) .cse5)) (.cse1 (and .cse2 (not (= (mod v_~z$w_buff1_used~0_312 256) 0)))) (.cse4 (and .cse5 .cse3))) (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_393 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_136) (= (ite .cse0 v_~z$w_buff0~0_222 (ite .cse1 v_~z$w_buff1~0_198 v_~z~0_281)) v_~z~0_280) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= v_~z$r_buff1_thd0~0_129 (ite (or (and .cse2 (not (= (mod v_~z$w_buff1_used~0_311 256) 0))) (and (not (= (mod v_~z$r_buff0_thd0~0_124 256) 0)) .cse3)) 0 v_~z$r_buff1_thd0~0_130)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|) (= v_~z$w_buff0_used~0_340 (ite .cse0 0 v_~z$w_buff0_used~0_341)) (= (mod v_~main$tmp_guard0~0_136 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= v_~main$tmp_guard1~0_92 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_110 0) (= v_~__unbuffered_p2_EBX~0_110 0) (= v_~__unbuffered_p1_EAX~0_111 1) (= v_~__unbuffered_p1_EBX~0_143 0) (= v_~__unbuffered_p2_EAX~0_123 1))) 1 0) 0) 0 1)) (= v_~z$r_buff0_thd0~0_124 (ite .cse4 0 v_~z$r_buff0_thd0~0_125)) (= (mod v_~main$tmp_guard1~0_92 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| 0)) (= (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_312) v_~z$w_buff1_used~0_311)))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_143, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_110, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_341, ~z$w_buff0~0=v_~z$w_buff0~0_222, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_312, ~z$w_buff1~0=v_~z$w_buff1~0_198, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_125, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_111, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_130, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_123, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_393, ~z~0=v_~z~0_281} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_143, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_110, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_101|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_340, ~z$w_buff0~0=v_~z$w_buff0~0_222, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_311, ~z$w_buff1~0=v_~z$w_buff1~0_198, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_92, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_136, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_125|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_124, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_111, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_123, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_393, ~z~0=v_~z~0_280, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:46:14,208 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L829-->P2EXIT: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd3~0_194 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_229 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_394 256) 0)))) (let ((.cse2 (and .cse5 .cse1)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_395 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~z$w_buff1_used~0_364 256) 0)) .cse0))) (and (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_363 256) 0)) .cse0) (and (not (= (mod v_~z$r_buff0_thd3~0_228 256) 0)) .cse1)) 0 v_~z$r_buff1_thd3~0_194) v_~z$r_buff1_thd3~0_193) (= v_~z$r_buff0_thd3~0_228 (ite .cse2 0 v_~z$r_buff0_thd3~0_229)) (= |v_P2Thread1of1ForFork1_#res#1.base_49| 0) (= |v_P2Thread1of1ForFork1_#res#1.offset_49| 0) (= v_~__unbuffered_cnt~0_419 (+ v_~__unbuffered_cnt~0_420 1)) (= v_~z$w_buff1_used~0_363 (ite (or .cse3 .cse2) 0 v_~z$w_buff1_used~0_364)) (= v_~z$w_buff0_used~0_394 (ite .cse4 0 v_~z$w_buff0_used~0_395)) (= v_~z~0_332 (ite .cse4 v_~z$w_buff0~0_258 (ite .cse3 v_~z$w_buff1~0_232 v_~z~0_333)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_395, ~z$w_buff0~0=v_~z$w_buff0~0_258, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_194, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_364, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_229, ~z$w_buff1~0=v_~z$w_buff1~0_232, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_420, ~z~0=v_~z~0_333} OutVars{P2Thread1of1ForFork1_#res#1.offset=|v_P2Thread1of1ForFork1_#res#1.offset_49|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_394, ~z$w_buff0~0=v_~z$w_buff0~0_258, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_193, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_363, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_228, ~z$w_buff1~0=v_~z$w_buff1~0_232, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_419, ~z~0=v_~z~0_332, P2Thread1of1ForFork1_#res#1.base=|v_P2Thread1of1ForFork1_#res#1.base_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res#1.offset, ~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, P2Thread1of1ForFork1_#res#1.base] and [522] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_340 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd0~0_130 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_125 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_341 256) 0)) .cse5)) (.cse1 (and .cse2 (not (= (mod v_~z$w_buff1_used~0_312 256) 0)))) (.cse4 (and .cse5 .cse3))) (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_393 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_136) (= (ite .cse0 v_~z$w_buff0~0_222 (ite .cse1 v_~z$w_buff1~0_198 v_~z~0_281)) v_~z~0_280) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= v_~z$r_buff1_thd0~0_129 (ite (or (and .cse2 (not (= (mod v_~z$w_buff1_used~0_311 256) 0))) (and (not (= (mod v_~z$r_buff0_thd0~0_124 256) 0)) .cse3)) 0 v_~z$r_buff1_thd0~0_130)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|) (= v_~z$w_buff0_used~0_340 (ite .cse0 0 v_~z$w_buff0_used~0_341)) (= (mod v_~main$tmp_guard0~0_136 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= v_~main$tmp_guard1~0_92 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_110 0) (= v_~__unbuffered_p2_EBX~0_110 0) (= v_~__unbuffered_p1_EAX~0_111 1) (= v_~__unbuffered_p1_EBX~0_143 0) (= v_~__unbuffered_p2_EAX~0_123 1))) 1 0) 0) 0 1)) (= v_~z$r_buff0_thd0~0_124 (ite .cse4 0 v_~z$r_buff0_thd0~0_125)) (= (mod v_~main$tmp_guard1~0_92 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| 0)) (= (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_312) v_~z$w_buff1_used~0_311)))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_143, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_110, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_341, ~z$w_buff0~0=v_~z$w_buff0~0_222, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_312, ~z$w_buff1~0=v_~z$w_buff1~0_198, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_125, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_111, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_130, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_123, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_393, ~z~0=v_~z~0_281} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_143, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_110, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_101|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_340, ~z$w_buff0~0=v_~z$w_buff0~0_222, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_311, ~z$w_buff1~0=v_~z$w_buff1~0_198, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_92, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_136, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_125|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_124, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_111, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_123, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_393, ~z~0=v_~z~0_280, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:46:14,515 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [536] L829-->P2FINAL: Formula: (let ((.cse4 (not (= 0 (mod v_~z$r_buff1_thd3~0_202 256)))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_402 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_237 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and .cse4 (not (= (mod v_~z$w_buff1_used~0_372 256) 0)))) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_403 256) 0)) .cse5))) (and (= v_~__unbuffered_cnt~0_427 (+ v_~__unbuffered_cnt~0_428 1)) (= (ite .cse0 0 v_~z$r_buff0_thd3~0_237) v_~z$r_buff0_thd3~0_236) (= |v_P2Thread1of1ForFork1_#res#1.offset_53| 0) (= (ite .cse1 v_~z$w_buff0~0_262 (ite .cse2 v_~z$w_buff1~0_236 v_~z~0_341)) v_~z~0_340) (= (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd3~0_236 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_371 256) 0)))) 0 v_~z$r_buff1_thd3~0_202) v_~z$r_buff1_thd3~0_201) (= |v_P2Thread1of1ForFork1_#res#1.base_53| 0) (= v_~z$w_buff1_used~0_371 (ite (or .cse0 .cse2) 0 v_~z$w_buff1_used~0_372)) (= v_~z$w_buff0_used~0_402 (ite .cse1 0 v_~z$w_buff0_used~0_403))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_403, ~z$w_buff0~0=v_~z$w_buff0~0_262, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_202, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_372, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_237, ~z$w_buff1~0=v_~z$w_buff1~0_236, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_428, ~z~0=v_~z~0_341} OutVars{P2Thread1of1ForFork1_#res#1.offset=|v_P2Thread1of1ForFork1_#res#1.offset_53|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_402, ~z$w_buff0~0=v_~z$w_buff0~0_262, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_201, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_371, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_236, ~z$w_buff1~0=v_~z$w_buff1~0_236, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_427, ~z~0=v_~z~0_340, P2Thread1of1ForFork1_#res#1.base=|v_P2Thread1of1ForFork1_#res#1.base_53|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res#1.offset, ~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, P2Thread1of1ForFork1_#res#1.base] and [522] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_340 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd0~0_130 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_125 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_341 256) 0)) .cse5)) (.cse1 (and .cse2 (not (= (mod v_~z$w_buff1_used~0_312 256) 0)))) (.cse4 (and .cse5 .cse3))) (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_393 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_136) (= (ite .cse0 v_~z$w_buff0~0_222 (ite .cse1 v_~z$w_buff1~0_198 v_~z~0_281)) v_~z~0_280) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= v_~z$r_buff1_thd0~0_129 (ite (or (and .cse2 (not (= (mod v_~z$w_buff1_used~0_311 256) 0))) (and (not (= (mod v_~z$r_buff0_thd0~0_124 256) 0)) .cse3)) 0 v_~z$r_buff1_thd0~0_130)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|) (= v_~z$w_buff0_used~0_340 (ite .cse0 0 v_~z$w_buff0_used~0_341)) (= (mod v_~main$tmp_guard0~0_136 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= v_~main$tmp_guard1~0_92 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_110 0) (= v_~__unbuffered_p2_EBX~0_110 0) (= v_~__unbuffered_p1_EAX~0_111 1) (= v_~__unbuffered_p1_EBX~0_143 0) (= v_~__unbuffered_p2_EAX~0_123 1))) 1 0) 0) 0 1)) (= v_~z$r_buff0_thd0~0_124 (ite .cse4 0 v_~z$r_buff0_thd0~0_125)) (= (mod v_~main$tmp_guard1~0_92 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| 0)) (= (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_312) v_~z$w_buff1_used~0_311)))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_143, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_110, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_341, ~z$w_buff0~0=v_~z$w_buff0~0_222, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_312, ~z$w_buff1~0=v_~z$w_buff1~0_198, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_125, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_111, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_130, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_123, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_393, ~z~0=v_~z~0_281} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_143, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_110, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_101|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_340, ~z$w_buff0~0=v_~z$w_buff0~0_222, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_311, ~z$w_buff1~0=v_~z$w_buff1~0_198, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_92, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_136, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_125|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_124, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_111, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_123, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_393, ~z~0=v_~z~0_280, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:46:14,821 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:46:14,822 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2265 [2022-12-13 11:46:14,822 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 278 flow [2022-12-13 11:46:14,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-13 11:46:14,822 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:14,822 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:14,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:46:14,822 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:14,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:14,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1110354415, now seen corresponding path program 1 times [2022-12-13 11:46:14,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:14,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960314249] [2022-12-13 11:46:14,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:14,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:46:14,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:46:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:46:14,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:46:14,881 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:46:14,882 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 11:46:14,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 11:46:14,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 11:46:14,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 11:46:14,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 11:46:14,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 11:46:14,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:46:14,883 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:14,899 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:46:14,899 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:46:14,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:46:14 BasicIcfg [2022-12-13 11:46:14,934 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:46:14,935 INFO L158 Benchmark]: Toolchain (without parser) took 14644.77ms. Allocated memory was 198.2MB in the beginning and 823.1MB in the end (delta: 625.0MB). Free memory was 174.1MB in the beginning and 636.0MB in the end (delta: -461.9MB). Peak memory consumption was 164.1MB. Max. memory is 8.0GB. [2022-12-13 11:46:14,935 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 198.2MB. Free memory is still 175.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:46:14,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.21ms. Allocated memory is still 198.2MB. Free memory was 174.1MB in the beginning and 146.2MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 11:46:14,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.30ms. Allocated memory is still 198.2MB. Free memory was 146.2MB in the beginning and 143.7MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 11:46:14,935 INFO L158 Benchmark]: Boogie Preprocessor took 33.34ms. Allocated memory is still 198.2MB. Free memory was 143.7MB in the beginning and 141.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:46:14,936 INFO L158 Benchmark]: RCFGBuilder took 544.88ms. Allocated memory is still 198.2MB. Free memory was 141.6MB in the beginning and 152.7MB in the end (delta: -11.1MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. [2022-12-13 11:46:14,936 INFO L158 Benchmark]: TraceAbstraction took 13514.99ms. Allocated memory was 198.2MB in the beginning and 823.1MB in the end (delta: 625.0MB). Free memory was 151.1MB in the beginning and 636.0MB in the end (delta: -484.9MB). Peak memory consumption was 140.1MB. Max. memory is 8.0GB. [2022-12-13 11:46:14,936 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 198.2MB. Free memory is still 175.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 488.21ms. Allocated memory is still 198.2MB. Free memory was 174.1MB in the beginning and 146.2MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.30ms. Allocated memory is still 198.2MB. Free memory was 146.2MB in the beginning and 143.7MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.34ms. Allocated memory is still 198.2MB. Free memory was 143.7MB in the beginning and 141.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 544.88ms. Allocated memory is still 198.2MB. Free memory was 141.6MB in the beginning and 152.7MB in the end (delta: -11.1MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. * TraceAbstraction took 13514.99ms. Allocated memory was 198.2MB in the beginning and 823.1MB in the end (delta: 625.0MB). Free memory was 151.1MB in the beginning and 636.0MB in the end (delta: -484.9MB). Peak memory consumption was 140.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 118 PlacesBefore, 67 PlacesAfterwards, 110 TransitionsBefore, 58 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 43 ConcurrentYvCompositions, 3 ChoiceCompositions, 90 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3897, independent: 3772, independent conditional: 3772, independent unconditional: 0, dependent: 125, dependent conditional: 125, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3897, independent: 3772, independent conditional: 0, independent unconditional: 3772, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3897, independent: 3772, independent conditional: 0, independent unconditional: 3772, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3897, independent: 3772, independent conditional: 0, independent unconditional: 3772, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1925, independent: 1883, independent conditional: 0, independent unconditional: 1883, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1925, independent: 1872, independent conditional: 0, independent unconditional: 1872, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 142, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3897, independent: 1889, independent conditional: 0, independent unconditional: 1889, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 1925, unknown conditional: 0, unknown unconditional: 1925] , Statistics on independence cache: Total cache size (in pairs): 3912, Positive cache size: 3870, Positive conditional cache size: 0, Positive unconditional cache size: 3870, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, 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, 42 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 620 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 324, independent conditional: 324, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 360, independent: 324, independent conditional: 19, independent unconditional: 305, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 360, independent: 324, independent conditional: 19, independent unconditional: 305, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 360, independent: 324, independent conditional: 19, independent unconditional: 305, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 268, independent: 243, independent conditional: 15, independent unconditional: 228, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 268, independent: 222, independent conditional: 0, independent unconditional: 222, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 122, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 106, dependent conditional: 13, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 360, independent: 81, independent conditional: 4, independent unconditional: 77, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 268, unknown conditional: 17, unknown unconditional: 251] , Statistics on independence cache: Total cache size (in pairs): 268, Positive cache size: 243, Positive conditional cache size: 15, Positive unconditional cache size: 228, 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: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 286, independent: 263, independent conditional: 263, 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: 286, independent: 263, independent conditional: 13, independent unconditional: 250, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 286, independent: 263, independent conditional: 0, independent unconditional: 263, 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: 286, independent: 263, independent conditional: 0, independent unconditional: 263, 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: 27, independent: 25, independent conditional: 0, independent unconditional: 25, 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: 27, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 286, independent: 238, independent conditional: 0, independent unconditional: 238, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 27, unknown conditional: 0, unknown unconditional: 27] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 268, Positive conditional cache size: 15, Positive unconditional cache size: 253, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 229, independent: 206, independent conditional: 206, 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: 229, independent: 206, independent conditional: 14, independent unconditional: 192, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 229, independent: 206, independent conditional: 0, independent unconditional: 206, 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: 229, independent: 206, independent conditional: 0, independent unconditional: 206, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 229, independent: 201, independent conditional: 0, independent unconditional: 201, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 273, Positive conditional cache size: 15, Positive unconditional cache size: 258, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 566 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 205, independent: 181, independent conditional: 181, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 205, independent: 181, independent conditional: 12, independent unconditional: 169, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 205, independent: 181, independent conditional: 0, independent unconditional: 181, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 205, independent: 181, independent conditional: 0, independent unconditional: 181, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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: 205, independent: 173, independent conditional: 0, independent unconditional: 173, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 311, Positive cache size: 281, Positive conditional cache size: 15, Positive unconditional cache size: 266, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 668 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 157, independent: 135, independent conditional: 135, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 157, independent: 135, independent conditional: 28, independent unconditional: 107, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 157, independent: 135, independent conditional: 24, independent unconditional: 111, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 157, independent: 135, independent conditional: 24, independent unconditional: 111, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 157, independent: 128, independent conditional: 24, independent unconditional: 104, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 321, Positive cache size: 288, Positive conditional cache size: 15, Positive unconditional cache size: 273, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 686 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 327, independent: 298, independent conditional: 298, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 327, independent: 298, independent conditional: 129, independent unconditional: 169, dependent: 29, dependent conditional: 2, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 327, independent: 298, independent conditional: 121, independent unconditional: 177, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 327, independent: 298, independent conditional: 121, independent unconditional: 177, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 6, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 327, independent: 288, independent conditional: 115, independent unconditional: 173, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 10, unknown conditional: 6, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 331, Positive cache size: 298, Positive conditional cache size: 21, Positive unconditional cache size: 277, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 591, independent: 533, independent conditional: 533, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 591, independent: 533, independent conditional: 219, independent unconditional: 314, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 591, independent: 533, independent conditional: 194, independent unconditional: 339, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 591, independent: 533, independent conditional: 194, independent unconditional: 339, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 4, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 591, independent: 522, independent conditional: 190, independent unconditional: 332, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 11, unknown conditional: 4, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 354, Positive cache size: 321, Positive conditional cache size: 26, Positive unconditional cache size: 295, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, 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.4s, 51 PlacesBefore, 48 PlacesAfterwards, 50 TransitionsBefore, 47 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 534, independent: 484, independent conditional: 484, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 534, independent: 484, independent conditional: 267, independent unconditional: 217, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 534, independent: 484, independent conditional: 258, independent unconditional: 226, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 534, independent: 484, independent conditional: 258, independent unconditional: 226, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 534, independent: 481, independent conditional: 258, independent unconditional: 223, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 389, Positive cache size: 356, Positive conditional cache size: 27, Positive unconditional cache size: 329, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 526 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 176, independent: 162, independent conditional: 162, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 176, independent: 162, independent conditional: 98, independent unconditional: 64, dependent: 14, dependent conditional: 11, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 176, independent: 162, independent conditional: 70, independent unconditional: 92, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 176, independent: 162, independent conditional: 70, independent unconditional: 92, dependent: 14, dependent conditional: 0, dependent unconditional: 14, 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: 176, independent: 162, independent conditional: 70, independent unconditional: 92, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 389, Positive cache size: 356, Positive conditional cache size: 27, Positive unconditional cache size: 329, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 39, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 51 PlacesBefore, 47 PlacesAfterwards, 44 TransitionsBefore, 40 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 380, independent: 342, independent conditional: 342, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 380, independent: 342, independent conditional: 242, independent unconditional: 100, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 380, independent: 342, independent conditional: 242, independent unconditional: 100, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 380, independent: 342, independent conditional: 242, independent unconditional: 100, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 5, independent unconditional: 3, 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: 10, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 380, independent: 334, independent conditional: 237, independent unconditional: 97, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 10, unknown conditional: 5, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 446, Positive cache size: 411, Positive conditional cache size: 33, Positive unconditional cache size: 378, Negative cache size: 35, Negative conditional cache size: 2, Negative unconditional cache size: 33, 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: 2.3s, 46 PlacesBefore, 45 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, independent: 141, independent conditional: 141, 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: 141, independent: 141, independent conditional: 138, 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: 141, independent: 141, independent conditional: 138, independent unconditional: 3, 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: 141, independent: 141, independent conditional: 138, independent unconditional: 3, 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: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 141, independent: 133, independent conditional: 130, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 601, Positive cache size: 566, Positive conditional cache size: 41, Positive unconditional cache size: 525, Negative cache size: 35, Negative conditional cache size: 2, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t260; [L854] FCALL, FORK 0 pthread_create(&t260, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t260, ((void *)0), P0, ((void *)0))=-3, t260={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t261; [L856] FCALL, FORK 0 pthread_create(&t261, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t261, ((void *)0), P1, ((void *)0))=-2, t260={5:0}, t261={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 pthread_t t262; [L858] FCALL, FORK 0 pthread_create(&t262, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t262, ((void *)0), P2, ((void *)0))=-1, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 a = 1 [L754] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 238 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 784 IncrementalHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 10 mSDtfsCounter, 784 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298occurred in iteration=8, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-13 11:46:14,965 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...