/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/safe031_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:53:58,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:53:58,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:53:58,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:53:58,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:53:58,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:53:58,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:53:58,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:53:58,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:53:58,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:53:58,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:53:58,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:53:58,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:53:58,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:53:58,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:53:58,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:53:58,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:53:58,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:53:58,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:53:58,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:53:58,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:53:58,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:53:58,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:53:58,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:53:58,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:53:58,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:53:58,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:53:58,946 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:53:58,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:53:58,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:53:58,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:53:58,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:53:58,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:53:58,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:53:58,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:53:58,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:53:58,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:53:58,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:53:58,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:53:58,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:53:58,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:53:58,953 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:53:58,984 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:53:58,984 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:53:58,986 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:53:58,986 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:53:58,986 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:53:58,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:53:58,987 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:53:58,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:53:59,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:53:59,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:53:59,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:53:59,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:53:59,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:53:59,004 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:53:59,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:53:59,005 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:53:59,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:53:59,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:53:59,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:53:59,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:53:59,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:53:59,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:53:59,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:53:59,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:53:59,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:53:59,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:53:59,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:53:59,006 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:53:59,006 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:53:59,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:53:59,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:53:59,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:53:59,378 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:53:59,378 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:53:59,379 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2022-12-13 00:54:00,356 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:54:00,695 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:54:00,695 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2022-12-13 00:54:00,726 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/830ad39d2/0355d6238564466fa4e7494721711286/FLAG621b47e19 [2022-12-13 00:54:00,739 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/830ad39d2/0355d6238564466fa4e7494721711286 [2022-12-13 00:54:00,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:54:00,741 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:54:00,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:54:00,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:54:00,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:54:00,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:54:00" (1/1) ... [2022-12-13 00:54:00,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25be3ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:00, skipping insertion in model container [2022-12-13 00:54:00,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:54:00" (1/1) ... [2022-12-13 00:54:00,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:54:00,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:54:00,927 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-13 00:54:01,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:54:01,129 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:54:01,138 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-13 00:54:01,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:01,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:01,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:54:01,212 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:54:01,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:01 WrapperNode [2022-12-13 00:54:01,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:54:01,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:54:01,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:54:01,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:54:01,218 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:54:01" (1/1) ... [2022-12-13 00:54:01,229 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:54:01" (1/1) ... [2022-12-13 00:54:01,247 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-13 00:54:01,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:54:01,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:54:01,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:54:01,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:54:01,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:01" (1/1) ... [2022-12-13 00:54:01,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:01" (1/1) ... [2022-12-13 00:54:01,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:01" (1/1) ... [2022-12-13 00:54:01,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:01" (1/1) ... [2022-12-13 00:54:01,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:01" (1/1) ... [2022-12-13 00:54:01,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:01" (1/1) ... [2022-12-13 00:54:01,281 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:01" (1/1) ... [2022-12-13 00:54:01,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:01" (1/1) ... [2022-12-13 00:54:01,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:54:01,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:54:01,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:54:01,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:54:01,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:01" (1/1) ... [2022-12-13 00:54:01,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:54:01,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:54:01,329 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:54:01,337 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:54:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:54:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:54:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:54:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:54:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:54:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:54:01,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:54:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:54:01,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:54:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:54:01,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:54:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:54:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:54:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:54:01,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:54:01,363 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:54:01,479 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:54:01,480 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:54:01,734 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:54:01,837 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:54:01,837 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:54:01,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:54:01 BoogieIcfgContainer [2022-12-13 00:54:01,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:54:01,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:54:01,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:54:01,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:54:01,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:54:00" (1/3) ... [2022-12-13 00:54:01,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436a0caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:54:01, skipping insertion in model container [2022-12-13 00:54:01,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:01" (2/3) ... [2022-12-13 00:54:01,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436a0caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:54:01, skipping insertion in model container [2022-12-13 00:54:01,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:54:01" (3/3) ... [2022-12-13 00:54:01,845 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i [2022-12-13 00:54:01,857 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:54:01,857 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:54:01,857 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:54:01,895 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:54:01,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-13 00:54:01,968 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-13 00:54:01,968 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:01,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 00:54:01,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-13 00:54:01,976 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-13 00:54:01,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:01,993 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-13 00:54:01,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-13 00:54:02,080 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-13 00:54:02,080 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:02,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 00:54:02,083 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-13 00:54:02,084 INFO L226 LiptonReduction]: Number of co-enabled transitions 1776 [2022-12-13 00:54:09,735 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-13 00:54:09,768 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:54:09,773 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;@7485d28d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:54:09,773 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:54:09,779 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-13 00:54:09,779 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:09,779 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:09,780 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:09,780 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:54:09,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:09,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1789848918, now seen corresponding path program 1 times [2022-12-13 00:54:09,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:09,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318522987] [2022-12-13 00:54:09,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:10,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:10,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318522987] [2022-12-13 00:54:10,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318522987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:10,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:10,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:54:10,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175316968] [2022-12-13 00:54:10,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:10,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:54:10,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:10,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:54:10,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:54:10,146 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2022-12-13 00:54:10,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:10,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:10,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2022-12-13 00:54:10,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:11,186 INFO L130 PetriNetUnfolder]: 6079/9809 cut-off events. [2022-12-13 00:54:11,186 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 00:54:11,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18592 conditions, 9809 events. 6079/9809 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 72628 event pairs, 855 based on Foata normal form. 0/5894 useless extension candidates. Maximal degree in co-relation 18581. Up to 7305 conditions per place. [2022-12-13 00:54:11,214 INFO L137 encePairwiseOnDemand]: 50/54 looper letters, 28 selfloop transitions, 2 changer transitions 44/84 dead transitions. [2022-12-13 00:54:11,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 325 flow [2022-12-13 00:54:11,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:54:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:54:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2022-12-13 00:54:11,223 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6604938271604939 [2022-12-13 00:54:11,224 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 117 flow. Second operand 3 states and 107 transitions. [2022-12-13 00:54:11,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 84 transitions, 325 flow [2022-12-13 00:54:11,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 322 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:54:11,229 INFO L231 Difference]: Finished difference. Result has 61 places, 30 transitions, 70 flow [2022-12-13 00:54:11,230 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=61, PETRI_TRANSITIONS=30} [2022-12-13 00:54:11,233 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2022-12-13 00:54:11,233 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:11,233 INFO L89 Accepts]: Start accepts. Operand has 61 places, 30 transitions, 70 flow [2022-12-13 00:54:11,235 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:11,235 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:11,235 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 30 transitions, 70 flow [2022-12-13 00:54:11,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 70 flow [2022-12-13 00:54:11,246 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-12-13 00:54:11,246 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:11,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 67 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:54:11,248 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 70 flow [2022-12-13 00:54:11,248 INFO L226 LiptonReduction]: Number of co-enabled transitions 502 [2022-12-13 00:54:11,301 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:11,302 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-13 00:54:11,302 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 70 flow [2022-12-13 00:54:11,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:11,303 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:11,303 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:11,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:54:11,303 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:54:11,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:11,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2057980510, now seen corresponding path program 1 times [2022-12-13 00:54:11,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:11,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150859313] [2022-12-13 00:54:11,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:11,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:11,887 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:54:11,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:11,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150859313] [2022-12-13 00:54:11,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150859313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:11,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:11,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:54:11,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074636870] [2022-12-13 00:54:11,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:11,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:54:11,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:11,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:54:11,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:54:11,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 00:54:11,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 70 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:54:11,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:11,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 00:54:11,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:12,170 INFO L130 PetriNetUnfolder]: 1896/2950 cut-off events. [2022-12-13 00:54:12,170 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-13 00:54:12,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5923 conditions, 2950 events. 1896/2950 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14988 event pairs, 437 based on Foata normal form. 42/2543 useless extension candidates. Maximal degree in co-relation 5913. Up to 2418 conditions per place. [2022-12-13 00:54:12,184 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 40 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2022-12-13 00:54:12,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 226 flow [2022-12-13 00:54:12,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:54:12,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:54:12,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-12-13 00:54:12,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2022-12-13 00:54:12,186 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 70 flow. Second operand 4 states and 79 transitions. [2022-12-13 00:54:12,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 226 flow [2022-12-13 00:54:12,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:54:12,188 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 122 flow [2022-12-13 00:54:12,189 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-13 00:54:12,189 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -22 predicate places. [2022-12-13 00:54:12,189 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:12,189 INFO L89 Accepts]: Start accepts. Operand has 42 places, 37 transitions, 122 flow [2022-12-13 00:54:12,190 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:12,190 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:12,190 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 122 flow [2022-12-13 00:54:12,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 122 flow [2022-12-13 00:54:12,229 INFO L130 PetriNetUnfolder]: 87/242 cut-off events. [2022-12-13 00:54:12,229 INFO L131 PetriNetUnfolder]: For 29/30 co-relation queries the response was YES. [2022-12-13 00:54:12,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 242 events. 87/242 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1352 event pairs, 32 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 455. Up to 130 conditions per place. [2022-12-13 00:54:12,231 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 37 transitions, 122 flow [2022-12-13 00:54:12,231 INFO L226 LiptonReduction]: Number of co-enabled transitions 598 [2022-12-13 00:54:12,246 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:12,247 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 00:54:12,248 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 122 flow [2022-12-13 00:54:12,248 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:54:12,248 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:12,248 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:12,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:54:12,248 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:54:12,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:12,249 INFO L85 PathProgramCache]: Analyzing trace with hash -627114415, now seen corresponding path program 1 times [2022-12-13 00:54:12,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:12,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678378305] [2022-12-13 00:54:12,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:12,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:12,535 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:54:12,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:12,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678378305] [2022-12-13 00:54:12,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678378305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:12,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:12,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:54:12,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817179333] [2022-12-13 00:54:12,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:12,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:54:12,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:12,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:54:12,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:54:12,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 00:54:12,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:12,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:12,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 00:54:12,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:12,736 INFO L130 PetriNetUnfolder]: 1658/2679 cut-off events. [2022-12-13 00:54:12,737 INFO L131 PetriNetUnfolder]: For 942/942 co-relation queries the response was YES. [2022-12-13 00:54:12,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6633 conditions, 2679 events. 1658/2679 cut-off events. For 942/942 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 14800 event pairs, 480 based on Foata normal form. 8/2186 useless extension candidates. Maximal degree in co-relation 6621. Up to 2181 conditions per place. [2022-12-13 00:54:12,750 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 33 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2022-12-13 00:54:12,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 221 flow [2022-12-13 00:54:12,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:54:12,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:54:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 00:54:12,751 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6555555555555556 [2022-12-13 00:54:12,751 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 122 flow. Second operand 3 states and 59 transitions. [2022-12-13 00:54:12,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 221 flow [2022-12-13 00:54:12,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 221 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:54:12,754 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 141 flow [2022-12-13 00:54:12,754 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-12-13 00:54:12,755 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -19 predicate places. [2022-12-13 00:54:12,755 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:12,755 INFO L89 Accepts]: Start accepts. Operand has 45 places, 39 transitions, 141 flow [2022-12-13 00:54:12,755 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:12,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:12,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 141 flow [2022-12-13 00:54:12,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 141 flow [2022-12-13 00:54:12,777 INFO L130 PetriNetUnfolder]: 129/352 cut-off events. [2022-12-13 00:54:12,777 INFO L131 PetriNetUnfolder]: For 96/103 co-relation queries the response was YES. [2022-12-13 00:54:12,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 352 events. 129/352 cut-off events. For 96/103 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2092 event pairs, 60 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 701. Up to 178 conditions per place. [2022-12-13 00:54:12,780 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 39 transitions, 141 flow [2022-12-13 00:54:12,780 INFO L226 LiptonReduction]: Number of co-enabled transitions 628 [2022-12-13 00:54:12,781 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:12,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 00:54:12,781 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 141 flow [2022-12-13 00:54:12,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:12,782 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:12,782 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:12,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:54:12,782 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:54:12,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:12,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1652384143, now seen corresponding path program 1 times [2022-12-13 00:54:12,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:12,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114689914] [2022-12-13 00:54:12,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:12,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:13,095 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:54:13,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:13,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114689914] [2022-12-13 00:54:13,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114689914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:13,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:13,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:54:13,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706040333] [2022-12-13 00:54:13,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:13,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:54:13,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:13,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:54:13,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:54:13,098 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 00:54:13,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:54:13,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:13,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 00:54:13,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:13,362 INFO L130 PetriNetUnfolder]: 1606/2599 cut-off events. [2022-12-13 00:54:13,362 INFO L131 PetriNetUnfolder]: For 1395/1395 co-relation queries the response was YES. [2022-12-13 00:54:13,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6799 conditions, 2599 events. 1606/2599 cut-off events. For 1395/1395 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 14293 event pairs, 468 based on Foata normal form. 18/2122 useless extension candidates. Maximal degree in co-relation 6784. Up to 1986 conditions per place. [2022-12-13 00:54:13,378 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 42 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2022-12-13 00:54:13,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 304 flow [2022-12-13 00:54:13,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:54:13,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:54:13,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-13 00:54:13,380 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-13 00:54:13,380 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 141 flow. Second operand 4 states and 76 transitions. [2022-12-13 00:54:13,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 304 flow [2022-12-13 00:54:13,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:54:13,398 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 175 flow [2022-12-13 00:54:13,398 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2022-12-13 00:54:13,398 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -16 predicate places. [2022-12-13 00:54:13,398 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:13,398 INFO L89 Accepts]: Start accepts. Operand has 48 places, 42 transitions, 175 flow [2022-12-13 00:54:13,399 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:13,399 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:13,399 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 42 transitions, 175 flow [2022-12-13 00:54:13,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 42 transitions, 175 flow [2022-12-13 00:54:13,421 INFO L130 PetriNetUnfolder]: 121/337 cut-off events. [2022-12-13 00:54:13,421 INFO L131 PetriNetUnfolder]: For 154/163 co-relation queries the response was YES. [2022-12-13 00:54:13,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 337 events. 121/337 cut-off events. For 154/163 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2006 event pairs, 56 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 746. Up to 165 conditions per place. [2022-12-13 00:54:13,423 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 42 transitions, 175 flow [2022-12-13 00:54:13,424 INFO L226 LiptonReduction]: Number of co-enabled transitions 668 [2022-12-13 00:54:13,424 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:13,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 00:54:13,425 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 175 flow [2022-12-13 00:54:13,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:54:13,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:13,425 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:13,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:54:13,426 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:54:13,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:13,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1462525034, now seen corresponding path program 1 times [2022-12-13 00:54:13,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:13,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667923628] [2022-12-13 00:54:13,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:13,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:13,779 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:54:13,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:13,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667923628] [2022-12-13 00:54:13,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667923628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:13,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:13,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:54:13,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824083162] [2022-12-13 00:54:13,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:13,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:54:13,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:13,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:54:13,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:54:13,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 00:54:13,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:13,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:13,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 00:54:13,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:14,321 INFO L130 PetriNetUnfolder]: 2600/4125 cut-off events. [2022-12-13 00:54:14,321 INFO L131 PetriNetUnfolder]: For 3701/3701 co-relation queries the response was YES. [2022-12-13 00:54:14,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11490 conditions, 4125 events. 2600/4125 cut-off events. For 3701/3701 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 23434 event pairs, 420 based on Foata normal form. 81/3469 useless extension candidates. Maximal degree in co-relation 11473. Up to 1968 conditions per place. [2022-12-13 00:54:14,340 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 67 selfloop transitions, 26 changer transitions 10/110 dead transitions. [2022-12-13 00:54:14,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 110 transitions, 662 flow [2022-12-13 00:54:14,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:54:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:54:14,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2022-12-13 00:54:14,341 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2022-12-13 00:54:14,341 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 175 flow. Second operand 6 states and 122 transitions. [2022-12-13 00:54:14,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 110 transitions, 662 flow [2022-12-13 00:54:14,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 110 transitions, 634 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 00:54:14,345 INFO L231 Difference]: Finished difference. Result has 55 places, 61 transitions, 378 flow [2022-12-13 00:54:14,346 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=378, PETRI_PLACES=55, PETRI_TRANSITIONS=61} [2022-12-13 00:54:14,346 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -9 predicate places. [2022-12-13 00:54:14,346 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:14,346 INFO L89 Accepts]: Start accepts. Operand has 55 places, 61 transitions, 378 flow [2022-12-13 00:54:14,347 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:14,347 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:14,347 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 61 transitions, 378 flow [2022-12-13 00:54:14,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 61 transitions, 378 flow [2022-12-13 00:54:14,384 INFO L130 PetriNetUnfolder]: 202/564 cut-off events. [2022-12-13 00:54:14,384 INFO L131 PetriNetUnfolder]: For 655/703 co-relation queries the response was YES. [2022-12-13 00:54:14,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 564 events. 202/564 cut-off events. For 655/703 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3846 event pairs, 75 based on Foata normal form. 5/437 useless extension candidates. Maximal degree in co-relation 1661. Up to 251 conditions per place. [2022-12-13 00:54:14,388 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 61 transitions, 378 flow [2022-12-13 00:54:14,388 INFO L226 LiptonReduction]: Number of co-enabled transitions 832 [2022-12-13 00:54:14,389 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:14,390 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 00:54:14,390 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 61 transitions, 378 flow [2022-12-13 00:54:14,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:14,390 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:14,390 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:14,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:54:14,390 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:54:14,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:14,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1401756272, now seen corresponding path program 1 times [2022-12-13 00:54:14,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:14,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032566101] [2022-12-13 00:54:14,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:14,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:14,763 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:54:14,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:14,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032566101] [2022-12-13 00:54:14,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032566101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:14,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:14,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:54:14,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993775702] [2022-12-13 00:54:14,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:14,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:54:14,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:14,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:54:14,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:54:14,765 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 00:54:14,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 61 transitions, 378 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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:54:14,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:14,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 00:54:14,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:15,201 INFO L130 PetriNetUnfolder]: 2699/4325 cut-off events. [2022-12-13 00:54:15,201 INFO L131 PetriNetUnfolder]: For 6098/6098 co-relation queries the response was YES. [2022-12-13 00:54:15,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14054 conditions, 4325 events. 2699/4325 cut-off events. For 6098/6098 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 24564 event pairs, 299 based on Foata normal form. 16/3571 useless extension candidates. Maximal degree in co-relation 14033. Up to 2901 conditions per place. [2022-12-13 00:54:15,229 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 59 selfloop transitions, 29 changer transitions 1/96 dead transitions. [2022-12-13 00:54:15,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 96 transitions, 709 flow [2022-12-13 00:54:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:54:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:54:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-13 00:54:15,232 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2022-12-13 00:54:15,232 INFO L175 Difference]: Start difference. First operand has 55 places, 61 transitions, 378 flow. Second operand 5 states and 98 transitions. [2022-12-13 00:54:15,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 96 transitions, 709 flow [2022-12-13 00:54:15,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 96 transitions, 709 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:54:15,246 INFO L231 Difference]: Finished difference. Result has 61 places, 65 transitions, 489 flow [2022-12-13 00:54:15,246 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=489, PETRI_PLACES=61, PETRI_TRANSITIONS=65} [2022-12-13 00:54:15,248 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2022-12-13 00:54:15,248 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:15,248 INFO L89 Accepts]: Start accepts. Operand has 61 places, 65 transitions, 489 flow [2022-12-13 00:54:15,249 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:15,249 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:15,249 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 65 transitions, 489 flow [2022-12-13 00:54:15,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 65 transitions, 489 flow [2022-12-13 00:54:15,291 INFO L130 PetriNetUnfolder]: 243/643 cut-off events. [2022-12-13 00:54:15,292 INFO L131 PetriNetUnfolder]: For 1223/1271 co-relation queries the response was YES. [2022-12-13 00:54:15,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2168 conditions, 643 events. 243/643 cut-off events. For 1223/1271 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4365 event pairs, 67 based on Foata normal form. 8/504 useless extension candidates. Maximal degree in co-relation 2146. Up to 280 conditions per place. [2022-12-13 00:54:15,297 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 65 transitions, 489 flow [2022-12-13 00:54:15,298 INFO L226 LiptonReduction]: Number of co-enabled transitions 870 [2022-12-13 00:54:15,299 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:15,299 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 00:54:15,299 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 65 transitions, 489 flow [2022-12-13 00:54:15,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 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:54:15,300 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:15,300 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:15,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:54:15,300 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:54:15,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:15,300 INFO L85 PathProgramCache]: Analyzing trace with hash -838600060, now seen corresponding path program 2 times [2022-12-13 00:54:15,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:15,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956384009] [2022-12-13 00:54:15,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:15,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:15,517 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:54:15,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:15,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956384009] [2022-12-13 00:54:15,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956384009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:15,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:15,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:54:15,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364541822] [2022-12-13 00:54:15,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:15,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:54:15,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:15,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:54:15,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:54:15,518 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 00:54:15,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 65 transitions, 489 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:54:15,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:15,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 00:54:15,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:15,852 INFO L130 PetriNetUnfolder]: 2353/3941 cut-off events. [2022-12-13 00:54:15,853 INFO L131 PetriNetUnfolder]: For 7540/7576 co-relation queries the response was YES. [2022-12-13 00:54:15,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13840 conditions, 3941 events. 2353/3941 cut-off events. For 7540/7576 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 24186 event pairs, 431 based on Foata normal form. 5/3202 useless extension candidates. Maximal degree in co-relation 13815. Up to 2725 conditions per place. [2022-12-13 00:54:15,872 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 54 selfloop transitions, 16 changer transitions 0/86 dead transitions. [2022-12-13 00:54:15,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 742 flow [2022-12-13 00:54:15,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:54:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:54:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-13 00:54:15,873 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-13 00:54:15,874 INFO L175 Difference]: Start difference. First operand has 61 places, 65 transitions, 489 flow. Second operand 4 states and 78 transitions. [2022-12-13 00:54:15,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 742 flow [2022-12-13 00:54:15,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:54:15,883 INFO L231 Difference]: Finished difference. Result has 64 places, 70 transitions, 549 flow [2022-12-13 00:54:15,884 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=549, PETRI_PLACES=64, PETRI_TRANSITIONS=70} [2022-12-13 00:54:15,884 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 0 predicate places. [2022-12-13 00:54:15,884 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:15,884 INFO L89 Accepts]: Start accepts. Operand has 64 places, 70 transitions, 549 flow [2022-12-13 00:54:15,885 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:15,885 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:15,885 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 70 transitions, 549 flow [2022-12-13 00:54:15,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 70 transitions, 549 flow [2022-12-13 00:54:15,926 INFO L130 PetriNetUnfolder]: 248/654 cut-off events. [2022-12-13 00:54:15,926 INFO L131 PetriNetUnfolder]: For 1616/1698 co-relation queries the response was YES. [2022-12-13 00:54:15,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2314 conditions, 654 events. 248/654 cut-off events. For 1616/1698 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4498 event pairs, 52 based on Foata normal form. 7/513 useless extension candidates. Maximal degree in co-relation 2289. Up to 283 conditions per place. [2022-12-13 00:54:15,932 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 70 transitions, 549 flow [2022-12-13 00:54:15,932 INFO L226 LiptonReduction]: Number of co-enabled transitions 914 [2022-12-13 00:54:15,933 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:15,934 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 00:54:15,934 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 70 transitions, 549 flow [2022-12-13 00:54:15,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:54:15,934 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:15,934 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:15,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:54:15,934 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:54:15,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:15,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1401233829, now seen corresponding path program 1 times [2022-12-13 00:54:15,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:15,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270676784] [2022-12-13 00:54:15,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:15,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:16,035 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:54:16,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:16,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270676784] [2022-12-13 00:54:16,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270676784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:16,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:16,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:54:16,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096120653] [2022-12-13 00:54:16,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:16,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:54:16,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:16,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:54:16,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:54:16,036 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 00:54:16,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 70 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:16,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:16,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 00:54:16,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:16,438 INFO L130 PetriNetUnfolder]: 3277/5590 cut-off events. [2022-12-13 00:54:16,438 INFO L131 PetriNetUnfolder]: For 16199/16326 co-relation queries the response was YES. [2022-12-13 00:54:16,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18606 conditions, 5590 events. 3277/5590 cut-off events. For 16199/16326 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 37821 event pairs, 1517 based on Foata normal form. 150/4510 useless extension candidates. Maximal degree in co-relation 18578. Up to 2742 conditions per place. [2022-12-13 00:54:16,464 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 60 selfloop transitions, 8 changer transitions 0/83 dead transitions. [2022-12-13 00:54:16,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 83 transitions, 740 flow [2022-12-13 00:54:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:54:16,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:54:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-13 00:54:16,466 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2022-12-13 00:54:16,466 INFO L175 Difference]: Start difference. First operand has 64 places, 70 transitions, 549 flow. Second operand 3 states and 61 transitions. [2022-12-13 00:54:16,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 83 transitions, 740 flow [2022-12-13 00:54:16,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 83 transitions, 724 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 00:54:16,477 INFO L231 Difference]: Finished difference. Result has 66 places, 70 transitions, 559 flow [2022-12-13 00:54:16,477 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=559, PETRI_PLACES=66, PETRI_TRANSITIONS=70} [2022-12-13 00:54:16,478 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 2 predicate places. [2022-12-13 00:54:16,479 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:16,479 INFO L89 Accepts]: Start accepts. Operand has 66 places, 70 transitions, 559 flow [2022-12-13 00:54:16,479 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:16,480 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:16,480 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 70 transitions, 559 flow [2022-12-13 00:54:16,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 70 transitions, 559 flow [2022-12-13 00:54:16,528 INFO L130 PetriNetUnfolder]: 266/811 cut-off events. [2022-12-13 00:54:16,528 INFO L131 PetriNetUnfolder]: For 1996/2078 co-relation queries the response was YES. [2022-12-13 00:54:16,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2646 conditions, 811 events. 266/811 cut-off events. For 1996/2078 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6395 event pairs, 86 based on Foata normal form. 7/602 useless extension candidates. Maximal degree in co-relation 2620. Up to 331 conditions per place. [2022-12-13 00:54:16,534 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 70 transitions, 559 flow [2022-12-13 00:54:16,535 INFO L226 LiptonReduction]: Number of co-enabled transitions 910 [2022-12-13 00:54:16,536 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:16,538 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-13 00:54:16,538 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 559 flow [2022-12-13 00:54:16,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:16,538 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:16,538 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:16,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:54:16,538 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:54:16,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:16,539 INFO L85 PathProgramCache]: Analyzing trace with hash -466849260, now seen corresponding path program 1 times [2022-12-13 00:54:16,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:16,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251003644] [2022-12-13 00:54:16,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:16,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:17,205 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:54:17,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:17,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251003644] [2022-12-13 00:54:17,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251003644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:17,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:17,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:54:17,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102371254] [2022-12-13 00:54:17,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:17,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:54:17,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:17,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:54:17,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:54:17,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 00:54:17,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 559 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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:54:17,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:17,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 00:54:17,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:17,862 INFO L130 PetriNetUnfolder]: 3693/6023 cut-off events. [2022-12-13 00:54:17,863 INFO L131 PetriNetUnfolder]: For 15803/15803 co-relation queries the response was YES. [2022-12-13 00:54:17,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21015 conditions, 6023 events. 3693/6023 cut-off events. For 15803/15803 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 37277 event pairs, 911 based on Foata normal form. 4/4846 useless extension candidates. Maximal degree in co-relation 20986. Up to 4401 conditions per place. [2022-12-13 00:54:17,885 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 59 selfloop transitions, 40 changer transitions 7/113 dead transitions. [2022-12-13 00:54:17,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 113 transitions, 1011 flow [2022-12-13 00:54:17,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:54:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:54:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2022-12-13 00:54:17,887 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2022-12-13 00:54:17,887 INFO L175 Difference]: Start difference. First operand has 66 places, 70 transitions, 559 flow. Second operand 7 states and 124 transitions. [2022-12-13 00:54:17,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 113 transitions, 1011 flow [2022-12-13 00:54:17,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 113 transitions, 999 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:54:17,903 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 748 flow [2022-12-13 00:54:17,903 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=748, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2022-12-13 00:54:17,903 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 9 predicate places. [2022-12-13 00:54:17,904 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:17,904 INFO L89 Accepts]: Start accepts. Operand has 73 places, 75 transitions, 748 flow [2022-12-13 00:54:17,904 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:17,904 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:17,905 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 75 transitions, 748 flow [2022-12-13 00:54:17,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 75 transitions, 748 flow [2022-12-13 00:54:17,955 INFO L130 PetriNetUnfolder]: 252/793 cut-off events. [2022-12-13 00:54:17,955 INFO L131 PetriNetUnfolder]: For 2493/2579 co-relation queries the response was YES. [2022-12-13 00:54:17,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3035 conditions, 793 events. 252/793 cut-off events. For 2493/2579 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6315 event pairs, 44 based on Foata normal form. 5/581 useless extension candidates. Maximal degree in co-relation 3006. Up to 324 conditions per place. [2022-12-13 00:54:17,962 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 75 transitions, 748 flow [2022-12-13 00:54:17,962 INFO L226 LiptonReduction]: Number of co-enabled transitions 934 [2022-12-13 00:54:17,986 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] L759-->L762: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [355] $Ultimate##0-->L742: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~z~0_28 2)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~z~0=v_~z~0_28, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, P0Thread1of1ForFork2_~arg.base] [2022-12-13 00:54:18,000 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] L759-->L762: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [400] L2-1-->L831: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_154 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_229 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_150 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_230 256) 0)) .cse5)) (.cse1 (and .cse5 .cse4)) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_203 256) 0))))) (and (= v_~y$w_buff0_used~0_229 (ite .cse0 0 v_~y$w_buff0_used~0_230)) (= v_~y$r_buff0_thd0~0_149 (ite .cse1 0 v_~y$r_buff0_thd0~0_150)) (= v_~y~0_170 (ite .cse0 v_~y$w_buff0~0_144 (ite .cse2 v_~y$w_buff1~0_135 v_~y~0_171))) (= v_~y$w_buff1_used~0_202 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_203)) (= v_~y$r_buff1_thd0~0_153 (ite (or (and .cse3 (not (= 0 (mod v_~y$w_buff1_used~0_202 256)))) (and (not (= (mod v_~y$r_buff0_thd0~0_149 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_154))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_230, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, ~y$w_buff0~0=v_~y$w_buff0~0_144, ~y~0=v_~y~0_171, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_154, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_203} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_229, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_149, ~y$w_buff0~0=v_~y$w_buff0~0_144, ~y~0=v_~y~0_170, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_202} 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:54:18,110 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] L759-->L762: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [358] $Ultimate##0-->L788: Formula: (and (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~y$w_buff0~0_81 v_~y$w_buff1~0_76) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_141) (= v_~y$r_buff0_thd1~0_11 v_~y$r_buff1_thd1~0_13) (= v_~y$w_buff0_used~0_163 1) (= v_~y$r_buff0_thd3~0_58 1) (= v_~y$r_buff0_thd3~0_59 v_~y$r_buff1_thd3~0_39) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_163 256) 0)) (not (= (mod v_~y$w_buff1_used~0_141 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~y$r_buff0_thd0~0_89 v_~y$r_buff1_thd0~0_91) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|) (= 2 v_~y$w_buff0~0_80) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| 0)) (= v_~y$r_buff0_thd2~0_39 v_~y$r_buff1_thd2~0_39)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_59, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_81, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, 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_39, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_76, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_58, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_80, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_91, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_141} 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, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-13 00:54:18,195 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:54:18,196 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 292 [2022-12-13 00:54:18,196 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 762 flow [2022-12-13 00:54:18,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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:54:18,196 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:18,196 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:18,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:54:18,196 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:54:18,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:18,197 INFO L85 PathProgramCache]: Analyzing trace with hash -529518534, now seen corresponding path program 2 times [2022-12-13 00:54:18,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:18,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14803660] [2022-12-13 00:54:18,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:18,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:19,018 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:54:19,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:19,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14803660] [2022-12-13 00:54:19,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14803660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:19,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:19,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:54:19,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838420383] [2022-12-13 00:54:19,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:19,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:54:19,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:19,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:54:19,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:54:19,020 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2022-12-13 00:54:19,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 762 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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:54:19,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:19,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2022-12-13 00:54:19,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:19,535 INFO L130 PetriNetUnfolder]: 3630/5920 cut-off events. [2022-12-13 00:54:19,535 INFO L131 PetriNetUnfolder]: For 21925/21925 co-relation queries the response was YES. [2022-12-13 00:54:19,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23156 conditions, 5920 events. 3630/5920 cut-off events. For 21925/21925 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 36802 event pairs, 922 based on Foata normal form. 5/4761 useless extension candidates. Maximal degree in co-relation 23124. Up to 4627 conditions per place. [2022-12-13 00:54:19,563 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 79 selfloop transitions, 37 changer transitions 8/131 dead transitions. [2022-12-13 00:54:19,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 131 transitions, 1495 flow [2022-12-13 00:54:19,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:54:19,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:54:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2022-12-13 00:54:19,565 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5210084033613446 [2022-12-13 00:54:19,565 INFO L175 Difference]: Start difference. First operand has 72 places, 74 transitions, 762 flow. Second operand 7 states and 124 transitions. [2022-12-13 00:54:19,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 131 transitions, 1495 flow [2022-12-13 00:54:19,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 131 transitions, 1437 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-13 00:54:19,594 INFO L231 Difference]: Finished difference. Result has 78 places, 88 transitions, 1011 flow [2022-12-13 00:54:19,594 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1011, PETRI_PLACES=78, PETRI_TRANSITIONS=88} [2022-12-13 00:54:19,595 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 14 predicate places. [2022-12-13 00:54:19,595 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:19,595 INFO L89 Accepts]: Start accepts. Operand has 78 places, 88 transitions, 1011 flow [2022-12-13 00:54:19,596 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:19,596 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:19,596 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 88 transitions, 1011 flow [2022-12-13 00:54:19,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 88 transitions, 1011 flow [2022-12-13 00:54:19,650 INFO L130 PetriNetUnfolder]: 285/806 cut-off events. [2022-12-13 00:54:19,650 INFO L131 PetriNetUnfolder]: For 3389/3540 co-relation queries the response was YES. [2022-12-13 00:54:19,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3610 conditions, 806 events. 285/806 cut-off events. For 3389/3540 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6070 event pairs, 50 based on Foata normal form. 5/614 useless extension candidates. Maximal degree in co-relation 3578. Up to 370 conditions per place. [2022-12-13 00:54:19,657 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 88 transitions, 1011 flow [2022-12-13 00:54:19,657 INFO L226 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-13 00:54:19,662 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:19,662 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-13 00:54:19,662 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 88 transitions, 1011 flow [2022-12-13 00:54:19,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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:54:19,663 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:19,663 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:19,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:54:19,663 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:54:19,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash -285905276, now seen corresponding path program 1 times [2022-12-13 00:54:19,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:19,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088861509] [2022-12-13 00:54:19,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:19,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:20,248 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:54:20,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:20,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088861509] [2022-12-13 00:54:20,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088861509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:20,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:20,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:54:20,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602698101] [2022-12-13 00:54:20,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:20,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:54:20,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:20,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:54:20,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:54:20,249 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 00:54:20,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 88 transitions, 1011 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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:54:20,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:20,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 00:54:20,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:20,864 INFO L130 PetriNetUnfolder]: 3637/6178 cut-off events. [2022-12-13 00:54:20,864 INFO L131 PetriNetUnfolder]: For 28333/28644 co-relation queries the response was YES. [2022-12-13 00:54:20,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25770 conditions, 6178 events. 3637/6178 cut-off events. For 28333/28644 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 42663 event pairs, 627 based on Foata normal form. 169/5113 useless extension candidates. Maximal degree in co-relation 25735. Up to 4100 conditions per place. [2022-12-13 00:54:20,892 INFO L137 encePairwiseOnDemand]: 24/34 looper letters, 78 selfloop transitions, 39 changer transitions 2/135 dead transitions. [2022-12-13 00:54:20,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 135 transitions, 1685 flow [2022-12-13 00:54:20,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:54:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:54:20,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-12-13 00:54:20,893 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2022-12-13 00:54:20,893 INFO L175 Difference]: Start difference. First operand has 78 places, 88 transitions, 1011 flow. Second operand 5 states and 100 transitions. [2022-12-13 00:54:20,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 135 transitions, 1685 flow [2022-12-13 00:54:20,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 135 transitions, 1643 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 00:54:20,927 INFO L231 Difference]: Finished difference. Result has 80 places, 107 transitions, 1366 flow [2022-12-13 00:54:20,927 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1366, PETRI_PLACES=80, PETRI_TRANSITIONS=107} [2022-12-13 00:54:20,927 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 16 predicate places. [2022-12-13 00:54:20,927 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:20,928 INFO L89 Accepts]: Start accepts. Operand has 80 places, 107 transitions, 1366 flow [2022-12-13 00:54:20,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:20,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:20,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 107 transitions, 1366 flow [2022-12-13 00:54:20,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 107 transitions, 1366 flow [2022-12-13 00:54:21,017 INFO L130 PetriNetUnfolder]: 350/996 cut-off events. [2022-12-13 00:54:21,017 INFO L131 PetriNetUnfolder]: For 4843/5019 co-relation queries the response was YES. [2022-12-13 00:54:21,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4939 conditions, 996 events. 350/996 cut-off events. For 4843/5019 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 7957 event pairs, 39 based on Foata normal form. 24/777 useless extension candidates. Maximal degree in co-relation 4905. Up to 457 conditions per place. [2022-12-13 00:54:21,026 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 107 transitions, 1366 flow [2022-12-13 00:54:21,026 INFO L226 LiptonReduction]: Number of co-enabled transitions 1182 [2022-12-13 00:54:21,029 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:21,031 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 00:54:21,031 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 107 transitions, 1366 flow [2022-12-13 00:54:21,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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:54:21,031 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:21,031 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:21,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:54:21,031 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:54:21,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:21,032 INFO L85 PathProgramCache]: Analyzing trace with hash -466812060, now seen corresponding path program 3 times [2022-12-13 00:54:21,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:21,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511802684] [2022-12-13 00:54:21,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:21,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:21,524 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:54:21,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:21,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511802684] [2022-12-13 00:54:21,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511802684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:21,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:21,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:54:21,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591359195] [2022-12-13 00:54:21,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:21,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:54:21,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:21,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:54:21,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:54:21,526 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2022-12-13 00:54:21,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 107 transitions, 1366 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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:54:21,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:21,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2022-12-13 00:54:21,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:22,534 INFO L130 PetriNetUnfolder]: 4481/7253 cut-off events. [2022-12-13 00:54:22,535 INFO L131 PetriNetUnfolder]: For 38322/38322 co-relation queries the response was YES. [2022-12-13 00:54:22,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32999 conditions, 7253 events. 4481/7253 cut-off events. For 38322/38322 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 46556 event pairs, 930 based on Foata normal form. 20/5871 useless extension candidates. Maximal degree in co-relation 32962. Up to 4846 conditions per place. [2022-12-13 00:54:22,600 INFO L137 encePairwiseOnDemand]: 20/34 looper letters, 77 selfloop transitions, 62 changer transitions 3/149 dead transitions. [2022-12-13 00:54:22,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 149 transitions, 1971 flow [2022-12-13 00:54:22,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:54:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:54:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-12-13 00:54:22,602 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2022-12-13 00:54:22,602 INFO L175 Difference]: Start difference. First operand has 80 places, 107 transitions, 1366 flow. Second operand 6 states and 105 transitions. [2022-12-13 00:54:22,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 149 transitions, 1971 flow [2022-12-13 00:54:22,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 149 transitions, 1959 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-13 00:54:22,701 INFO L231 Difference]: Finished difference. Result has 87 places, 122 transitions, 1783 flow [2022-12-13 00:54:22,702 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1783, PETRI_PLACES=87, PETRI_TRANSITIONS=122} [2022-12-13 00:54:22,702 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 23 predicate places. [2022-12-13 00:54:22,702 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:22,702 INFO L89 Accepts]: Start accepts. Operand has 87 places, 122 transitions, 1783 flow [2022-12-13 00:54:22,703 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:22,703 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:22,704 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 122 transitions, 1783 flow [2022-12-13 00:54:22,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 122 transitions, 1783 flow [2022-12-13 00:54:22,814 INFO L130 PetriNetUnfolder]: 393/1067 cut-off events. [2022-12-13 00:54:22,814 INFO L131 PetriNetUnfolder]: For 7071/7250 co-relation queries the response was YES. [2022-12-13 00:54:22,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6070 conditions, 1067 events. 393/1067 cut-off events. For 7071/7250 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 8343 event pairs, 45 based on Foata normal form. 16/843 useless extension candidates. Maximal degree in co-relation 6032. Up to 502 conditions per place. [2022-12-13 00:54:22,831 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 122 transitions, 1783 flow [2022-12-13 00:54:22,831 INFO L226 LiptonReduction]: Number of co-enabled transitions 1252 [2022-12-13 00:54:22,840 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:22,842 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 00:54:22,842 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 122 transitions, 1783 flow [2022-12-13 00:54:22,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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:54:22,842 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:22,842 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:22,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:54:22,843 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:54:22,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:22,843 INFO L85 PathProgramCache]: Analyzing trace with hash -272621907, now seen corresponding path program 1 times [2022-12-13 00:54:22,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:22,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979138044] [2022-12-13 00:54:22,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:22,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:23,239 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:54:23,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:23,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979138044] [2022-12-13 00:54:23,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979138044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:23,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:23,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:54:23,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682884790] [2022-12-13 00:54:23,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:23,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:54:23,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:23,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:54:23,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:54:23,241 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 00:54:23,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 122 transitions, 1783 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:23,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:23,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 00:54:23,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:23,951 INFO L130 PetriNetUnfolder]: 4096/6913 cut-off events. [2022-12-13 00:54:23,951 INFO L131 PetriNetUnfolder]: For 51911/52210 co-relation queries the response was YES. [2022-12-13 00:54:23,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34577 conditions, 6913 events. 4096/6913 cut-off events. For 51911/52210 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 48097 event pairs, 730 based on Foata normal form. 153/5690 useless extension candidates. Maximal degree in co-relation 34536. Up to 4232 conditions per place. [2022-12-13 00:54:23,994 INFO L137 encePairwiseOnDemand]: 24/34 looper letters, 81 selfloop transitions, 53 changer transitions 4/158 dead transitions. [2022-12-13 00:54:23,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 158 transitions, 2371 flow [2022-12-13 00:54:23,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:54:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:54:23,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-13 00:54:23,995 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6058823529411764 [2022-12-13 00:54:23,995 INFO L175 Difference]: Start difference. First operand has 87 places, 122 transitions, 1783 flow. Second operand 5 states and 103 transitions. [2022-12-13 00:54:23,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 158 transitions, 2371 flow [2022-12-13 00:54:24,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 158 transitions, 2334 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 00:54:24,074 INFO L231 Difference]: Finished difference. Result has 90 places, 128 transitions, 2022 flow [2022-12-13 00:54:24,074 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1748, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2022, PETRI_PLACES=90, PETRI_TRANSITIONS=128} [2022-12-13 00:54:24,074 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 26 predicate places. [2022-12-13 00:54:24,074 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:24,074 INFO L89 Accepts]: Start accepts. Operand has 90 places, 128 transitions, 2022 flow [2022-12-13 00:54:24,075 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:24,075 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:24,075 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 128 transitions, 2022 flow [2022-12-13 00:54:24,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 128 transitions, 2022 flow [2022-12-13 00:54:24,176 INFO L130 PetriNetUnfolder]: 381/1066 cut-off events. [2022-12-13 00:54:24,176 INFO L131 PetriNetUnfolder]: For 8483/8668 co-relation queries the response was YES. [2022-12-13 00:54:24,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6590 conditions, 1066 events. 381/1066 cut-off events. For 8483/8668 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 8603 event pairs, 46 based on Foata normal form. 16/844 useless extension candidates. Maximal degree in co-relation 6550. Up to 495 conditions per place. [2022-12-13 00:54:24,186 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 128 transitions, 2022 flow [2022-12-13 00:54:24,186 INFO L226 LiptonReduction]: Number of co-enabled transitions 1334 [2022-12-13 00:54:24,188 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:24,189 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 00:54:24,189 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 128 transitions, 2022 flow [2022-12-13 00:54:24,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:24,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:24,189 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:24,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:54:24,189 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:54:24,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash -274417055, now seen corresponding path program 1 times [2022-12-13 00:54:24,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:24,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82348839] [2022-12-13 00:54:24,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:24,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:24,662 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:54:24,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:24,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82348839] [2022-12-13 00:54:24,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82348839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:24,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:24,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:54:24,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737773365] [2022-12-13 00:54:24,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:24,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:54:24,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:24,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:54:24,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:54:24,664 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 00:54:24,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 128 transitions, 2022 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:54:24,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:24,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 00:54:24,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:25,379 INFO L130 PetriNetUnfolder]: 3875/6538 cut-off events. [2022-12-13 00:54:25,379 INFO L131 PetriNetUnfolder]: For 59509/59713 co-relation queries the response was YES. [2022-12-13 00:54:25,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34862 conditions, 6538 events. 3875/6538 cut-off events. For 59509/59713 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 44962 event pairs, 749 based on Foata normal form. 146/5404 useless extension candidates. Maximal degree in co-relation 34819. Up to 3326 conditions per place. [2022-12-13 00:54:25,422 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 72 selfloop transitions, 34 changer transitions 28/151 dead transitions. [2022-12-13 00:54:25,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 151 transitions, 2395 flow [2022-12-13 00:54:25,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:54:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:54:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-12-13 00:54:25,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2022-12-13 00:54:25,424 INFO L175 Difference]: Start difference. First operand has 90 places, 128 transitions, 2022 flow. Second operand 5 states and 100 transitions. [2022-12-13 00:54:25,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 151 transitions, 2395 flow [2022-12-13 00:54:25,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 151 transitions, 2343 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-13 00:54:25,558 INFO L231 Difference]: Finished difference. Result has 94 places, 109 transitions, 1725 flow [2022-12-13 00:54:25,558 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1970, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1725, PETRI_PLACES=94, PETRI_TRANSITIONS=109} [2022-12-13 00:54:25,558 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 30 predicate places. [2022-12-13 00:54:25,559 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:25,559 INFO L89 Accepts]: Start accepts. Operand has 94 places, 109 transitions, 1725 flow [2022-12-13 00:54:25,560 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:25,560 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:25,561 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 109 transitions, 1725 flow [2022-12-13 00:54:25,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 109 transitions, 1725 flow [2022-12-13 00:54:25,602 INFO L130 PetriNetUnfolder]: 166/428 cut-off events. [2022-12-13 00:54:25,602 INFO L131 PetriNetUnfolder]: For 4000/4015 co-relation queries the response was YES. [2022-12-13 00:54:25,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2782 conditions, 428 events. 166/428 cut-off events. For 4000/4015 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 2539 event pairs, 20 based on Foata normal form. 7/360 useless extension candidates. Maximal degree in co-relation 2740. Up to 227 conditions per place. [2022-12-13 00:54:25,607 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 109 transitions, 1725 flow [2022-12-13 00:54:25,607 INFO L226 LiptonReduction]: Number of co-enabled transitions 890 [2022-12-13 00:54:25,727 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] L759-->L762: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [358] $Ultimate##0-->L788: Formula: (and (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~y$w_buff0~0_81 v_~y$w_buff1~0_76) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_141) (= v_~y$r_buff0_thd1~0_11 v_~y$r_buff1_thd1~0_13) (= v_~y$w_buff0_used~0_163 1) (= v_~y$r_buff0_thd3~0_58 1) (= v_~y$r_buff0_thd3~0_59 v_~y$r_buff1_thd3~0_39) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_163 256) 0)) (not (= (mod v_~y$w_buff1_used~0_141 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~y$r_buff0_thd0~0_89 v_~y$r_buff1_thd0~0_91) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|) (= 2 v_~y$w_buff0~0_80) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| 0)) (= v_~y$r_buff0_thd2~0_39 v_~y$r_buff1_thd2~0_39)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_59, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_81, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, 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_39, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_76, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_58, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_80, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_91, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_141} 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, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-13 00:54:25,852 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [450] L759-->L831: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_527 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd0~0_372 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd0~0_362 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_528 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_478 256) 0)))) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_528) v_~y$w_buff0_used~0_527) (= v_~y$w_buff1_used~0_477 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_478)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_361 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_477 256) 0)))) 0 v_~y$r_buff1_thd0~0_372) v_~y$r_buff1_thd0~0_371) (= v_~y~0_428 (ite .cse0 v_~y$w_buff0~0_402 (ite .cse1 v_~y$w_buff1~0_372 1))) (= v_~y$r_buff0_thd0~0_361 (ite .cse2 0 v_~y$r_buff0_thd0~0_362))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_528, ~y$w_buff1~0=v_~y$w_buff1~0_372, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_362, ~y$w_buff0~0=v_~y$w_buff0~0_402, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_372, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_478} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_527, ~y$w_buff1~0=v_~y$w_buff1~0_372, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_361, ~y$w_buff0~0=v_~y$w_buff0~0_402, ~y~0=v_~y~0_428, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_371, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_477} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [319] L762-->L769: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_24 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~y~0_51 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse1 v_~y$w_buff1~0_37 v_~y~0_52))) (= v_~y$w_buff1_used~0_82 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_97 (ite .cse0 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_82 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_23 256) 0)) .cse4)) 0 v_~y$r_buff1_thd2~0_22) v_~y$r_buff1_thd2~0_21) (= v_~y$r_buff0_thd2~0_23 (ite .cse2 0 v_~y$r_buff0_thd2~0_24))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_23, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} 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:54:25,993 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [450] L759-->L831: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_527 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd0~0_372 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd0~0_362 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_528 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_478 256) 0)))) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_528) v_~y$w_buff0_used~0_527) (= v_~y$w_buff1_used~0_477 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_478)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_361 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_477 256) 0)))) 0 v_~y$r_buff1_thd0~0_372) v_~y$r_buff1_thd0~0_371) (= v_~y~0_428 (ite .cse0 v_~y$w_buff0~0_402 (ite .cse1 v_~y$w_buff1~0_372 1))) (= v_~y$r_buff0_thd0~0_361 (ite .cse2 0 v_~y$r_buff0_thd0~0_362))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_528, ~y$w_buff1~0=v_~y$w_buff1~0_372, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_362, ~y$w_buff0~0=v_~y$w_buff0~0_402, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_372, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_478} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_527, ~y$w_buff1~0=v_~y$w_buff1~0_372, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_361, ~y$w_buff0~0=v_~y$w_buff0~0_402, ~y~0=v_~y~0_428, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_371, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_477} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [358] $Ultimate##0-->L788: Formula: (and (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~y$w_buff0~0_81 v_~y$w_buff1~0_76) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_141) (= v_~y$r_buff0_thd1~0_11 v_~y$r_buff1_thd1~0_13) (= v_~y$w_buff0_used~0_163 1) (= v_~y$r_buff0_thd3~0_58 1) (= v_~y$r_buff0_thd3~0_59 v_~y$r_buff1_thd3~0_39) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_163 256) 0)) (not (= (mod v_~y$w_buff1_used~0_141 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~y$r_buff0_thd0~0_89 v_~y$r_buff1_thd0~0_91) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|) (= 2 v_~y$w_buff0~0_80) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| 0)) (= v_~y$r_buff0_thd2~0_39 v_~y$r_buff1_thd2~0_39)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_59, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_81, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, 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_39, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_76, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_58, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_80, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_91, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_141} 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, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-13 00:54:26,165 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:54:26,166 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 607 [2022-12-13 00:54:26,166 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 107 transitions, 1726 flow [2022-12-13 00:54:26,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:54:26,166 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:26,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:26,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 00:54:26,166 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:26,167 INFO L85 PathProgramCache]: Analyzing trace with hash -488618374, now seen corresponding path program 1 times [2022-12-13 00:54:26,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:26,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836081760] [2022-12-13 00:54:26,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:26,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:26,277 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:54:26,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:26,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836081760] [2022-12-13 00:54:26,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836081760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:26,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:26,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:54:26,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741989445] [2022-12-13 00:54:26,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:26,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:54:26,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:26,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:54:26,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:54:26,279 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2022-12-13 00:54:26,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 107 transitions, 1726 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:26,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:26,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2022-12-13 00:54:26,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:26,621 INFO L130 PetriNetUnfolder]: 2292/3597 cut-off events. [2022-12-13 00:54:26,621 INFO L131 PetriNetUnfolder]: For 37766/38042 co-relation queries the response was YES. [2022-12-13 00:54:26,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17740 conditions, 3597 events. 2292/3597 cut-off events. For 37766/38042 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 20148 event pairs, 687 based on Foata normal form. 213/2542 useless extension candidates. Maximal degree in co-relation 17710. Up to 3388 conditions per place. [2022-12-13 00:54:26,641 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 75 selfloop transitions, 10 changer transitions 5/104 dead transitions. [2022-12-13 00:54:26,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 104 transitions, 1585 flow [2022-12-13 00:54:26,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:54:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:54:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 00:54:26,643 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-13 00:54:26,643 INFO L175 Difference]: Start difference. First operand has 90 places, 107 transitions, 1726 flow. Second operand 3 states and 63 transitions. [2022-12-13 00:54:26,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 104 transitions, 1585 flow [2022-12-13 00:54:26,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 104 transitions, 1427 flow, removed 21 selfloop flow, removed 10 redundant places. [2022-12-13 00:54:26,665 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 987 flow [2022-12-13 00:54:26,665 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=987, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2022-12-13 00:54:26,665 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 19 predicate places. [2022-12-13 00:54:26,665 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:26,666 INFO L89 Accepts]: Start accepts. Operand has 83 places, 82 transitions, 987 flow [2022-12-13 00:54:26,667 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:26,667 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:26,667 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 82 transitions, 987 flow [2022-12-13 00:54:26,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 82 transitions, 987 flow [2022-12-13 00:54:26,787 INFO L130 PetriNetUnfolder]: 1059/2113 cut-off events. [2022-12-13 00:54:26,788 INFO L131 PetriNetUnfolder]: For 6023/6126 co-relation queries the response was YES. [2022-12-13 00:54:26,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7417 conditions, 2113 events. 1059/2113 cut-off events. For 6023/6126 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 16768 event pairs, 446 based on Foata normal form. 16/1128 useless extension candidates. Maximal degree in co-relation 7382. Up to 1528 conditions per place. [2022-12-13 00:54:26,806 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 82 transitions, 987 flow [2022-12-13 00:54:26,806 INFO L226 LiptonReduction]: Number of co-enabled transitions 734 [2022-12-13 00:54:27,209 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] L759-->L788: Formula: (and (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_61| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_61|) (= v_~y$w_buff1~0_376 v_~y$w_buff0~0_407) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_98) (= v_~y$r_buff0_thd3~0_127 v_~y$r_buff1_thd3~0_91) (= v_~y$w_buff0_used~0_535 1) (= v_~y$r_buff0_thd1~0_37 v_~y$r_buff1_thd1~0_45) (= v_~y$w_buff0_used~0_536 v_~y$w_buff1_used~0_485) (= v_~y$r_buff0_thd3~0_126 1) (= v_~y~0_436 1) (= |v_P2Thread1of1ForFork1_~arg#1.base_57| |v_P2Thread1of1ForFork1_#in~arg#1.base_57|) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_535 256) 0)) (not (= (mod v_~y$w_buff1_used~0_485 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_61|) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_57| |v_P2Thread1of1ForFork1_~arg#1.offset_57|) (= v_~y$r_buff0_thd0~0_365 v_~y$r_buff1_thd0~0_375) (= 2 v_~y$w_buff0~0_406) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_61| 0))) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_57|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_536, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_127, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_365, ~y$w_buff0~0=v_~y$w_buff0~0_407, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_37, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_57|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_535, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_57|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_57|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_98, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_45, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_91, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_57|, ~y$w_buff1~0=v_~y$w_buff1~0_376, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_126, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_365, ~y$w_buff0~0=v_~y$w_buff0~0_406, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_37, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_61|, ~y~0=v_~y~0_436, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_375, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_61|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_485} 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, ~y~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [319] L762-->L769: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_24 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~y~0_51 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse1 v_~y$w_buff1~0_37 v_~y~0_52))) (= v_~y$w_buff1_used~0_82 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_97 (ite .cse0 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_82 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_23 256) 0)) .cse4)) 0 v_~y$r_buff1_thd2~0_22) v_~y$r_buff1_thd2~0_21) (= v_~y$r_buff0_thd2~0_23 (ite .cse2 0 v_~y$r_buff0_thd2~0_24))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_23, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} 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:54:27,373 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:54:27,374 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 709 [2022-12-13 00:54:27,374 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 1002 flow [2022-12-13 00:54:27,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:27,374 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:27,374 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:27,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 00:54:27,374 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:27,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:27,375 INFO L85 PathProgramCache]: Analyzing trace with hash 955851504, now seen corresponding path program 1 times [2022-12-13 00:54:27,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:27,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750171081] [2022-12-13 00:54:27,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:27,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:27,457 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:54:27,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:27,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750171081] [2022-12-13 00:54:27,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750171081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:27,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:27,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:54:27,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120252847] [2022-12-13 00:54:27,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:27,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:54:27,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:27,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:54:27,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:54:27,458 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2022-12-13 00:54:27,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 82 transitions, 1002 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:27,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:27,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2022-12-13 00:54:27,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:27,678 INFO L130 PetriNetUnfolder]: 1137/2058 cut-off events. [2022-12-13 00:54:27,678 INFO L131 PetriNetUnfolder]: For 14011/14179 co-relation queries the response was YES. [2022-12-13 00:54:27,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10597 conditions, 2058 events. 1137/2058 cut-off events. For 14011/14179 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 12266 event pairs, 151 based on Foata normal form. 216/1572 useless extension candidates. Maximal degree in co-relation 10559. Up to 1639 conditions per place. [2022-12-13 00:54:27,689 INFO L137 encePairwiseOnDemand]: 22/36 looper letters, 71 selfloop transitions, 19 changer transitions 8/110 dead transitions. [2022-12-13 00:54:27,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 110 transitions, 1473 flow [2022-12-13 00:54:27,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:54:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:54:27,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 00:54:27,691 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2022-12-13 00:54:27,691 INFO L175 Difference]: Start difference. First operand has 82 places, 82 transitions, 1002 flow. Second operand 4 states and 87 transitions. [2022-12-13 00:54:27,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 110 transitions, 1473 flow [2022-12-13 00:54:27,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 110 transitions, 1406 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-12-13 00:54:27,709 INFO L231 Difference]: Finished difference. Result has 79 places, 81 transitions, 904 flow [2022-12-13 00:54:27,709 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=904, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2022-12-13 00:54:27,709 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 15 predicate places. [2022-12-13 00:54:27,709 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:27,709 INFO L89 Accepts]: Start accepts. Operand has 79 places, 81 transitions, 904 flow [2022-12-13 00:54:27,710 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:27,710 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:27,710 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 81 transitions, 904 flow [2022-12-13 00:54:27,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 81 transitions, 904 flow [2022-12-13 00:54:27,797 INFO L130 PetriNetUnfolder]: 562/1340 cut-off events. [2022-12-13 00:54:27,797 INFO L131 PetriNetUnfolder]: For 4923/5328 co-relation queries the response was YES. [2022-12-13 00:54:27,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6160 conditions, 1340 events. 562/1340 cut-off events. For 4923/5328 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 10421 event pairs, 93 based on Foata normal form. 27/846 useless extension candidates. Maximal degree in co-relation 6127. Up to 880 conditions per place. [2022-12-13 00:54:27,809 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 81 transitions, 904 flow [2022-12-13 00:54:27,809 INFO L226 LiptonReduction]: Number of co-enabled transitions 658 [2022-12-13 00:54:27,811 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:27,812 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 00:54:27,812 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 904 flow [2022-12-13 00:54:27,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:27,812 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:27,812 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:27,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 00:54:27,812 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:27,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:27,812 INFO L85 PathProgramCache]: Analyzing trace with hash -96158619, now seen corresponding path program 1 times [2022-12-13 00:54:27,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:27,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454089011] [2022-12-13 00:54:27,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:27,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:27,917 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:54:27,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:27,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454089011] [2022-12-13 00:54:27,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454089011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:27,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:27,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:54:27,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067051024] [2022-12-13 00:54:27,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:27,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:54:27,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:27,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:54:27,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:54:27,918 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 00:54:27,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 904 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:54:27,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:27,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 00:54:27,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:28,063 INFO L130 PetriNetUnfolder]: 556/1087 cut-off events. [2022-12-13 00:54:28,063 INFO L131 PetriNetUnfolder]: For 5998/6112 co-relation queries the response was YES. [2022-12-13 00:54:28,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6233 conditions, 1087 events. 556/1087 cut-off events. For 5998/6112 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5942 event pairs, 5 based on Foata normal form. 198/863 useless extension candidates. Maximal degree in co-relation 6197. Up to 649 conditions per place. [2022-12-13 00:54:28,068 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 31 selfloop transitions, 28 changer transitions 42/107 dead transitions. [2022-12-13 00:54:28,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 107 transitions, 1438 flow [2022-12-13 00:54:28,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:54:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:54:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 00:54:28,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2022-12-13 00:54:28,069 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 904 flow. Second operand 5 states and 91 transitions. [2022-12-13 00:54:28,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 107 transitions, 1438 flow [2022-12-13 00:54:28,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 107 transitions, 1323 flow, removed 24 selfloop flow, removed 5 redundant places. [2022-12-13 00:54:28,078 INFO L231 Difference]: Finished difference. Result has 79 places, 53 transitions, 456 flow [2022-12-13 00:54:28,078 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=456, PETRI_PLACES=79, PETRI_TRANSITIONS=53} [2022-12-13 00:54:28,078 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 15 predicate places. [2022-12-13 00:54:28,078 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:28,078 INFO L89 Accepts]: Start accepts. Operand has 79 places, 53 transitions, 456 flow [2022-12-13 00:54:28,079 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:28,079 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:28,079 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 53 transitions, 456 flow [2022-12-13 00:54:28,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 53 transitions, 456 flow [2022-12-13 00:54:28,099 INFO L130 PetriNetUnfolder]: 115/336 cut-off events. [2022-12-13 00:54:28,099 INFO L131 PetriNetUnfolder]: For 326/512 co-relation queries the response was YES. [2022-12-13 00:54:28,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1247 conditions, 336 events. 115/336 cut-off events. For 326/512 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2111 event pairs, 1 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 1216. Up to 217 conditions per place. [2022-12-13 00:54:28,101 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 53 transitions, 456 flow [2022-12-13 00:54:28,101 INFO L226 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-13 00:54:28,240 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [326] L788-->L791: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0] and [355] $Ultimate##0-->L742: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~z~0_28 2)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~z~0=v_~z~0_28, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, P0Thread1of1ForFork2_~arg.base] [2022-12-13 00:54:30,634 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 00:54:30,634 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2556 [2022-12-13 00:54:30,634 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 445 flow [2022-12-13 00:54:30,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:54:30,634 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:30,635 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:30,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 00:54:30,635 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:30,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:30,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1037474114, now seen corresponding path program 1 times [2022-12-13 00:54:30,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:30,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348475022] [2022-12-13 00:54:30,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:30,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:31,133 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:54:31,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:31,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348475022] [2022-12-13 00:54:31,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348475022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:31,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:31,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:54:31,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475857915] [2022-12-13 00:54:31,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:31,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:54:31,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:31,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:54:31,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:54:31,134 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 00:54:31,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 48 transitions, 445 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:31,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:31,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 00:54:31,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:31,289 INFO L130 PetriNetUnfolder]: 315/619 cut-off events. [2022-12-13 00:54:31,289 INFO L131 PetriNetUnfolder]: For 2751/2822 co-relation queries the response was YES. [2022-12-13 00:54:31,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3281 conditions, 619 events. 315/619 cut-off events. For 2751/2822 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 3400 event pairs, 31 based on Foata normal form. 53/498 useless extension candidates. Maximal degree in co-relation 3247. Up to 424 conditions per place. [2022-12-13 00:54:31,294 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 31 selfloop transitions, 5 changer transitions 30/78 dead transitions. [2022-12-13 00:54:31,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 78 transitions, 826 flow [2022-12-13 00:54:31,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:54:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:54:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-13 00:54:31,295 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46794871794871795 [2022-12-13 00:54:31,295 INFO L175 Difference]: Start difference. First operand has 67 places, 48 transitions, 445 flow. Second operand 6 states and 73 transitions. [2022-12-13 00:54:31,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 78 transitions, 826 flow [2022-12-13 00:54:31,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 78 transitions, 576 flow, removed 66 selfloop flow, removed 19 redundant places. [2022-12-13 00:54:31,301 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 272 flow [2022-12-13 00:54:31,301 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2022-12-13 00:54:31,301 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -9 predicate places. [2022-12-13 00:54:31,301 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:31,301 INFO L89 Accepts]: Start accepts. Operand has 55 places, 46 transitions, 272 flow [2022-12-13 00:54:31,302 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:31,302 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:31,302 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 46 transitions, 272 flow [2022-12-13 00:54:31,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 272 flow [2022-12-13 00:54:31,317 INFO L130 PetriNetUnfolder]: 113/270 cut-off events. [2022-12-13 00:54:31,317 INFO L131 PetriNetUnfolder]: For 277/277 co-relation queries the response was YES. [2022-12-13 00:54:31,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 270 events. 113/270 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 1485 event pairs, 1 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 799. Up to 136 conditions per place. [2022-12-13 00:54:31,320 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 272 flow [2022-12-13 00:54:31,320 INFO L226 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-13 00:54:31,320 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:31,321 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 00:54:31,321 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 272 flow [2022-12-13 00:54:31,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:31,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:31,321 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:31,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 00:54:31,321 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:54:31,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:31,321 INFO L85 PathProgramCache]: Analyzing trace with hash 241769258, now seen corresponding path program 1 times [2022-12-13 00:54:31,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:31,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609449081] [2022-12-13 00:54:31,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:31,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:54:31,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:54:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:54:31,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:54:31,397 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:54:31,398 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:54:31,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:54:31,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:54:31,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:54:31,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:54:31,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:54:31,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 00:54:31,400 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:31,403 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:54:31,403 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:54:31,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:54:31 BasicIcfg [2022-12-13 00:54:31,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:54:31,466 INFO L158 Benchmark]: Toolchain (without parser) took 30725.02ms. Allocated memory was 238.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 212.3MB in the beginning and 1.0GB in the end (delta: -807.5MB). Peak memory consumption was 260.0MB. Max. memory is 8.0GB. [2022-12-13 00:54:31,466 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 238.0MB. Free memory is still 214.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:54:31,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.24ms. Allocated memory is still 238.0MB. Free memory was 212.3MB in the beginning and 186.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 00:54:31,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.77ms. Allocated memory is still 238.0MB. Free memory was 186.1MB in the beginning and 183.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:54:31,467 INFO L158 Benchmark]: Boogie Preprocessor took 36.44ms. Allocated memory is still 238.0MB. Free memory was 183.4MB in the beginning and 181.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:54:31,471 INFO L158 Benchmark]: RCFGBuilder took 546.74ms. Allocated memory is still 238.0MB. Free memory was 181.3MB in the beginning and 148.3MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-13 00:54:31,471 INFO L158 Benchmark]: TraceAbstraction took 29625.56ms. Allocated memory was 238.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 147.3MB in the beginning and 1.0GB in the end (delta: -872.5MB). Peak memory consumption was 195.0MB. Max. memory is 8.0GB. [2022-12-13 00:54:31,472 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 238.0MB. Free memory is still 214.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 470.24ms. Allocated memory is still 238.0MB. Free memory was 212.3MB in the beginning and 186.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.77ms. Allocated memory is still 238.0MB. Free memory was 186.1MB in the beginning and 183.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.44ms. Allocated memory is still 238.0MB. Free memory was 183.4MB in the beginning and 181.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 546.74ms. Allocated memory is still 238.0MB. Free memory was 181.3MB in the beginning and 148.3MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 29625.56ms. Allocated memory was 238.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 147.3MB in the beginning and 1.0GB in the end (delta: -872.5MB). Peak memory consumption was 195.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 111 PlacesBefore, 64 PlacesAfterwards, 103 TransitionsBefore, 54 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 2 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3126, independent: 2966, independent conditional: 2966, independent unconditional: 0, dependent: 160, dependent conditional: 160, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3126, independent: 2966, independent conditional: 0, independent unconditional: 2966, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3126, independent: 2966, independent conditional: 0, independent unconditional: 2966, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3126, independent: 2966, independent conditional: 0, independent unconditional: 2966, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1741, independent: 1681, independent conditional: 0, independent unconditional: 1681, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1741, independent: 1648, independent conditional: 0, independent unconditional: 1648, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 341, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 301, dependent conditional: 0, dependent unconditional: 301, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3126, independent: 1285, independent conditional: 0, independent unconditional: 1285, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 1741, unknown conditional: 0, unknown unconditional: 1741] , Statistics on independence cache: Total cache size (in pairs): 3036, Positive cache size: 2976, Positive conditional cache size: 0, Positive unconditional cache size: 2976, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, 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, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 282, independent: 250, independent conditional: 250, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 282, independent: 250, independent conditional: 12, independent unconditional: 238, dependent: 32, dependent conditional: 5, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 282, independent: 250, independent conditional: 12, independent unconditional: 238, dependent: 32, dependent conditional: 5, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 282, independent: 250, independent conditional: 12, independent unconditional: 238, dependent: 32, dependent conditional: 5, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 213, independent: 193, independent conditional: 11, independent unconditional: 182, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 213, independent: 175, independent conditional: 0, independent unconditional: 175, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 38, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 35, dependent conditional: 9, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 282, independent: 57, independent conditional: 1, independent unconditional: 56, dependent: 12, dependent conditional: 3, dependent unconditional: 9, unknown: 213, unknown conditional: 13, unknown unconditional: 200] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 193, Positive conditional cache size: 11, Positive unconditional cache size: 182, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 598 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, independent: 65, independent conditional: 65, 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: 73, independent: 65, independent conditional: 17, independent unconditional: 48, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 73, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 7, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 73, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 195, Positive conditional cache size: 11, Positive unconditional cache size: 184, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 628 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 195, Positive conditional cache size: 11, Positive unconditional cache size: 184, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, 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, 48 PlacesBefore, 48 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 668 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 12, independent conditional: 5, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 17, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 195, Positive conditional cache size: 11, Positive unconditional cache size: 184, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 832 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 30, independent conditional: 20, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, independent: 30, independent conditional: 5, independent unconditional: 25, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, independent: 30, independent conditional: 5, independent unconditional: 25, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 35, independent: 30, independent conditional: 5, independent unconditional: 25, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 195, Positive conditional cache size: 11, Positive unconditional cache size: 184, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 870 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 5, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 195, Positive conditional cache size: 11, Positive unconditional cache size: 184, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 914 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 21, independent conditional: 7, independent unconditional: 14, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 7, dependent conditional: 0, dependent unconditional: 7, 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: 28, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 195, Positive conditional cache size: 11, Positive unconditional cache size: 184, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 910 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 21, independent conditional: 7, independent unconditional: 14, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 7, dependent conditional: 0, dependent unconditional: 7, 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: 28, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 195, Positive conditional cache size: 11, Positive unconditional cache size: 184, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 73 PlacesBefore, 72 PlacesAfterwards, 75 TransitionsBefore, 74 TransitionsAfterwards, 934 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88, independent: 72, independent conditional: 40, independent unconditional: 32, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 16, dependent conditional: 0, dependent unconditional: 16, 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: 88, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 243, Positive conditional cache size: 13, Positive unconditional cache size: 230, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 30, independent conditional: 30, 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: 40, independent: 30, independent conditional: 10, independent unconditional: 20, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 40, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 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: 40, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 243, Positive conditional cache size: 13, Positive unconditional cache size: 230, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 107 TransitionsBefore, 107 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 42, independent conditional: 14, independent unconditional: 28, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 243, Positive conditional cache size: 13, Positive unconditional cache size: 230, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 122 TransitionsBefore, 122 TransitionsAfterwards, 1252 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 42, independent conditional: 14, independent unconditional: 28, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 243, Positive conditional cache size: 13, Positive unconditional cache size: 230, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 90 PlacesBefore, 90 PlacesAfterwards, 128 TransitionsBefore, 128 TransitionsAfterwards, 1334 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 75, independent conditional: 30, independent unconditional: 45, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 15, dependent conditional: 0, dependent unconditional: 15, 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: 90, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 243, Positive conditional cache size: 13, Positive unconditional cache size: 230, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 93 PlacesBefore, 90 PlacesAfterwards, 109 TransitionsBefore, 107 TransitionsAfterwards, 890 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 95, independent: 66, independent conditional: 8, independent unconditional: 58, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 95, independent: 66, independent conditional: 4, independent unconditional: 62, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95, independent: 66, independent conditional: 4, independent unconditional: 62, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, independent: 65, independent conditional: 3, independent unconditional: 62, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 281, Positive conditional cache size: 14, Positive unconditional cache size: 267, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, 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.6s, 82 PlacesBefore, 82 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 734 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 83, independent conditional: 83, 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: 83, independent: 83, independent conditional: 62, independent unconditional: 21, 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: 83, independent: 83, independent conditional: 41, independent unconditional: 42, 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: 83, independent: 83, independent conditional: 41, independent unconditional: 42, 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: 11, independent: 11, independent conditional: 8, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, independent: 72, independent conditional: 33, independent unconditional: 39, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 8, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 333, Positive cache size: 310, Positive conditional cache size: 22, Positive unconditional cache size: 288, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 79 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 658 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 333, Positive cache size: 310, Positive conditional cache size: 22, Positive unconditional cache size: 288, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, 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: 2.5s, 73 PlacesBefore, 67 PlacesAfterwards, 53 TransitionsBefore, 48 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 52, independent conditional: 52, 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: 52, independent: 52, independent conditional: 46, independent unconditional: 6, 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: 52, independent: 52, independent conditional: 42, independent unconditional: 10, 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: 52, independent: 52, independent conditional: 42, independent unconditional: 10, 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: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 47, independent conditional: 40, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 400, Positive cache size: 377, Positive conditional cache size: 27, Positive unconditional cache size: 350, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, 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, 52 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 400, Positive cache size: 377, Positive conditional cache size: 27, Positive unconditional cache size: 350, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2516, ((void *)0), P0, ((void *)0))=-2, t2516={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] [L817] 0 pthread_t t2517; [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2517, ((void *)0), P1, ((void *)0))=-1, t2516={5:0}, t2517={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] [L819] 0 pthread_t t2518; [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2518, ((void *)0), P2, ((void *)0))=0, t2516={5:0}, t2517={6:0}, t2518={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] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 [L790] 3 z = 1 [L741] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2] [L758] 2 x = 1 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=1, 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=2] [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, 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=1, 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=2] [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2] [L764] 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) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 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 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 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=1, __unbuffered_p0_EAX=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=1, 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=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, 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=2] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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=1, 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=2] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 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) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 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 [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] 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 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 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) [L838] 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)) [L839] 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)) [L840] 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)) [L841] 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)) [L842] 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)) [L843] 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)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 816]: 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: 820]: 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, 132 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: 29.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 541 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 541 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1595 IncrementalHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 43 mSDtfsCounter, 1595 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2022occurred in iteration=13, InterpolantAutomatonStates: 85, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 2812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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:54:31,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...