/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:43:40,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:43:40,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:43:40,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:43:40,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:43:40,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:43:40,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:43:40,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:43:40,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:43:40,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:43:40,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:43:40,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:43:40,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:43:40,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:43:40,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:43:40,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:43:40,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:43:40,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:43:40,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:43:40,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:43:40,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:43:40,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:43:40,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:43:40,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:43:40,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:43:40,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:43:40,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:43:40,821 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:43:40,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:43:40,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:43:40,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:43:40,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:43:40,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:43:40,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:43:40,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:43:40,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:43:40,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:43:40,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:43:40,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:43:40,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:43:40,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:43:40,828 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:43:40,843 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:43:40,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:43:40,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:43:40,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:43:40,845 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:43:40,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:43:40,845 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:43:40,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:43:40,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:43:40,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:43:40,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:43:40,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:43:40,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:43:40,846 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:43:40,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:43:40,846 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:43:40,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:43:40,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:43:40,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:43:40,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:43:40,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:43:40,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:43:40,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:43:40,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:43:40,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:43:40,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:43:40,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:43:40,848 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:43:40,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:43:41,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:43:41,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:43:41,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:43:41,182 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:43:41,185 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:43:41,186 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 00:43:42,198 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:43:42,491 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:43:42,492 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 00:43:42,524 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26c8701bc/d977e2c5ade940fb96aac3882075e1e3/FLAG5213a5923 [2022-12-13 00:43:42,542 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26c8701bc/d977e2c5ade940fb96aac3882075e1e3 [2022-12-13 00:43:42,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:43:42,546 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:43:42,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:43:42,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:43:42,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:43:42,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:43:42" (1/1) ... [2022-12-13 00:43:42,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@648ef877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:42, skipping insertion in model container [2022-12-13 00:43:42,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:43:42" (1/1) ... [2022-12-13 00:43:42,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:43:42,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:43:42,734 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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-13 00:43:42,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:43:42,902 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:43:42,912 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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-13 00:43:42,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:43:42,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:43:42,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:43:43,016 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:43:43,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:43 WrapperNode [2022-12-13 00:43:43,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:43:43,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:43:43,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:43:43,018 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:43:43,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:43" (1/1) ... [2022-12-13 00:43:43,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:43" (1/1) ... [2022-12-13 00:43:43,082 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-12-13 00:43:43,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:43:43,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:43:43,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:43:43,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:43:43,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:43" (1/1) ... [2022-12-13 00:43:43,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:43" (1/1) ... [2022-12-13 00:43:43,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:43" (1/1) ... [2022-12-13 00:43:43,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:43" (1/1) ... [2022-12-13 00:43:43,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:43" (1/1) ... [2022-12-13 00:43:43,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:43" (1/1) ... [2022-12-13 00:43:43,112 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:43" (1/1) ... [2022-12-13 00:43:43,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:43" (1/1) ... [2022-12-13 00:43:43,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:43:43,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:43:43,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:43:43,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:43:43,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:43" (1/1) ... [2022-12-13 00:43:43,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:43:43,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:43:43,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:43:43,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:43:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:43:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:43:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:43:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:43:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:43:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:43:43,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:43:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:43:43,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:43:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:43:43,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:43:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:43:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:43:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:43:43,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:43:43,184 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:43:43,281 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:43:43,282 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:43:43,534 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:43:43,644 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:43:43,644 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:43:43,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:43:43 BoogieIcfgContainer [2022-12-13 00:43:43,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:43:43,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:43:43,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:43:43,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:43:43,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:43:42" (1/3) ... [2022-12-13 00:43:43,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607f8172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:43:43, skipping insertion in model container [2022-12-13 00:43:43,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:43:43" (2/3) ... [2022-12-13 00:43:43,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607f8172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:43:43, skipping insertion in model container [2022-12-13 00:43:43,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:43:43" (3/3) ... [2022-12-13 00:43:43,657 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 00:43:43,673 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:43:43,673 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:43:43,673 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:43:43,723 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:43:43,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-13 00:43:43,818 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-13 00:43:43,818 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:43:43,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 00:43:43,824 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-13 00:43:43,827 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-13 00:43:43,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:43:43,847 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-13 00:43:43,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2022-12-13 00:43:43,889 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-13 00:43:43,889 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:43:43,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 00:43:43,893 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-13 00:43:43,894 INFO L226 LiptonReduction]: Number of co-enabled transitions 1944 [2022-12-13 00:43:51,395 INFO L241 LiptonReduction]: Total number of compositions: 87 [2022-12-13 00:43:51,412 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:43:51,418 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;@24345006, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:43:51,418 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:43:51,422 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 00:43:51,422 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:43:51,422 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:43:51,423 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:43:51,423 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:43:51,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:43:51,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1797002814, now seen corresponding path program 1 times [2022-12-13 00:43:51,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:43:51,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883294756] [2022-12-13 00:43:51,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:43:51,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:43:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:43:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:43:51,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:43:51,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883294756] [2022-12-13 00:43:51,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883294756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:43:51,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:43:51,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:43:51,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898788503] [2022-12-13 00:43:51,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:43:51,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:43:51,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:43:51,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:43:51,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:43:51,890 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 56 [2022-12-13 00:43:51,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:51,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:43:51,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 56 [2022-12-13 00:43:51,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:43:53,133 INFO L130 PetriNetUnfolder]: 7385/12163 cut-off events. [2022-12-13 00:43:53,133 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 00:43:53,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22772 conditions, 12163 events. 7385/12163 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 899. Compared 95309 event pairs, 855 based on Foata normal form. 0/7054 useless extension candidates. Maximal degree in co-relation 22761. Up to 9131 conditions per place. [2022-12-13 00:43:53,178 INFO L137 encePairwiseOnDemand]: 51/56 looper letters, 28 selfloop transitions, 3 changer transitions 44/86 dead transitions. [2022-12-13 00:43:53,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 86 transitions, 331 flow [2022-12-13 00:43:53,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:43:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:43:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-12-13 00:43:53,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2022-12-13 00:43:53,205 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 121 flow. Second operand 3 states and 111 transitions. [2022-12-13 00:43:53,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 86 transitions, 331 flow [2022-12-13 00:43:53,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 86 transitions, 328 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:43:53,210 INFO L231 Difference]: Finished difference. Result has 63 places, 32 transitions, 76 flow [2022-12-13 00:43:53,211 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=63, PETRI_TRANSITIONS=32} [2022-12-13 00:43:53,214 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -3 predicate places. [2022-12-13 00:43:53,215 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:43:53,215 INFO L89 Accepts]: Start accepts. Operand has 63 places, 32 transitions, 76 flow [2022-12-13 00:43:53,217 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:43:53,217 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:43:53,217 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 32 transitions, 76 flow [2022-12-13 00:43:53,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 76 flow [2022-12-13 00:43:53,224 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 00:43:53,225 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:43:53,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:43:53,227 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 76 flow [2022-12-13 00:43:53,227 INFO L226 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-13 00:43:53,287 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:43:53,289 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-13 00:43:53,289 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 76 flow [2022-12-13 00:43:53,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:53,289 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:43:53,289 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:43:53,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:43:53,289 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:43:53,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:43:53,290 INFO L85 PathProgramCache]: Analyzing trace with hash 342955412, now seen corresponding path program 1 times [2022-12-13 00:43:53,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:43:53,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805623339] [2022-12-13 00:43:53,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:43:53,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:43:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:43:53,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:43:53,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:43:53,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805623339] [2022-12-13 00:43:53,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805623339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:43:53,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:43:53,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:43:53,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356945800] [2022-12-13 00:43:53,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:43:53,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:43:53,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:43:53,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:43:53,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:43:53,900 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 00:43:53,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:53,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:43:53,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 00:43:53,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:43:54,252 INFO L130 PetriNetUnfolder]: 2686/4263 cut-off events. [2022-12-13 00:43:54,252 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2022-12-13 00:43:54,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8506 conditions, 4263 events. 2686/4263 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 23407 event pairs, 758 based on Foata normal form. 180/3638 useless extension candidates. Maximal degree in co-relation 8496. Up to 2235 conditions per place. [2022-12-13 00:43:54,272 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 40 selfloop transitions, 8 changer transitions 1/56 dead transitions. [2022-12-13 00:43:54,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 222 flow [2022-12-13 00:43:54,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:43:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:43:54,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-12-13 00:43:54,274 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6171875 [2022-12-13 00:43:54,274 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 76 flow. Second operand 4 states and 79 transitions. [2022-12-13 00:43:54,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 222 flow [2022-12-13 00:43:54,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:43:54,276 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 128 flow [2022-12-13 00:43:54,276 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=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2022-12-13 00:43:54,277 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -21 predicate places. [2022-12-13 00:43:54,277 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:43:54,277 INFO L89 Accepts]: Start accepts. Operand has 45 places, 37 transitions, 128 flow [2022-12-13 00:43:54,278 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:43:54,278 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:43:54,278 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 37 transitions, 128 flow [2022-12-13 00:43:54,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 128 flow [2022-12-13 00:43:54,298 INFO L130 PetriNetUnfolder]: 107/338 cut-off events. [2022-12-13 00:43:54,298 INFO L131 PetriNetUnfolder]: For 43/47 co-relation queries the response was YES. [2022-12-13 00:43:54,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 338 events. 107/338 cut-off events. For 43/47 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2130 event pairs, 56 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 624. Up to 160 conditions per place. [2022-12-13 00:43:54,300 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 37 transitions, 128 flow [2022-12-13 00:43:54,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 606 [2022-12-13 00:43:54,307 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:43:54,308 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 00:43:54,308 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 128 flow [2022-12-13 00:43:54,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:54,308 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:43:54,308 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:43:54,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:43:54,309 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:43:54,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:43:54,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1219153128, now seen corresponding path program 1 times [2022-12-13 00:43:54,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:43:54,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032653008] [2022-12-13 00:43:54,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:43:54,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:43:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:43:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:43:54,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:43:54,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032653008] [2022-12-13 00:43:54,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032653008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:43:54,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:43:54,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:43:54,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7219963] [2022-12-13 00:43:54,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:43:54,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:43:54,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:43:54,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:43:54,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:43:54,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2022-12-13 00:43:54,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:54,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:43:54,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2022-12-13 00:43:54,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:43:54,647 INFO L130 PetriNetUnfolder]: 1828/3084 cut-off events. [2022-12-13 00:43:54,648 INFO L131 PetriNetUnfolder]: For 1375/1384 co-relation queries the response was YES. [2022-12-13 00:43:54,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7464 conditions, 3084 events. 1828/3084 cut-off events. For 1375/1384 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 18500 event pairs, 705 based on Foata normal form. 10/2462 useless extension candidates. Maximal degree in co-relation 7451. Up to 2600 conditions per place. [2022-12-13 00:43:54,664 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 36 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2022-12-13 00:43:54,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 252 flow [2022-12-13 00:43:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:43:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:43:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 00:43:54,665 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6989247311827957 [2022-12-13 00:43:54,665 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 128 flow. Second operand 3 states and 65 transitions. [2022-12-13 00:43:54,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 252 flow [2022-12-13 00:43:54,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:43:54,668 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 160 flow [2022-12-13 00:43:54,668 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2022-12-13 00:43:54,668 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -20 predicate places. [2022-12-13 00:43:54,668 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:43:54,669 INFO L89 Accepts]: Start accepts. Operand has 46 places, 40 transitions, 160 flow [2022-12-13 00:43:54,669 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:43:54,669 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:43:54,669 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 40 transitions, 160 flow [2022-12-13 00:43:54,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 160 flow [2022-12-13 00:43:54,688 INFO L130 PetriNetUnfolder]: 101/336 cut-off events. [2022-12-13 00:43:54,688 INFO L131 PetriNetUnfolder]: For 115/127 co-relation queries the response was YES. [2022-12-13 00:43:54,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 336 events. 101/336 cut-off events. For 115/127 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2109 event pairs, 52 based on Foata normal form. 2/236 useless extension candidates. Maximal degree in co-relation 677. Up to 153 conditions per place. [2022-12-13 00:43:54,691 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 40 transitions, 160 flow [2022-12-13 00:43:54,691 INFO L226 LiptonReduction]: Number of co-enabled transitions 648 [2022-12-13 00:43:54,697 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:43:54,698 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 00:43:54,698 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 160 flow [2022-12-13 00:43:54,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:54,699 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:43:54,699 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:43:54,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:43:54,699 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:43:54,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:43:54,699 INFO L85 PathProgramCache]: Analyzing trace with hash 744660016, now seen corresponding path program 1 times [2022-12-13 00:43:54,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:43:54,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975826065] [2022-12-13 00:43:54,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:43:54,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:43:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:43:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:43:55,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:43:55,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975826065] [2022-12-13 00:43:55,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975826065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:43:55,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:43:55,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:43:55,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94257152] [2022-12-13 00:43:55,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:43:55,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:43:55,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:43:55,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:43:55,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:43:55,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 00:43:55,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:55,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:43:55,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 00:43:55,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:43:55,933 INFO L130 PetriNetUnfolder]: 2509/3994 cut-off events. [2022-12-13 00:43:55,934 INFO L131 PetriNetUnfolder]: For 2550/2550 co-relation queries the response was YES. [2022-12-13 00:43:55,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10536 conditions, 3994 events. 2509/3994 cut-off events. For 2550/2550 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 21771 event pairs, 613 based on Foata normal form. 26/3340 useless extension candidates. Maximal degree in co-relation 10521. Up to 3049 conditions per place. [2022-12-13 00:43:55,963 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 67 selfloop transitions, 15 changer transitions 0/89 dead transitions. [2022-12-13 00:43:55,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 534 flow [2022-12-13 00:43:55,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:43:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:43:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 00:43:55,969 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6193548387096774 [2022-12-13 00:43:55,969 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 160 flow. Second operand 5 states and 96 transitions. [2022-12-13 00:43:55,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 534 flow [2022-12-13 00:43:55,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:43:55,975 INFO L231 Difference]: Finished difference. Result has 52 places, 54 transitions, 291 flow [2022-12-13 00:43:55,976 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=52, PETRI_TRANSITIONS=54} [2022-12-13 00:43:55,977 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -14 predicate places. [2022-12-13 00:43:55,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:43:55,977 INFO L89 Accepts]: Start accepts. Operand has 52 places, 54 transitions, 291 flow [2022-12-13 00:43:55,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:43:55,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:43:55,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 54 transitions, 291 flow [2022-12-13 00:43:55,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 54 transitions, 291 flow [2022-12-13 00:43:56,013 INFO L130 PetriNetUnfolder]: 160/480 cut-off events. [2022-12-13 00:43:56,014 INFO L131 PetriNetUnfolder]: For 338/346 co-relation queries the response was YES. [2022-12-13 00:43:56,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 480 events. 160/480 cut-off events. For 338/346 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3190 event pairs, 55 based on Foata normal form. 4/353 useless extension candidates. Maximal degree in co-relation 1249. Up to 215 conditions per place. [2022-12-13 00:43:56,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 54 transitions, 291 flow [2022-12-13 00:43:56,018 INFO L226 LiptonReduction]: Number of co-enabled transitions 820 [2022-12-13 00:43:56,022 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:43:56,023 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 00:43:56,023 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 54 transitions, 291 flow [2022-12-13 00:43:56,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:56,023 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:43:56,023 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:43:56,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:43:56,023 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:43:56,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:43:56,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2010575818, now seen corresponding path program 1 times [2022-12-13 00:43:56,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:43:56,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590460041] [2022-12-13 00:43:56,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:43:56,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:43:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:43:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:43:56,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:43:56,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590460041] [2022-12-13 00:43:56,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590460041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:43:56,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:43:56,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:43:56,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697061903] [2022-12-13 00:43:56,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:43:56,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:43:56,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:43:56,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:43:56,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:43:56,634 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 00:43:56,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 54 transitions, 291 flow. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:56,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:43:56,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 00:43:56,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:43:57,192 INFO L130 PetriNetUnfolder]: 2940/4663 cut-off events. [2022-12-13 00:43:57,193 INFO L131 PetriNetUnfolder]: For 5312/5312 co-relation queries the response was YES. [2022-12-13 00:43:57,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14648 conditions, 4663 events. 2940/4663 cut-off events. For 5312/5312 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 25995 event pairs, 187 based on Foata normal form. 20/3918 useless extension candidates. Maximal degree in co-relation 14629. Up to 2710 conditions per place. [2022-12-13 00:43:57,223 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 81 selfloop transitions, 52 changer transitions 0/140 dead transitions. [2022-12-13 00:43:57,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 140 transitions, 948 flow [2022-12-13 00:43:57,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:43:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:43:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2022-12-13 00:43:57,226 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6088709677419355 [2022-12-13 00:43:57,226 INFO L175 Difference]: Start difference. First operand has 52 places, 54 transitions, 291 flow. Second operand 8 states and 151 transitions. [2022-12-13 00:43:57,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 140 transitions, 948 flow [2022-12-13 00:43:57,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 140 transitions, 948 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:43:57,234 INFO L231 Difference]: Finished difference. Result has 64 places, 95 transitions, 794 flow [2022-12-13 00:43:57,234 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=794, PETRI_PLACES=64, PETRI_TRANSITIONS=95} [2022-12-13 00:43:57,235 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2022-12-13 00:43:57,235 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:43:57,235 INFO L89 Accepts]: Start accepts. Operand has 64 places, 95 transitions, 794 flow [2022-12-13 00:43:57,236 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:43:57,236 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:43:57,236 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 95 transitions, 794 flow [2022-12-13 00:43:57,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 95 transitions, 794 flow [2022-12-13 00:43:57,280 INFO L130 PetriNetUnfolder]: 242/650 cut-off events. [2022-12-13 00:43:57,281 INFO L131 PetriNetUnfolder]: For 1221/1251 co-relation queries the response was YES. [2022-12-13 00:43:57,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2338 conditions, 650 events. 242/650 cut-off events. For 1221/1251 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4372 event pairs, 21 based on Foata normal form. 7/500 useless extension candidates. Maximal degree in co-relation 2315. Up to 281 conditions per place. [2022-12-13 00:43:57,287 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 95 transitions, 794 flow [2022-12-13 00:43:57,287 INFO L226 LiptonReduction]: Number of co-enabled transitions 1232 [2022-12-13 00:43:57,379 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [326] L761-->L764: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [367] $Ultimate##0-->L793: Formula: (and (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_13| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_13|) (= v_~y$w_buff0~0_97 v_~y$w_buff1~0_78) (= v_~y$r_buff0_thd3~0_58 1) (= v_~y$w_buff0_used~0_159 1) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_13| 0)) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_137 256) 0)) (not (= (mod v_~y$w_buff0_used~0_159 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_13|) (= v_~y$r_buff0_thd1~0_21 v_~y$r_buff1_thd1~0_19) (= v_~y$w_buff0_used~0_160 v_~y$w_buff1_used~0_137) (= 2 v_~y$w_buff0~0_96) (= v_~z~0_6 1) (= v_~y$r_buff0_thd2~0_49 v_~y$r_buff1_thd2~0_47) (= v_~y$r_buff0_thd3~0_59 v_~y$r_buff1_thd3~0_37) (= v_~y$r_buff0_thd0~0_95 v_~y$r_buff1_thd0~0_92) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_160, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_59, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_95, ~y$w_buff0~0=v_~y$w_buff0~0_97, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_21, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_159, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_47, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_37, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_78, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_58, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_95, ~y$w_buff0~0=v_~y$w_buff0~0_96, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_21, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_13|, ~z~0=v_~z~0_6, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_92, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_13|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_137} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-13 00:43:57,596 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [326] L761-->L764: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [320] L746-->L749: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-13 00:43:57,605 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [326] L761-->L764: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [401] L2-1-->L839: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_111 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_187 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_114 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_188 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_158 256) 0))))) (and (= v_~y~0_123 (ite .cse0 v_~y$w_buff0~0_122 (ite .cse1 v_~y$w_buff1~0_98 v_~y~0_124))) (= (ite .cse0 0 v_~y$w_buff0_used~0_188) v_~y$w_buff0_used~0_187) (= v_~y$r_buff0_thd0~0_113 (ite .cse2 0 v_~y$r_buff0_thd0~0_114)) (= v_~y$w_buff1_used~0_157 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_158)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_157 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd0~0_113 256) 0)))) 0 v_~y$r_buff1_thd0~0_111) v_~y$r_buff1_thd0~0_110)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_188, ~y$w_buff1~0=v_~y$w_buff1~0_98, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_122, ~y~0=v_~y~0_124, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_158} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_187, ~y$w_buff1~0=v_~y$w_buff1~0_98, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_113, ~y$w_buff0~0=v_~y$w_buff0~0_122, ~y~0=v_~y~0_123, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_157} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 00:43:57,715 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:43:57,718 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 483 [2022-12-13 00:43:57,718 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 94 transitions, 801 flow [2022-12-13 00:43:57,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:57,718 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:43:57,718 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:43:57,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:43:57,718 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:43:57,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:43:57,719 INFO L85 PathProgramCache]: Analyzing trace with hash -686115042, now seen corresponding path program 1 times [2022-12-13 00:43:57,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:43:57,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947211259] [2022-12-13 00:43:57,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:43:57,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:43:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:43:58,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:43:58,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:43:58,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947211259] [2022-12-13 00:43:58,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947211259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:43:58,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:43:58,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:43:58,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394752382] [2022-12-13 00:43:58,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:43:58,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:43:58,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:43:58,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:43:58,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:43:58,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2022-12-13 00:43:58,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 94 transitions, 801 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:58,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:43:58,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2022-12-13 00:43:58,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:43:58,525 INFO L130 PetriNetUnfolder]: 2652/4403 cut-off events. [2022-12-13 00:43:58,525 INFO L131 PetriNetUnfolder]: For 14047/14145 co-relation queries the response was YES. [2022-12-13 00:43:58,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16755 conditions, 4403 events. 2652/4403 cut-off events. For 14047/14145 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 27414 event pairs, 458 based on Foata normal form. 86/3691 useless extension candidates. Maximal degree in co-relation 16729. Up to 2337 conditions per place. [2022-12-13 00:43:58,554 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 66 selfloop transitions, 25 changer transitions 0/118 dead transitions. [2022-12-13 00:43:58,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 118 transitions, 1127 flow [2022-12-13 00:43:58,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:43:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:43:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 00:43:58,556 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6214285714285714 [2022-12-13 00:43:58,556 INFO L175 Difference]: Start difference. First operand has 63 places, 94 transitions, 801 flow. Second operand 4 states and 87 transitions. [2022-12-13 00:43:58,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 118 transitions, 1127 flow [2022-12-13 00:43:58,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 118 transitions, 1095 flow, removed 16 selfloop flow, removed 0 redundant places. [2022-12-13 00:43:58,573 INFO L231 Difference]: Finished difference. Result has 67 places, 98 transitions, 893 flow [2022-12-13 00:43:58,573 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=893, PETRI_PLACES=67, PETRI_TRANSITIONS=98} [2022-12-13 00:43:58,575 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2022-12-13 00:43:58,575 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:43:58,575 INFO L89 Accepts]: Start accepts. Operand has 67 places, 98 transitions, 893 flow [2022-12-13 00:43:58,576 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:43:58,576 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:43:58,576 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 98 transitions, 893 flow [2022-12-13 00:43:58,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 98 transitions, 893 flow [2022-12-13 00:43:58,624 INFO L130 PetriNetUnfolder]: 247/668 cut-off events. [2022-12-13 00:43:58,624 INFO L131 PetriNetUnfolder]: For 1641/1670 co-relation queries the response was YES. [2022-12-13 00:43:58,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2631 conditions, 668 events. 247/668 cut-off events. For 1641/1670 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4618 event pairs, 10 based on Foata normal form. 6/513 useless extension candidates. Maximal degree in co-relation 2605. Up to 277 conditions per place. [2022-12-13 00:43:58,631 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 98 transitions, 893 flow [2022-12-13 00:43:58,631 INFO L226 LiptonReduction]: Number of co-enabled transitions 1272 [2022-12-13 00:43:58,640 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:43:58,641 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-13 00:43:58,641 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 98 transitions, 893 flow [2022-12-13 00:43:58,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:58,641 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:43:58,642 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:43:58,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:43:58,642 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:43:58,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:43:58,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1940031939, now seen corresponding path program 1 times [2022-12-13 00:43:58,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:43:58,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509532064] [2022-12-13 00:43:58,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:43:58,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:43:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:43:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:43:59,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:43:59,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509532064] [2022-12-13 00:43:59,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509532064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:43:59,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:43:59,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:43:59,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57421622] [2022-12-13 00:43:59,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:43:59,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:43:59,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:43:59,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:43:59,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:43:59,107 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2022-12-13 00:43:59,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 98 transitions, 893 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:59,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:43:59,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2022-12-13 00:43:59,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:43:59,598 INFO L130 PetriNetUnfolder]: 2564/4261 cut-off events. [2022-12-13 00:43:59,598 INFO L131 PetriNetUnfolder]: For 16793/16884 co-relation queries the response was YES. [2022-12-13 00:43:59,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17149 conditions, 4261 events. 2564/4261 cut-off events. For 16793/16884 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 26435 event pairs, 415 based on Foata normal form. 70/3559 useless extension candidates. Maximal degree in co-relation 17120. Up to 1732 conditions per place. [2022-12-13 00:43:59,634 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 72 selfloop transitions, 18 changer transitions 0/117 dead transitions. [2022-12-13 00:43:59,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 117 transitions, 1167 flow [2022-12-13 00:43:59,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:43:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:43:59,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-13 00:43:59,636 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2022-12-13 00:43:59,636 INFO L175 Difference]: Start difference. First operand has 67 places, 98 transitions, 893 flow. Second operand 4 states and 86 transitions. [2022-12-13 00:43:59,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 117 transitions, 1167 flow [2022-12-13 00:43:59,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 117 transitions, 1122 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 00:43:59,658 INFO L231 Difference]: Finished difference. Result has 67 places, 98 transitions, 903 flow [2022-12-13 00:43:59,658 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=903, PETRI_PLACES=67, PETRI_TRANSITIONS=98} [2022-12-13 00:43:59,659 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2022-12-13 00:43:59,659 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:43:59,659 INFO L89 Accepts]: Start accepts. Operand has 67 places, 98 transitions, 903 flow [2022-12-13 00:43:59,660 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:43:59,660 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:43:59,660 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 98 transitions, 903 flow [2022-12-13 00:43:59,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 98 transitions, 903 flow [2022-12-13 00:43:59,712 INFO L130 PetriNetUnfolder]: 241/650 cut-off events. [2022-12-13 00:43:59,712 INFO L131 PetriNetUnfolder]: For 1677/1706 co-relation queries the response was YES. [2022-12-13 00:43:59,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 650 events. 241/650 cut-off events. For 1677/1706 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4447 event pairs, 8 based on Foata normal form. 6/499 useless extension candidates. Maximal degree in co-relation 2478. Up to 267 conditions per place. [2022-12-13 00:43:59,720 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 98 transitions, 903 flow [2022-12-13 00:43:59,721 INFO L226 LiptonReduction]: Number of co-enabled transitions 1272 [2022-12-13 00:43:59,724 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:43:59,725 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-13 00:43:59,725 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 98 transitions, 903 flow [2022-12-13 00:43:59,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:59,725 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:43:59,725 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:43:59,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:43:59,726 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:43:59,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:43:59,726 INFO L85 PathProgramCache]: Analyzing trace with hash -11441589, now seen corresponding path program 1 times [2022-12-13 00:43:59,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:43:59,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790769816] [2022-12-13 00:43:59,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:43:59,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:43:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:43:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:43:59,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:43:59,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790769816] [2022-12-13 00:43:59,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790769816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:43:59,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:43:59,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:43:59,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273493853] [2022-12-13 00:43:59,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:43:59,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:43:59,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:43:59,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:43:59,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:43:59,823 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 00:43:59,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 98 transitions, 903 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:59,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:43:59,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 00:43:59,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:44:00,265 INFO L130 PetriNetUnfolder]: 3305/5269 cut-off events. [2022-12-13 00:44:00,265 INFO L131 PetriNetUnfolder]: For 22619/23316 co-relation queries the response was YES. [2022-12-13 00:44:00,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20654 conditions, 5269 events. 3305/5269 cut-off events. For 22619/23316 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 33113 event pairs, 900 based on Foata normal form. 117/3572 useless extension candidates. Maximal degree in co-relation 20626. Up to 4777 conditions per place. [2022-12-13 00:44:00,295 INFO L137 encePairwiseOnDemand]: 24/35 looper letters, 107 selfloop transitions, 10 changer transitions 0/141 dead transitions. [2022-12-13 00:44:00,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 141 transitions, 1552 flow [2022-12-13 00:44:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:44:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:44:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-13 00:44:00,297 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2022-12-13 00:44:00,297 INFO L175 Difference]: Start difference. First operand has 67 places, 98 transitions, 903 flow. Second operand 3 states and 72 transitions. [2022-12-13 00:44:00,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 141 transitions, 1552 flow [2022-12-13 00:44:00,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 141 transitions, 1482 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 00:44:00,309 INFO L231 Difference]: Finished difference. Result has 67 places, 103 transitions, 901 flow [2022-12-13 00:44:00,310 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=901, PETRI_PLACES=67, PETRI_TRANSITIONS=103} [2022-12-13 00:44:00,310 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2022-12-13 00:44:00,310 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:44:00,310 INFO L89 Accepts]: Start accepts. Operand has 67 places, 103 transitions, 901 flow [2022-12-13 00:44:00,311 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:44:00,311 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:44:00,311 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 103 transitions, 901 flow [2022-12-13 00:44:00,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 103 transitions, 901 flow [2022-12-13 00:44:00,476 INFO L130 PetriNetUnfolder]: 1623/3026 cut-off events. [2022-12-13 00:44:00,476 INFO L131 PetriNetUnfolder]: For 4558/4634 co-relation queries the response was YES. [2022-12-13 00:44:00,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9437 conditions, 3026 events. 1623/3026 cut-off events. For 4558/4634 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 23880 event pairs, 474 based on Foata normal form. 23/1710 useless extension candidates. Maximal degree in co-relation 9411. Up to 1945 conditions per place. [2022-12-13 00:44:00,504 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 103 transitions, 901 flow [2022-12-13 00:44:00,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 1340 [2022-12-13 00:44:00,652 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [463] L828-3-->L2-1: Formula: (and (= v_~main$tmp_guard0~0_Out_2 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_In_1) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (mod v_~main$tmp_guard0~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_Out_2|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} 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 [478] L761-->L839: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_503 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_695 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd0~0_499 256))))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_696 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_642 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_696) v_~y$w_buff0_used~0_695) (= v_~y~0_601 (ite .cse0 v_~y$w_buff0~0_553 (ite .cse1 v_~y$w_buff1~0_508 1))) (= v_~y$r_buff0_thd0~0_498 (ite .cse2 0 v_~y$r_buff0_thd0~0_499)) (= v_~y$r_buff1_thd0~0_502 (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_641 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd0~0_498 256) 0)))) 0 v_~y$r_buff1_thd0~0_503)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_642) v_~y$w_buff1_used~0_641)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_696, ~y$w_buff1~0=v_~y$w_buff1~0_508, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_499, ~y$w_buff0~0=v_~y$w_buff0~0_553, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_503, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_642} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_695, ~y$w_buff1~0=v_~y$w_buff1~0_508, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_498, ~y$w_buff0~0=v_~y$w_buff0~0_553, ~y~0=v_~y~0_601, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_502, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_641} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 00:44:01,702 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:44:01,703 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1393 [2022-12-13 00:44:01,703 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 103 transitions, 917 flow [2022-12-13 00:44:01,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:44:01,703 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:44:01,704 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:44:01,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:44:01,704 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:44:01,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:44:01,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1716088025, now seen corresponding path program 1 times [2022-12-13 00:44:01,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:44:01,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905516176] [2022-12-13 00:44:01,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:44:01,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:44:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:44:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:44:01,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:44:01,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905516176] [2022-12-13 00:44:01,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905516176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:44:01,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:44:01,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:44:01,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273297603] [2022-12-13 00:44:01,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:44:01,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:44:01,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:44:01,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:44:01,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:44:01,791 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2022-12-13 00:44:01,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 103 transitions, 917 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:44:01,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:44:01,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2022-12-13 00:44:01,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:44:02,101 INFO L130 PetriNetUnfolder]: 1655/2983 cut-off events. [2022-12-13 00:44:02,101 INFO L131 PetriNetUnfolder]: For 11057/11287 co-relation queries the response was YES. [2022-12-13 00:44:02,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13165 conditions, 2983 events. 1655/2983 cut-off events. For 11057/11287 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 19477 event pairs, 183 based on Foata normal form. 266/2276 useless extension candidates. Maximal degree in co-relation 13136. Up to 2080 conditions per place. [2022-12-13 00:44:02,116 INFO L137 encePairwiseOnDemand]: 23/42 looper letters, 109 selfloop transitions, 19 changer transitions 0/151 dead transitions. [2022-12-13 00:44:02,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 151 transitions, 1593 flow [2022-12-13 00:44:02,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:44:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:44:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-12-13 00:44:02,118 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6130952380952381 [2022-12-13 00:44:02,118 INFO L175 Difference]: Start difference. First operand has 67 places, 103 transitions, 917 flow. Second operand 4 states and 103 transitions. [2022-12-13 00:44:02,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 151 transitions, 1593 flow [2022-12-13 00:44:02,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 151 transitions, 1558 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 00:44:02,128 INFO L231 Difference]: Finished difference. Result has 69 places, 100 transitions, 863 flow [2022-12-13 00:44:02,128 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=863, PETRI_PLACES=69, PETRI_TRANSITIONS=100} [2022-12-13 00:44:02,128 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2022-12-13 00:44:02,129 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:44:02,129 INFO L89 Accepts]: Start accepts. Operand has 69 places, 100 transitions, 863 flow [2022-12-13 00:44:02,131 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:44:02,132 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:44:02,132 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 100 transitions, 863 flow [2022-12-13 00:44:02,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 100 transitions, 863 flow [2022-12-13 00:44:02,232 INFO L130 PetriNetUnfolder]: 753/1676 cut-off events. [2022-12-13 00:44:02,232 INFO L131 PetriNetUnfolder]: For 3137/3948 co-relation queries the response was YES. [2022-12-13 00:44:02,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6697 conditions, 1676 events. 753/1676 cut-off events. For 3137/3948 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 13288 event pairs, 72 based on Foata normal form. 28/1038 useless extension candidates. Maximal degree in co-relation 6670. Up to 1072 conditions per place. [2022-12-13 00:44:02,247 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 100 transitions, 863 flow [2022-12-13 00:44:02,247 INFO L226 LiptonReduction]: Number of co-enabled transitions 1234 [2022-12-13 00:44:02,648 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:44:02,649 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 520 [2022-12-13 00:44:02,649 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 100 transitions, 875 flow [2022-12-13 00:44:02,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:44:02,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:44:02,649 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:44:02,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:44:02,650 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:44:02,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:44:02,650 INFO L85 PathProgramCache]: Analyzing trace with hash -968998810, now seen corresponding path program 1 times [2022-12-13 00:44:02,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:44:02,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576387363] [2022-12-13 00:44:02,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:44:02,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:44:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:44:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:44:03,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:44:03,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576387363] [2022-12-13 00:44:03,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576387363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:44:03,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:44:03,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:44:03,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332251935] [2022-12-13 00:44:03,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:44:03,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:44:03,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:44:03,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:44:03,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:44:03,058 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2022-12-13 00:44:03,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 100 transitions, 875 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:44:03,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:44:03,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2022-12-13 00:44:03,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:44:03,474 INFO L130 PetriNetUnfolder]: 2413/4334 cut-off events. [2022-12-13 00:44:03,475 INFO L131 PetriNetUnfolder]: For 14356/14986 co-relation queries the response was YES. [2022-12-13 00:44:03,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20931 conditions, 4334 events. 2413/4334 cut-off events. For 14356/14986 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 29513 event pairs, 430 based on Foata normal form. 366/3992 useless extension candidates. Maximal degree in co-relation 20901. Up to 2375 conditions per place. [2022-12-13 00:44:03,494 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 77 selfloop transitions, 11 changer transitions 47/148 dead transitions. [2022-12-13 00:44:03,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 148 transitions, 1498 flow [2022-12-13 00:44:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:44:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:44:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 00:44:03,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5743243243243243 [2022-12-13 00:44:03,496 INFO L175 Difference]: Start difference. First operand has 69 places, 100 transitions, 875 flow. Second operand 4 states and 85 transitions. [2022-12-13 00:44:03,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 148 transitions, 1498 flow [2022-12-13 00:44:03,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 148 transitions, 1436 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-13 00:44:03,513 INFO L231 Difference]: Finished difference. Result has 72 places, 79 transitions, 631 flow [2022-12-13 00:44:03,514 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=631, PETRI_PLACES=72, PETRI_TRANSITIONS=79} [2022-12-13 00:44:03,514 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places. [2022-12-13 00:44:03,514 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:44:03,515 INFO L89 Accepts]: Start accepts. Operand has 72 places, 79 transitions, 631 flow [2022-12-13 00:44:03,517 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:44:03,517 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:44:03,517 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 79 transitions, 631 flow [2022-12-13 00:44:03,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 79 transitions, 631 flow [2022-12-13 00:44:03,628 INFO L130 PetriNetUnfolder]: 875/1978 cut-off events. [2022-12-13 00:44:03,628 INFO L131 PetriNetUnfolder]: For 3818/4318 co-relation queries the response was YES. [2022-12-13 00:44:03,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7014 conditions, 1978 events. 875/1978 cut-off events. For 3818/4318 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 16613 event pairs, 126 based on Foata normal form. 20/1167 useless extension candidates. Maximal degree in co-relation 6985. Up to 1252 conditions per place. [2022-12-13 00:44:03,644 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 79 transitions, 631 flow [2022-12-13 00:44:03,644 INFO L226 LiptonReduction]: Number of co-enabled transitions 960 [2022-12-13 00:44:03,647 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] L761-->L793: Formula: (and (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_635 256) 0)) (not (= (mod v_~y$w_buff0_used~0_687 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_48| |v_P2Thread1of1ForFork1_~arg#1.offset_48|) (= v_~y$r_buff0_thd1~0_66 v_~y$r_buff1_thd1~0_64) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| 0)) (= v_~y$r_buff0_thd3~0_173 v_~y$r_buff1_thd3~0_118) (= |v_P2Thread1of1ForFork1_~arg#1.base_48| |v_P2Thread1of1ForFork1_#in~arg#1.base_48|) (= v_~y~0_593 1) (= 2 v_~y$w_buff0~0_547) (= v_~z~0_59 1) (= v_~y$w_buff1~0_504 v_~y$w_buff0~0_548) (= v_~y$w_buff0_used~0_687 1) (= v_~y$r_buff0_thd0~0_496 v_~y$r_buff1_thd0~0_500) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|) (= v_~y$w_buff0_used~0_688 v_~y$w_buff1_used~0_635) (= v_~y$r_buff0_thd3~0_172 1) (= v_~y$r_buff0_thd2~0_171 v_~y$r_buff1_thd2~0_174)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_48|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_688, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_496, ~y$w_buff0~0=v_~y$w_buff0~0_548, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_171, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_66, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_48|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_687, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_48|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_48|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_64, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_118, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_48|, ~y$w_buff1~0=v_~y$w_buff1~0_504, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_172, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_496, ~y$w_buff0~0=v_~y$w_buff0~0_547, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_48|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_171, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_66, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_54|, ~z~0=v_~z~0_59, ~y~0=v_~y~0_593, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_500, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_635} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z~0, ~y~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [327] L764-->L771: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_109 256) 0)))) (let ((.cse2 (and .cse5 .cse0)) (.cse3 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_110 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_97 256) 0)) .cse1))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_96 256) 0)) .cse1)) 0 v_~y$r_buff1_thd2~0_24) v_~y$r_buff1_thd2~0_23) (= v_~y$r_buff0_thd2~0_25 (ite .cse2 0 v_~y$r_buff0_thd2~0_26)) (= (ite .cse3 0 v_~y$w_buff0_used~0_110) v_~y$w_buff0_used~0_109) (= v_~y$w_buff1_used~0_96 (ite (or .cse2 .cse4) 0 v_~y$w_buff1_used~0_97)) (= v_~y~0_71 (ite .cse3 v_~y$w_buff0~0_54 (ite .cse4 v_~y$w_buff1~0_47 v_~y~0_72)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:44:03,895 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:44:03,897 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 383 [2022-12-13 00:44:03,897 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 636 flow [2022-12-13 00:44:03,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:44:03,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:44:03,897 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:44:03,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:44:03,897 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:44:03,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:44:03,898 INFO L85 PathProgramCache]: Analyzing trace with hash -414385255, now seen corresponding path program 1 times [2022-12-13 00:44:03,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:44:03,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136798258] [2022-12-13 00:44:03,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:44:03,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:44:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:44:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:44:04,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:44:04,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136798258] [2022-12-13 00:44:04,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136798258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:44:04,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:44:04,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:44:04,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677556346] [2022-12-13 00:44:04,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:44:04,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:44:04,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:44:04,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:44:04,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:44:04,021 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 00:44:04,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 636 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:44:04,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:44:04,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 00:44:04,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:44:04,221 INFO L130 PetriNetUnfolder]: 926/1814 cut-off events. [2022-12-13 00:44:04,221 INFO L131 PetriNetUnfolder]: For 5374/5474 co-relation queries the response was YES. [2022-12-13 00:44:04,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8001 conditions, 1814 events. 926/1814 cut-off events. For 5374/5474 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 11945 event pairs, 37 based on Foata normal form. 290/1365 useless extension candidates. Maximal degree in co-relation 7969. Up to 838 conditions per place. [2022-12-13 00:44:04,229 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 63 selfloop transitions, 28 changer transitions 8/113 dead transitions. [2022-12-13 00:44:04,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 113 transitions, 1153 flow [2022-12-13 00:44:04,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:44:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:44:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-13 00:44:04,231 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 00:44:04,231 INFO L175 Difference]: Start difference. First operand has 71 places, 79 transitions, 636 flow. Second operand 5 states and 105 transitions. [2022-12-13 00:44:04,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 113 transitions, 1153 flow [2022-12-13 00:44:04,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 113 transitions, 1075 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-12-13 00:44:04,239 INFO L231 Difference]: Finished difference. Result has 74 places, 72 transitions, 597 flow [2022-12-13 00:44:04,239 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=597, PETRI_PLACES=74, PETRI_TRANSITIONS=72} [2022-12-13 00:44:04,239 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 8 predicate places. [2022-12-13 00:44:04,240 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:44:04,240 INFO L89 Accepts]: Start accepts. Operand has 74 places, 72 transitions, 597 flow [2022-12-13 00:44:04,240 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:44:04,240 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:44:04,241 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 72 transitions, 597 flow [2022-12-13 00:44:04,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 72 transitions, 597 flow [2022-12-13 00:44:04,263 INFO L130 PetriNetUnfolder]: 149/406 cut-off events. [2022-12-13 00:44:04,264 INFO L131 PetriNetUnfolder]: For 402/603 co-relation queries the response was YES. [2022-12-13 00:44:04,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 406 events. 149/406 cut-off events. For 402/603 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 2347 event pairs, 0 based on Foata normal form. 1/210 useless extension candidates. Maximal degree in co-relation 1508. Up to 253 conditions per place. [2022-12-13 00:44:04,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 72 transitions, 597 flow [2022-12-13 00:44:04,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 642 [2022-12-13 00:44:06,803 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:44:06,803 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2563 [2022-12-13 00:44:06,804 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 593 flow [2022-12-13 00:44:06,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:44:06,804 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:44:06,804 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:44:06,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:44:06,804 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:44:06,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:44:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash -722314211, now seen corresponding path program 1 times [2022-12-13 00:44:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:44:06,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665437181] [2022-12-13 00:44:06,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:44:06,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:44:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:44:06,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:44:06,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:44:06,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665437181] [2022-12-13 00:44:06,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665437181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:44:06,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:44:06,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:44:06,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620648180] [2022-12-13 00:44:06,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:44:06,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:44:06,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:44:06,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:44:06,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:44:06,906 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 00:44:06,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 593 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 00:44:06,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:44:06,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 00:44:06,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:44:07,026 INFO L130 PetriNetUnfolder]: 560/1065 cut-off events. [2022-12-13 00:44:07,026 INFO L131 PetriNetUnfolder]: For 3590/3750 co-relation queries the response was YES. [2022-12-13 00:44:07,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5218 conditions, 1065 events. 560/1065 cut-off events. For 3590/3750 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5818 event pairs, 56 based on Foata normal form. 93/904 useless extension candidates. Maximal degree in co-relation 5185. Up to 544 conditions per place. [2022-12-13 00:44:07,032 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 38 selfloop transitions, 1 changer transitions 53/107 dead transitions. [2022-12-13 00:44:07,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 107 transitions, 1076 flow [2022-12-13 00:44:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:44:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:44:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-13 00:44:07,034 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6209677419354839 [2022-12-13 00:44:07,034 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 593 flow. Second operand 4 states and 77 transitions. [2022-12-13 00:44:07,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 107 transitions, 1076 flow [2022-12-13 00:44:07,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 926 flow, removed 38 selfloop flow, removed 5 redundant places. [2022-12-13 00:44:07,044 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 337 flow [2022-12-13 00:44:07,044 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=337, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2022-12-13 00:44:07,044 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2022-12-13 00:44:07,044 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:44:07,044 INFO L89 Accepts]: Start accepts. Operand has 71 places, 51 transitions, 337 flow [2022-12-13 00:44:07,045 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:44:07,045 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:44:07,045 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 51 transitions, 337 flow [2022-12-13 00:44:07,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 51 transitions, 337 flow [2022-12-13 00:44:07,063 INFO L130 PetriNetUnfolder]: 121/292 cut-off events. [2022-12-13 00:44:07,063 INFO L131 PetriNetUnfolder]: For 698/737 co-relation queries the response was YES. [2022-12-13 00:44:07,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 292 events. 121/292 cut-off events. For 698/737 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1525 event pairs, 1 based on Foata normal form. 6/119 useless extension candidates. Maximal degree in co-relation 958. Up to 154 conditions per place. [2022-12-13 00:44:07,065 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 51 transitions, 337 flow [2022-12-13 00:44:07,065 INFO L226 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-13 00:44:07,158 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [326] L761-->L764: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [337] L799-->L806: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse2))) (and (= v_~y$w_buff0_used~0_77 (ite .cse0 0 v_~y$w_buff0_used~0_78)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_25) v_~y$r_buff0_thd3~0_24) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= v_~y$w_buff1_used~0_66 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_45 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse4 v_~y$w_buff1~0_29 v_~y~0_46)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y~0=v_~y~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:44:07,335 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [495] L761-->L806: Formula: (let ((.cse5 (not (= 0 (mod v_~y$r_buff0_thd3~0_181 256)))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_763 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd3~0_123 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_708 256) 0)) .cse3)) (.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_764 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_181) v_~y$r_buff0_thd3~0_180) (= (ite .cse1 v_~y$w_buff0~0_591 (ite .cse2 v_~y$w_buff1~0_544 1)) v_~y~0_665) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_707 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_180 256) 0)))) 0 v_~y$r_buff1_thd3~0_123) v_~y$r_buff1_thd3~0_122) (= v_~y$w_buff1_used~0_707 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_708)) (= v_~y$w_buff0_used~0_763 (ite .cse1 0 v_~y$w_buff0_used~0_764))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_123, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_764, ~y$w_buff1~0=v_~y$w_buff1~0_544, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_181, ~y$w_buff0~0=v_~y$w_buff0~0_591, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_708} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_122, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_763, ~y$w_buff1~0=v_~y$w_buff1~0_544, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_180, ~y$w_buff0~0=v_~y$w_buff0~0_591, ~y~0=v_~y~0_665, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_707} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] and [327] L764-->L771: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_109 256) 0)))) (let ((.cse2 (and .cse5 .cse0)) (.cse3 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_110 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_97 256) 0)) .cse1))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_96 256) 0)) .cse1)) 0 v_~y$r_buff1_thd2~0_24) v_~y$r_buff1_thd2~0_23) (= v_~y$r_buff0_thd2~0_25 (ite .cse2 0 v_~y$r_buff0_thd2~0_26)) (= (ite .cse3 0 v_~y$w_buff0_used~0_110) v_~y$w_buff0_used~0_109) (= v_~y$w_buff1_used~0_96 (ite (or .cse2 .cse4) 0 v_~y$w_buff1_used~0_97)) (= v_~y~0_71 (ite .cse3 v_~y$w_buff0~0_54 (ite .cse4 v_~y$w_buff1~0_47 v_~y~0_72)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_110, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_97} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:44:07,532 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 00:44:07,533 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 489 [2022-12-13 00:44:07,533 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 328 flow [2022-12-13 00:44:07,533 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 00:44:07,533 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:44:07,534 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:44:07,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:44:07,534 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:44:07,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:44:07,534 INFO L85 PathProgramCache]: Analyzing trace with hash -612038429, now seen corresponding path program 1 times [2022-12-13 00:44:07,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:44:07,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936875631] [2022-12-13 00:44:07,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:44:07,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:44:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:44:07,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:44:07,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:44:07,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936875631] [2022-12-13 00:44:07,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936875631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:44:07,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:44:07,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:44:07,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611520679] [2022-12-13 00:44:07,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:44:07,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:44:07,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:44:07,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:44:07,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:44:07,917 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 00:44:07,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:44:07,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:44:07,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 00:44:07,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:44:08,007 INFO L130 PetriNetUnfolder]: 256/487 cut-off events. [2022-12-13 00:44:08,008 INFO L131 PetriNetUnfolder]: For 2201/2218 co-relation queries the response was YES. [2022-12-13 00:44:08,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2012 conditions, 487 events. 256/487 cut-off events. For 2201/2218 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2499 event pairs, 8 based on Foata normal form. 41/393 useless extension candidates. Maximal degree in co-relation 1980. Up to 219 conditions per place. [2022-12-13 00:44:08,010 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 35 selfloop transitions, 4 changer transitions 17/66 dead transitions. [2022-12-13 00:44:08,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 563 flow [2022-12-13 00:44:08,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:44:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:44:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-13 00:44:08,011 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.432 [2022-12-13 00:44:08,011 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 328 flow. Second operand 5 states and 54 transitions. [2022-12-13 00:44:08,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 563 flow [2022-12-13 00:44:08,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 478 flow, removed 15 selfloop flow, removed 16 redundant places. [2022-12-13 00:44:08,015 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 239 flow [2022-12-13 00:44:08,015 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2022-12-13 00:44:08,016 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -15 predicate places. [2022-12-13 00:44:08,016 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:44:08,016 INFO L89 Accepts]: Start accepts. Operand has 51 places, 41 transitions, 239 flow [2022-12-13 00:44:08,017 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:44:08,017 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:44:08,017 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 41 transitions, 239 flow [2022-12-13 00:44:08,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 239 flow [2022-12-13 00:44:08,031 INFO L130 PetriNetUnfolder]: 91/205 cut-off events. [2022-12-13 00:44:08,031 INFO L131 PetriNetUnfolder]: For 612/615 co-relation queries the response was YES. [2022-12-13 00:44:08,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 205 events. 91/205 cut-off events. For 612/615 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 999 event pairs, 0 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 667. Up to 109 conditions per place. [2022-12-13 00:44:08,033 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 41 transitions, 239 flow [2022-12-13 00:44:08,033 INFO L226 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-13 00:44:08,114 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [493] $Ultimate##0-->L749: Formula: (and (= v_~a~0_39 1) (= v_~x~0_228 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_15| v_P0Thread1of1ForFork2_~arg.offset_15) (= v_P0Thread1of1ForFork2_~arg.base_15 |v_P0Thread1of1ForFork2_#in~arg.base_15|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_15|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_15|} OutVars{~a~0=v_~a~0_39, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_15|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_15, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_15|, ~x~0=v_~x~0_228, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, ~x~0, P0Thread1of1ForFork2_~arg.base] and [460] $Ultimate##0-->L761: Formula: (and (= v_~x~0_66 2) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_66} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] [2022-12-13 00:44:08,142 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] $Ultimate##0-->L754: Formula: (and (= v_~a~0_45 1) (= v_P0Thread1of1ForFork2_~arg.base_17 |v_P0Thread1of1ForFork2_#in~arg.base_17|) (= v_~__unbuffered_cnt~0_503 (+ v_~__unbuffered_cnt~0_504 1)) (= |v_P0Thread1of1ForFork2_#in~arg.offset_17| v_P0Thread1of1ForFork2_~arg.offset_17) (= v_~x~0_230 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_504, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|} OutVars{~a~0=v_~a~0_45, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_503, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~x~0=v_~x~0_230, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_17} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork2_~arg.base] and [460] $Ultimate##0-->L761: Formula: (and (= v_~x~0_66 2) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_66} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] [2022-12-13 00:44:08,172 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [501] $Ultimate##0-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_57| 0) (= v_~x~0_232 1) (= v_~a~0_47 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_19| v_P0Thread1of1ForFork2_~arg.offset_19) (= v_~__unbuffered_cnt~0_507 (+ v_~__unbuffered_cnt~0_508 1)) (= v_P0Thread1of1ForFork2_~arg.base_19 |v_P0Thread1of1ForFork2_#in~arg.base_19|) (= |v_P0Thread1of1ForFork2_#res.offset_57| 0)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_508, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_19|} OutVars{~a~0=v_~a~0_47, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_19|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_19, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_57|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_507, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_19|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_57|, ~x~0=v_~x~0_232, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_19} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] and [460] $Ultimate##0-->L761: Formula: (and (= v_~x~0_66 2) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_66} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] [2022-12-13 00:44:08,211 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_21| v_P0Thread1of1ForFork2_~arg.offset_21) (= v_~a~0_49 1) (= |v_P0Thread1of1ForFork2_#res.offset_59| 0) (= v_~x~0_234 1) (= v_~__unbuffered_cnt~0_511 (+ v_~__unbuffered_cnt~0_512 1)) (= |v_P0Thread1of1ForFork2_#res.base_59| 0) (= v_P0Thread1of1ForFork2_~arg.base_21 |v_P0Thread1of1ForFork2_#in~arg.base_21|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_512, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|} OutVars{~a~0=v_~a~0_49, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_21, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_59|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_511, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_59|, ~x~0=v_~x~0_234, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_21} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] and [460] $Ultimate##0-->L761: Formula: (and (= v_~x~0_66 2) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_66} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] [2022-12-13 00:44:08,252 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:44:08,252 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-13 00:44:08,252 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 271 flow [2022-12-13 00:44:08,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:44:08,252 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:44:08,252 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:44:08,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:44:08,253 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:44:08,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:44:08,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1566025965, now seen corresponding path program 1 times [2022-12-13 00:44:08,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:44:08,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387397631] [2022-12-13 00:44:08,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:44:08,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:44:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:44:08,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:44:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:44:08,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:44:08,343 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:44:08,344 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:44:08,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:44:08,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:44:08,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:44:08,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:44:08,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:44:08,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 00:44:08,346 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:44:08,350 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:44:08,350 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:44:08,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:44:08 BasicIcfg [2022-12-13 00:44:08,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:44:08,413 INFO L158 Benchmark]: Toolchain (without parser) took 25868.02ms. Allocated memory was 178.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 153.0MB in the beginning and 658.1MB in the end (delta: -505.1MB). Peak memory consumption was 601.2MB. Max. memory is 8.0GB. [2022-12-13 00:44:08,414 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory was 155.0MB in the beginning and 155.0MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:44:08,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.65ms. Allocated memory is still 178.3MB. Free memory was 152.5MB in the beginning and 126.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 00:44:08,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.40ms. Allocated memory is still 178.3MB. Free memory was 126.3MB in the beginning and 123.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:44:08,414 INFO L158 Benchmark]: Boogie Preprocessor took 31.64ms. Allocated memory is still 178.3MB. Free memory was 123.6MB in the beginning and 121.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:44:08,414 INFO L158 Benchmark]: RCFGBuilder took 518.51ms. Allocated memory is still 178.3MB. Free memory was 121.5MB in the beginning and 89.6MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-13 00:44:08,414 INFO L158 Benchmark]: TraceAbstraction took 24762.32ms. Allocated memory was 178.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 88.5MB in the beginning and 658.1MB in the end (delta: -569.6MB). Peak memory consumption was 536.2MB. Max. memory is 8.0GB. [2022-12-13 00:44:08,416 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory was 155.0MB in the beginning and 155.0MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 468.65ms. Allocated memory is still 178.3MB. Free memory was 152.5MB in the beginning and 126.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.40ms. Allocated memory is still 178.3MB. Free memory was 126.3MB in the beginning and 123.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.64ms. Allocated memory is still 178.3MB. Free memory was 123.6MB in the beginning and 121.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 518.51ms. Allocated memory is still 178.3MB. Free memory was 121.5MB in the beginning and 89.6MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 24762.32ms. Allocated memory was 178.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 88.5MB in the beginning and 658.1MB in the end (delta: -569.6MB). Peak memory consumption was 536.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 115 PlacesBefore, 66 PlacesAfterwards, 107 TransitionsBefore, 56 TransitionsAfterwards, 1944 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 43 ConcurrentYvCompositions, 3 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3195, independent: 3023, independent conditional: 3023, independent unconditional: 0, dependent: 172, dependent conditional: 172, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3195, independent: 3023, independent conditional: 0, independent unconditional: 3023, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3195, independent: 3023, independent conditional: 0, independent unconditional: 3023, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3195, independent: 3023, independent conditional: 0, independent unconditional: 3023, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1954, independent: 1880, independent conditional: 0, independent unconditional: 1880, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1954, independent: 1815, independent conditional: 0, independent unconditional: 1815, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 139, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 526, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3195, independent: 1143, independent conditional: 0, independent unconditional: 1143, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 1954, unknown conditional: 0, unknown unconditional: 1954] , Statistics on independence cache: Total cache size (in pairs): 3297, Positive cache size: 3223, Positive conditional cache size: 0, Positive unconditional cache size: 3223, Negative cache size: 74, Negative conditional cache size: 0, Negative unconditional cache size: 74, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 335, independent: 301, independent conditional: 301, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 335, independent: 301, independent conditional: 29, independent unconditional: 272, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 335, independent: 301, independent conditional: 29, independent unconditional: 272, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 335, independent: 301, independent conditional: 29, independent unconditional: 272, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 266, independent: 243, independent conditional: 25, independent unconditional: 218, dependent: 23, dependent conditional: 3, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 266, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 23, dependent conditional: 3, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 42, dependent conditional: 11, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 335, independent: 58, independent conditional: 4, independent unconditional: 54, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 266, unknown conditional: 28, unknown unconditional: 238] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 243, Positive conditional cache size: 25, Positive unconditional cache size: 218, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 606 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 77, independent: 69, independent conditional: 4, independent unconditional: 65, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 77, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 77, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 0, dependent unconditional: 1, 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: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 77, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 255, Positive conditional cache size: 25, Positive unconditional cache size: 230, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 122, independent: 113, independent conditional: 113, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 122, independent: 113, independent conditional: 12, independent unconditional: 101, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 122, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 122, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 122, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 281, Positive cache size: 256, Positive conditional cache size: 25, Positive unconditional cache size: 231, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 820 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 142, independent: 132, independent conditional: 132, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 142, independent: 132, independent conditional: 36, independent unconditional: 96, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 142, independent: 132, independent conditional: 12, independent unconditional: 120, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 142, independent: 132, independent conditional: 12, independent unconditional: 120, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 142, independent: 125, independent conditional: 12, independent unconditional: 113, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 288, Positive cache size: 263, Positive conditional cache size: 25, Positive unconditional cache size: 238, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 64 PlacesBefore, 63 PlacesAfterwards, 95 TransitionsBefore, 94 TransitionsAfterwards, 1232 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 922, independent: 868, independent conditional: 868, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 922, independent: 868, independent conditional: 416, independent unconditional: 452, dependent: 54, dependent conditional: 20, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 922, independent: 868, independent conditional: 180, independent unconditional: 688, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 922, independent: 868, independent conditional: 180, independent unconditional: 688, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 922, independent: 866, independent conditional: 180, independent unconditional: 686, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 343, Positive cache size: 318, Positive conditional cache size: 26, Positive unconditional cache size: 292, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 256, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 1272 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 463, independent: 433, independent conditional: 433, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 463, independent: 433, independent conditional: 202, independent unconditional: 231, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 463, independent: 433, independent conditional: 110, independent unconditional: 323, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 463, independent: 433, independent conditional: 110, independent unconditional: 323, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 463, independent: 433, independent conditional: 110, independent unconditional: 323, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 343, Positive cache size: 318, Positive conditional cache size: 26, Positive unconditional cache size: 292, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 1272 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 463, independent: 433, independent conditional: 433, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 463, independent: 433, independent conditional: 202, independent unconditional: 231, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 463, independent: 433, independent conditional: 110, independent unconditional: 323, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 463, independent: 433, independent conditional: 110, independent unconditional: 323, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 463, independent: 433, independent conditional: 110, independent unconditional: 323, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 343, Positive cache size: 318, Positive conditional cache size: 26, Positive unconditional cache size: 292, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 67 PlacesBefore, 67 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 1340 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1168, independent: 1140, independent conditional: 1140, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1168, independent: 1140, independent conditional: 632, independent unconditional: 508, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1168, independent: 1140, independent conditional: 416, independent unconditional: 724, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1168, independent: 1140, independent conditional: 416, independent unconditional: 724, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 10, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 1168, independent: 1126, independent conditional: 406, independent unconditional: 720, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 14, unknown conditional: 10, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 394, Positive conditional cache size: 36, Positive unconditional cache size: 358, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 216, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 69 PlacesBefore, 69 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 1234 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 732, independent: 712, independent conditional: 712, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 732, independent: 712, independent conditional: 427, independent unconditional: 285, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 732, independent: 712, independent conditional: 322, independent unconditional: 390, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 732, independent: 712, independent conditional: 322, independent unconditional: 390, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 732, independent: 712, independent conditional: 322, independent unconditional: 390, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 418, Positive conditional cache size: 36, Positive unconditional cache size: 382, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 105, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 71 PlacesBefore, 71 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 960 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 262, independent: 254, independent conditional: 254, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 262, independent: 254, independent conditional: 174, independent unconditional: 80, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 262, independent: 254, independent conditional: 126, independent unconditional: 128, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 262, independent: 254, independent conditional: 126, independent unconditional: 128, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 262, independent: 254, independent conditional: 126, independent unconditional: 128, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 450, Positive cache size: 425, Positive conditional cache size: 36, Positive unconditional cache size: 389, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 73 PlacesBefore, 71 PlacesAfterwards, 72 TransitionsBefore, 70 TransitionsAfterwards, 642 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 78, independent conditional: 36, independent unconditional: 42, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 78, independent conditional: 30, independent unconditional: 48, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 78, independent conditional: 30, independent unconditional: 48, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 78, independent conditional: 30, independent unconditional: 48, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 458, Positive cache size: 433, Positive conditional cache size: 36, Positive unconditional cache size: 397, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 67 PlacesBefore, 62 PlacesAfterwards, 51 TransitionsBefore, 46 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 42, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 50, independent conditional: 31, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 31, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 50, independent: 43, independent conditional: 25, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 589, Positive cache size: 564, Positive conditional cache size: 43, Positive unconditional cache size: 521, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 50 PlacesBefore, 48 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 18, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, independent: 19, independent conditional: 15, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 15, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 19, independent: 15, independent conditional: 12, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 750, Positive cache size: 725, Positive conditional cache size: 53, Positive unconditional cache size: 672, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1196; [L824] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1196, ((void *)0), P0, ((void *)0))=-1, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1197; [L826] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1197, ((void *)0), P1, ((void *)0))=0, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1198; [L828] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1198, ((void *)0), P2, ((void *)0))=1, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L784] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L784] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 [L748] 1 x = 1 [L760] 1 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 [L801] 2 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 2 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L856] 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_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - 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: 826]: 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: 824]: 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: 828]: 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, 138 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: 24.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 382 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 382 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1000 IncrementalHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 31 mSDtfsCounter, 1000 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=917occurred in iteration=8, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 1480 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:44:08,442 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...