/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:31:25,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:31:25,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:31:25,683 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:31:25,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:31:25,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:31:25,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:31:25,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:31:25,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:31:25,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:31:25,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:31:25,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:31:25,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:31:25,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:31:25,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:31:25,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:31:25,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:31:25,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:31:25,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:31:25,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:31:25,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:31:25,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:31:25,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:31:25,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:31:25,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:31:25,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:31:25,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:31:25,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:31:25,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:31:25,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:31:25,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:31:25,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:31:25,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:31:25,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:31:25,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:31:25,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:31:25,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:31:25,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:31:25,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:31:25,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:31:25,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:31:25,741 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:31:25,774 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:31:25,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:31:25,776 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:31:25,776 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:31:25,776 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:31:25,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:31:25,777 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:31:25,777 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:31:25,777 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:31:25,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:31:25,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:31:25,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:31:25,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:31:25,779 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:31:25,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:31:25,779 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:31:25,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:31:25,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:31:25,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:31:25,780 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:31:25,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:31:25,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:31:25,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:31:25,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:31:25,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:31:25,781 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:31:25,781 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:31:25,781 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:31:25,781 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:31:25,781 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 09:31:26,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:31:26,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:31:26,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:31:26,079 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:31:26,081 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:31:26,082 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-12-13 09:31:27,136 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:31:27,365 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:31:27,366 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-12-13 09:31:27,379 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5a5a7caa/97c5fefb2a4b4256888b024bede18b23/FLAG2340e8073 [2022-12-13 09:31:27,397 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5a5a7caa/97c5fefb2a4b4256888b024bede18b23 [2022-12-13 09:31:27,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:31:27,400 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:31:27,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:31:27,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:31:27,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:31:27,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:31:27" (1/1) ... [2022-12-13 09:31:27,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5308ae62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:27, skipping insertion in model container [2022-12-13 09:31:27,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:31:27" (1/1) ... [2022-12-13 09:31:27,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:31:27,449 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:31:27,565 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/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2022-12-13 09:31:27,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:31:27,798 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:31:27,814 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/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2022-12-13 09:31:27,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:31:27,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:31:27,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:31:27,926 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:31:27,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:27 WrapperNode [2022-12-13 09:31:27,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:31:27,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:31:27,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:31:27,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:31:27,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:27" (1/1) ... [2022-12-13 09:31:27,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:27" (1/1) ... [2022-12-13 09:31:27,994 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-13 09:31:27,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:31:27,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:31:27,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:31:27,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:31:28,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:27" (1/1) ... [2022-12-13 09:31:28,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:27" (1/1) ... [2022-12-13 09:31:28,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:27" (1/1) ... [2022-12-13 09:31:28,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:27" (1/1) ... [2022-12-13 09:31:28,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:27" (1/1) ... [2022-12-13 09:31:28,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:27" (1/1) ... [2022-12-13 09:31:28,015 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:27" (1/1) ... [2022-12-13 09:31:28,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:27" (1/1) ... [2022-12-13 09:31:28,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:31:28,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:31:28,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:31:28,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:31:28,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:27" (1/1) ... [2022-12-13 09:31:28,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:31:28,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:31:28,064 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 09:31:28,066 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 09:31:28,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:31:28,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:31:28,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:31:28,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:31:28,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:31:28,093 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:31:28,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:31:28,093 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:31:28,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:31:28,093 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:31:28,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:31:28,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:31:28,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:31:28,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:31:28,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:31:28,095 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 09:31:28,210 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:31:28,211 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:31:28,544 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:31:28,692 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:31:28,692 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:31:28,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:31:28 BoogieIcfgContainer [2022-12-13 09:31:28,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:31:28,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:31:28,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:31:28,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:31:28,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:31:27" (1/3) ... [2022-12-13 09:31:28,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44176616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:31:28, skipping insertion in model container [2022-12-13 09:31:28,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:31:27" (2/3) ... [2022-12-13 09:31:28,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44176616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:31:28, skipping insertion in model container [2022-12-13 09:31:28,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:31:28" (3/3) ... [2022-12-13 09:31:28,702 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-12-13 09:31:28,719 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:31:28,720 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:31:28,720 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:31:28,779 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:31:28,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-13 09:31:28,876 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-13 09:31:28,876 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:31:28,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 09:31:28,881 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-13 09:31:28,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-13 09:31:28,887 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:28,914 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-13 09:31:28,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-13 09:31:28,979 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-13 09:31:28,980 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:31:28,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 09:31:28,983 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-13 09:31:28,983 INFO L226 LiptonReduction]: Number of co-enabled transitions 1906 [2022-12-13 09:31:37,608 INFO L241 LiptonReduction]: Total number of compositions: 84 [2022-12-13 09:31:37,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:31:37,644 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;@17a4a1c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:31:37,644 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 09:31:37,649 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-13 09:31:37,649 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:31:37,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:37,650 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:31:37,650 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:37,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:37,654 INFO L85 PathProgramCache]: Analyzing trace with hash 462415477, now seen corresponding path program 1 times [2022-12-13 09:31:37,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:37,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137188578] [2022-12-13 09:31:37,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:37,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:38,057 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 09:31:38,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:38,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137188578] [2022-12-13 09:31:38,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137188578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:38,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:38,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:31:38,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443616354] [2022-12-13 09:31:38,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:38,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:31:38,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:38,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:31:38,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:31:38,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 61 [2022-12-13 09:31:38,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 131 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 09:31:38,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:38,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 61 [2022-12-13 09:31:38,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:39,893 INFO L130 PetriNetUnfolder]: 7924/12722 cut-off events. [2022-12-13 09:31:39,893 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 09:31:39,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24124 conditions, 12722 events. 7924/12722 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 784. Compared 95832 event pairs, 1048 based on Foata normal form. 0/7819 useless extension candidates. Maximal degree in co-relation 24113. Up to 9597 conditions per place. [2022-12-13 09:31:39,932 INFO L137 encePairwiseOnDemand]: 56/61 looper letters, 32 selfloop transitions, 2 changer transitions 52/97 dead transitions. [2022-12-13 09:31:39,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 378 flow [2022-12-13 09:31:39,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:31:39,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2022-12-13 09:31:39,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6775956284153005 [2022-12-13 09:31:39,943 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 131 flow. Second operand 3 states and 124 transitions. [2022-12-13 09:31:39,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 378 flow [2022-12-13 09:31:39,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 97 transitions, 374 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:31:39,948 INFO L231 Difference]: Finished difference. Result has 67 places, 32 transitions, 74 flow [2022-12-13 09:31:39,949 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=67, PETRI_TRANSITIONS=32} [2022-12-13 09:31:39,952 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2022-12-13 09:31:39,952 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:39,953 INFO L89 Accepts]: Start accepts. Operand has 67 places, 32 transitions, 74 flow [2022-12-13 09:31:39,955 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:39,955 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:39,955 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 32 transitions, 74 flow [2022-12-13 09:31:39,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2022-12-13 09:31:39,961 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 09:31:39,961 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:31:39,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 83 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:31:39,963 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 74 flow [2022-12-13 09:31:39,963 INFO L226 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-13 09:31:40,033 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:40,035 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-13 09:31:40,035 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 74 flow [2022-12-13 09:31:40,035 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 09:31:40,036 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:40,036 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:40,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:31:40,036 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:40,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:40,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1826368940, now seen corresponding path program 1 times [2022-12-13 09:31:40,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:40,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087755507] [2022-12-13 09:31:40,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:40,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:40,441 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 09:31:40,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:40,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087755507] [2022-12-13 09:31:40,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087755507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:40,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:40,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:31:40,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583781541] [2022-12-13 09:31:40,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:40,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:31:40,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:40,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:31:40,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:31:40,444 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:31:40,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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 09:31:40,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:40,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:31:40,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:40,902 INFO L130 PetriNetUnfolder]: 2430/3728 cut-off events. [2022-12-13 09:31:40,902 INFO L131 PetriNetUnfolder]: For 164/164 co-relation queries the response was YES. [2022-12-13 09:31:40,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7533 conditions, 3728 events. 2430/3728 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 18949 event pairs, 383 based on Foata normal form. 96/3301 useless extension candidates. Maximal degree in co-relation 7523. Up to 2587 conditions per place. [2022-12-13 09:31:40,924 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 42 selfloop transitions, 10 changer transitions 0/60 dead transitions. [2022-12-13 09:31:40,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 238 flow [2022-12-13 09:31:40,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:31:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-13 09:31:40,926 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.671875 [2022-12-13 09:31:40,926 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 74 flow. Second operand 4 states and 86 transitions. [2022-12-13 09:31:40,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 238 flow [2022-12-13 09:31:40,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:31:40,928 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 146 flow [2022-12-13 09:31:40,929 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2022-12-13 09:31:40,929 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -25 predicate places. [2022-12-13 09:31:40,929 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:40,929 INFO L89 Accepts]: Start accepts. Operand has 45 places, 40 transitions, 146 flow [2022-12-13 09:31:40,930 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:40,930 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:40,931 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 40 transitions, 146 flow [2022-12-13 09:31:40,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 146 flow [2022-12-13 09:31:40,989 INFO L130 PetriNetUnfolder]: 308/630 cut-off events. [2022-12-13 09:31:40,989 INFO L131 PetriNetUnfolder]: For 114/121 co-relation queries the response was YES. [2022-12-13 09:31:40,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 630 events. 308/630 cut-off events. For 114/121 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3610 event pairs, 149 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 1329. Up to 432 conditions per place. [2022-12-13 09:31:40,994 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 40 transitions, 146 flow [2022-12-13 09:31:40,994 INFO L226 LiptonReduction]: Number of co-enabled transitions 650 [2022-12-13 09:31:41,005 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:41,007 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-13 09:31:41,007 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 146 flow [2022-12-13 09:31:41,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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 09:31:41,007 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:41,007 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:41,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:31:41,007 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:41,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:41,008 INFO L85 PathProgramCache]: Analyzing trace with hash 782902771, now seen corresponding path program 1 times [2022-12-13 09:31:41,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:41,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067669755] [2022-12-13 09:31:41,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:41,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:41,343 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 09:31:41,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:41,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067669755] [2022-12-13 09:31:41,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067669755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:41,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:41,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:31:41,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059403465] [2022-12-13 09:31:41,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:41,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:31:41,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:41,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:31:41,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:31:41,346 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:31:41,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:41,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:41,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:31:41,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:41,797 INFO L130 PetriNetUnfolder]: 2442/3761 cut-off events. [2022-12-13 09:31:41,798 INFO L131 PetriNetUnfolder]: For 1302/1302 co-relation queries the response was YES. [2022-12-13 09:31:41,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10186 conditions, 3761 events. 2442/3761 cut-off events. For 1302/1302 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 19158 event pairs, 470 based on Foata normal form. 12/3248 useless extension candidates. Maximal degree in co-relation 10173. Up to 2745 conditions per place. [2022-12-13 09:31:41,828 INFO L137 encePairwiseOnDemand]: 22/32 looper letters, 47 selfloop transitions, 17 changer transitions 0/72 dead transitions. [2022-12-13 09:31:41,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 72 transitions, 388 flow [2022-12-13 09:31:41,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:31:41,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 09:31:41,833 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2022-12-13 09:31:41,833 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 146 flow. Second operand 4 states and 87 transitions. [2022-12-13 09:31:41,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 72 transitions, 388 flow [2022-12-13 09:31:41,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 384 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:31:41,840 INFO L231 Difference]: Finished difference. Result has 50 places, 51 transitions, 287 flow [2022-12-13 09:31:41,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=287, PETRI_PLACES=50, PETRI_TRANSITIONS=51} [2022-12-13 09:31:41,841 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -20 predicate places. [2022-12-13 09:31:41,841 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:41,842 INFO L89 Accepts]: Start accepts. Operand has 50 places, 51 transitions, 287 flow [2022-12-13 09:31:41,843 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:41,843 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:41,843 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 51 transitions, 287 flow [2022-12-13 09:31:41,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 51 transitions, 287 flow [2022-12-13 09:31:41,917 INFO L130 PetriNetUnfolder]: 304/625 cut-off events. [2022-12-13 09:31:41,917 INFO L131 PetriNetUnfolder]: For 518/608 co-relation queries the response was YES. [2022-12-13 09:31:41,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1896 conditions, 625 events. 304/625 cut-off events. For 518/608 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3585 event pairs, 135 based on Foata normal form. 1/526 useless extension candidates. Maximal degree in co-relation 1882. Up to 422 conditions per place. [2022-12-13 09:31:41,923 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 51 transitions, 287 flow [2022-12-13 09:31:41,923 INFO L226 LiptonReduction]: Number of co-enabled transitions 776 [2022-12-13 09:31:41,939 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:41,944 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 09:31:41,944 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 51 transitions, 287 flow [2022-12-13 09:31:41,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:41,944 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:41,945 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:41,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:31:41,945 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:41,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:41,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1501001307, now seen corresponding path program 1 times [2022-12-13 09:31:41,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:41,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090308726] [2022-12-13 09:31:41,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:41,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:42,117 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 09:31:42,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:42,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090308726] [2022-12-13 09:31:42,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090308726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:42,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:42,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:31:42,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570157459] [2022-12-13 09:31:42,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:42,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:31:42,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:42,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:31:42,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:31:42,121 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2022-12-13 09:31:42,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 51 transitions, 287 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 09:31:42,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:42,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2022-12-13 09:31:42,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:42,446 INFO L130 PetriNetUnfolder]: 1766/2897 cut-off events. [2022-12-13 09:31:42,446 INFO L131 PetriNetUnfolder]: For 3142/3242 co-relation queries the response was YES. [2022-12-13 09:31:42,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9351 conditions, 2897 events. 1766/2897 cut-off events. For 3142/3242 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 16993 event pairs, 224 based on Foata normal form. 58/2472 useless extension candidates. Maximal degree in co-relation 9334. Up to 2128 conditions per place. [2022-12-13 09:31:42,472 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 52 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2022-12-13 09:31:42,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 73 transitions, 519 flow [2022-12-13 09:31:42,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:31:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-13 09:31:42,475 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.71875 [2022-12-13 09:31:42,475 INFO L175 Difference]: Start difference. First operand has 50 places, 51 transitions, 287 flow. Second operand 3 states and 69 transitions. [2022-12-13 09:31:42,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 73 transitions, 519 flow [2022-12-13 09:31:42,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 519 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:31:42,484 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 304 flow [2022-12-13 09:31:42,485 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2022-12-13 09:31:42,486 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -17 predicate places. [2022-12-13 09:31:42,486 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:42,486 INFO L89 Accepts]: Start accepts. Operand has 53 places, 51 transitions, 304 flow [2022-12-13 09:31:42,488 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:42,489 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:42,489 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions, 304 flow [2022-12-13 09:31:42,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions, 304 flow [2022-12-13 09:31:42,553 INFO L130 PetriNetUnfolder]: 278/583 cut-off events. [2022-12-13 09:31:42,553 INFO L131 PetriNetUnfolder]: For 604/694 co-relation queries the response was YES. [2022-12-13 09:31:42,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1873 conditions, 583 events. 278/583 cut-off events. For 604/694 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3304 event pairs, 123 based on Foata normal form. 1/486 useless extension candidates. Maximal degree in co-relation 1856. Up to 386 conditions per place. [2022-12-13 09:31:42,559 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 51 transitions, 304 flow [2022-12-13 09:31:42,559 INFO L226 LiptonReduction]: Number of co-enabled transitions 774 [2022-12-13 09:31:42,561 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:42,562 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-13 09:31:42,562 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 304 flow [2022-12-13 09:31:42,563 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 09:31:42,563 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:42,563 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:42,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:31:42,563 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:42,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:42,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2050100407, now seen corresponding path program 1 times [2022-12-13 09:31:42,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:42,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981321191] [2022-12-13 09:31:42,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:42,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:42,873 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 09:31:42,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:42,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981321191] [2022-12-13 09:31:42,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981321191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:42,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:42,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:31:42,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909819532] [2022-12-13 09:31:42,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:42,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:31:42,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:42,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:31:42,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:31:42,875 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:31:42,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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 09:31:42,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:42,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:31:42,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:43,412 INFO L130 PetriNetUnfolder]: 3006/4719 cut-off events. [2022-12-13 09:31:43,412 INFO L131 PetriNetUnfolder]: For 6791/6791 co-relation queries the response was YES. [2022-12-13 09:31:43,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15304 conditions, 4719 events. 3006/4719 cut-off events. For 6791/6791 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 26094 event pairs, 404 based on Foata normal form. 140/4148 useless extension candidates. Maximal degree in co-relation 15284. Up to 2344 conditions per place. [2022-12-13 09:31:43,432 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 50 selfloop transitions, 9 changer transitions 20/87 dead transitions. [2022-12-13 09:31:43,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 626 flow [2022-12-13 09:31:43,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:31:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-13 09:31:43,434 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.64375 [2022-12-13 09:31:43,434 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 304 flow. Second operand 5 states and 103 transitions. [2022-12-13 09:31:43,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 626 flow [2022-12-13 09:31:43,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 87 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:31:43,439 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 238 flow [2022-12-13 09:31:43,439 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2022-12-13 09:31:43,439 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -14 predicate places. [2022-12-13 09:31:43,440 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:43,440 INFO L89 Accepts]: Start accepts. Operand has 56 places, 42 transitions, 238 flow [2022-12-13 09:31:43,440 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:43,441 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:43,441 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 42 transitions, 238 flow [2022-12-13 09:31:43,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 42 transitions, 238 flow [2022-12-13 09:31:43,470 INFO L130 PetriNetUnfolder]: 130/312 cut-off events. [2022-12-13 09:31:43,470 INFO L131 PetriNetUnfolder]: For 335/386 co-relation queries the response was YES. [2022-12-13 09:31:43,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 312 events. 130/312 cut-off events. For 335/386 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1598 event pairs, 62 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 969. Up to 195 conditions per place. [2022-12-13 09:31:43,473 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 42 transitions, 238 flow [2022-12-13 09:31:43,473 INFO L226 LiptonReduction]: Number of co-enabled transitions 612 [2022-12-13 09:31:43,617 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [331] L771-->L774: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] and [459] $Ultimate##0-->L791: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_74 v_~__unbuffered_p2_EAX~0_57) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_74} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_57, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_74} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] [2022-12-13 09:31:43,637 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:31:43,638 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-13 09:31:43,638 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 247 flow [2022-12-13 09:31:43,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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 09:31:43,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:43,639 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:43,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:31:43,639 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:43,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:43,639 INFO L85 PathProgramCache]: Analyzing trace with hash 273438087, now seen corresponding path program 1 times [2022-12-13 09:31:43,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:43,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297492344] [2022-12-13 09:31:43,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:43,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:43,899 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 09:31:43,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:43,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297492344] [2022-12-13 09:31:43,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297492344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:43,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:43,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:31:43,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409561541] [2022-12-13 09:31:43,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:43,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:31:43,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:43,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:31:43,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:31:43,901 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 09:31:43,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 09:31:43,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:43,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 09:31:43,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:44,188 INFO L130 PetriNetUnfolder]: 1482/2360 cut-off events. [2022-12-13 09:31:44,188 INFO L131 PetriNetUnfolder]: For 3609/3609 co-relation queries the response was YES. [2022-12-13 09:31:44,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7941 conditions, 2360 events. 1482/2360 cut-off events. For 3609/3609 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11878 event pairs, 388 based on Foata normal form. 20/2005 useless extension candidates. Maximal degree in co-relation 7920. Up to 1416 conditions per place. [2022-12-13 09:31:44,202 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 46 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2022-12-13 09:31:44,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 429 flow [2022-12-13 09:31:44,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:31:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-12-13 09:31:44,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5808823529411765 [2022-12-13 09:31:44,204 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 247 flow. Second operand 4 states and 79 transitions. [2022-12-13 09:31:44,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 429 flow [2022-12-13 09:31:44,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 373 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-13 09:31:44,210 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 240 flow [2022-12-13 09:31:44,210 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2022-12-13 09:31:44,212 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -17 predicate places. [2022-12-13 09:31:44,212 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:44,213 INFO L89 Accepts]: Start accepts. Operand has 53 places, 45 transitions, 240 flow [2022-12-13 09:31:44,214 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:44,214 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:44,214 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 45 transitions, 240 flow [2022-12-13 09:31:44,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 240 flow [2022-12-13 09:31:44,246 INFO L130 PetriNetUnfolder]: 122/322 cut-off events. [2022-12-13 09:31:44,246 INFO L131 PetriNetUnfolder]: For 260/337 co-relation queries the response was YES. [2022-12-13 09:31:44,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 322 events. 122/322 cut-off events. For 260/337 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1860 event pairs, 40 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 942. Up to 183 conditions per place. [2022-12-13 09:31:44,249 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 240 flow [2022-12-13 09:31:44,249 INFO L226 LiptonReduction]: Number of co-enabled transitions 646 [2022-12-13 09:31:44,262 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:44,263 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 09:31:44,263 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 240 flow [2022-12-13 09:31:44,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 09:31:44,264 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:44,264 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:44,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:31:44,264 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:44,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:44,264 INFO L85 PathProgramCache]: Analyzing trace with hash -794575535, now seen corresponding path program 1 times [2022-12-13 09:31:44,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:44,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442498189] [2022-12-13 09:31:44,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:44,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:44,425 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 09:31:44,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:44,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442498189] [2022-12-13 09:31:44,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442498189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:44,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:44,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:31:44,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772387703] [2022-12-13 09:31:44,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:44,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:31:44,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:44,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:31:44,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:31:44,427 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 09:31:44,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 09:31:44,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:44,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 09:31:44,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:44,802 INFO L130 PetriNetUnfolder]: 1917/3189 cut-off events. [2022-12-13 09:31:44,802 INFO L131 PetriNetUnfolder]: For 4772/4772 co-relation queries the response was YES. [2022-12-13 09:31:44,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10229 conditions, 3189 events. 1917/3189 cut-off events. For 4772/4772 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 19077 event pairs, 316 based on Foata normal form. 64/2688 useless extension candidates. Maximal degree in co-relation 10211. Up to 1396 conditions per place. [2022-12-13 09:31:44,818 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 47 selfloop transitions, 6 changer transitions 11/72 dead transitions. [2022-12-13 09:31:44,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 492 flow [2022-12-13 09:31:44,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:31:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-13 09:31:44,820 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6323529411764706 [2022-12-13 09:31:44,820 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 240 flow. Second operand 4 states and 86 transitions. [2022-12-13 09:31:44,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 492 flow [2022-12-13 09:31:44,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 72 transitions, 461 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 09:31:44,825 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 218 flow [2022-12-13 09:31:44,825 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2022-12-13 09:31:44,825 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -16 predicate places. [2022-12-13 09:31:44,825 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:44,826 INFO L89 Accepts]: Start accepts. Operand has 54 places, 42 transitions, 218 flow [2022-12-13 09:31:44,826 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:44,826 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:44,827 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 42 transitions, 218 flow [2022-12-13 09:31:44,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 42 transitions, 218 flow [2022-12-13 09:31:44,858 INFO L130 PetriNetUnfolder]: 102/292 cut-off events. [2022-12-13 09:31:44,858 INFO L131 PetriNetUnfolder]: For 250/258 co-relation queries the response was YES. [2022-12-13 09:31:44,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 292 events. 102/292 cut-off events. For 250/258 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1759 event pairs, 36 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 811. Up to 157 conditions per place. [2022-12-13 09:31:44,862 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 42 transitions, 218 flow [2022-12-13 09:31:44,862 INFO L226 LiptonReduction]: Number of co-enabled transitions 516 [2022-12-13 09:31:44,870 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:44,871 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 09:31:44,871 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 218 flow [2022-12-13 09:31:44,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 09:31:44,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:44,872 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:44,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:31:44,872 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:44,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:44,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2135023813, now seen corresponding path program 2 times [2022-12-13 09:31:44,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:44,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227779678] [2022-12-13 09:31:44,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:44,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:45,301 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 09:31:45,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:45,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227779678] [2022-12-13 09:31:45,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227779678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:45,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:45,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:31:45,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445071174] [2022-12-13 09:31:45,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:45,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:31:45,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:45,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:31:45,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:31:45,304 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 09:31:45,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:45,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:45,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 09:31:45,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:45,523 INFO L130 PetriNetUnfolder]: 1296/2044 cut-off events. [2022-12-13 09:31:45,523 INFO L131 PetriNetUnfolder]: For 3517/3517 co-relation queries the response was YES. [2022-12-13 09:31:45,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6675 conditions, 2044 events. 1296/2044 cut-off events. For 3517/3517 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 9896 event pairs, 597 based on Foata normal form. 1/1687 useless extension candidates. Maximal degree in co-relation 6656. Up to 1836 conditions per place. [2022-12-13 09:31:45,537 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 40 selfloop transitions, 9 changer transitions 0/58 dead transitions. [2022-12-13 09:31:45,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 403 flow [2022-12-13 09:31:45,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:31:45,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-13 09:31:45,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2022-12-13 09:31:45,539 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 218 flow. Second operand 4 states and 75 transitions. [2022-12-13 09:31:45,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 403 flow [2022-12-13 09:31:45,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 383 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 09:31:45,543 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 264 flow [2022-12-13 09:31:45,543 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=264, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 09:31:45,544 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -16 predicate places. [2022-12-13 09:31:45,544 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:45,544 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 264 flow [2022-12-13 09:31:45,545 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:45,545 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:45,545 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 264 flow [2022-12-13 09:31:45,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 264 flow [2022-12-13 09:31:45,576 INFO L130 PetriNetUnfolder]: 128/349 cut-off events. [2022-12-13 09:31:45,576 INFO L131 PetriNetUnfolder]: For 301/309 co-relation queries the response was YES. [2022-12-13 09:31:45,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 349 events. 128/349 cut-off events. For 301/309 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2123 event pairs, 38 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 1019. Up to 182 conditions per place. [2022-12-13 09:31:45,580 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 264 flow [2022-12-13 09:31:45,580 INFO L226 LiptonReduction]: Number of co-enabled transitions 556 [2022-12-13 09:31:45,582 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:45,582 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 09:31:45,582 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 264 flow [2022-12-13 09:31:45,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:45,583 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:45,583 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:45,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:31:45,583 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:45,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1406510769, now seen corresponding path program 1 times [2022-12-13 09:31:45,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:45,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923669535] [2022-12-13 09:31:45,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:45,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:46,220 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 09:31:46,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:46,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923669535] [2022-12-13 09:31:46,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923669535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:46,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:46,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:31:46,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835962477] [2022-12-13 09:31:46,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:46,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:31:46,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:46,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:31:46,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:31:46,223 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 09:31:46,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 09:31:46,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:46,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 09:31:46,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:46,488 INFO L130 PetriNetUnfolder]: 1274/2024 cut-off events. [2022-12-13 09:31:46,489 INFO L131 PetriNetUnfolder]: For 3939/3939 co-relation queries the response was YES. [2022-12-13 09:31:46,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6845 conditions, 2024 events. 1274/2024 cut-off events. For 3939/3939 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9927 event pairs, 547 based on Foata normal form. 7/1675 useless extension candidates. Maximal degree in co-relation 6826. Up to 1713 conditions per place. [2022-12-13 09:31:46,501 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 54 selfloop transitions, 13 changer transitions 0/76 dead transitions. [2022-12-13 09:31:46,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 552 flow [2022-12-13 09:31:46,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:31:46,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-13 09:31:46,503 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.593939393939394 [2022-12-13 09:31:46,503 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 264 flow. Second operand 5 states and 98 transitions. [2022-12-13 09:31:46,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 552 flow [2022-12-13 09:31:46,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:31:46,506 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 350 flow [2022-12-13 09:31:46,507 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=350, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2022-12-13 09:31:46,507 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -12 predicate places. [2022-12-13 09:31:46,507 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:46,507 INFO L89 Accepts]: Start accepts. Operand has 58 places, 53 transitions, 350 flow [2022-12-13 09:31:46,508 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:46,508 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:46,508 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 53 transitions, 350 flow [2022-12-13 09:31:46,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 53 transitions, 350 flow [2022-12-13 09:31:46,538 INFO L130 PetriNetUnfolder]: 120/329 cut-off events. [2022-12-13 09:31:46,538 INFO L131 PetriNetUnfolder]: For 461/473 co-relation queries the response was YES. [2022-12-13 09:31:46,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 329 events. 120/329 cut-off events. For 461/473 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1940 event pairs, 28 based on Foata normal form. 4/255 useless extension candidates. Maximal degree in co-relation 1084. Up to 172 conditions per place. [2022-12-13 09:31:46,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 53 transitions, 350 flow [2022-12-13 09:31:46,541 INFO L226 LiptonReduction]: Number of co-enabled transitions 622 [2022-12-13 09:31:46,543 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:46,544 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 09:31:46,544 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 350 flow [2022-12-13 09:31:46,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 09:31:46,544 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:46,544 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:46,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:31:46,544 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:46,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:46,545 INFO L85 PathProgramCache]: Analyzing trace with hash 576635417, now seen corresponding path program 1 times [2022-12-13 09:31:46,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:46,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618874272] [2022-12-13 09:31:46,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:46,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:46,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:46,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:46,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618874272] [2022-12-13 09:31:46,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618874272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:46,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:46,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:31:46,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987767346] [2022-12-13 09:31:46,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:46,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:31:46,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:46,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:31:46,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:31:46,674 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 09:31:46,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 350 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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 09:31:46,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:46,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 09:31:46,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:47,015 INFO L130 PetriNetUnfolder]: 2077/3297 cut-off events. [2022-12-13 09:31:47,016 INFO L131 PetriNetUnfolder]: For 10939/10948 co-relation queries the response was YES. [2022-12-13 09:31:47,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11536 conditions, 3297 events. 2077/3297 cut-off events. For 10939/10948 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 18217 event pairs, 509 based on Foata normal form. 286/2488 useless extension candidates. Maximal degree in co-relation 11515. Up to 2458 conditions per place. [2022-12-13 09:31:47,035 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 89 selfloop transitions, 20 changer transitions 8/126 dead transitions. [2022-12-13 09:31:47,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 126 transitions, 1055 flow [2022-12-13 09:31:47,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:47,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:31:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-12-13 09:31:47,036 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6848484848484848 [2022-12-13 09:31:47,037 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 350 flow. Second operand 5 states and 113 transitions. [2022-12-13 09:31:47,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 126 transitions, 1055 flow [2022-12-13 09:31:47,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 126 transitions, 1049 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:31:47,044 INFO L231 Difference]: Finished difference. Result has 63 places, 69 transitions, 480 flow [2022-12-13 09:31:47,044 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=480, PETRI_PLACES=63, PETRI_TRANSITIONS=69} [2022-12-13 09:31:47,045 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2022-12-13 09:31:47,045 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:47,045 INFO L89 Accepts]: Start accepts. Operand has 63 places, 69 transitions, 480 flow [2022-12-13 09:31:47,046 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:47,046 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:47,046 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 69 transitions, 480 flow [2022-12-13 09:31:47,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 69 transitions, 480 flow [2022-12-13 09:31:47,188 INFO L130 PetriNetUnfolder]: 1009/1841 cut-off events. [2022-12-13 09:31:47,188 INFO L131 PetriNetUnfolder]: For 3874/4181 co-relation queries the response was YES. [2022-12-13 09:31:47,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6704 conditions, 1841 events. 1009/1841 cut-off events. For 3874/4181 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 12900 event pairs, 425 based on Foata normal form. 39/1057 useless extension candidates. Maximal degree in co-relation 6683. Up to 1288 conditions per place. [2022-12-13 09:31:47,209 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 69 transitions, 480 flow [2022-12-13 09:31:47,210 INFO L226 LiptonReduction]: Number of co-enabled transitions 872 [2022-12-13 09:31:47,450 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L823-3-->L3: Formula: (and (= (mod v_~main$tmp_guard0~0_26 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_45) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [333] L781-->L784: 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] [2022-12-13 09:31:47,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L823-3-->L3: Formula: (and (= (mod v_~main$tmp_guard0~0_26 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_45) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [432] L781-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res#1.offset_7| 0) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P1Thread1of1ForFork0_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_7|, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, P1Thread1of1ForFork0_#res#1.offset] [2022-12-13 09:31:47,511 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L823-3-->L3: Formula: (and (= (mod v_~main$tmp_guard0~0_26 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_45) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [340] L801-->L804: 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] [2022-12-13 09:31:47,536 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L823-3-->L3: Formula: (and (= (mod v_~main$tmp_guard0~0_26 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_45) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [433] L781-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork0_#res#1.base_9| 0) (= |v_P1Thread1of1ForFork0_#res#1.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_9|, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_9|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, P1Thread1of1ForFork0_#res#1.offset] [2022-12-13 09:31:47,571 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L823-3-->L3: Formula: (and (= (mod v_~main$tmp_guard0~0_26 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_45) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [451] L801-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res.base_9| 0) (= v_~__unbuffered_cnt~0_101 (+ v_~__unbuffered_cnt~0_102 1)) (= |v_P2Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] [2022-12-13 09:31:47,606 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L823-3-->L3: Formula: (and (= (mod v_~main$tmp_guard0~0_26 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_45) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [325] L752-->L755: 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] [2022-12-13 09:31:47,630 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L823-3-->L3: Formula: (and (= (mod v_~main$tmp_guard0~0_26 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_45) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [450] L801-->P2FINAL: Formula: (and (= v_~__unbuffered_cnt~0_97 (+ v_~__unbuffered_cnt~0_98 1)) (= |v_P2Thread1of1ForFork1_#res.base_7| 0) (= |v_P2Thread1of1ForFork1_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] [2022-12-13 09:31:47,665 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L823-3-->L3: Formula: (and (= (mod v_~main$tmp_guard0~0_26 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_45) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [447] L752-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_88 1) v_~__unbuffered_cnt~0_87) (= |v_P0Thread1of1ForFork2_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] [2022-12-13 09:31:47,702 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L823-3-->L3: Formula: (and (= (mod v_~main$tmp_guard0~0_26 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_45) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [446] L752-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] [2022-12-13 09:31:47,742 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:31:47,742 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 697 [2022-12-13 09:31:47,742 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 67 transitions, 513 flow [2022-12-13 09:31:47,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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 09:31:47,743 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:47,743 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:47,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:31:47,743 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:47,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1343471673, now seen corresponding path program 1 times [2022-12-13 09:31:47,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:47,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136485817] [2022-12-13 09:31:47,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:47,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:47,877 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 09:31:47,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:47,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136485817] [2022-12-13 09:31:47,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136485817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:47,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:47,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:31:47,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234522078] [2022-12-13 09:31:47,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:47,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:31:47,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:47,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:31:47,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:31:47,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2022-12-13 09:31:47,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 67 transitions, 513 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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 09:31:47,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:47,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2022-12-13 09:31:47,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:48,215 INFO L130 PetriNetUnfolder]: 1516/2664 cut-off events. [2022-12-13 09:31:48,215 INFO L131 PetriNetUnfolder]: For 10330/10332 co-relation queries the response was YES. [2022-12-13 09:31:48,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12433 conditions, 2664 events. 1516/2664 cut-off events. For 10330/10332 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 16416 event pairs, 107 based on Foata normal form. 233/1977 useless extension candidates. Maximal degree in co-relation 12409. Up to 1588 conditions per place. [2022-12-13 09:31:48,231 INFO L137 encePairwiseOnDemand]: 20/41 looper letters, 72 selfloop transitions, 38 changer transitions 17/135 dead transitions. [2022-12-13 09:31:48,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 135 transitions, 1265 flow [2022-12-13 09:31:48,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:31:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2022-12-13 09:31:48,232 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2022-12-13 09:31:48,232 INFO L175 Difference]: Start difference. First operand has 61 places, 67 transitions, 513 flow. Second operand 6 states and 138 transitions. [2022-12-13 09:31:48,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 135 transitions, 1265 flow [2022-12-13 09:31:48,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 135 transitions, 1237 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-13 09:31:48,243 INFO L231 Difference]: Finished difference. Result has 68 places, 86 transitions, 748 flow [2022-12-13 09:31:48,244 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=748, PETRI_PLACES=68, PETRI_TRANSITIONS=86} [2022-12-13 09:31:48,244 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -2 predicate places. [2022-12-13 09:31:48,244 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:48,244 INFO L89 Accepts]: Start accepts. Operand has 68 places, 86 transitions, 748 flow [2022-12-13 09:31:48,245 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:48,245 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:48,246 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 86 transitions, 748 flow [2022-12-13 09:31:48,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 86 transitions, 748 flow [2022-12-13 09:31:48,366 INFO L130 PetriNetUnfolder]: 595/1380 cut-off events. [2022-12-13 09:31:48,366 INFO L131 PetriNetUnfolder]: For 5087/5491 co-relation queries the response was YES. [2022-12-13 09:31:48,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6716 conditions, 1380 events. 595/1380 cut-off events. For 5087/5491 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 10867 event pairs, 104 based on Foata normal form. 11/779 useless extension candidates. Maximal degree in co-relation 6691. Up to 1009 conditions per place. [2022-12-13 09:31:48,381 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 86 transitions, 748 flow [2022-12-13 09:31:48,381 INFO L226 LiptonReduction]: Number of co-enabled transitions 954 [2022-12-13 09:31:49,189 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:31:49,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 946 [2022-12-13 09:31:49,190 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 86 transitions, 760 flow [2022-12-13 09:31:49,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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 09:31:49,191 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:49,191 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:49,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:31:49,191 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:49,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:49,191 INFO L85 PathProgramCache]: Analyzing trace with hash -853912117, now seen corresponding path program 1 times [2022-12-13 09:31:49,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:49,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670495090] [2022-12-13 09:31:49,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:49,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:49,482 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 09:31:49,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:49,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670495090] [2022-12-13 09:31:49,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670495090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:49,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:49,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:31:49,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273214148] [2022-12-13 09:31:49,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:49,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:31:49,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:49,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:31:49,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:31:49,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2022-12-13 09:31:49,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 86 transitions, 760 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:49,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:49,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2022-12-13 09:31:49,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:50,051 INFO L130 PetriNetUnfolder]: 2116/3739 cut-off events. [2022-12-13 09:31:50,052 INFO L131 PetriNetUnfolder]: For 17855/18205 co-relation queries the response was YES. [2022-12-13 09:31:50,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20193 conditions, 3739 events. 2116/3739 cut-off events. For 17855/18205 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 25377 event pairs, 399 based on Foata normal form. 165/3182 useless extension candidates. Maximal degree in co-relation 20165. Up to 2178 conditions per place. [2022-12-13 09:31:50,071 INFO L137 encePairwiseOnDemand]: 35/42 looper letters, 45 selfloop transitions, 5 changer transitions 114/175 dead transitions. [2022-12-13 09:31:50,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 175 transitions, 1854 flow [2022-12-13 09:31:50,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:31:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2022-12-13 09:31:50,073 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2022-12-13 09:31:50,073 INFO L175 Difference]: Start difference. First operand has 68 places, 86 transitions, 760 flow. Second operand 6 states and 128 transitions. [2022-12-13 09:31:50,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 175 transitions, 1854 flow [2022-12-13 09:31:50,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 175 transitions, 1645 flow, removed 80 selfloop flow, removed 1 redundant places. [2022-12-13 09:31:50,167 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 437 flow [2022-12-13 09:31:50,167 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=437, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2022-12-13 09:31:50,168 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, 4 predicate places. [2022-12-13 09:31:50,168 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:50,168 INFO L89 Accepts]: Start accepts. Operand has 74 places, 57 transitions, 437 flow [2022-12-13 09:31:50,169 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:50,169 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:50,169 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 57 transitions, 437 flow [2022-12-13 09:31:50,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 57 transitions, 437 flow [2022-12-13 09:31:50,241 INFO L130 PetriNetUnfolder]: 348/722 cut-off events. [2022-12-13 09:31:50,241 INFO L131 PetriNetUnfolder]: For 3811/3982 co-relation queries the response was YES. [2022-12-13 09:31:50,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3406 conditions, 722 events. 348/722 cut-off events. For 3811/3982 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 4380 event pairs, 93 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 3378. Up to 355 conditions per place. [2022-12-13 09:31:50,248 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 57 transitions, 437 flow [2022-12-13 09:31:50,248 INFO L226 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-13 09:31:50,270 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:31:50,271 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 09:31:50,271 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 447 flow [2022-12-13 09:31:50,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:50,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:50,272 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:50,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:31:50,272 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:50,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:50,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1576240113, now seen corresponding path program 2 times [2022-12-13 09:31:50,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:50,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094565890] [2022-12-13 09:31:50,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:50,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:50,421 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 09:31:50,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:50,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094565890] [2022-12-13 09:31:50,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094565890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:50,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:50,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:31:50,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176728395] [2022-12-13 09:31:50,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:50,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:31:50,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:50,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:31:50,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:31:50,424 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-13 09:31:50,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 447 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 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 09:31:50,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:50,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-13 09:31:50,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:50,645 INFO L130 PetriNetUnfolder]: 361/749 cut-off events. [2022-12-13 09:31:50,646 INFO L131 PetriNetUnfolder]: For 4961/4961 co-relation queries the response was YES. [2022-12-13 09:31:50,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3787 conditions, 749 events. 361/749 cut-off events. For 4961/4961 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4108 event pairs, 7 based on Foata normal form. 99/593 useless extension candidates. Maximal degree in co-relation 3756. Up to 331 conditions per place. [2022-12-13 09:31:50,650 INFO L137 encePairwiseOnDemand]: 19/31 looper letters, 39 selfloop transitions, 28 changer transitions 14/86 dead transitions. [2022-12-13 09:31:50,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 86 transitions, 851 flow [2022-12-13 09:31:50,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:31:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:31:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-12-13 09:31:50,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46543778801843316 [2022-12-13 09:31:50,651 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 447 flow. Second operand 7 states and 101 transitions. [2022-12-13 09:31:50,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 86 transitions, 851 flow [2022-12-13 09:31:50,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 86 transitions, 748 flow, removed 38 selfloop flow, removed 10 redundant places. [2022-12-13 09:31:50,658 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 459 flow [2022-12-13 09:31:50,658 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=459, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2022-12-13 09:31:50,658 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -4 predicate places. [2022-12-13 09:31:50,659 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:50,659 INFO L89 Accepts]: Start accepts. Operand has 66 places, 57 transitions, 459 flow [2022-12-13 09:31:50,660 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:50,660 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:50,660 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 57 transitions, 459 flow [2022-12-13 09:31:50,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 57 transitions, 459 flow [2022-12-13 09:31:50,687 INFO L130 PetriNetUnfolder]: 114/332 cut-off events. [2022-12-13 09:31:50,688 INFO L131 PetriNetUnfolder]: For 649/823 co-relation queries the response was YES. [2022-12-13 09:31:50,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 332 events. 114/332 cut-off events. For 649/823 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 1850 event pairs, 3 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 1406. Up to 172 conditions per place. [2022-12-13 09:31:50,690 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 57 transitions, 459 flow [2022-12-13 09:31:50,690 INFO L226 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-13 09:31:52,724 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:31:52,725 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2066 [2022-12-13 09:31:52,725 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 455 flow [2022-12-13 09:31:52,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 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 09:31:52,725 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:52,725 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:52,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 09:31:52,726 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:52,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:52,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2047685731, now seen corresponding path program 1 times [2022-12-13 09:31:52,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:52,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152390843] [2022-12-13 09:31:52,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:52,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:53,215 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 09:31:53,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:53,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152390843] [2022-12-13 09:31:53,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152390843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:53,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:53,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:31:53,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933194821] [2022-12-13 09:31:53,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:53,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:31:53,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:53,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:31:53,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:31:53,217 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2022-12-13 09:31:53,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 455 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 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 09:31:53,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:53,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2022-12-13 09:31:53,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:53,361 INFO L130 PetriNetUnfolder]: 376/708 cut-off events. [2022-12-13 09:31:53,361 INFO L131 PetriNetUnfolder]: For 3332/3407 co-relation queries the response was YES. [2022-12-13 09:31:53,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3738 conditions, 708 events. 376/708 cut-off events. For 3332/3407 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 3700 event pairs, 45 based on Foata normal form. 64/589 useless extension candidates. Maximal degree in co-relation 3711. Up to 405 conditions per place. [2022-12-13 09:31:53,365 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 50 selfloop transitions, 9 changer transitions 9/80 dead transitions. [2022-12-13 09:31:53,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 80 transitions, 787 flow [2022-12-13 09:31:53,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:31:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:31:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-13 09:31:53,366 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4482758620689655 [2022-12-13 09:31:53,366 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 455 flow. Second operand 5 states and 65 transitions. [2022-12-13 09:31:53,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 80 transitions, 787 flow [2022-12-13 09:31:53,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 80 transitions, 634 flow, removed 36 selfloop flow, removed 8 redundant places. [2022-12-13 09:31:53,374 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 385 flow [2022-12-13 09:31:53,374 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=385, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2022-12-13 09:31:53,374 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -11 predicate places. [2022-12-13 09:31:53,374 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:53,375 INFO L89 Accepts]: Start accepts. Operand has 59 places, 55 transitions, 385 flow [2022-12-13 09:31:53,375 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:53,375 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:53,375 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 55 transitions, 385 flow [2022-12-13 09:31:53,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 55 transitions, 385 flow [2022-12-13 09:31:53,405 INFO L130 PetriNetUnfolder]: 220/482 cut-off events. [2022-12-13 09:31:53,405 INFO L131 PetriNetUnfolder]: For 627/657 co-relation queries the response was YES. [2022-12-13 09:31:53,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 482 events. 220/482 cut-off events. For 627/657 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 2892 event pairs, 5 based on Foata normal form. 6/184 useless extension candidates. Maximal degree in co-relation 1451. Up to 226 conditions per place. [2022-12-13 09:31:53,407 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 55 transitions, 385 flow [2022-12-13 09:31:53,407 INFO L226 LiptonReduction]: Number of co-enabled transitions 366 [2022-12-13 09:31:53,756 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [489] $Ultimate##0-->L794: Formula: (and (= v_~x$r_buff0_thd2~0_196 1) (= v_~__unbuffered_p2_EAX~0_170 1) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_663 256) 0)) (not (= (mod v_~x$w_buff1_used~0_616 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|) (= v_~x$r_buff0_thd0~0_424 v_~x$r_buff1_thd0~0_432) (= v_~x$r_buff0_thd2~0_197 v_~x$r_buff1_thd2~0_161) (= v_~x$w_buff0_used~0_663 1) (= v_~x$w_buff0_used~0_664 v_~x$w_buff1_used~0_616) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35| 0)) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_23| |v_P1Thread1of1ForFork0_~arg#1.offset_23|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|) (= v_~x$w_buff0~0_467 v_~x$w_buff1~0_435) (= |v_P1Thread1of1ForFork0_~arg#1.base_23| |v_P1Thread1of1ForFork0_#in~arg#1.base_23|) (= v_P2Thread1of1ForFork1_~arg.offset_17 |v_P2Thread1of1ForFork1_#in~arg.offset_17|) (= v_~y~0_222 2) (= v_~x$r_buff0_thd3~0_107 v_~x$r_buff1_thd3~0_111) (= v_~x$r_buff0_thd1~0_111 v_~x$r_buff1_thd1~0_111) (= v_P2Thread1of1ForFork1_~arg.base_17 |v_P2Thread1of1ForFork1_#in~arg.base_17|) (= 2 v_~x$w_buff0~0_466)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff0~0=v_~x$w_buff0~0_467, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_424, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_23|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_111, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_197, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_23|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_664} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff0~0=v_~x$w_buff0~0_466, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_424, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_111, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_23|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_23|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_17, ~x$w_buff1~0=v_~x$w_buff1~0_435, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_111, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_161, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_616, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_111, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_196, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_432, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_23|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_663, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_23|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_170, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~y~0=v_~y~0_222} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, P2Thread1of1ForFork1_~arg.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~y~0] and [486] $Ultimate##0-->L745: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_51| v_P0Thread1of1ForFork2_~arg.offset_51) (= v_P0Thread1of1ForFork2_~arg.base_51 |v_P0Thread1of1ForFork2_#in~arg.base_51|) (= v_~x~0_549 1) (= v_~y~0_216 v_~__unbuffered_p0_EAX~0_192)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_51|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_51|, ~y~0=v_~y~0_216} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_192, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_51|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_51, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_51|, ~y~0=v_~y~0_216, ~x~0=v_~x~0_549, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_51} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, ~x~0, P0Thread1of1ForFork2_~arg.base] [2022-12-13 09:31:53,894 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:31:53,895 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 521 [2022-12-13 09:31:53,895 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 377 flow [2022-12-13 09:31:53,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 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 09:31:53,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:53,895 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:53,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 09:31:53,895 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:53,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:53,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2063607245, now seen corresponding path program 1 times [2022-12-13 09:31:53,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:53,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152918208] [2022-12-13 09:31:53,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:53,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:31:53,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:31:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:31:54,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:31:54,023 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:31:54,024 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 09:31:54,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 09:31:54,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 09:31:54,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 09:31:54,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 09:31:54,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 09:31:54,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 09:31:54,027 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:54,031 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:31:54,031 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:31:54,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:31:54 BasicIcfg [2022-12-13 09:31:54,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:31:54,107 INFO L158 Benchmark]: Toolchain (without parser) took 26707.47ms. Allocated memory was 189.8MB in the beginning and 807.4MB in the end (delta: 617.6MB). Free memory was 150.6MB in the beginning and 635.8MB in the end (delta: -485.1MB). Peak memory consumption was 133.0MB. Max. memory is 8.0GB. [2022-12-13 09:31:54,108 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 189.8MB. Free memory was 166.4MB in the beginning and 166.3MB in the end (delta: 99.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:31:54,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.67ms. Allocated memory is still 189.8MB. Free memory was 150.6MB in the beginning and 124.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 09:31:54,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.82ms. Allocated memory is still 189.8MB. Free memory was 124.4MB in the beginning and 121.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:31:54,108 INFO L158 Benchmark]: Boogie Preprocessor took 24.27ms. Allocated memory is still 189.8MB. Free memory was 121.8MB in the beginning and 119.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:31:54,109 INFO L158 Benchmark]: RCFGBuilder took 674.51ms. Allocated memory is still 189.8MB. Free memory was 119.7MB in the beginning and 83.5MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-13 09:31:54,109 INFO L158 Benchmark]: TraceAbstraction took 25409.96ms. Allocated memory was 189.8MB in the beginning and 807.4MB in the end (delta: 617.6MB). Free memory was 82.5MB in the beginning and 635.8MB in the end (delta: -553.3MB). Peak memory consumption was 64.8MB. Max. memory is 8.0GB. [2022-12-13 09:31:54,110 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.13ms. Allocated memory is still 189.8MB. Free memory was 166.4MB in the beginning and 166.3MB in the end (delta: 99.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 525.67ms. Allocated memory is still 189.8MB. Free memory was 150.6MB in the beginning and 124.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.82ms. Allocated memory is still 189.8MB. Free memory was 124.4MB in the beginning and 121.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.27ms. Allocated memory is still 189.8MB. Free memory was 121.8MB in the beginning and 119.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 674.51ms. Allocated memory is still 189.8MB. Free memory was 119.7MB in the beginning and 83.5MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 25409.96ms. Allocated memory was 189.8MB in the beginning and 807.4MB in the end (delta: 617.6MB). Free memory was 82.5MB in the beginning and 635.8MB in the end (delta: -553.3MB). Peak memory consumption was 64.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6s, 112 PlacesBefore, 70 PlacesAfterwards, 104 TransitionsBefore, 61 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 4 ChoiceCompositions, 84 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2820, independent: 2699, independent conditional: 2699, independent unconditional: 0, dependent: 121, dependent conditional: 121, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2037, independent: 1981, independent conditional: 0, independent unconditional: 1981, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2037, independent: 1981, independent conditional: 0, independent unconditional: 1981, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2037, independent: 1949, independent conditional: 0, independent unconditional: 1949, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 88, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 420, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 317, dependent conditional: 0, dependent unconditional: 317, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2820, independent: 718, independent conditional: 718, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 2037, unknown conditional: 2037, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2067, Positive cache size: 2011, Positive conditional cache size: 2011, Positive unconditional cache size: 0, Negative cache size: 56, Negative conditional cache size: 56, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 233, independent: 199, independent conditional: 199, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 201, independent: 178, independent conditional: 15, independent unconditional: 163, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 201, independent: 178, independent conditional: 15, independent unconditional: 163, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 201, independent: 160, independent conditional: 0, independent unconditional: 160, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 48, dependent conditional: 10, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 233, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 201, unknown conditional: 201, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 178, Positive conditional cache size: 178, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 650 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 4, independent unconditional: 8, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 4, independent unconditional: 8, 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: 13, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 214, Positive cache size: 190, Positive conditional cache size: 190, Positive unconditional cache size: 0, Negative cache size: 24, Negative conditional cache size: 24, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 776 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 81, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 81, independent: 65, independent conditional: 65, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 197, Positive conditional cache size: 197, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 774 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, independent: 71, independent conditional: 71, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 198, Positive conditional cache size: 198, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 56 PlacesBefore, 56 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 612 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 153, independent: 137, independent conditional: 137, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 12, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 12, independent unconditional: 10, 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: 22, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 153, independent: 115, independent conditional: 115, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 220, Positive conditional cache size: 220, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 646 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 88, independent conditional: 88, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 99, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 228, Positive conditional cache size: 228, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 516 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 230, Positive conditional cache size: 230, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 36, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 237, Positive conditional cache size: 237, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 622 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 270, Positive cache size: 241, Positive conditional cache size: 241, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 63 PlacesBefore, 61 PlacesAfterwards, 69 TransitionsBefore, 67 TransitionsAfterwards, 872 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 266, independent: 266, independent conditional: 266, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 29, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 29, independent unconditional: 6, 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: 35, independent: 35, independent conditional: 0, independent unconditional: 35, 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: 266, independent: 231, independent conditional: 231, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 276, Positive conditional cache size: 276, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 68 PlacesBefore, 68 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 954 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 285, Positive conditional cache size: 285, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 299, Positive conditional cache size: 299, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 64 PlacesBefore, 62 PlacesAfterwards, 57 TransitionsBefore, 55 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 299, Positive conditional cache size: 299, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 59 PlacesBefore, 56 PlacesAfterwards, 55 TransitionsBefore, 53 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 344, Positive cache size: 315, Positive conditional cache size: 315, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1804; [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1804, ((void *)0), P0, ((void *)0))=-1, t1804={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1805; [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1805, ((void *)0), P1, ((void *)0))=0, t1804={5:0}, t1805={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1806; [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1806, ((void *)0), P2, ((void *)0))=1, t1804={5:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 [L773] 2 y = 1 [L790] 2 __unbuffered_p2_EAX = y [L793] 2 y = 2 [L741] 2 __unbuffered_p0_EAX = y [L744] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 819]: 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: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 423 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 423 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1294 IncrementalHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 21 mSDtfsCounter, 1294 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=760occurred in iteration=11, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 1452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:31:54,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...