/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:02:11,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:02:11,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:02:11,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:02:11,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:02:11,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:02:11,629 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:02:11,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:02:11,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:02:11,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:02:11,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:02:11,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:02:11,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:02:11,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:02:11,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:02:11,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:02:11,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:02:11,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:02:11,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:02:11,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:02:11,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:02:11,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:02:11,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:02:11,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:02:11,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:02:11,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:02:11,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:02:11,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:02:11,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:02:11,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:02:11,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:02:11,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:02:11,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:02:11,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:02:11,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:02:11,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:02:11,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:02:11,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:02:11,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:02:11,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:02:11,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:02:11,656 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 12:02:11,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:02:11,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:02:11,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:02:11,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:02:11,687 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:02:11,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:02:11,687 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:02:11,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:02:11,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:02:11,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:02:11,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:02:11,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:02:11,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:02:11,689 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:02:11,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:02:11,689 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:02:11,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:02:11,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:02:11,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:02:11,689 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:02:11,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:02:11,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:02:11,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:02:11,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:02:11,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:02:11,690 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:02:11,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:02:11,690 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:02:11,690 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 12:02:11,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:02:12,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:02:12,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:02:12,009 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:02:12,009 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:02:12,010 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2022-12-13 12:02:13,027 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:02:13,268 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:02:13,269 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2022-12-13 12:02:13,304 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e325abbf/21a86934bb874e3289fe31b21a8944d9/FLAG2dbcc6eb3 [2022-12-13 12:02:13,317 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e325abbf/21a86934bb874e3289fe31b21a8944d9 [2022-12-13 12:02:13,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:02:13,321 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:02:13,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:02:13,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:02:13,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:02:13,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:02:13" (1/1) ... [2022-12-13 12:02:13,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db34fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:13, skipping insertion in model container [2022-12-13 12:02:13,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:02:13" (1/1) ... [2022-12-13 12:02:13,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:02:13,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:02:13,529 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/safe016_rmo.oepc.i[993,1006] [2022-12-13 12:02:13,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:02:13,730 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:02:13,741 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/safe016_rmo.oepc.i[993,1006] [2022-12-13 12:02:13,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:13,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:13,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:02:13,805 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:02:13,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:13 WrapperNode [2022-12-13 12:02:13,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:02:13,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:02:13,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:02:13,807 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:02:13,812 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:02:13" (1/1) ... [2022-12-13 12:02:13,841 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:02:13" (1/1) ... [2022-12-13 12:02:13,861 INFO L138 Inliner]: procedures = 177, calls = 85, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 185 [2022-12-13 12:02:13,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:02:13,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:02:13,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:02:13,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:02:13,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:13" (1/1) ... [2022-12-13 12:02:13,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:13" (1/1) ... [2022-12-13 12:02:13,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:13" (1/1) ... [2022-12-13 12:02:13,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:13" (1/1) ... [2022-12-13 12:02:13,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:13" (1/1) ... [2022-12-13 12:02:13,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:13" (1/1) ... [2022-12-13 12:02:13,894 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:13" (1/1) ... [2022-12-13 12:02:13,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:13" (1/1) ... [2022-12-13 12:02:13,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:02:13,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:02:13,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:02:13,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:02:13,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:13" (1/1) ... [2022-12-13 12:02:13,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:02:13,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:02:13,936 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 12:02:13,954 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 12:02:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:02:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:02:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:02:13,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:02:13,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:02:13,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:02:13,968 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:02:13,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:02:13,968 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:02:13,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:02:13,969 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:02:13,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:02:13,969 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 12:02:13,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 12:02:13,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:02:13,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:02:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:02:13,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:02:13,971 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 12:02:14,140 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:02:14,142 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:02:14,426 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:02:14,637 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:02:14,638 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:02:14,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:02:14 BoogieIcfgContainer [2022-12-13 12:02:14,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:02:14,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:02:14,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:02:14,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:02:14,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:02:13" (1/3) ... [2022-12-13 12:02:14,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a48417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:02:14, skipping insertion in model container [2022-12-13 12:02:14,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:13" (2/3) ... [2022-12-13 12:02:14,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a48417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:02:14, skipping insertion in model container [2022-12-13 12:02:14,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:02:14" (3/3) ... [2022-12-13 12:02:14,647 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_rmo.oepc.i [2022-12-13 12:02:14,660 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:02:14,661 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:02:14,661 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:02:14,715 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:02:14,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2022-12-13 12:02:14,788 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2022-12-13 12:02:14,788 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:02:14,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-13 12:02:14,793 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2022-12-13 12:02:14,796 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 124 transitions, 260 flow [2022-12-13 12:02:14,797 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:14,809 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 124 transitions, 260 flow [2022-12-13 12:02:14,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 124 transitions, 260 flow [2022-12-13 12:02:14,831 INFO L130 PetriNetUnfolder]: 1/124 cut-off events. [2022-12-13 12:02:14,832 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:02:14,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 1/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 12:02:14,834 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 124 transitions, 260 flow [2022-12-13 12:02:14,835 INFO L226 LiptonReduction]: Number of co-enabled transitions 1736 [2022-12-13 12:02:24,750 INFO L241 LiptonReduction]: Total number of compositions: 102 [2022-12-13 12:02:24,762 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:02:24,767 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;@119058e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:02:24,767 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 12:02:24,773 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-13 12:02:24,773 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:02:24,773 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:24,774 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:24,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:24,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:24,782 INFO L85 PathProgramCache]: Analyzing trace with hash 516841788, now seen corresponding path program 1 times [2022-12-13 12:02:24,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:24,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450855886] [2022-12-13 12:02:24,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:24,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:24,983 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 12:02:24,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:24,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450855886] [2022-12-13 12:02:24,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450855886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:24,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:24,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:02:24,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691542183] [2022-12-13 12:02:24,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:24,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:02:24,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:25,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:02:25,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:02:25,021 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2022-12-13 12:02:25,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:25,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:25,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2022-12-13 12:02:25,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:25,903 INFO L130 PetriNetUnfolder]: 4983/7049 cut-off events. [2022-12-13 12:02:25,903 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-13 12:02:25,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14041 conditions, 7049 events. 4983/7049 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 37574 event pairs, 4983 based on Foata normal form. 0/5462 useless extension candidates. Maximal degree in co-relation 14029. Up to 6785 conditions per place. [2022-12-13 12:02:25,954 INFO L137 encePairwiseOnDemand]: 35/36 looper letters, 25 selfloop transitions, 0 changer transitions 0/35 dead transitions. [2022-12-13 12:02:25,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 35 transitions, 132 flow [2022-12-13 12:02:25,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:02:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:02:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2022-12-13 12:02:25,964 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-13 12:02:25,965 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 2 states and 46 transitions. [2022-12-13 12:02:25,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 35 transitions, 132 flow [2022-12-13 12:02:25,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 12:02:25,972 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2022-12-13 12:02:25,974 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-12-13 12:02:25,977 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2022-12-13 12:02:25,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:25,978 INFO L89 Accepts]: Start accepts. Operand has 45 places, 35 transitions, 78 flow [2022-12-13 12:02:25,980 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:25,980 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:25,980 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 78 flow [2022-12-13 12:02:25,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 78 flow [2022-12-13 12:02:25,995 INFO L130 PetriNetUnfolder]: 0/35 cut-off events. [2022-12-13 12:02:25,995 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:02:25,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 87 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 12:02:25,998 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 78 flow [2022-12-13 12:02:25,998 INFO L226 LiptonReduction]: Number of co-enabled transitions 714 [2022-12-13 12:02:26,267 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:26,268 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 291 [2022-12-13 12:02:26,268 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 78 flow [2022-12-13 12:02:26,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:26,269 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:26,269 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:26,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:02:26,269 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:26,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:26,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1531237524, now seen corresponding path program 1 times [2022-12-13 12:02:26,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:26,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347009303] [2022-12-13 12:02:26,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:26,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:26,432 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 12:02:26,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:26,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347009303] [2022-12-13 12:02:26,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347009303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:26,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:26,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:02:26,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21493230] [2022-12-13 12:02:26,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:26,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:02:26,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:26,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:02:26,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:02:26,435 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 12:02:26,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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 12:02:26,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:26,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 12:02:26,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:27,460 INFO L130 PetriNetUnfolder]: 6161/8921 cut-off events. [2022-12-13 12:02:27,460 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:02:27,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17537 conditions, 8921 events. 6161/8921 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 49502 event pairs, 2378 based on Foata normal form. 50/7138 useless extension candidates. Maximal degree in co-relation 17529. Up to 7888 conditions per place. [2022-12-13 12:02:27,508 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 42 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2022-12-13 12:02:27,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 212 flow [2022-12-13 12:02:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:02:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:02:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-13 12:02:27,510 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6952380952380952 [2022-12-13 12:02:27,510 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 78 flow. Second operand 3 states and 73 transitions. [2022-12-13 12:02:27,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 212 flow [2022-12-13 12:02:27,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:02:27,512 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 97 flow [2022-12-13 12:02:27,512 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2022-12-13 12:02:27,513 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2022-12-13 12:02:27,513 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:27,513 INFO L89 Accepts]: Start accepts. Operand has 47 places, 37 transitions, 97 flow [2022-12-13 12:02:27,514 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:27,514 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:27,514 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 37 transitions, 97 flow [2022-12-13 12:02:27,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 97 flow [2022-12-13 12:02:27,520 INFO L130 PetriNetUnfolder]: 3/47 cut-off events. [2022-12-13 12:02:27,521 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:02:27,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 47 events. 3/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 62. Up to 10 conditions per place. [2022-12-13 12:02:27,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 97 flow [2022-12-13 12:02:27,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 784 [2022-12-13 12:02:27,630 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:27,631 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 12:02:27,631 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 97 flow [2022-12-13 12:02:27,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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 12:02:27,631 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:27,631 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:27,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:02:27,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:27,632 INFO L85 PathProgramCache]: Analyzing trace with hash -223724596, now seen corresponding path program 1 times [2022-12-13 12:02:27,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:27,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410707627] [2022-12-13 12:02:27,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:27,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:27,974 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 12:02:27,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:27,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410707627] [2022-12-13 12:02:27,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410707627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:27,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:27,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:02:27,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574401797] [2022-12-13 12:02:27,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:27,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:02:27,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:27,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:02:27,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:02:27,984 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2022-12-13 12:02:27,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 12:02:27,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:27,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2022-12-13 12:02:27,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:28,870 INFO L130 PetriNetUnfolder]: 5412/8173 cut-off events. [2022-12-13 12:02:28,871 INFO L131 PetriNetUnfolder]: For 827/828 co-relation queries the response was YES. [2022-12-13 12:02:28,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16883 conditions, 8173 events. 5412/8173 cut-off events. For 827/828 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 49014 event pairs, 923 based on Foata normal form. 90/6527 useless extension candidates. Maximal degree in co-relation 16872. Up to 6351 conditions per place. [2022-12-13 12:02:28,912 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 39 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2022-12-13 12:02:28,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 52 transitions, 216 flow [2022-12-13 12:02:28,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:02:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:02:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 12:02:28,914 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 12:02:28,914 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 97 flow. Second operand 3 states and 70 transitions. [2022-12-13 12:02:28,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 52 transitions, 216 flow [2022-12-13 12:02:28,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:02:28,916 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 102 flow [2022-12-13 12:02:28,916 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2022-12-13 12:02:28,916 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2022-12-13 12:02:28,916 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:28,917 INFO L89 Accepts]: Start accepts. Operand has 49 places, 37 transitions, 102 flow [2022-12-13 12:02:28,917 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:28,917 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:28,917 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 37 transitions, 102 flow [2022-12-13 12:02:28,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 37 transitions, 102 flow [2022-12-13 12:02:28,923 INFO L130 PetriNetUnfolder]: 3/47 cut-off events. [2022-12-13 12:02:28,923 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 12:02:28,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 47 events. 3/47 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 118 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 65. Up to 10 conditions per place. [2022-12-13 12:02:28,924 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 37 transitions, 102 flow [2022-12-13 12:02:28,924 INFO L226 LiptonReduction]: Number of co-enabled transitions 780 [2022-12-13 12:02:28,925 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:28,926 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 12:02:28,926 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 102 flow [2022-12-13 12:02:28,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 12:02:28,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:28,926 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:28,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:02:28,927 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:28,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:28,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1037136722, now seen corresponding path program 1 times [2022-12-13 12:02:28,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:28,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16641207] [2022-12-13 12:02:28,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:28,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:29,120 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 12:02:29,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:29,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16641207] [2022-12-13 12:02:29,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16641207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:29,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:29,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:02:29,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372735876] [2022-12-13 12:02:29,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:29,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:02:29,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:29,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:02:29,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:02:29,122 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2022-12-13 12:02:29,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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 12:02:29,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:29,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2022-12-13 12:02:29,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:30,021 INFO L130 PetriNetUnfolder]: 5326/7799 cut-off events. [2022-12-13 12:02:30,021 INFO L131 PetriNetUnfolder]: For 1746/1746 co-relation queries the response was YES. [2022-12-13 12:02:30,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17111 conditions, 7799 events. 5326/7799 cut-off events. For 1746/1746 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 43621 event pairs, 2322 based on Foata normal form. 60/6167 useless extension candidates. Maximal degree in co-relation 17098. Up to 6096 conditions per place. [2022-12-13 12:02:30,068 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 43 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2022-12-13 12:02:30,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 241 flow [2022-12-13 12:02:30,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:02:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:02:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-13 12:02:30,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2022-12-13 12:02:30,070 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 102 flow. Second operand 3 states and 75 transitions. [2022-12-13 12:02:30,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 241 flow [2022-12-13 12:02:30,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 235 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:02:30,072 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 106 flow [2022-12-13 12:02:30,072 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2022-12-13 12:02:30,087 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2022-12-13 12:02:30,088 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:30,088 INFO L89 Accepts]: Start accepts. Operand has 50 places, 37 transitions, 106 flow [2022-12-13 12:02:30,088 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:30,089 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:30,089 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 37 transitions, 106 flow [2022-12-13 12:02:30,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 37 transitions, 106 flow [2022-12-13 12:02:30,096 INFO L130 PetriNetUnfolder]: 3/47 cut-off events. [2022-12-13 12:02:30,096 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-13 12:02:30,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 47 events. 3/47 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 118 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 69. Up to 10 conditions per place. [2022-12-13 12:02:30,097 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 37 transitions, 106 flow [2022-12-13 12:02:30,097 INFO L226 LiptonReduction]: Number of co-enabled transitions 776 [2022-12-13 12:02:30,098 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:30,099 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 12:02:30,099 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 106 flow [2022-12-13 12:02:30,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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 12:02:30,099 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:30,099 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:30,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:02:30,099 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:30,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:30,100 INFO L85 PathProgramCache]: Analyzing trace with hash 442629010, now seen corresponding path program 1 times [2022-12-13 12:02:30,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:30,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576373368] [2022-12-13 12:02:30,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:30,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:30,174 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 12:02:30,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:30,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576373368] [2022-12-13 12:02:30,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576373368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:30,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:30,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:02:30,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970001231] [2022-12-13 12:02:30,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:30,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:02:30,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:30,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:02:30,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:02:30,177 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 12:02:30,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:30,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:30,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 12:02:30,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:31,144 INFO L130 PetriNetUnfolder]: 7788/11432 cut-off events. [2022-12-13 12:02:31,144 INFO L131 PetriNetUnfolder]: For 3250/3250 co-relation queries the response was YES. [2022-12-13 12:02:31,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25300 conditions, 11432 events. 7788/11432 cut-off events. For 3250/3250 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 68714 event pairs, 3939 based on Foata normal form. 240/8971 useless extension candidates. Maximal degree in co-relation 25286. Up to 6306 conditions per place. [2022-12-13 12:02:31,187 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 45 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2022-12-13 12:02:31,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 249 flow [2022-12-13 12:02:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:02:31,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:02:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-13 12:02:31,189 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2022-12-13 12:02:31,189 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 106 flow. Second operand 3 states and 75 transitions. [2022-12-13 12:02:31,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 249 flow [2022-12-13 12:02:31,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:02:31,195 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2022-12-13 12:02:31,195 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2022-12-13 12:02:31,197 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2022-12-13 12:02:31,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:31,197 INFO L89 Accepts]: Start accepts. Operand has 51 places, 37 transitions, 113 flow [2022-12-13 12:02:31,198 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:31,198 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:31,198 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 37 transitions, 113 flow [2022-12-13 12:02:31,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 37 transitions, 113 flow [2022-12-13 12:02:31,204 INFO L130 PetriNetUnfolder]: 0/48 cut-off events. [2022-12-13 12:02:31,204 INFO L131 PetriNetUnfolder]: For 19/25 co-relation queries the response was YES. [2022-12-13 12:02:31,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 48 events. 0/48 cut-off events. For 19/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 143 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-12-13 12:02:31,206 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 37 transitions, 113 flow [2022-12-13 12:02:31,206 INFO L226 LiptonReduction]: Number of co-enabled transitions 774 [2022-12-13 12:02:31,208 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:31,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 12:02:31,210 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2022-12-13 12:02:31,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:31,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:31,211 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:31,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:02:31,211 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:31,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash -2034494218, now seen corresponding path program 1 times [2022-12-13 12:02:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:31,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980542841] [2022-12-13 12:02:31,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:31,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:32,388 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 12:02:32,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:32,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980542841] [2022-12-13 12:02:32,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980542841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:32,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:32,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:02:32,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641281624] [2022-12-13 12:02:32,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:32,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:02:32,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:32,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:02:32,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:02:32,390 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 12:02:32,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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 12:02:32,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:32,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 12:02:32,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:33,382 INFO L130 PetriNetUnfolder]: 8146/12057 cut-off events. [2022-12-13 12:02:33,382 INFO L131 PetriNetUnfolder]: For 4404/4500 co-relation queries the response was YES. [2022-12-13 12:02:33,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26995 conditions, 12057 events. 8146/12057 cut-off events. For 4404/4500 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 73244 event pairs, 1633 based on Foata normal form. 36/9292 useless extension candidates. Maximal degree in co-relation 26981. Up to 10353 conditions per place. [2022-12-13 12:02:33,432 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 49 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2022-12-13 12:02:33,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 299 flow [2022-12-13 12:02:33,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:02:33,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:02:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-13 12:02:33,434 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-13 12:02:33,434 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 4 states and 90 transitions. [2022-12-13 12:02:33,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 65 transitions, 299 flow [2022-12-13 12:02:33,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 65 transitions, 291 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 12:02:33,438 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 146 flow [2022-12-13 12:02:33,438 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-12-13 12:02:33,439 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2022-12-13 12:02:33,439 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:33,439 INFO L89 Accepts]: Start accepts. Operand has 55 places, 42 transitions, 146 flow [2022-12-13 12:02:33,439 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:33,439 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:33,440 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 42 transitions, 146 flow [2022-12-13 12:02:33,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 42 transitions, 146 flow [2022-12-13 12:02:33,452 INFO L130 PetriNetUnfolder]: 4/78 cut-off events. [2022-12-13 12:02:33,452 INFO L131 PetriNetUnfolder]: For 39/45 co-relation queries the response was YES. [2022-12-13 12:02:33,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 78 events. 4/78 cut-off events. For 39/45 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 329 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 132. Up to 10 conditions per place. [2022-12-13 12:02:33,453 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 42 transitions, 146 flow [2022-12-13 12:02:33,453 INFO L226 LiptonReduction]: Number of co-enabled transitions 890 [2022-12-13 12:02:33,566 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:33,567 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 12:02:33,567 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 146 flow [2022-12-13 12:02:33,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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 12:02:33,567 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:33,567 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:33,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:02:33,568 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:33,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:33,568 INFO L85 PathProgramCache]: Analyzing trace with hash 436909153, now seen corresponding path program 1 times [2022-12-13 12:02:33,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:33,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906543426] [2022-12-13 12:02:33,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:33,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:33,784 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 12:02:33,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:33,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906543426] [2022-12-13 12:02:33,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906543426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:33,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:33,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:02:33,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687786635] [2022-12-13 12:02:33,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:33,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:02:33,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:33,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:02:33,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:02:33,786 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 12:02:33,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 146 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 12:02:33,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:33,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 12:02:33,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:35,148 INFO L130 PetriNetUnfolder]: 9514/13847 cut-off events. [2022-12-13 12:02:35,149 INFO L131 PetriNetUnfolder]: For 6908/7025 co-relation queries the response was YES. [2022-12-13 12:02:35,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32326 conditions, 13847 events. 9514/13847 cut-off events. For 6908/7025 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 83493 event pairs, 6878 based on Foata normal form. 89/10753 useless extension candidates. Maximal degree in co-relation 32309. Up to 11558 conditions per place. [2022-12-13 12:02:35,218 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 38 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2022-12-13 12:02:35,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 58 transitions, 285 flow [2022-12-13 12:02:35,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:02:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:02:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-13 12:02:35,220 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2022-12-13 12:02:35,220 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 146 flow. Second operand 4 states and 78 transitions. [2022-12-13 12:02:35,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 58 transitions, 285 flow [2022-12-13 12:02:35,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 285 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:02:35,225 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 206 flow [2022-12-13 12:02:35,225 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2022-12-13 12:02:35,225 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2022-12-13 12:02:35,225 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:35,226 INFO L89 Accepts]: Start accepts. Operand has 59 places, 48 transitions, 206 flow [2022-12-13 12:02:35,226 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:35,226 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:35,226 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 48 transitions, 206 flow [2022-12-13 12:02:35,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 48 transitions, 206 flow [2022-12-13 12:02:35,267 INFO L130 PetriNetUnfolder]: 98/320 cut-off events. [2022-12-13 12:02:35,267 INFO L131 PetriNetUnfolder]: For 350/388 co-relation queries the response was YES. [2022-12-13 12:02:35,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 320 events. 98/320 cut-off events. For 350/388 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1818 event pairs, 36 based on Foata normal form. 2/233 useless extension candidates. Maximal degree in co-relation 756. Up to 148 conditions per place. [2022-12-13 12:02:35,272 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 48 transitions, 206 flow [2022-12-13 12:02:35,272 INFO L226 LiptonReduction]: Number of co-enabled transitions 1012 [2022-12-13 12:02:35,273 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:35,276 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 12:02:35,276 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 206 flow [2022-12-13 12:02:35,276 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 12:02:35,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:35,276 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:35,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:02:35,277 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:35,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:35,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1355098197, now seen corresponding path program 2 times [2022-12-13 12:02:35,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:35,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533267669] [2022-12-13 12:02:35,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:35,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:35,632 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 12:02:35,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:35,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533267669] [2022-12-13 12:02:35,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533267669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:35,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:35,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:02:35,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028513848] [2022-12-13 12:02:35,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:35,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:02:35,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:35,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:02:35,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:02:35,634 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 12:02:35,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 12:02:35,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:35,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 12:02:35,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:37,305 INFO L130 PetriNetUnfolder]: 14197/21021 cut-off events. [2022-12-13 12:02:37,305 INFO L131 PetriNetUnfolder]: For 16806/16982 co-relation queries the response was YES. [2022-12-13 12:02:37,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54379 conditions, 21021 events. 14197/21021 cut-off events. For 16806/16982 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 143243 event pairs, 5617 based on Foata normal form. 284/16208 useless extension candidates. Maximal degree in co-relation 54359. Up to 10850 conditions per place. [2022-12-13 12:02:37,434 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 54 selfloop transitions, 13 changer transitions 0/77 dead transitions. [2022-12-13 12:02:37,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 432 flow [2022-12-13 12:02:37,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:02:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:02:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-13 12:02:37,436 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5942857142857143 [2022-12-13 12:02:37,436 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 206 flow. Second operand 5 states and 104 transitions. [2022-12-13 12:02:37,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 432 flow [2022-12-13 12:02:37,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 417 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 12:02:37,449 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 241 flow [2022-12-13 12:02:37,449 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2022-12-13 12:02:37,449 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 14 predicate places. [2022-12-13 12:02:37,449 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:37,449 INFO L89 Accepts]: Start accepts. Operand has 62 places, 50 transitions, 241 flow [2022-12-13 12:02:37,450 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:37,450 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:37,450 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 50 transitions, 241 flow [2022-12-13 12:02:37,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 241 flow [2022-12-13 12:02:37,567 INFO L130 PetriNetUnfolder]: 118/446 cut-off events. [2022-12-13 12:02:37,567 INFO L131 PetriNetUnfolder]: For 485/523 co-relation queries the response was YES. [2022-12-13 12:02:37,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 446 events. 118/446 cut-off events. For 485/523 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3099 event pairs, 32 based on Foata normal form. 2/317 useless extension candidates. Maximal degree in co-relation 1032. Up to 196 conditions per place. [2022-12-13 12:02:37,573 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 50 transitions, 241 flow [2022-12-13 12:02:37,573 INFO L226 LiptonReduction]: Number of co-enabled transitions 1068 [2022-12-13 12:02:37,576 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:37,578 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 12:02:37,578 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 241 flow [2022-12-13 12:02:37,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 12:02:37,579 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:37,579 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:37,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:02:37,579 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:37,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:37,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1989825070, now seen corresponding path program 1 times [2022-12-13 12:02:37,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:37,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798381815] [2022-12-13 12:02:37,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:37,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:37,738 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 12:02:37,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:37,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798381815] [2022-12-13 12:02:37,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798381815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:37,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:37,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:02:37,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629340109] [2022-12-13 12:02:37,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:37,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:02:37,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:37,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:02:37,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:02:37,740 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 12:02:37,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 241 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 12:02:37,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:37,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 12:02:37,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:42,188 INFO L130 PetriNetUnfolder]: 37896/52684 cut-off events. [2022-12-13 12:02:42,188 INFO L131 PetriNetUnfolder]: For 41300/42354 co-relation queries the response was YES. [2022-12-13 12:02:42,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137843 conditions, 52684 events. 37896/52684 cut-off events. For 41300/42354 co-relation queries the response was YES. Maximal size of possible extension queue 3186. Compared 364480 event pairs, 3923 based on Foata normal form. 4081/35209 useless extension candidates. Maximal degree in co-relation 137822. Up to 29800 conditions per place. [2022-12-13 12:02:42,543 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 87 selfloop transitions, 14 changer transitions 3/113 dead transitions. [2022-12-13 12:02:42,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 113 transitions, 713 flow [2022-12-13 12:02:42,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:02:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:02:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-12-13 12:02:42,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7 [2022-12-13 12:02:42,545 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 241 flow. Second operand 4 states and 98 transitions. [2022-12-13 12:02:42,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 113 transitions, 713 flow [2022-12-13 12:02:42,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 113 transitions, 679 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:02:42,579 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 333 flow [2022-12-13 12:02:42,580 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=333, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2022-12-13 12:02:42,580 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2022-12-13 12:02:42,580 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:42,580 INFO L89 Accepts]: Start accepts. Operand has 64 places, 62 transitions, 333 flow [2022-12-13 12:02:42,581 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:42,581 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:42,581 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 62 transitions, 333 flow [2022-12-13 12:02:42,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 62 transitions, 333 flow [2022-12-13 12:02:43,962 INFO L130 PetriNetUnfolder]: 11170/16807 cut-off events. [2022-12-13 12:02:43,962 INFO L131 PetriNetUnfolder]: For 12849/20587 co-relation queries the response was YES. [2022-12-13 12:02:44,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41986 conditions, 16807 events. 11170/16807 cut-off events. For 12849/20587 co-relation queries the response was YES. Maximal size of possible extension queue 2343. Compared 132747 event pairs, 6644 based on Foata normal form. 13/6855 useless extension candidates. Maximal degree in co-relation 41965. Up to 14797 conditions per place. [2022-12-13 12:02:44,234 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 62 transitions, 333 flow [2022-12-13 12:02:44,235 INFO L226 LiptonReduction]: Number of co-enabled transitions 1338 [2022-12-13 12:02:44,345 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:44,346 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1766 [2022-12-13 12:02:44,346 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 333 flow [2022-12-13 12:02:44,346 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 12:02:44,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:44,346 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:44,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:02:44,346 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:44,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:44,347 INFO L85 PathProgramCache]: Analyzing trace with hash -960200329, now seen corresponding path program 1 times [2022-12-13 12:02:44,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:44,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810689788] [2022-12-13 12:02:44,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:44,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:44,551 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 12:02:44,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:44,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810689788] [2022-12-13 12:02:44,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810689788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:44,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:44,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:02:44,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909155827] [2022-12-13 12:02:44,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:44,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:02:44,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:44,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:02:44,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:02:44,553 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 12:02:44,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 12:02:44,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:44,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 12:02:44,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:48,308 INFO L130 PetriNetUnfolder]: 29602/42640 cut-off events. [2022-12-13 12:02:48,309 INFO L131 PetriNetUnfolder]: For 44806/45746 co-relation queries the response was YES. [2022-12-13 12:02:48,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147701 conditions, 42640 events. 29602/42640 cut-off events. For 44806/45746 co-relation queries the response was YES. Maximal size of possible extension queue 2853. Compared 308606 event pairs, 890 based on Foata normal form. 3883/29502 useless extension candidates. Maximal degree in co-relation 147677. Up to 27940 conditions per place. [2022-12-13 12:02:48,569 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 101 selfloop transitions, 26 changer transitions 6/142 dead transitions. [2022-12-13 12:02:48,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 142 transitions, 982 flow [2022-12-13 12:02:48,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:02:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:02:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2022-12-13 12:02:48,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.72 [2022-12-13 12:02:48,572 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 333 flow. Second operand 5 states and 126 transitions. [2022-12-13 12:02:48,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 142 transitions, 982 flow [2022-12-13 12:02:48,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 142 transitions, 961 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 12:02:48,611 INFO L231 Difference]: Finished difference. Result has 68 places, 74 transitions, 483 flow [2022-12-13 12:02:48,611 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=483, PETRI_PLACES=68, PETRI_TRANSITIONS=74} [2022-12-13 12:02:48,611 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2022-12-13 12:02:48,611 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:48,611 INFO L89 Accepts]: Start accepts. Operand has 68 places, 74 transitions, 483 flow [2022-12-13 12:02:48,612 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:48,612 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:48,612 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 74 transitions, 483 flow [2022-12-13 12:02:48,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 74 transitions, 483 flow [2022-12-13 12:02:49,781 INFO L130 PetriNetUnfolder]: 8530/14019 cut-off events. [2022-12-13 12:02:49,781 INFO L131 PetriNetUnfolder]: For 15202/31898 co-relation queries the response was YES. [2022-12-13 12:02:49,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48937 conditions, 14019 events. 8530/14019 cut-off events. For 15202/31898 co-relation queries the response was YES. Maximal size of possible extension queue 2115. Compared 118779 event pairs, 2774 based on Foata normal form. 34/6623 useless extension candidates. Maximal degree in co-relation 48914. Up to 11587 conditions per place. [2022-12-13 12:02:49,922 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 74 transitions, 483 flow [2022-12-13 12:02:49,922 INFO L226 LiptonReduction]: Number of co-enabled transitions 1612 [2022-12-13 12:02:50,173 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:50,175 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1564 [2022-12-13 12:02:50,175 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 74 transitions, 483 flow [2022-12-13 12:02:50,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 12:02:50,176 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:50,176 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 12:02:50,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:02:50,176 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:50,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:50,176 INFO L85 PathProgramCache]: Analyzing trace with hash -544607972, now seen corresponding path program 1 times [2022-12-13 12:02:50,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:50,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852921725] [2022-12-13 12:02:50,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:50,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:50,451 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 12:02:50,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:50,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852921725] [2022-12-13 12:02:50,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852921725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:50,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:50,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:02:50,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134216452] [2022-12-13 12:02:50,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:50,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:02:50,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:50,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:02:50,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:02:50,453 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 12:02:50,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 74 transitions, 483 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 12:02:50,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:50,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 12:02:50,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:52,979 INFO L130 PetriNetUnfolder]: 17587/27022 cut-off events. [2022-12-13 12:02:52,979 INFO L131 PetriNetUnfolder]: For 42068/42768 co-relation queries the response was YES. [2022-12-13 12:02:53,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113758 conditions, 27022 events. 17587/27022 cut-off events. For 42068/42768 co-relation queries the response was YES. Maximal size of possible extension queue 1917. Compared 205901 event pairs, 134 based on Foata normal form. 3072/19601 useless extension candidates. Maximal degree in co-relation 113732. Up to 16978 conditions per place. [2022-12-13 12:02:53,137 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 104 selfloop transitions, 38 changer transitions 8/159 dead transitions. [2022-12-13 12:02:53,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 159 transitions, 1243 flow [2022-12-13 12:02:53,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:02:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:02:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2022-12-13 12:02:53,139 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238 [2022-12-13 12:02:53,139 INFO L175 Difference]: Start difference. First operand has 68 places, 74 transitions, 483 flow. Second operand 6 states and 152 transitions. [2022-12-13 12:02:53,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 159 transitions, 1243 flow [2022-12-13 12:02:53,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 159 transitions, 1163 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-12-13 12:02:53,450 INFO L231 Difference]: Finished difference. Result has 70 places, 84 transitions, 606 flow [2022-12-13 12:02:53,451 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=606, PETRI_PLACES=70, PETRI_TRANSITIONS=84} [2022-12-13 12:02:53,451 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2022-12-13 12:02:53,451 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:53,451 INFO L89 Accepts]: Start accepts. Operand has 70 places, 84 transitions, 606 flow [2022-12-13 12:02:53,453 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:53,453 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:53,454 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 84 transitions, 606 flow [2022-12-13 12:02:53,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 84 transitions, 606 flow [2022-12-13 12:02:54,145 INFO L130 PetriNetUnfolder]: 4837/9026 cut-off events. [2022-12-13 12:02:54,145 INFO L131 PetriNetUnfolder]: For 15050/26526 co-relation queries the response was YES. [2022-12-13 12:02:54,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39942 conditions, 9026 events. 4837/9026 cut-off events. For 15050/26526 co-relation queries the response was YES. Maximal size of possible extension queue 1230. Compared 82836 event pairs, 570 based on Foata normal form. 28/4371 useless extension candidates. Maximal degree in co-relation 39919. Up to 7237 conditions per place. [2022-12-13 12:02:54,230 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 84 transitions, 606 flow [2022-12-13 12:02:54,230 INFO L226 LiptonReduction]: Number of co-enabled transitions 1546 [2022-12-13 12:02:55,960 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:02:55,961 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2510 [2022-12-13 12:02:55,961 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 84 transitions, 606 flow [2022-12-13 12:02:55,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 12:02:55,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:55,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:55,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:02:55,962 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:55,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:55,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1012903998, now seen corresponding path program 1 times [2022-12-13 12:02:55,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:55,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443346908] [2022-12-13 12:02:55,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:55,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:56,173 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 12:02:56,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:56,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443346908] [2022-12-13 12:02:56,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443346908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:56,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:56,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:02:56,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547245984] [2022-12-13 12:02:56,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:56,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:02:56,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:56,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:02:56,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:02:56,176 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2022-12-13 12:02:56,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 84 transitions, 606 flow. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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 12:02:56,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:56,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2022-12-13 12:02:56,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:57,686 INFO L130 PetriNetUnfolder]: 10205/16075 cut-off events. [2022-12-13 12:02:57,686 INFO L131 PetriNetUnfolder]: For 28147/28669 co-relation queries the response was YES. [2022-12-13 12:02:57,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77032 conditions, 16075 events. 10205/16075 cut-off events. For 28147/28669 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 118665 event pairs, 140 based on Foata normal form. 1672/11275 useless extension candidates. Maximal degree in co-relation 77006. Up to 9181 conditions per place. [2022-12-13 12:02:57,757 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 61 selfloop transitions, 50 changer transitions 17/135 dead transitions. [2022-12-13 12:02:57,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 135 transitions, 1115 flow [2022-12-13 12:02:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:02:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:02:57,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2022-12-13 12:02:57,759 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-13 12:02:57,759 INFO L175 Difference]: Start difference. First operand has 70 places, 84 transitions, 606 flow. Second operand 7 states and 144 transitions. [2022-12-13 12:02:57,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 135 transitions, 1115 flow [2022-12-13 12:02:58,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 135 transitions, 974 flow, removed 29 selfloop flow, removed 7 redundant places. [2022-12-13 12:02:58,563 INFO L231 Difference]: Finished difference. Result has 71 places, 79 transitions, 593 flow [2022-12-13 12:02:58,563 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=593, PETRI_PLACES=71, PETRI_TRANSITIONS=79} [2022-12-13 12:02:58,563 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 23 predicate places. [2022-12-13 12:02:58,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:58,564 INFO L89 Accepts]: Start accepts. Operand has 71 places, 79 transitions, 593 flow [2022-12-13 12:02:58,565 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:58,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:58,565 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 79 transitions, 593 flow [2022-12-13 12:02:58,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 79 transitions, 593 flow [2022-12-13 12:02:58,658 INFO L130 PetriNetUnfolder]: 778/1520 cut-off events. [2022-12-13 12:02:58,658 INFO L131 PetriNetUnfolder]: For 2148/2722 co-relation queries the response was YES. [2022-12-13 12:02:58,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6730 conditions, 1520 events. 778/1520 cut-off events. For 2148/2722 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 10445 event pairs, 2 based on Foata normal form. 1/643 useless extension candidates. Maximal degree in co-relation 6708. Up to 973 conditions per place. [2022-12-13 12:02:58,669 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 79 transitions, 593 flow [2022-12-13 12:02:58,669 INFO L226 LiptonReduction]: Number of co-enabled transitions 988 [2022-12-13 12:03:01,910 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [615] L783-->L788: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 12:03:01,921 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [709] L783-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_145 (+ v_~__unbuffered_cnt~0_146 1)) (= |v_P0Thread1of1ForFork0_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 12:03:01,939 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [733] L783-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_165 (+ v_~__unbuffered_cnt~0_166 1)) (= |v_P0Thread1of1ForFork0_#res.base_9| 0) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_166} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_165} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 12:03:01,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [713] L834-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#res.base_21| 0) (= |v_P3Thread1of1ForFork1_#res.offset_21| 0) (= v_~__unbuffered_cnt~0_155 (+ v_~__unbuffered_cnt~0_156 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_21|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 12:03:01,977 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [633] L834-->L837: Formula: (= (+ v_~__unbuffered_cnt~0_8 1) v_~__unbuffered_cnt~0_7) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 12:03:01,987 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [681] L834-->P3FINAL: Formula: (and (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 12:03:02,004 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [627] L817-->L820: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 12:03:02,023 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L817-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork3_#res.base_7| 0) (= v_~__unbuffered_cnt~0_269 (+ v_~__unbuffered_cnt~0_270 1)) (= |v_P2Thread1of1ForFork3_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_270} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_269, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_7|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 12:03:02,041 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [750] L817-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_273 (+ v_~__unbuffered_cnt~0_274 1)) (= |v_P2Thread1of1ForFork3_#res.base_9| 0) (= |v_P2Thread1of1ForFork3_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_274} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_273, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_9|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_9|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 12:03:02,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] L795-->L800: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 12:03:02,069 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L795-->P1FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork2_#res.base_5| 0) (= |v_P1Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 12:03:02,086 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [745] L795-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_217 (+ v_~__unbuffered_cnt~0_218 1)) (= |v_P1Thread1of1ForFork2_#res.base_29| 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_218} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_217, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 12:03:18,823 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:03:18,824 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20260 [2022-12-13 12:03:18,824 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 76 transitions, 687 flow [2022-12-13 12:03:18,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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 12:03:18,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:03:18,824 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 12:03:18,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:03:18,825 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:03:18,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:03:18,825 INFO L85 PathProgramCache]: Analyzing trace with hash -152768275, now seen corresponding path program 1 times [2022-12-13 12:03:18,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:03:18,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010456165] [2022-12-13 12:03:18,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:03:18,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:03:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:03:18,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:03:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:03:18,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:03:18,999 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:03:19,000 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 12:03:19,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 12:03:19,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 12:03:19,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 12:03:19,002 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 12:03:19,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 12:03:19,003 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:03:19,007 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:03:19,007 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:03:19,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:03:19 BasicIcfg [2022-12-13 12:03:19,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:03:19,093 INFO L158 Benchmark]: Toolchain (without parser) took 65771.64ms. Allocated memory was 184.5MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 148.1MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-12-13 12:03:19,093 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:03:19,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.90ms. Allocated memory is still 184.5MB. Free memory was 148.1MB in the beginning and 120.3MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 12:03:19,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.52ms. Allocated memory is still 184.5MB. Free memory was 120.3MB in the beginning and 117.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 12:03:19,093 INFO L158 Benchmark]: Boogie Preprocessor took 42.68ms. Allocated memory is still 184.5MB. Free memory was 117.1MB in the beginning and 115.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:03:19,093 INFO L158 Benchmark]: RCFGBuilder took 735.87ms. Allocated memory is still 184.5MB. Free memory was 115.0MB in the beginning and 143.9MB in the end (delta: -28.9MB). Peak memory consumption was 62.3MB. Max. memory is 8.0GB. [2022-12-13 12:03:19,094 INFO L158 Benchmark]: TraceAbstraction took 64449.77ms. Allocated memory was 184.5MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 142.9MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-12-13 12:03:19,094 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.10ms. Allocated memory is still 184.5MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 482.90ms. Allocated memory is still 184.5MB. Free memory was 148.1MB in the beginning and 120.3MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.52ms. Allocated memory is still 184.5MB. Free memory was 120.3MB in the beginning and 117.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.68ms. Allocated memory is still 184.5MB. Free memory was 117.1MB in the beginning and 115.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 735.87ms. Allocated memory is still 184.5MB. Free memory was 115.0MB in the beginning and 143.9MB in the end (delta: -28.9MB). Peak memory consumption was 62.3MB. Max. memory is 8.0GB. * TraceAbstraction took 64449.77ms. Allocated memory was 184.5MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 142.9MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.9s, 136 PlacesBefore, 48 PlacesAfterwards, 124 TransitionsBefore, 36 TransitionsAfterwards, 1736 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 60 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 102 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2071, independent: 1963, independent conditional: 1963, independent unconditional: 0, dependent: 108, dependent conditional: 108, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2071, independent: 1963, independent conditional: 0, independent unconditional: 1963, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2071, independent: 1963, independent conditional: 0, independent unconditional: 1963, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2071, independent: 1963, independent conditional: 0, independent unconditional: 1963, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1316, independent: 1264, independent conditional: 0, independent unconditional: 1264, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1316, independent: 1222, independent conditional: 0, independent unconditional: 1222, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 94, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 367, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 304, dependent conditional: 0, dependent unconditional: 304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2071, independent: 699, independent conditional: 0, independent unconditional: 699, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 1316, unknown conditional: 0, unknown unconditional: 1316] , Statistics on independence cache: Total cache size (in pairs): 2027, Positive cache size: 1975, Positive conditional cache size: 0, Positive unconditional cache size: 1975, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, 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.3s, 44 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 714 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 282, independent: 246, independent conditional: 246, 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: 282, independent: 246, independent conditional: 0, independent unconditional: 246, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 282, independent: 246, independent conditional: 0, independent unconditional: 246, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 282, independent: 246, independent conditional: 0, independent unconditional: 246, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 250, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 250, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 86, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 262, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 282, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 250, unknown conditional: 0, unknown unconditional: 250] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 224, Positive conditional cache size: 0, Positive unconditional cache size: 224, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 47 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 784 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 161, independent: 138, independent conditional: 138, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 161, independent: 138, independent conditional: 14, independent unconditional: 124, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 161, independent: 138, independent conditional: 0, independent unconditional: 138, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 161, independent: 138, independent conditional: 0, independent unconditional: 138, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 105, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 161, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 239, Positive conditional cache size: 0, Positive unconditional cache size: 239, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 780 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 130, independent conditional: 130, 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: 152, independent: 130, independent conditional: 17, independent unconditional: 113, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 152, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 239, Positive conditional cache size: 0, Positive unconditional cache size: 239, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 776 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 151, independent: 130, independent conditional: 130, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 151, independent: 130, independent conditional: 21, independent unconditional: 109, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 151, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 151, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 151, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 239, Positive conditional cache size: 0, Positive unconditional cache size: 239, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 774 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 149, independent: 128, independent conditional: 128, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 149, independent: 128, independent conditional: 20, independent unconditional: 108, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 149, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 149, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 149, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 239, Positive conditional cache size: 0, Positive unconditional cache size: 239, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 55 PlacesBefore, 55 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 890 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 46, independent conditional: 46, 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: 66, independent: 46, independent conditional: 7, independent unconditional: 39, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 46, independent conditional: 5, independent unconditional: 41, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 46, independent conditional: 5, independent unconditional: 41, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 16, independent conditional: 2, independent unconditional: 14, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 109, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 74, dependent conditional: 1, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 30, independent conditional: 3, independent unconditional: 27, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 21, unknown conditional: 3, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 255, Positive conditional cache size: 2, Positive unconditional cache size: 253, Negative cache size: 38, Negative conditional cache size: 1, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 1012 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 8, independent unconditional: 6, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 14, independent conditional: 4, independent unconditional: 10, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 4, independent unconditional: 10, dependent: 4, dependent conditional: 2, dependent unconditional: 2, 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: 18, independent: 14, independent conditional: 4, independent unconditional: 10, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 255, Positive conditional cache size: 2, Positive unconditional cache size: 253, Negative cache size: 38, Negative conditional cache size: 1, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 1068 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 8, independent unconditional: 6, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 14, independent conditional: 4, independent unconditional: 10, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 4, independent unconditional: 10, dependent: 4, dependent conditional: 2, dependent unconditional: 2, 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: 18, independent: 14, independent conditional: 4, independent unconditional: 10, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 255, Positive conditional cache size: 2, Positive unconditional cache size: 253, Negative cache size: 38, Negative conditional cache size: 1, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 64 PlacesBefore, 64 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 1338 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 36, independent: 29, independent conditional: 27, independent unconditional: 2, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 29, independent conditional: 2, independent unconditional: 27, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 29, independent conditional: 2, independent unconditional: 27, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 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: 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] ], Cache Queries: [ total: 36, independent: 24, independent conditional: 2, independent unconditional: 22, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 260, Positive conditional cache size: 2, Positive unconditional cache size: 258, Negative cache size: 39, Negative conditional cache size: 1, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 68 PlacesBefore, 68 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 1612 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 19, independent conditional: 13, independent unconditional: 6, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 31, independent: 19, independent conditional: 8, independent unconditional: 11, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 260, Positive conditional cache size: 2, Positive unconditional cache size: 258, Negative cache size: 40, Negative conditional cache size: 1, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 70 PlacesBefore, 70 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 1546 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 44, independent conditional: 35, independent unconditional: 9, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 44, independent conditional: 31, independent unconditional: 13, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 44, independent conditional: 31, independent unconditional: 13, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 23, independent conditional: 18, independent unconditional: 5, 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: 24, independent: 23, independent conditional: 0, independent unconditional: 23, 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: 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] ], Cache Queries: [ total: 64, independent: 21, independent conditional: 13, independent unconditional: 8, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 24, unknown conditional: 18, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 327, Positive cache size: 286, Positive conditional cache size: 20, Positive unconditional cache size: 266, Negative cache size: 41, Negative conditional cache size: 1, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.2s, 71 PlacesBefore, 68 PlacesAfterwards, 79 TransitionsBefore, 76 TransitionsAfterwards, 988 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 226, independent: 192, independent conditional: 192, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 226, independent: 192, independent conditional: 184, independent unconditional: 8, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 226, independent: 192, independent conditional: 4, independent unconditional: 188, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 226, independent: 192, independent conditional: 4, independent unconditional: 188, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 226, independent: 186, independent conditional: 4, independent unconditional: 182, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 414, Positive cache size: 372, Positive conditional cache size: 20, Positive unconditional cache size: 352, Negative cache size: 42, Negative conditional cache size: 2, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 180, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2161; [L852] FCALL, FORK 0 pthread_create(&t2161, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2161, ((void *)0), P0, ((void *)0))=-3, t2161={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] EXPR 1 \read(y) [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L769] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L770] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L771] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L772] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L774] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L777] EXPR 1 \read(y) [L777] 1 __unbuffered_p0_EAX = y [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] EXPR 1 \read(y) [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] 1 y = y$flush_delayed ? y$mem_tmp : y [L779] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] 0 pthread_t t2162; [L854] FCALL, FORK 0 pthread_create(&t2162, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2162, ((void *)0), P1, ((void *)0))=-2, t2161={7:0}, t2162={5:0}, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] 0 pthread_t t2163; [L782] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] FCALL, FORK 0 pthread_create(&t2163, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2163, ((void *)0), P2, ((void *)0))=-1, t2161={7:0}, t2162={5:0}, t2163={6:0}, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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=50, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, 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=50, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] 0 pthread_t t2164; [L858] FCALL, FORK 0 pthread_create(&t2164, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2164, ((void *)0), P3, ((void *)0))=0, t2161={7:0}, t2162={5:0}, t2163={6:0}, t2164={8:0}, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 4 y = 2 [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 \read(y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 4 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 4 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 4 !(!cond) [L862] RET 4 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 4 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 4 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 4 \read(y) [L864] EXPR 4 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 4 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 4 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 4 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 4 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L871] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 4 y$flush_delayed = weak$$choice2 [L874] EXPR 4 \read(y) [L874] 4 y$mem_tmp = y [L875] EXPR 4 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 4 \read(y) [L875] EXPR 4 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 4 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 4 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 4 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 4 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 4 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 4 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 4 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 4 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 4 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 4 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 4 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 4 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 4 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 4 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 4 x == 2 && y == 2 [L884] EXPR 4 \read(y) [L884] EXPR 4 x == 2 && y == 2 [L884] 4 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L885] EXPR 4 y$flush_delayed ? y$mem_tmp : y [L885] EXPR 4 \read(y) [L885] EXPR 4 y$flush_delayed ? y$mem_tmp : y [L885] 4 y = y$flush_delayed ? y$mem_tmp : y [L886] 4 y$flush_delayed = (_Bool)0 [L888] CALL 4 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 5 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: 64.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 23.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 605 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 605 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 911 IncrementalHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 4 mSDtfsCounter, 911 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=687occurred in iteration=12, InterpolantAutomatonStates: 49, 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.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 1073 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 12:03:19,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...