/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix011.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:34:56,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:34:56,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:34:56,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:34:56,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:34:56,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:34:56,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:34:56,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:34:56,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:34:56,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:34:56,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:34:56,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:34:56,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:34:56,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:34:56,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:34:56,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:34:56,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:34:56,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:34:56,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:34:56,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:34:56,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:34:56,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:34:56,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:34:56,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:34:56,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:34:56,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:34:56,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:34:56,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:34:56,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:34:56,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:34:56,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:34:56,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:34:56,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:34:56,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:34:56,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:34:56,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:34:56,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:34:56,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:34:56,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:34:56,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:34:56,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:34:56,764 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-RepeatedSemanticLbe.epf [2022-12-13 00:34:56,808 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:34:56,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:34:56,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:34:56,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:34:56,810 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:34:56,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:34:56,810 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:34:56,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:34:56,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:34:56,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:34:56,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:34:56,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:34:56,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:34:56,812 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:34:56,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:34:56,812 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:34:56,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:34:56,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:34:56,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:34:56,813 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:34:56,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:34:56,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:34:56,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:34:56,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:34:56,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:34:56,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:34:56,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:34:56,814 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:34:56,814 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 00:34:57,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:34:57,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:34:57,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:34:57,115 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:34:57,115 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:34:57,116 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011.opt.i [2022-12-13 00:34:58,004 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:34:58,291 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:34:58,297 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011.opt.i [2022-12-13 00:34:58,317 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d17f3255/93e7fcb3627f4fb39c578de4e317af6d/FLAG6a4b7ceb5 [2022-12-13 00:34:58,327 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d17f3255/93e7fcb3627f4fb39c578de4e317af6d [2022-12-13 00:34:58,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:34:58,329 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:34:58,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:34:58,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:34:58,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:34:58,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:34:58" (1/1) ... [2022-12-13 00:34:58,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca12b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:34:58, skipping insertion in model container [2022-12-13 00:34:58,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:34:58" (1/1) ... [2022-12-13 00:34:58,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:34:58,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:34:58,527 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/mix011.opt.i[944,957] [2022-12-13 00:34:58,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:34:58,743 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:34:58,754 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/mix011.opt.i[944,957] [2022-12-13 00:34:58,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:34:58,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:34:58,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:34:58,845 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:34:58,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:34:58 WrapperNode [2022-12-13 00:34:58,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:34:58,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:34:58,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:34:58,846 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:34:58,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:34:58" (1/1) ... [2022-12-13 00:34:58,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:34:58" (1/1) ... [2022-12-13 00:34:58,905 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2022-12-13 00:34:58,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:34:58,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:34:58,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:34:58,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:34:58,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:34:58" (1/1) ... [2022-12-13 00:34:58,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:34:58" (1/1) ... [2022-12-13 00:34:58,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:34:58" (1/1) ... [2022-12-13 00:34:58,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:34:58" (1/1) ... [2022-12-13 00:34:58,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:34:58" (1/1) ... [2022-12-13 00:34:58,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:34:58" (1/1) ... [2022-12-13 00:34:58,935 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:34:58" (1/1) ... [2022-12-13 00:34:58,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:34:58" (1/1) ... [2022-12-13 00:34:58,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:34:58,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:34:58,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:34:58,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:34:58,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:34:58" (1/1) ... [2022-12-13 00:34:58,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:34:58,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:34:58,973 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 00:34:59,009 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 00:34:59,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:34:59,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:34:59,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:34:59,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:34:59,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:34:59,022 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:34:59,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:34:59,023 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:34:59,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:34:59,023 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:34:59,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:34:59,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:34:59,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:34:59,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:34:59,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:34:59,024 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 00:34:59,120 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:34:59,121 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:34:59,433 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:34:59,633 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:34:59,633 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:34:59,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:34:59 BoogieIcfgContainer [2022-12-13 00:34:59,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:34:59,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:34:59,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:34:59,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:34:59,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:34:58" (1/3) ... [2022-12-13 00:34:59,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccc715c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:34:59, skipping insertion in model container [2022-12-13 00:34:59,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:34:58" (2/3) ... [2022-12-13 00:34:59,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccc715c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:34:59, skipping insertion in model container [2022-12-13 00:34:59,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:34:59" (3/3) ... [2022-12-13 00:34:59,641 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011.opt.i [2022-12-13 00:34:59,654 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:34:59,654 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:34:59,654 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:34:59,693 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:34:59,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-13 00:34:59,776 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-13 00:34:59,777 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:34:59,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 00:34:59,781 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-13 00:34:59,784 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-13 00:34:59,785 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:34:59,801 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-13 00:34:59,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-12-13 00:34:59,839 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-13 00:34:59,840 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:34:59,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 00:34:59,843 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-13 00:34:59,843 INFO L226 LiptonReduction]: Number of co-enabled transitions 1962 [2022-12-13 00:35:04,019 INFO L241 LiptonReduction]: Total number of compositions: 88 [2022-12-13 00:35:04,035 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:35:04,040 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;@3b9da135, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:35:04,040 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:35:04,046 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-13 00:35:04,046 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:35:04,046 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:35:04,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:35:04,053 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 00:35:04,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:35:04,056 INFO L85 PathProgramCache]: Analyzing trace with hash -128517101, now seen corresponding path program 1 times [2022-12-13 00:35:04,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:35:04,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109032259] [2022-12-13 00:35:04,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:04,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:35:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:35:04,437 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 00:35:04,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:35:04,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109032259] [2022-12-13 00:35:04,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109032259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:35:04,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:35:04,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:35:04,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894976149] [2022-12-13 00:35:04,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:35:04,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:35:04,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:35:04,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:35:04,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:35:04,460 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 56 [2022-12-13 00:35:04,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 00:35:04,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:35:04,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 56 [2022-12-13 00:35:04,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:35:05,522 INFO L130 PetriNetUnfolder]: 8639/13567 cut-off events. [2022-12-13 00:35:05,522 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-13 00:35:05,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25926 conditions, 13567 events. 8639/13567 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 100358 event pairs, 1009 based on Foata normal form. 0/7808 useless extension candidates. Maximal degree in co-relation 25915. Up to 10631 conditions per place. [2022-12-13 00:35:05,565 INFO L137 encePairwiseOnDemand]: 52/56 looper letters, 31 selfloop transitions, 2 changer transitions 42/86 dead transitions. [2022-12-13 00:35:05,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 86 transitions, 331 flow [2022-12-13 00:35:05,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:35:05,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:35:05,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-12-13 00:35:05,573 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2022-12-13 00:35:05,574 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 121 flow. Second operand 3 states and 111 transitions. [2022-12-13 00:35:05,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 86 transitions, 331 flow [2022-12-13 00:35:05,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 86 transitions, 328 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:35:05,579 INFO L231 Difference]: Finished difference. Result has 63 places, 33 transitions, 76 flow [2022-12-13 00:35:05,580 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, 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 00:35:05,583 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -3 predicate places. [2022-12-13 00:35:05,583 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:35:05,584 INFO L89 Accepts]: Start accepts. Operand has 63 places, 33 transitions, 76 flow [2022-12-13 00:35:05,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:35:05,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:35:05,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 33 transitions, 76 flow [2022-12-13 00:35:05,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 76 flow [2022-12-13 00:35:05,591 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-12-13 00:35:05,591 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:35:05,591 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 69 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 00:35:05,593 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 76 flow [2022-12-13 00:35:05,593 INFO L226 LiptonReduction]: Number of co-enabled transitions 620 [2022-12-13 00:35:05,774 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:35:05,776 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-13 00:35:05,776 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 76 flow [2022-12-13 00:35:05,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 00:35:05,776 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:35:05,776 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:35:05,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:35:05,777 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 00:35:05,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:35:05,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1049180535, now seen corresponding path program 1 times [2022-12-13 00:35:05,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:35:05,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088568245] [2022-12-13 00:35:05,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:05,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:35:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:35:05,975 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 00:35:05,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:35:05,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088568245] [2022-12-13 00:35:05,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088568245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:35:05,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:35:05,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:35:05,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928259380] [2022-12-13 00:35:05,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:35:05,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:35:05,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:35:05,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:35:05,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:35:05,978 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 00:35:05,978 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 00:35:05,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:35:05,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 00:35:05,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:35:06,479 INFO L130 PetriNetUnfolder]: 4328/6735 cut-off events. [2022-12-13 00:35:06,479 INFO L131 PetriNetUnfolder]: For 237/237 co-relation queries the response was YES. [2022-12-13 00:35:06,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13482 conditions, 6735 events. 4328/6735 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 39855 event pairs, 1318 based on Foata normal form. 0/5168 useless extension candidates. Maximal degree in co-relation 13472. Up to 4419 conditions per place. [2022-12-13 00:35:06,508 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 37 selfloop transitions, 8 changer transitions 2/54 dead transitions. [2022-12-13 00:35:06,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 216 flow [2022-12-13 00:35:06,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:35:06,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:35:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-13 00:35:06,510 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2022-12-13 00:35:06,511 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 76 flow. Second operand 3 states and 69 transitions. [2022-12-13 00:35:06,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 216 flow [2022-12-13 00:35:06,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:35:06,514 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 132 flow [2022-12-13 00:35:06,514 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=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2022-12-13 00:35:06,515 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -22 predicate places. [2022-12-13 00:35:06,515 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:35:06,515 INFO L89 Accepts]: Start accepts. Operand has 44 places, 39 transitions, 132 flow [2022-12-13 00:35:06,515 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:35:06,516 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:35:06,516 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 39 transitions, 132 flow [2022-12-13 00:35:06,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 39 transitions, 132 flow [2022-12-13 00:35:06,536 INFO L130 PetriNetUnfolder]: 92/360 cut-off events. [2022-12-13 00:35:06,537 INFO L131 PetriNetUnfolder]: For 31/39 co-relation queries the response was YES. [2022-12-13 00:35:06,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 360 events. 92/360 cut-off events. For 31/39 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2465 event pairs, 46 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 611. Up to 149 conditions per place. [2022-12-13 00:35:06,540 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 39 transitions, 132 flow [2022-12-13 00:35:06,540 INFO L226 LiptonReduction]: Number of co-enabled transitions 696 [2022-12-13 00:35:06,550 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:35:06,550 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 00:35:06,551 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 132 flow [2022-12-13 00:35:06,551 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 00:35:06,551 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:35:06,551 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:35:06,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:35:06,552 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 00:35:06,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:35:06,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1835144274, now seen corresponding path program 1 times [2022-12-13 00:35:06,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:35:06,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81715529] [2022-12-13 00:35:06,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:06,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:35:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:35:06,687 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 00:35:06,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:35:06,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81715529] [2022-12-13 00:35:06,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81715529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:35:06,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:35:06,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:35:06,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051499966] [2022-12-13 00:35:06,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:35:06,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:35:06,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:35:06,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:35:06,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:35:06,689 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 00:35:06,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:35:06,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:35:06,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 00:35:06,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:35:07,046 INFO L130 PetriNetUnfolder]: 3063/4928 cut-off events. [2022-12-13 00:35:07,046 INFO L131 PetriNetUnfolder]: For 1601/1601 co-relation queries the response was YES. [2022-12-13 00:35:07,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11746 conditions, 4928 events. 3063/4928 cut-off events. For 1601/1601 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 29174 event pairs, 799 based on Foata normal form. 95/4051 useless extension candidates. Maximal degree in co-relation 11734. Up to 2121 conditions per place. [2022-12-13 00:35:07,067 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 51 selfloop transitions, 7 changer transitions 2/67 dead transitions. [2022-12-13 00:35:07,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 328 flow [2022-12-13 00:35:07,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:35:07,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:35:07,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-13 00:35:07,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6484375 [2022-12-13 00:35:07,069 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 132 flow. Second operand 4 states and 83 transitions. [2022-12-13 00:35:07,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 67 transitions, 328 flow [2022-12-13 00:35:07,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 67 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:35:07,075 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 156 flow [2022-12-13 00:35:07,075 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-12-13 00:35:07,075 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -19 predicate places. [2022-12-13 00:35:07,075 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:35:07,076 INFO L89 Accepts]: Start accepts. Operand has 47 places, 40 transitions, 156 flow [2022-12-13 00:35:07,076 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:35:07,076 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:35:07,076 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 40 transitions, 156 flow [2022-12-13 00:35:07,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 156 flow [2022-12-13 00:35:07,088 INFO L130 PetriNetUnfolder]: 48/218 cut-off events. [2022-12-13 00:35:07,088 INFO L131 PetriNetUnfolder]: For 69/78 co-relation queries the response was YES. [2022-12-13 00:35:07,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 218 events. 48/218 cut-off events. For 69/78 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1277 event pairs, 22 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 412. Up to 83 conditions per place. [2022-12-13 00:35:07,090 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 40 transitions, 156 flow [2022-12-13 00:35:07,090 INFO L226 LiptonReduction]: Number of co-enabled transitions 684 [2022-12-13 00:35:07,099 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:35:07,100 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 00:35:07,100 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 156 flow [2022-12-13 00:35:07,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:35:07,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:35:07,100 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:35:07,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:35:07,101 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 00:35:07,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:35:07,101 INFO L85 PathProgramCache]: Analyzing trace with hash -157580957, now seen corresponding path program 1 times [2022-12-13 00:35:07,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:35:07,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989627487] [2022-12-13 00:35:07,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:07,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:35:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:35:07,180 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 00:35:07,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:35:07,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989627487] [2022-12-13 00:35:07,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989627487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:35:07,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:35:07,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:35:07,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723269837] [2022-12-13 00:35:07,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:35:07,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:35:07,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:35:07,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:35:07,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:35:07,182 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 00:35:07,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 156 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 00:35:07,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:35:07,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 00:35:07,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:35:07,524 INFO L130 PetriNetUnfolder]: 2541/4058 cut-off events. [2022-12-13 00:35:07,524 INFO L131 PetriNetUnfolder]: For 2854/2854 co-relation queries the response was YES. [2022-12-13 00:35:07,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10208 conditions, 4058 events. 2541/4058 cut-off events. For 2854/2854 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 22027 event pairs, 654 based on Foata normal form. 40/3388 useless extension candidates. Maximal degree in co-relation 10193. Up to 1972 conditions per place. [2022-12-13 00:35:07,544 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 45 selfloop transitions, 11 changer transitions 0/63 dead transitions. [2022-12-13 00:35:07,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 346 flow [2022-12-13 00:35:07,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:35:07,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:35:07,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-13 00:35:07,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6209677419354839 [2022-12-13 00:35:07,545 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 156 flow. Second operand 4 states and 77 transitions. [2022-12-13 00:35:07,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 346 flow [2022-12-13 00:35:07,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 341 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:35:07,555 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 242 flow [2022-12-13 00:35:07,555 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2022-12-13 00:35:07,556 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -15 predicate places. [2022-12-13 00:35:07,556 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:35:07,556 INFO L89 Accepts]: Start accepts. Operand has 51 places, 45 transitions, 242 flow [2022-12-13 00:35:07,557 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:35:07,557 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:35:07,557 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 45 transitions, 242 flow [2022-12-13 00:35:07,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 45 transitions, 242 flow [2022-12-13 00:35:07,570 INFO L130 PetriNetUnfolder]: 39/191 cut-off events. [2022-12-13 00:35:07,571 INFO L131 PetriNetUnfolder]: For 172/191 co-relation queries the response was YES. [2022-12-13 00:35:07,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 191 events. 39/191 cut-off events. For 172/191 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1042 event pairs, 16 based on Foata normal form. 1/127 useless extension candidates. Maximal degree in co-relation 445. Up to 70 conditions per place. [2022-12-13 00:35:07,572 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 45 transitions, 242 flow [2022-12-13 00:35:07,572 INFO L226 LiptonReduction]: Number of co-enabled transitions 734 [2022-12-13 00:35:07,574 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:35:07,574 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 00:35:07,575 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 242 flow [2022-12-13 00:35:07,575 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 00:35:07,575 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:35:07,575 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:35:07,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:35:07,575 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 00:35:07,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:35:07,575 INFO L85 PathProgramCache]: Analyzing trace with hash -92521605, now seen corresponding path program 1 times [2022-12-13 00:35:07,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:35:07,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674406491] [2022-12-13 00:35:07,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:07,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:35:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:35:07,679 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 00:35:07,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:35:07,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674406491] [2022-12-13 00:35:07,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674406491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:35:07,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:35:07,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:35:07,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888816112] [2022-12-13 00:35:07,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:35:07,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:35:07,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:35:07,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:35:07,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:35:07,681 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 00:35:07,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:35:07,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:35:07,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 00:35:07,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:35:07,979 INFO L130 PetriNetUnfolder]: 2941/4662 cut-off events. [2022-12-13 00:35:07,980 INFO L131 PetriNetUnfolder]: For 4815/4935 co-relation queries the response was YES. [2022-12-13 00:35:07,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11852 conditions, 4662 events. 2941/4662 cut-off events. For 4815/4935 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 28249 event pairs, 887 based on Foata normal form. 66/3140 useless extension candidates. Maximal degree in co-relation 11833. Up to 4405 conditions per place. [2022-12-13 00:35:07,999 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 45 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2022-12-13 00:35:07,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 462 flow [2022-12-13 00:35:07,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:35:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:35:08,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 00:35:08,000 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6989247311827957 [2022-12-13 00:35:08,000 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 242 flow. Second operand 3 states and 65 transitions. [2022-12-13 00:35:08,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 462 flow [2022-12-13 00:35:08,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:35:08,005 INFO L231 Difference]: Finished difference. Result has 53 places, 54 transitions, 306 flow [2022-12-13 00:35:08,005 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=53, PETRI_TRANSITIONS=54} [2022-12-13 00:35:08,006 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -13 predicate places. [2022-12-13 00:35:08,006 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:35:08,006 INFO L89 Accepts]: Start accepts. Operand has 53 places, 54 transitions, 306 flow [2022-12-13 00:35:08,007 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:35:08,007 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:35:08,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 54 transitions, 306 flow [2022-12-13 00:35:08,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 54 transitions, 306 flow [2022-12-13 00:35:08,084 INFO L130 PetriNetUnfolder]: 876/1857 cut-off events. [2022-12-13 00:35:08,084 INFO L131 PetriNetUnfolder]: For 561/580 co-relation queries the response was YES. [2022-12-13 00:35:08,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3998 conditions, 1857 events. 876/1857 cut-off events. For 561/580 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 14799 event pairs, 419 based on Foata normal form. 3/1021 useless extension candidates. Maximal degree in co-relation 3980. Up to 1387 conditions per place. [2022-12-13 00:35:08,097 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 54 transitions, 306 flow [2022-12-13 00:35:08,097 INFO L226 LiptonReduction]: Number of co-enabled transitions 900 [2022-12-13 00:35:08,105 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:35:08,106 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 00:35:08,106 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 54 transitions, 306 flow [2022-12-13 00:35:08,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:35:08,107 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:35:08,107 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:35:08,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:35:08,107 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 00:35:08,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:35:08,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1507096100, now seen corresponding path program 1 times [2022-12-13 00:35:08,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:35:08,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264716049] [2022-12-13 00:35:08,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:08,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:35:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:35:08,199 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 00:35:08,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:35:08,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264716049] [2022-12-13 00:35:08,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264716049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:35:08,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:35:08,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:35:08,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081053] [2022-12-13 00:35:08,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:35:08,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:35:08,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:35:08,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:35:08,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:35:08,200 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 00:35:08,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 54 transitions, 306 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 00:35:08,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:35:08,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 00:35:08,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:35:08,424 INFO L130 PetriNetUnfolder]: 1504/2748 cut-off events. [2022-12-13 00:35:08,424 INFO L131 PetriNetUnfolder]: For 2487/2568 co-relation queries the response was YES. [2022-12-13 00:35:08,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8770 conditions, 2748 events. 1504/2748 cut-off events. For 2487/2568 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 17828 event pairs, 197 based on Foata normal form. 189/2036 useless extension candidates. Maximal degree in co-relation 8749. Up to 2017 conditions per place. [2022-12-13 00:35:08,435 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 56 selfloop transitions, 19 changer transitions 0/90 dead transitions. [2022-12-13 00:35:08,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 90 transitions, 639 flow [2022-12-13 00:35:08,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:35:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:35:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-13 00:35:08,437 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.717741935483871 [2022-12-13 00:35:08,437 INFO L175 Difference]: Start difference. First operand has 53 places, 54 transitions, 306 flow. Second operand 4 states and 89 transitions. [2022-12-13 00:35:08,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 90 transitions, 639 flow [2022-12-13 00:35:08,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 90 transitions, 629 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:35:08,441 INFO L231 Difference]: Finished difference. Result has 56 places, 63 transitions, 408 flow [2022-12-13 00:35:08,441 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=408, PETRI_PLACES=56, PETRI_TRANSITIONS=63} [2022-12-13 00:35:08,443 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2022-12-13 00:35:08,443 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:35:08,443 INFO L89 Accepts]: Start accepts. Operand has 56 places, 63 transitions, 408 flow [2022-12-13 00:35:08,444 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:35:08,444 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:35:08,444 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 63 transitions, 408 flow [2022-12-13 00:35:08,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 63 transitions, 408 flow [2022-12-13 00:35:08,503 INFO L130 PetriNetUnfolder]: 477/1269 cut-off events. [2022-12-13 00:35:08,504 INFO L131 PetriNetUnfolder]: For 555/880 co-relation queries the response was YES. [2022-12-13 00:35:08,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3865 conditions, 1269 events. 477/1269 cut-off events. For 555/880 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 10530 event pairs, 107 based on Foata normal form. 10/751 useless extension candidates. Maximal degree in co-relation 3845. Up to 910 conditions per place. [2022-12-13 00:35:08,512 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 63 transitions, 408 flow [2022-12-13 00:35:08,512 INFO L226 LiptonReduction]: Number of co-enabled transitions 890 [2022-12-13 00:35:08,518 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:35:08,519 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-13 00:35:08,519 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 63 transitions, 408 flow [2022-12-13 00:35:08,519 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 00:35:08,519 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:35:08,519 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 00:35:08,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:35:08,519 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 00:35:08,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:35:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1530530291, now seen corresponding path program 1 times [2022-12-13 00:35:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:35:08,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651530415] [2022-12-13 00:35:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:08,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:35:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:35:08,723 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 00:35:08,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:35:08,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651530415] [2022-12-13 00:35:08,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651530415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:35:08,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:35:08,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:35:08,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633370663] [2022-12-13 00:35:08,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:35:08,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:35:08,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:35:08,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:35:08,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:35:08,725 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 00:35:08,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 63 transitions, 408 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 00:35:08,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:35:08,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 00:35:08,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:35:08,946 INFO L130 PetriNetUnfolder]: 838/1596 cut-off events. [2022-12-13 00:35:08,946 INFO L131 PetriNetUnfolder]: For 1680/1788 co-relation queries the response was YES. [2022-12-13 00:35:08,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6333 conditions, 1596 events. 838/1596 cut-off events. For 1680/1788 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9702 event pairs, 53 based on Foata normal form. 208/1200 useless extension candidates. Maximal degree in co-relation 6310. Up to 883 conditions per place. [2022-12-13 00:35:08,957 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 46 selfloop transitions, 28 changer transitions 1/90 dead transitions. [2022-12-13 00:35:08,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 90 transitions, 705 flow [2022-12-13 00:35:08,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:35:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:35:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 00:35:08,958 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6193548387096774 [2022-12-13 00:35:08,958 INFO L175 Difference]: Start difference. First operand has 56 places, 63 transitions, 408 flow. Second operand 5 states and 96 transitions. [2022-12-13 00:35:08,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 90 transitions, 705 flow [2022-12-13 00:35:08,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 650 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-13 00:35:08,964 INFO L231 Difference]: Finished difference. Result has 57 places, 63 transitions, 434 flow [2022-12-13 00:35:08,964 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=434, PETRI_PLACES=57, PETRI_TRANSITIONS=63} [2022-12-13 00:35:08,965 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -9 predicate places. [2022-12-13 00:35:08,965 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:35:08,965 INFO L89 Accepts]: Start accepts. Operand has 57 places, 63 transitions, 434 flow [2022-12-13 00:35:08,966 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:35:08,966 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:35:08,966 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 63 transitions, 434 flow [2022-12-13 00:35:08,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 63 transitions, 434 flow [2022-12-13 00:35:09,006 INFO L130 PetriNetUnfolder]: 270/720 cut-off events. [2022-12-13 00:35:09,007 INFO L131 PetriNetUnfolder]: For 390/619 co-relation queries the response was YES. [2022-12-13 00:35:09,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2494 conditions, 720 events. 270/720 cut-off events. For 390/619 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5032 event pairs, 8 based on Foata normal form. 1/346 useless extension candidates. Maximal degree in co-relation 2475. Up to 487 conditions per place. [2022-12-13 00:35:09,013 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 63 transitions, 434 flow [2022-12-13 00:35:09,013 INFO L226 LiptonReduction]: Number of co-enabled transitions 780 [2022-12-13 00:35:09,514 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:35:09,515 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 550 [2022-12-13 00:35:09,515 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 61 transitions, 430 flow [2022-12-13 00:35:09,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 00:35:09,516 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:35:09,516 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:35:09,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:35:09,516 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 00:35:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:35:09,516 INFO L85 PathProgramCache]: Analyzing trace with hash 230834823, now seen corresponding path program 1 times [2022-12-13 00:35:09,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:35:09,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202999189] [2022-12-13 00:35:09,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:09,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:35:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:35:09,713 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 00:35:09,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:35:09,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202999189] [2022-12-13 00:35:09,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202999189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:35:09,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:35:09,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:35:09,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175023013] [2022-12-13 00:35:09,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:35:09,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:35:09,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:35:09,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:35:09,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:35:09,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2022-12-13 00:35:09,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 61 transitions, 430 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 00:35:09,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:35:09,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2022-12-13 00:35:09,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:35:09,901 INFO L130 PetriNetUnfolder]: 1037/1932 cut-off events. [2022-12-13 00:35:09,901 INFO L131 PetriNetUnfolder]: For 4144/4357 co-relation queries the response was YES. [2022-12-13 00:35:09,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8074 conditions, 1932 events. 1037/1932 cut-off events. For 4144/4357 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 12342 event pairs, 103 based on Foata normal form. 119/1585 useless extension candidates. Maximal degree in co-relation 8052. Up to 994 conditions per place. [2022-12-13 00:35:09,912 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 39 selfloop transitions, 1 changer transitions 47/104 dead transitions. [2022-12-13 00:35:09,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 104 transitions, 878 flow [2022-12-13 00:35:09,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:35:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:35:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-13 00:35:09,913 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2022-12-13 00:35:09,913 INFO L175 Difference]: Start difference. First operand has 55 places, 61 transitions, 430 flow. Second operand 4 states and 80 transitions. [2022-12-13 00:35:09,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 104 transitions, 878 flow [2022-12-13 00:35:09,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 104 transitions, 744 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-13 00:35:09,939 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 291 flow [2022-12-13 00:35:09,939 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=291, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2022-12-13 00:35:09,941 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -9 predicate places. [2022-12-13 00:35:09,941 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:35:09,941 INFO L89 Accepts]: Start accepts. Operand has 57 places, 53 transitions, 291 flow [2022-12-13 00:35:09,942 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:35:09,942 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:35:09,942 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 53 transitions, 291 flow [2022-12-13 00:35:09,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 53 transitions, 291 flow [2022-12-13 00:35:09,962 INFO L130 PetriNetUnfolder]: 208/472 cut-off events. [2022-12-13 00:35:09,963 INFO L131 PetriNetUnfolder]: For 467/497 co-relation queries the response was YES. [2022-12-13 00:35:09,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 472 events. 208/472 cut-off events. For 467/497 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 2842 event pairs, 4 based on Foata normal form. 7/203 useless extension candidates. Maximal degree in co-relation 1328. Up to 208 conditions per place. [2022-12-13 00:35:09,966 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 53 transitions, 291 flow [2022-12-13 00:35:09,966 INFO L226 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-13 00:35:10,001 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:35:10,003 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-13 00:35:10,003 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 292 flow [2022-12-13 00:35:10,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 00:35:10,003 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:35:10,003 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 00:35:10,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:35:10,004 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 00:35:10,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:35:10,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2001043127, now seen corresponding path program 1 times [2022-12-13 00:35:10,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:35:10,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519725222] [2022-12-13 00:35:10,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:10,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:35:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:35:10,138 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 00:35:10,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:35:10,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519725222] [2022-12-13 00:35:10,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519725222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:35:10,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:35:10,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:35:10,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571001811] [2022-12-13 00:35:10,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:35:10,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:35:10,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:35:10,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:35:10,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:35:10,140 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 00:35:10,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:35:10,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:35:10,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 00:35:10,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:35:10,238 INFO L130 PetriNetUnfolder]: 556/1060 cut-off events. [2022-12-13 00:35:10,238 INFO L131 PetriNetUnfolder]: For 2301/2355 co-relation queries the response was YES. [2022-12-13 00:35:10,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3867 conditions, 1060 events. 556/1060 cut-off events. For 2301/2355 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6198 event pairs, 75 based on Foata normal form. 66/847 useless extension candidates. Maximal degree in co-relation 3844. Up to 465 conditions per place. [2022-12-13 00:35:10,242 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 38 selfloop transitions, 4 changer transitions 22/75 dead transitions. [2022-12-13 00:35:10,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 526 flow [2022-12-13 00:35:10,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:35:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:35:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-13 00:35:10,243 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2022-12-13 00:35:10,244 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 292 flow. Second operand 4 states and 66 transitions. [2022-12-13 00:35:10,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 526 flow [2022-12-13 00:35:10,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 510 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 00:35:10,252 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 238 flow [2022-12-13 00:35:10,252 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2022-12-13 00:35:10,252 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -11 predicate places. [2022-12-13 00:35:10,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:35:10,252 INFO L89 Accepts]: Start accepts. Operand has 55 places, 44 transitions, 238 flow [2022-12-13 00:35:10,255 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:35:10,255 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:35:10,255 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 44 transitions, 238 flow [2022-12-13 00:35:10,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 238 flow [2022-12-13 00:35:10,268 INFO L130 PetriNetUnfolder]: 90/215 cut-off events. [2022-12-13 00:35:10,268 INFO L131 PetriNetUnfolder]: For 373/391 co-relation queries the response was YES. [2022-12-13 00:35:10,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 215 events. 90/215 cut-off events. For 373/391 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1156 event pairs, 0 based on Foata normal form. 4/100 useless extension candidates. Maximal degree in co-relation 638. Up to 109 conditions per place. [2022-12-13 00:35:10,269 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 44 transitions, 238 flow [2022-12-13 00:35:10,269 INFO L226 LiptonReduction]: Number of co-enabled transitions 220 [2022-12-13 00:35:11,450 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:35:11,451 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1199 [2022-12-13 00:35:11,451 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 224 flow [2022-12-13 00:35:11,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:35:11,451 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:35:11,451 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:35:11,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:35:11,451 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 00:35:11,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:35:11,452 INFO L85 PathProgramCache]: Analyzing trace with hash 444485949, now seen corresponding path program 1 times [2022-12-13 00:35:11,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:35:11,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482799764] [2022-12-13 00:35:11,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:35:11,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:35:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:35:11,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:35:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:35:11,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:35:11,532 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:35:11,533 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:35:11,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:35:11,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:35:11,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:35:11,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:35:11,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:35:11,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:35:11,534 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:35:11,538 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:35:11,538 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:35:11,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:35:11 BasicIcfg [2022-12-13 00:35:11,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:35:11,575 INFO L158 Benchmark]: Toolchain (without parser) took 13245.84ms. Allocated memory was 173.0MB in the beginning and 705.7MB in the end (delta: 532.7MB). Free memory was 147.3MB in the beginning and 250.1MB in the end (delta: -102.8MB). Peak memory consumption was 430.4MB. Max. memory is 8.0GB. [2022-12-13 00:35:11,575 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 173.0MB. Free memory is still 149.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:35:11,575 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.93ms. Allocated memory is still 173.0MB. Free memory was 147.1MB in the beginning and 119.5MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 00:35:11,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.04ms. Allocated memory is still 173.0MB. Free memory was 119.5MB in the beginning and 116.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:35:11,576 INFO L158 Benchmark]: Boogie Preprocessor took 32.20ms. Allocated memory is still 173.0MB. Free memory was 116.9MB in the beginning and 114.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:35:11,576 INFO L158 Benchmark]: RCFGBuilder took 696.33ms. Allocated memory was 173.0MB in the beginning and 249.6MB in the end (delta: 76.5MB). Free memory was 114.8MB in the beginning and 215.8MB in the end (delta: -101.0MB). Peak memory consumption was 31.6MB. Max. memory is 8.0GB. [2022-12-13 00:35:11,576 INFO L158 Benchmark]: TraceAbstraction took 11938.31ms. Allocated memory was 249.6MB in the beginning and 705.7MB in the end (delta: 456.1MB). Free memory was 214.7MB in the beginning and 250.1MB in the end (delta: -35.4MB). Peak memory consumption was 421.8MB. Max. memory is 8.0GB. [2022-12-13 00:35:11,577 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 173.0MB. Free memory is still 149.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 513.93ms. Allocated memory is still 173.0MB. Free memory was 147.1MB in the beginning and 119.5MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.04ms. Allocated memory is still 173.0MB. Free memory was 119.5MB in the beginning and 116.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.20ms. Allocated memory is still 173.0MB. Free memory was 116.9MB in the beginning and 114.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 696.33ms. Allocated memory was 173.0MB in the beginning and 249.6MB in the end (delta: 76.5MB). Free memory was 114.8MB in the beginning and 215.8MB in the end (delta: -101.0MB). Peak memory consumption was 31.6MB. Max. memory is 8.0GB. * TraceAbstraction took 11938.31ms. Allocated memory was 249.6MB in the beginning and 705.7MB in the end (delta: 456.1MB). Free memory was 214.7MB in the beginning and 250.1MB in the end (delta: -35.4MB). Peak memory consumption was 421.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 117 PlacesBefore, 66 PlacesAfterwards, 109 TransitionsBefore, 56 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 43 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3905, independent: 3712, independent conditional: 3712, independent unconditional: 0, dependent: 193, dependent conditional: 193, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3905, independent: 3712, independent conditional: 0, independent unconditional: 3712, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3905, independent: 3712, independent conditional: 0, independent unconditional: 3712, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3905, independent: 3712, independent conditional: 0, independent unconditional: 3712, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2004, independent: 1927, independent conditional: 0, independent unconditional: 1927, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2004, independent: 1856, independent conditional: 0, independent unconditional: 1856, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 148, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 292, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3905, independent: 1785, independent conditional: 0, independent unconditional: 1785, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 2004, unknown conditional: 0, unknown unconditional: 2004] , Statistics on independence cache: Total cache size (in pairs): 3372, Positive cache size: 3295, Positive conditional cache size: 0, Positive unconditional cache size: 3295, Negative cache size: 77, Negative conditional cache size: 0, Negative unconditional cache size: 77, 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.2s, 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: 365, independent: 329, independent conditional: 329, 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: 365, independent: 329, independent conditional: 19, independent unconditional: 310, 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: 365, independent: 329, independent conditional: 19, independent unconditional: 310, 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: 365, independent: 329, independent conditional: 19, independent unconditional: 310, 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: 274, independent: 248, independent conditional: 15, independent unconditional: 233, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 274, independent: 226, independent conditional: 0, independent unconditional: 226, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 176, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 130, dependent conditional: 13, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 365, independent: 81, independent conditional: 4, independent unconditional: 77, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 274, unknown conditional: 17, unknown unconditional: 257] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 248, Positive conditional cache size: 15, Positive unconditional cache size: 233, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, 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, 43 PlacesBefore, 43 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 696 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, independent: 193, independent conditional: 193, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 206, independent: 193, independent conditional: 39, independent unconditional: 154, dependent: 13, dependent conditional: 7, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 206, independent: 193, independent conditional: 0, independent unconditional: 193, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 206, independent: 193, independent conditional: 0, independent unconditional: 193, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 206, independent: 174, independent conditional: 0, independent unconditional: 174, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 267, Positive conditional cache size: 15, Positive unconditional cache size: 252, 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: 46, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 684 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 227, independent conditional: 227, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 244, independent: 227, independent conditional: 16, independent unconditional: 211, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 227, independent conditional: 0, independent unconditional: 227, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 227, independent conditional: 0, independent unconditional: 227, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 244, independent: 218, independent conditional: 0, independent unconditional: 218, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 276, Positive conditional cache size: 15, Positive unconditional cache size: 261, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, 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, 51 PlacesBefore, 51 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 734 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183, independent: 164, independent conditional: 164, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 183, independent: 164, independent conditional: 18, independent unconditional: 146, dependent: 19, dependent conditional: 8, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 188, independent: 164, independent conditional: 0, independent unconditional: 164, 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: 188, independent: 164, independent conditional: 0, independent unconditional: 164, 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: 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: 188, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 276, Positive conditional cache size: 15, Positive unconditional cache size: 261, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 900 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 227, independent conditional: 227, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 244, independent: 227, independent conditional: 48, independent unconditional: 179, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 227, independent conditional: 48, independent unconditional: 179, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 227, independent conditional: 48, independent unconditional: 179, dependent: 17, dependent conditional: 0, dependent unconditional: 17, 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: 244, independent: 227, independent conditional: 48, independent unconditional: 179, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 276, Positive conditional cache size: 15, Positive unconditional cache size: 261, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, 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, 56 PlacesBefore, 56 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 890 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 216, independent: 196, independent conditional: 196, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 216, independent: 196, independent conditional: 57, independent unconditional: 139, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 216, independent: 196, independent conditional: 57, independent unconditional: 139, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 216, independent: 196, independent conditional: 57, independent unconditional: 139, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 216, independent: 196, independent conditional: 57, independent unconditional: 139, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 276, Positive conditional cache size: 15, Positive unconditional cache size: 261, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, 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.5s, 57 PlacesBefore, 55 PlacesAfterwards, 63 TransitionsBefore, 61 TransitionsAfterwards, 780 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 650, independent: 612, independent conditional: 612, 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: 650, independent: 612, independent conditional: 298, independent unconditional: 314, dependent: 38, dependent conditional: 22, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 672, independent: 612, independent conditional: 254, independent unconditional: 358, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 672, independent: 612, independent conditional: 254, independent unconditional: 358, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 672, independent: 603, independent conditional: 245, independent unconditional: 358, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 324, Positive cache size: 295, Positive conditional cache size: 24, Positive unconditional cache size: 271, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 88, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 55 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 243, independent: 221, independent conditional: 221, 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: 243, independent: 221, independent conditional: 108, independent unconditional: 113, dependent: 22, dependent conditional: 9, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 252, independent: 221, independent conditional: 90, independent unconditional: 131, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 252, independent: 221, independent conditional: 90, independent unconditional: 131, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 252, independent: 218, independent conditional: 87, independent unconditional: 131, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 375, Positive cache size: 346, Positive conditional cache size: 29, Positive unconditional cache size: 317, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 52 PlacesBefore, 48 PlacesAfterwards, 44 TransitionsBefore, 40 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 194, independent: 156, independent conditional: 156, 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: 194, independent: 156, independent conditional: 103, independent unconditional: 53, dependent: 38, dependent conditional: 19, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 213, independent: 156, independent conditional: 90, independent unconditional: 66, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 213, independent: 156, independent conditional: 90, independent unconditional: 66, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 6, independent unconditional: 3, 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: 12, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 37, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 213, independent: 147, independent conditional: 84, independent unconditional: 63, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 12, unknown conditional: 6, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 429, Positive cache size: 397, Positive conditional cache size: 35, Positive unconditional cache size: 362, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 51, Maximal queried relation: 1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L727] 0 int z = 0; [L728] 0 _Bool z$flush_delayed; [L729] 0 int z$mem_tmp; [L730] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd1; [L732] 0 _Bool z$r_buff0_thd2; [L733] 0 _Bool z$r_buff0_thd3; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$read_delayed; [L739] 0 int *z$read_delayed_var; [L740] 0 int z$w_buff0; [L741] 0 _Bool z$w_buff0_used; [L742] 0 int z$w_buff1; [L743] 0 _Bool z$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L851] 0 pthread_t t284; [L852] FCALL, FORK 0 pthread_create(&t284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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(&t284, ((void *)0), P0, ((void *)0))=-2, t284={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] [L853] 0 pthread_t t285; [L854] FCALL, FORK 0 pthread_create(&t285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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(&t285, ((void *)0), P1, ((void *)0))=-1, t284={5:0}, t285={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] [L855] 0 pthread_t t286; [L856] FCALL, FORK 0 pthread_create(&t286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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(&t286, ((void *)0), P2, ((void *)0))=0, t284={5:0}, t285={6:0}, t286={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] [L798] 3 z$w_buff1 = z$w_buff0 [L799] 3 z$w_buff0 = 1 [L800] 3 z$w_buff1_used = z$w_buff0_used [L801] 3 z$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 3 z$r_buff0_thd3 = (_Bool)1 [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 z$flush_delayed = weak$$choice2 [L813] 3 z$mem_tmp = z [L814] 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) [L815] 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)) [L816] 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)) [L817] 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)) [L818] 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)) [L819] 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)) [L820] 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)) [L821] 3 __unbuffered_p2_EAX = z [L822] 3 z = z$flush_delayed ? z$mem_tmp : z [L823] 3 z$flush_delayed = (_Bool)0 [L826] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=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=3, weak$$choice2=1, 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] [L749] 1 a = 1 [L752] 1 x = 1 VAL [__unbuffered_cnt=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=3, weak$$choice2=1, x=1, 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] [L764] 2 x = 2 [L767] 2 y = 1 [L770] 2 __unbuffered_p1_EAX = y [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 z$flush_delayed = weak$$choice2 [L776] 2 z$mem_tmp = z [L777] 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) [L778] 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)) [L779] 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)) [L780] 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)) [L781] 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)) [L782] 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)) [L783] 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)) [L784] 2 __unbuffered_p1_EBX = z [L785] 2 z = z$flush_delayed ? z$mem_tmp : z [L786] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=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=2, weak$$choice2=255, x=2, 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] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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=2, weak$$choice2=255, x=2, 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] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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=2, weak$$choice2=255, x=2, 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] [L829] 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) [L830] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L831] 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 [L832] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 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 VAL [__unbuffered_cnt=2, __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=2, weak$$choice2=255, x=2, 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] [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __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=2, weak$$choice2=255, x=2, 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] [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] 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) [L863] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L864] 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 [L865] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L866] 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 [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L871] 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_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=2, weak$$choice2=255, x=2, 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: 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. - UnprovableResult [Line: 852]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 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: 11.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 620 IncrementalHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 16 mSDtfsCounter, 620 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=434occurred in iteration=7, InterpolantAutomatonStates: 34, 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.2s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 00:35:11,601 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...