/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/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:50:58,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:50:58,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:50:58,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:50:58,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:50:58,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:50:58,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:50:58,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:50:58,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:50:58,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:50:58,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:50:58,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:50:58,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:50:58,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:50:58,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:50:58,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:50:58,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:50:58,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:50:58,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:50:58,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:50:58,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:50:58,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:50:58,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:50:58,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:50:58,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:50:58,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:50:58,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:50:58,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:50:58,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:50:58,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:50:58,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:50:58,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:50:58,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:50:58,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:50:58,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:50:58,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:50:58,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:50:58,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:50:58,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:50:58,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:50:58,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:50:58,087 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:50:58,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:50:58,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:50:58,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:50:58,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:50:58,115 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:50:58,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:50:58,116 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:50:58,116 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:50:58,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:50:58,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:50:58,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:50:58,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:50:58,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:50:58,117 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:50:58,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:50:58,117 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:50:58,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:50:58,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:50:58,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:50:58,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:50:58,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:50:58,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:50:58,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:50:58,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:50:58,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:50:58,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:50:58,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:50:58,118 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:50:58,118 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:50:58,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:50:58,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:50:58,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:50:58,482 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:50:58,483 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:50:58,484 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 00:50:59,577 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:50:59,769 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:50:59,770 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 00:50:59,801 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06a950450/c93fc729b3104c4da01d9322d428c3ad/FLAG421ac1f19 [2022-12-13 00:50:59,835 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06a950450/c93fc729b3104c4da01d9322d428c3ad [2022-12-13 00:50:59,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:50:59,839 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:50:59,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:50:59,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:50:59,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:50:59,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:50:59" (1/1) ... [2022-12-13 00:50:59,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d4ed64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:59, skipping insertion in model container [2022-12-13 00:50:59,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:50:59" (1/1) ... [2022-12-13 00:50:59,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:50:59,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:50:59,998 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-13 00:51:00,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:51:00,132 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:51:00,148 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-13 00:51:00,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:51:00,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:51:00,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:51:00,217 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:51:00,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:00 WrapperNode [2022-12-13 00:51:00,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:51:00,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:51:00,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:51:00,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:51:00,223 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:51:00" (1/1) ... [2022-12-13 00:51:00,234 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:51:00" (1/1) ... [2022-12-13 00:51:00,252 INFO L138 Inliner]: procedures = 177, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-12-13 00:51:00,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:51:00,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:51:00,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:51:00,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:51:00,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:00" (1/1) ... [2022-12-13 00:51:00,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:00" (1/1) ... [2022-12-13 00:51:00,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:00" (1/1) ... [2022-12-13 00:51:00,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:00" (1/1) ... [2022-12-13 00:51:00,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:00" (1/1) ... [2022-12-13 00:51:00,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:00" (1/1) ... [2022-12-13 00:51:00,277 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:00" (1/1) ... [2022-12-13 00:51:00,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:00" (1/1) ... [2022-12-13 00:51:00,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:51:00,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:51:00,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:51:00,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:51:00,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:00" (1/1) ... [2022-12-13 00:51:00,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:51:00,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:51:00,315 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:51:00,321 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:51:00,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:51:00,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:51:00,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:51:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:51:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:51:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:51:00,347 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:51:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:51:00,347 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:51:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:51:00,347 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:51:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 00:51:00,347 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 00:51:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:51:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:51:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:51:00,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:51:00,348 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:51:00,438 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:51:00,440 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:51:00,640 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:51:00,645 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:51:00,645 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:51:00,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:51:00 BoogieIcfgContainer [2022-12-13 00:51:00,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:51:00,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:51:00,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:51:00,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:51:00,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:50:59" (1/3) ... [2022-12-13 00:51:00,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522de079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:51:00, skipping insertion in model container [2022-12-13 00:51:00,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:51:00" (2/3) ... [2022-12-13 00:51:00,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522de079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:51:00, skipping insertion in model container [2022-12-13 00:51:00,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:51:00" (3/3) ... [2022-12-13 00:51:00,656 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 00:51:00,680 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:51:00,681 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 00:51:00,682 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:51:00,755 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:51:00,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 98 transitions, 216 flow [2022-12-13 00:51:00,834 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2022-12-13 00:51:00,835 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:51:00,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-12-13 00:51:00,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 98 transitions, 216 flow [2022-12-13 00:51:00,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 80 transitions, 172 flow [2022-12-13 00:51:00,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:51:00,868 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 80 transitions, 172 flow [2022-12-13 00:51:00,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 80 transitions, 172 flow [2022-12-13 00:51:00,897 INFO L130 PetriNetUnfolder]: 1/80 cut-off events. [2022-12-13 00:51:00,898 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:51:00,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 80 events. 1/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 43 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-13 00:51:00,902 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 80 transitions, 172 flow [2022-12-13 00:51:00,903 INFO L226 LiptonReduction]: Number of co-enabled transitions 1542 [2022-12-13 00:51:03,083 INFO L241 LiptonReduction]: Total number of compositions: 60 [2022-12-13 00:51:03,094 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:51:03,098 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;@10117052, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:51:03,098 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 00:51:03,103 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-13 00:51:03,103 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:51:03,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:51:03,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:51:03,104 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:51:03,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:51:03,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1301783342, now seen corresponding path program 1 times [2022-12-13 00:51:03,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:51:03,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505002550] [2022-12-13 00:51:03,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:51:03,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:51:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:51:03,467 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:51:03,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:51:03,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505002550] [2022-12-13 00:51:03,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505002550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:51:03,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:51:03,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:51:03,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59835851] [2022-12-13 00:51:03,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:51:03,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:51:03,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:51:03,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:51:03,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:51:03,489 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 00:51:03,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:51:03,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:51:03,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 00:51:03,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:51:04,133 INFO L130 PetriNetUnfolder]: 6424/9568 cut-off events. [2022-12-13 00:51:04,133 INFO L131 PetriNetUnfolder]: For 143/143 co-relation queries the response was YES. [2022-12-13 00:51:04,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18975 conditions, 9568 events. 6424/9568 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 56970 event pairs, 2469 based on Foata normal form. 337/7597 useless extension candidates. Maximal degree in co-relation 18963. Up to 5301 conditions per place. [2022-12-13 00:51:04,186 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 38 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2022-12-13 00:51:04,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 217 flow [2022-12-13 00:51:04,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:51:04,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:51:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-13 00:51:04,195 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2022-12-13 00:51:04,196 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 72 transitions. [2022-12-13 00:51:04,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 217 flow [2022-12-13 00:51:04,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 00:51:04,203 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 126 flow [2022-12-13 00:51:04,205 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-12-13 00:51:04,207 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2022-12-13 00:51:04,207 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:51:04,208 INFO L89 Accepts]: Start accepts. Operand has 45 places, 38 transitions, 126 flow [2022-12-13 00:51:04,210 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:51:04,210 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:51:04,210 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 126 flow [2022-12-13 00:51:04,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 126 flow [2022-12-13 00:51:04,238 INFO L130 PetriNetUnfolder]: 148/502 cut-off events. [2022-12-13 00:51:04,238 INFO L131 PetriNetUnfolder]: For 35/51 co-relation queries the response was YES. [2022-12-13 00:51:04,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 502 events. 148/502 cut-off events. For 35/51 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3720 event pairs, 70 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 866. Up to 189 conditions per place. [2022-12-13 00:51:04,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 126 flow [2022-12-13 00:51:04,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 728 [2022-12-13 00:51:04,250 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:51:04,251 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 00:51:04,251 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 126 flow [2022-12-13 00:51:04,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:51:04,252 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:51:04,252 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:51:04,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:51:04,252 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:51:04,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:51:04,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1700578171, now seen corresponding path program 1 times [2022-12-13 00:51:04,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:51:04,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759340787] [2022-12-13 00:51:04,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:51:04,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:51:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:51:04,365 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:51:04,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:51:04,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759340787] [2022-12-13 00:51:04,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759340787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:51:04,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:51:04,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:51:04,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142951324] [2022-12-13 00:51:04,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:51:04,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:51:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:51:04,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:51:04,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:51:04,368 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 00:51:04,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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:51:04,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:51:04,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 00:51:04,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:51:05,203 INFO L130 PetriNetUnfolder]: 8028/12442 cut-off events. [2022-12-13 00:51:05,203 INFO L131 PetriNetUnfolder]: For 4337/4338 co-relation queries the response was YES. [2022-12-13 00:51:05,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29175 conditions, 12442 events. 8028/12442 cut-off events. For 4337/4338 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 83443 event pairs, 1848 based on Foata normal form. 381/9573 useless extension candidates. Maximal degree in co-relation 29163. Up to 5562 conditions per place. [2022-12-13 00:51:05,254 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 49 selfloop transitions, 6 changer transitions 9/74 dead transitions. [2022-12-13 00:51:05,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 74 transitions, 384 flow [2022-12-13 00:51:05,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:51:05,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:51:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-13 00:51:05,256 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6875 [2022-12-13 00:51:05,256 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 126 flow. Second operand 4 states and 88 transitions. [2022-12-13 00:51:05,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 74 transitions, 384 flow [2022-12-13 00:51:05,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 74 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:51:05,266 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 157 flow [2022-12-13 00:51:05,267 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2022-12-13 00:51:05,267 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2022-12-13 00:51:05,267 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:51:05,267 INFO L89 Accepts]: Start accepts. Operand has 48 places, 41 transitions, 157 flow [2022-12-13 00:51:05,268 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:51:05,268 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:51:05,268 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 41 transitions, 157 flow [2022-12-13 00:51:05,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 41 transitions, 157 flow [2022-12-13 00:51:05,282 INFO L130 PetriNetUnfolder]: 59/248 cut-off events. [2022-12-13 00:51:05,282 INFO L131 PetriNetUnfolder]: For 59/66 co-relation queries the response was YES. [2022-12-13 00:51:05,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 248 events. 59/248 cut-off events. For 59/66 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1586 event pairs, 15 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 462. Up to 86 conditions per place. [2022-12-13 00:51:05,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 41 transitions, 157 flow [2022-12-13 00:51:05,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 694 [2022-12-13 00:51:05,286 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:51:05,287 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 00:51:05,287 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 157 flow [2022-12-13 00:51:05,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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:51:05,287 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:51:05,287 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:51:05,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:51:05,287 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:51:05,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:51:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1178342890, now seen corresponding path program 1 times [2022-12-13 00:51:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:51:05,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169280944] [2022-12-13 00:51:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:51:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:51:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:51:05,414 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:51:05,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:51:05,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169280944] [2022-12-13 00:51:05,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169280944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:51:05,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:51:05,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:51:05,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354146963] [2022-12-13 00:51:05,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:51:05,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:51:05,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:51:05,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:51:05,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:51:05,416 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 00:51:05,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 157 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:51:05,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:51:05,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 00:51:05,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:51:05,858 INFO L130 PetriNetUnfolder]: 4632/6975 cut-off events. [2022-12-13 00:51:05,858 INFO L131 PetriNetUnfolder]: For 3042/3049 co-relation queries the response was YES. [2022-12-13 00:51:05,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17068 conditions, 6975 events. 4632/6975 cut-off events. For 3042/3049 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 40723 event pairs, 2108 based on Foata normal form. 25/5029 useless extension candidates. Maximal degree in co-relation 17054. Up to 6131 conditions per place. [2022-12-13 00:51:05,899 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 45 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2022-12-13 00:51:05,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 337 flow [2022-12-13 00:51:05,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:51:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:51:05,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 00:51:05,900 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2022-12-13 00:51:05,900 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 157 flow. Second operand 3 states and 65 transitions. [2022-12-13 00:51:05,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 337 flow [2022-12-13 00:51:05,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 332 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:51:05,902 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 195 flow [2022-12-13 00:51:05,903 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2022-12-13 00:51:05,903 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2022-12-13 00:51:05,903 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:51:05,903 INFO L89 Accepts]: Start accepts. Operand has 50 places, 45 transitions, 195 flow [2022-12-13 00:51:05,904 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:51:05,904 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:51:05,904 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 45 transitions, 195 flow [2022-12-13 00:51:05,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 45 transitions, 195 flow [2022-12-13 00:51:05,916 INFO L130 PetriNetUnfolder]: 44/210 cut-off events. [2022-12-13 00:51:05,916 INFO L131 PetriNetUnfolder]: For 90/101 co-relation queries the response was YES. [2022-12-13 00:51:05,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 210 events. 44/210 cut-off events. For 90/101 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1266 event pairs, 7 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 441. Up to 70 conditions per place. [2022-12-13 00:51:05,918 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 45 transitions, 195 flow [2022-12-13 00:51:05,918 INFO L226 LiptonReduction]: Number of co-enabled transitions 766 [2022-12-13 00:51:05,921 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:51:05,922 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 00:51:05,922 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 195 flow [2022-12-13 00:51:05,922 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:51:05,922 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:51:05,922 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:51:05,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:51:05,923 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:51:05,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:51:05,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2125542486, now seen corresponding path program 1 times [2022-12-13 00:51:05,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:51:05,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173710426] [2022-12-13 00:51:05,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:51:05,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:51:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:51:05,995 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:51:05,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:51:05,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173710426] [2022-12-13 00:51:05,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173710426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:51:05,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:51:05,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:51:05,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991992112] [2022-12-13 00:51:05,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:51:05,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:51:05,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:51:05,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:51:05,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:51:05,997 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:51:05,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:51:05,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:51:05,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:51:05,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:51:06,317 INFO L130 PetriNetUnfolder]: 3991/6169 cut-off events. [2022-12-13 00:51:06,318 INFO L131 PetriNetUnfolder]: For 4968/5036 co-relation queries the response was YES. [2022-12-13 00:51:06,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15660 conditions, 6169 events. 3991/6169 cut-off events. For 4968/5036 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 38058 event pairs, 1486 based on Foata normal form. 72/4478 useless extension candidates. Maximal degree in co-relation 15644. Up to 5071 conditions per place. [2022-12-13 00:51:06,360 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 41 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2022-12-13 00:51:06,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 337 flow [2022-12-13 00:51:06,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:51:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:51:06,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 00:51:06,361 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2022-12-13 00:51:06,361 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 195 flow. Second operand 3 states and 65 transitions. [2022-12-13 00:51:06,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 337 flow [2022-12-13 00:51:06,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:51:06,365 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 201 flow [2022-12-13 00:51:06,366 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2022-12-13 00:51:06,367 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2022-12-13 00:51:06,367 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:51:06,367 INFO L89 Accepts]: Start accepts. Operand has 52 places, 45 transitions, 201 flow [2022-12-13 00:51:06,368 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:51:06,368 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:51:06,368 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 45 transitions, 201 flow [2022-12-13 00:51:06,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 45 transitions, 201 flow [2022-12-13 00:51:06,380 INFO L130 PetriNetUnfolder]: 41/201 cut-off events. [2022-12-13 00:51:06,380 INFO L131 PetriNetUnfolder]: For 111/122 co-relation queries the response was YES. [2022-12-13 00:51:06,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 201 events. 41/201 cut-off events. For 111/122 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1192 event pairs, 5 based on Foata normal form. 2/137 useless extension candidates. Maximal degree in co-relation 428. Up to 65 conditions per place. [2022-12-13 00:51:06,383 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 45 transitions, 201 flow [2022-12-13 00:51:06,383 INFO L226 LiptonReduction]: Number of co-enabled transitions 764 [2022-12-13 00:51:06,385 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:51:06,389 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 00:51:06,389 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 201 flow [2022-12-13 00:51:06,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:51:06,389 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:51:06,389 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:51:06,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:51:06,389 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:51:06,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:51:06,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1094108571, now seen corresponding path program 1 times [2022-12-13 00:51:06,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:51:06,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643853752] [2022-12-13 00:51:06,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:51:06,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:51:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:51:06,493 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:51:06,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:51:06,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643853752] [2022-12-13 00:51:06,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643853752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:51:06,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:51:06,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:51:06,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623920002] [2022-12-13 00:51:06,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:51:06,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:51:06,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:51:06,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:51:06,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:51:06,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:51:06,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 201 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:51:06,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:51:06,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:51:06,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:51:06,998 INFO L130 PetriNetUnfolder]: 5932/9012 cut-off events. [2022-12-13 00:51:07,002 INFO L131 PetriNetUnfolder]: For 7260/7260 co-relation queries the response was YES. [2022-12-13 00:51:07,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22511 conditions, 9012 events. 5932/9012 cut-off events. For 7260/7260 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 55784 event pairs, 1680 based on Foata normal form. 144/6502 useless extension candidates. Maximal degree in co-relation 22493. Up to 4172 conditions per place. [2022-12-13 00:51:07,046 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 54 selfloop transitions, 12 changer transitions 1/75 dead transitions. [2022-12-13 00:51:07,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 425 flow [2022-12-13 00:51:07,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:51:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:51:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-13 00:51:07,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6953125 [2022-12-13 00:51:07,048 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 201 flow. Second operand 4 states and 89 transitions. [2022-12-13 00:51:07,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 425 flow [2022-12-13 00:51:07,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:51:07,052 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 271 flow [2022-12-13 00:51:07,052 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2022-12-13 00:51:07,054 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2022-12-13 00:51:07,054 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:51:07,054 INFO L89 Accepts]: Start accepts. Operand has 56 places, 48 transitions, 271 flow [2022-12-13 00:51:07,055 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:51:07,055 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:51:07,055 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 48 transitions, 271 flow [2022-12-13 00:51:07,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 271 flow [2022-12-13 00:51:07,066 INFO L130 PetriNetUnfolder]: 34/214 cut-off events. [2022-12-13 00:51:07,066 INFO L131 PetriNetUnfolder]: For 219/233 co-relation queries the response was YES. [2022-12-13 00:51:07,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 214 events. 34/214 cut-off events. For 219/233 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1350 event pairs, 2 based on Foata normal form. 2/140 useless extension candidates. Maximal degree in co-relation 514. Up to 63 conditions per place. [2022-12-13 00:51:07,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 48 transitions, 271 flow [2022-12-13 00:51:07,068 INFO L226 LiptonReduction]: Number of co-enabled transitions 812 [2022-12-13 00:51:07,070 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:51:07,072 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 00:51:07,072 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 271 flow [2022-12-13 00:51:07,072 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:51:07,072 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:51:07,072 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:51:07,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:51:07,072 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:51:07,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:51:07,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1467459231, now seen corresponding path program 1 times [2022-12-13 00:51:07,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:51:07,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667898728] [2022-12-13 00:51:07,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:51:07,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:51:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:51:07,193 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:51:07,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:51:07,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667898728] [2022-12-13 00:51:07,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667898728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:51:07,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:51:07,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:51:07,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844603613] [2022-12-13 00:51:07,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:51:07,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:51:07,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:51:07,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:51:07,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:51:07,195 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 00:51:07,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:51:07,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:51:07,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 00:51:07,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:51:08,502 INFO L130 PetriNetUnfolder]: 18039/25848 cut-off events. [2022-12-13 00:51:08,503 INFO L131 PetriNetUnfolder]: For 42755/43639 co-relation queries the response was YES. [2022-12-13 00:51:08,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65096 conditions, 25848 events. 18039/25848 cut-off events. For 42755/43639 co-relation queries the response was YES. Maximal size of possible extension queue 2205. Compared 175480 event pairs, 7839 based on Foata normal form. 860/13709 useless extension candidates. Maximal degree in co-relation 65075. Up to 19258 conditions per place. [2022-12-13 00:51:08,688 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 79 selfloop transitions, 26 changer transitions 10/127 dead transitions. [2022-12-13 00:51:08,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 127 transitions, 885 flow [2022-12-13 00:51:08,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:51:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:51:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-13 00:51:08,690 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.69375 [2022-12-13 00:51:08,690 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 271 flow. Second operand 5 states and 111 transitions. [2022-12-13 00:51:08,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 127 transitions, 885 flow [2022-12-13 00:51:08,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 127 transitions, 867 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-12-13 00:51:08,711 INFO L231 Difference]: Finished difference. Result has 63 places, 73 transitions, 460 flow [2022-12-13 00:51:08,711 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=460, PETRI_PLACES=63, PETRI_TRANSITIONS=73} [2022-12-13 00:51:08,712 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2022-12-13 00:51:08,712 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:51:08,712 INFO L89 Accepts]: Start accepts. Operand has 63 places, 73 transitions, 460 flow [2022-12-13 00:51:08,723 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:51:08,724 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:51:08,724 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 73 transitions, 460 flow [2022-12-13 00:51:08,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 73 transitions, 460 flow [2022-12-13 00:51:09,831 INFO L130 PetriNetUnfolder]: 12351/18333 cut-off events. [2022-12-13 00:51:09,831 INFO L131 PetriNetUnfolder]: For 19226/34106 co-relation queries the response was YES. [2022-12-13 00:51:09,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56763 conditions, 18333 events. 12351/18333 cut-off events. For 19226/34106 co-relation queries the response was YES. Maximal size of possible extension queue 2559. Compared 144028 event pairs, 6986 based on Foata normal form. 24/7066 useless extension candidates. Maximal degree in co-relation 56740. Up to 17387 conditions per place. [2022-12-13 00:51:10,075 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 73 transitions, 460 flow [2022-12-13 00:51:10,075 INFO L226 LiptonReduction]: Number of co-enabled transitions 1496 [2022-12-13 00:51:10,100 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [271] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= v_~main$tmp_guard0~0_22 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [297] L767-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.offset_9| 0) (= |v_P3Thread1of1ForFork0_#res.base_9| 0) (= v_~__unbuffered_cnt~0_203 (+ v_~__unbuffered_cnt~0_204 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_204} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_9|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_203} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-13 00:51:10,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [271] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= v_~main$tmp_guard0~0_22 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [237] L755-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_34 1) v_~__unbuffered_cnt~0_33) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] [2022-12-13 00:51:10,152 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [271] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= v_~main$tmp_guard0~0_22 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [219] L767-->L772: Formula: (= (+ v_~__unbuffered_cnt~0_8 1) v_~__unbuffered_cnt~0_7) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:51:10,168 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [271] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= v_~main$tmp_guard0~0_22 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [203] L728-->L733: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:51:10,184 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [271] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= v_~main$tmp_guard0~0_22 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [208] L740-->L745: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:51:10,201 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [271] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= v_~main$tmp_guard0~0_22 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [257] L728-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork3_#res.offset_7| 0) (= |v_P0Thread1of1ForFork3_#res.base_7| 0) (= v_~__unbuffered_cnt~0_155 (+ v_~__unbuffered_cnt~0_156 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156} OutVars{P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset] [2022-12-13 00:51:10,226 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [271] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= v_~main$tmp_guard0~0_22 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [253] L740-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-13 00:51:10,251 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [271] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= v_~main$tmp_guard0~0_22 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [214] L755-->L760: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:51:10,267 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [271] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= v_~main$tmp_guard0~0_22 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [296] L767-->P3FINAL: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_7| 0) (= |v_P3Thread1of1ForFork0_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_199 (+ v_~__unbuffered_cnt~0_200 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_200} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_199} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-13 00:51:10,292 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [271] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= v_~main$tmp_guard0~0_22 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [258] L728-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork3_#res.offset_9| 0) (= |v_P0Thread1of1ForFork3_#res.base_9| 0) (= v_~__unbuffered_cnt~0_159 (+ v_~__unbuffered_cnt~0_160 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_160} OutVars{P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset] [2022-12-13 00:51:10,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [271] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= v_~main$tmp_guard0~0_22 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [254] L740-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1)) (= |v_P1Thread1of1ForFork1_#res.base_9| 0) (= |v_P1Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-13 00:51:10,340 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [271] L793-3-->L797: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_22 256)) (= v_~main$tmp_guard0~0_22 (ite (= (ite (= v_~__unbuffered_cnt~0_175 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [238] L755-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork2_#res.base_9| 0) (= |v_P2Thread1of1ForFork2_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] [2022-12-13 00:51:16,633 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:51:16,634 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7922 [2022-12-13 00:51:16,634 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 412 flow [2022-12-13 00:51:16,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:51:16,634 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:51:16,634 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:51:16,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:51:16,634 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:51:16,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:51:16,635 INFO L85 PathProgramCache]: Analyzing trace with hash 810040871, now seen corresponding path program 1 times [2022-12-13 00:51:16,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:51:16,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087828103] [2022-12-13 00:51:16,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:51:16,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:51:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:51:16,721 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:51:16,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:51:16,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087828103] [2022-12-13 00:51:16,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087828103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:51:16,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:51:16,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:51:16,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794999257] [2022-12-13 00:51:16,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:51:16,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:51:16,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:51:16,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:51:16,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:51:16,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 00:51:16,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 412 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:51:16,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:51:16,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 00:51:16,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:51:17,950 INFO L130 PetriNetUnfolder]: 16936/25475 cut-off events. [2022-12-13 00:51:17,950 INFO L131 PetriNetUnfolder]: For 49435/51208 co-relation queries the response was YES. [2022-12-13 00:51:18,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104455 conditions, 25475 events. 16936/25475 cut-off events. For 49435/51208 co-relation queries the response was YES. Maximal size of possible extension queue 2511. Compared 191201 event pairs, 3042 based on Foata normal form. 812/13496 useless extension candidates. Maximal degree in co-relation 104429. Up to 20986 conditions per place. [2022-12-13 00:51:18,119 INFO L137 encePairwiseOnDemand]: 17/35 looper letters, 89 selfloop transitions, 41 changer transitions 10/152 dead transitions. [2022-12-13 00:51:18,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 152 transitions, 1266 flow [2022-12-13 00:51:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:51:18,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:51:18,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2022-12-13 00:51:18,122 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2022-12-13 00:51:18,122 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 412 flow. Second operand 6 states and 138 transitions. [2022-12-13 00:51:18,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 152 transitions, 1266 flow [2022-12-13 00:51:18,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 152 transitions, 1247 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 00:51:18,195 INFO L231 Difference]: Finished difference. Result has 69 places, 88 transitions, 730 flow [2022-12-13 00:51:18,195 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=730, PETRI_PLACES=69, PETRI_TRANSITIONS=88} [2022-12-13 00:51:18,195 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2022-12-13 00:51:18,196 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:51:18,196 INFO L89 Accepts]: Start accepts. Operand has 69 places, 88 transitions, 730 flow [2022-12-13 00:51:18,197 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:51:18,197 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:51:18,197 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 88 transitions, 730 flow [2022-12-13 00:51:18,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 88 transitions, 730 flow [2022-12-13 00:51:19,192 INFO L130 PetriNetUnfolder]: 11559/18227 cut-off events. [2022-12-13 00:51:19,192 INFO L131 PetriNetUnfolder]: For 36438/117906 co-relation queries the response was YES. [2022-12-13 00:51:19,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90274 conditions, 18227 events. 11559/18227 cut-off events. For 36438/117906 co-relation queries the response was YES. Maximal size of possible extension queue 2958. Compared 156324 event pairs, 2891 based on Foata normal form. 30/7016 useless extension candidates. Maximal degree in co-relation 90247. Up to 17494 conditions per place. [2022-12-13 00:51:19,552 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 88 transitions, 730 flow [2022-12-13 00:51:19,553 INFO L226 LiptonReduction]: Number of co-enabled transitions 1932 [2022-12-13 00:51:38,849 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:51:38,850 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20654 [2022-12-13 00:51:38,850 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 87 transitions, 722 flow [2022-12-13 00:51:38,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:51:38,850 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:51:38,850 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:51:38,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:51:38,851 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:51:38,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:51:38,851 INFO L85 PathProgramCache]: Analyzing trace with hash -658512208, now seen corresponding path program 1 times [2022-12-13 00:51:38,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:51:38,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846609326] [2022-12-13 00:51:38,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:51:38,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:51:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:51:38,937 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:51:38,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:51:38,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846609326] [2022-12-13 00:51:38,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846609326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:51:38,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:51:38,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:51:38,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834476235] [2022-12-13 00:51:38,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:51:38,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:51:38,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:51:38,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:51:38,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:51:38,939 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 00:51:38,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 87 transitions, 722 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:51:38,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:51:38,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 00:51:38,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:51:40,259 INFO L130 PetriNetUnfolder]: 11986/19031 cut-off events. [2022-12-13 00:51:40,260 INFO L131 PetriNetUnfolder]: For 53630/56912 co-relation queries the response was YES. [2022-12-13 00:51:40,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106679 conditions, 19031 events. 11986/19031 cut-off events. For 53630/56912 co-relation queries the response was YES. Maximal size of possible extension queue 2067. Compared 151515 event pairs, 423 based on Foata normal form. 675/10353 useless extension candidates. Maximal degree in co-relation 106649. Up to 15604 conditions per place. [2022-12-13 00:51:40,353 INFO L137 encePairwiseOnDemand]: 17/35 looper letters, 86 selfloop transitions, 62 changer transitions 28/188 dead transitions. [2022-12-13 00:51:40,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 188 transitions, 1864 flow [2022-12-13 00:51:40,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:51:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:51:40,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2022-12-13 00:51:40,354 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-13 00:51:40,354 INFO L175 Difference]: Start difference. First operand has 69 places, 87 transitions, 722 flow. Second operand 8 states and 180 transitions. [2022-12-13 00:51:40,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 188 transitions, 1864 flow [2022-12-13 00:51:40,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 188 transitions, 1740 flow, removed 43 selfloop flow, removed 3 redundant places. [2022-12-13 00:51:40,587 INFO L231 Difference]: Finished difference. Result has 76 places, 109 transitions, 1027 flow [2022-12-13 00:51:40,587 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1027, PETRI_PLACES=76, PETRI_TRANSITIONS=109} [2022-12-13 00:51:40,587 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2022-12-13 00:51:40,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:51:40,588 INFO L89 Accepts]: Start accepts. Operand has 76 places, 109 transitions, 1027 flow [2022-12-13 00:51:40,589 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:51:40,589 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:51:40,589 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 109 transitions, 1027 flow [2022-12-13 00:51:40,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 109 transitions, 1027 flow [2022-12-13 00:51:41,175 INFO L130 PetriNetUnfolder]: 6294/11195 cut-off events. [2022-12-13 00:51:41,176 INFO L131 PetriNetUnfolder]: For 54382/91585 co-relation queries the response was YES. [2022-12-13 00:51:41,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67947 conditions, 11195 events. 6294/11195 cut-off events. For 54382/91585 co-relation queries the response was YES. Maximal size of possible extension queue 2025. Compared 104311 event pairs, 407 based on Foata normal form. 6/4578 useless extension candidates. Maximal degree in co-relation 67918. Up to 10450 conditions per place. [2022-12-13 00:51:41,290 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 109 transitions, 1027 flow [2022-12-13 00:51:41,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 2040 [2022-12-13 00:51:54,837 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:51:54,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14250 [2022-12-13 00:51:54,838 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 108 transitions, 1017 flow [2022-12-13 00:51:54,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:51:54,839 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:51:54,839 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:51:54,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:51:54,839 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:51:54,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:51:54,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1453002466, now seen corresponding path program 1 times [2022-12-13 00:51:54,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:51:54,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30819490] [2022-12-13 00:51:54,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:51:54,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:51:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:51:54,950 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:51:54,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:51:54,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30819490] [2022-12-13 00:51:54,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30819490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:51:54,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:51:54,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:51:54,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275296276] [2022-12-13 00:51:54,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:51:54,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:51:54,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:51:54,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:51:54,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:51:54,952 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 00:51:54,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 108 transitions, 1017 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:51:54,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:51:54,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 00:51:54,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:51:55,993 INFO L130 PetriNetUnfolder]: 10612/17059 cut-off events. [2022-12-13 00:51:55,994 INFO L131 PetriNetUnfolder]: For 93500/95804 co-relation queries the response was YES. [2022-12-13 00:51:56,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106018 conditions, 17059 events. 10612/17059 cut-off events. For 93500/95804 co-relation queries the response was YES. Maximal size of possible extension queue 1643. Compared 133048 event pairs, 1034 based on Foata normal form. 581/13048 useless extension candidates. Maximal degree in co-relation 105986. Up to 13279 conditions per place. [2022-12-13 00:51:56,117 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 99 selfloop transitions, 16 changer transitions 75/210 dead transitions. [2022-12-13 00:51:56,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 210 transitions, 2380 flow [2022-12-13 00:51:56,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:51:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:51:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-12-13 00:51:56,118 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7071428571428572 [2022-12-13 00:51:56,118 INFO L175 Difference]: Start difference. First operand has 76 places, 108 transitions, 1017 flow. Second operand 4 states and 99 transitions. [2022-12-13 00:51:56,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 210 transitions, 2380 flow [2022-12-13 00:51:58,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 210 transitions, 1739 flow, removed 227 selfloop flow, removed 6 redundant places. [2022-12-13 00:51:58,849 INFO L231 Difference]: Finished difference. Result has 76 places, 86 transitions, 671 flow [2022-12-13 00:51:58,849 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=671, PETRI_PLACES=76, PETRI_TRANSITIONS=86} [2022-12-13 00:51:58,850 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2022-12-13 00:51:58,850 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:51:58,850 INFO L89 Accepts]: Start accepts. Operand has 76 places, 86 transitions, 671 flow [2022-12-13 00:51:58,851 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:51:58,851 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:51:58,851 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 86 transitions, 671 flow [2022-12-13 00:51:58,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 86 transitions, 671 flow [2022-12-13 00:51:59,273 INFO L130 PetriNetUnfolder]: 5985/9809 cut-off events. [2022-12-13 00:51:59,274 INFO L131 PetriNetUnfolder]: For 20136/21592 co-relation queries the response was YES. [2022-12-13 00:51:59,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41601 conditions, 9809 events. 5985/9809 cut-off events. For 20136/21592 co-relation queries the response was YES. Maximal size of possible extension queue 1539. Compared 79506 event pairs, 569 based on Foata normal form. 4/4129 useless extension candidates. Maximal degree in co-relation 41571. Up to 6967 conditions per place. [2022-12-13 00:51:59,362 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 86 transitions, 671 flow [2022-12-13 00:51:59,363 INFO L226 LiptonReduction]: Number of co-enabled transitions 1436 [2022-12-13 00:51:59,369 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:51:59,370 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 520 [2022-12-13 00:51:59,370 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 86 transitions, 671 flow [2022-12-13 00:51:59,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:51:59,370 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:51:59,370 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:51:59,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:51:59,370 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:51:59,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:51:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1897231031, now seen corresponding path program 1 times [2022-12-13 00:51:59,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:51:59,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880749966] [2022-12-13 00:51:59,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:51:59,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:51:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:51:59,469 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:51:59,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:51:59,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880749966] [2022-12-13 00:51:59,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880749966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:51:59,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:51:59,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:51:59,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491706591] [2022-12-13 00:51:59,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:51:59,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:51:59,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:51:59,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:51:59,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:51:59,470 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:51:59,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 86 transitions, 671 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:51:59,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:51:59,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:51:59,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:00,847 INFO L130 PetriNetUnfolder]: 13262/20531 cut-off events. [2022-12-13 00:52:00,848 INFO L131 PetriNetUnfolder]: For 72546/73344 co-relation queries the response was YES. [2022-12-13 00:52:00,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100794 conditions, 20531 events. 13262/20531 cut-off events. For 72546/73344 co-relation queries the response was YES. Maximal size of possible extension queue 2007. Compared 155288 event pairs, 1179 based on Foata normal form. 581/15513 useless extension candidates. Maximal degree in co-relation 100761. Up to 12504 conditions per place. [2022-12-13 00:52:00,972 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 113 selfloop transitions, 18 changer transitions 85/236 dead transitions. [2022-12-13 00:52:00,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 236 transitions, 2125 flow [2022-12-13 00:52:00,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:52:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:52:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2022-12-13 00:52:00,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2022-12-13 00:52:00,974 INFO L175 Difference]: Start difference. First operand has 71 places, 86 transitions, 671 flow. Second operand 6 states and 130 transitions. [2022-12-13 00:52:00,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 236 transitions, 2125 flow [2022-12-13 00:52:02,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 236 transitions, 2111 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-13 00:52:02,718 INFO L231 Difference]: Finished difference. Result has 79 places, 90 transitions, 783 flow [2022-12-13 00:52:02,718 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=783, PETRI_PLACES=79, PETRI_TRANSITIONS=90} [2022-12-13 00:52:02,718 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2022-12-13 00:52:02,718 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:02,718 INFO L89 Accepts]: Start accepts. Operand has 79 places, 90 transitions, 783 flow [2022-12-13 00:52:02,719 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:02,719 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:02,720 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 90 transitions, 783 flow [2022-12-13 00:52:02,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 90 transitions, 783 flow [2022-12-13 00:52:03,304 INFO L130 PetriNetUnfolder]: 8239/13117 cut-off events. [2022-12-13 00:52:03,304 INFO L131 PetriNetUnfolder]: For 25069/26553 co-relation queries the response was YES. [2022-12-13 00:52:03,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56087 conditions, 13117 events. 8239/13117 cut-off events. For 25069/26553 co-relation queries the response was YES. Maximal size of possible extension queue 2268. Compared 107440 event pairs, 812 based on Foata normal form. 3/5484 useless extension candidates. Maximal degree in co-relation 56052. Up to 9640 conditions per place. [2022-12-13 00:52:03,447 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 90 transitions, 783 flow [2022-12-13 00:52:03,447 INFO L226 LiptonReduction]: Number of co-enabled transitions 1550 [2022-12-13 00:52:03,453 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:03,454 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 736 [2022-12-13 00:52:03,454 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 90 transitions, 783 flow [2022-12-13 00:52:03,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:03,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:03,454 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:03,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:52:03,454 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:52:03,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:03,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2042917375, now seen corresponding path program 2 times [2022-12-13 00:52:03,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:03,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030302941] [2022-12-13 00:52:03,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:03,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:03,538 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:52:03,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:03,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030302941] [2022-12-13 00:52:03,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030302941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:03,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:03,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:52:03,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560227752] [2022-12-13 00:52:03,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:03,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:52:03,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:03,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:52:03,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:52:03,539 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 00:52:03,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 90 transitions, 783 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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:52:03,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:03,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 00:52:03,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:04,503 INFO L130 PetriNetUnfolder]: 9555/15866 cut-off events. [2022-12-13 00:52:04,504 INFO L131 PetriNetUnfolder]: For 43709/44997 co-relation queries the response was YES. [2022-12-13 00:52:04,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81050 conditions, 15866 events. 9555/15866 cut-off events. For 43709/44997 co-relation queries the response was YES. Maximal size of possible extension queue 2052. Compared 133230 event pairs, 16 based on Foata normal form. 366/7975 useless extension candidates. Maximal degree in co-relation 81012. Up to 9883 conditions per place. [2022-12-13 00:52:04,598 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 21 selfloop transitions, 49 changer transitions 85/160 dead transitions. [2022-12-13 00:52:04,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 160 transitions, 1779 flow [2022-12-13 00:52:04,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:52:04,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:52:04,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2022-12-13 00:52:04,599 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.58203125 [2022-12-13 00:52:04,599 INFO L175 Difference]: Start difference. First operand has 79 places, 90 transitions, 783 flow. Second operand 8 states and 149 transitions. [2022-12-13 00:52:04,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 160 transitions, 1779 flow [2022-12-13 00:52:06,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 160 transitions, 1703 flow, removed 29 selfloop flow, removed 1 redundant places. [2022-12-13 00:52:06,958 INFO L231 Difference]: Finished difference. Result has 88 places, 67 transitions, 601 flow [2022-12-13 00:52:06,958 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=601, PETRI_PLACES=88, PETRI_TRANSITIONS=67} [2022-12-13 00:52:06,958 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 43 predicate places. [2022-12-13 00:52:06,958 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:06,959 INFO L89 Accepts]: Start accepts. Operand has 88 places, 67 transitions, 601 flow [2022-12-13 00:52:06,960 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:06,960 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:06,960 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 67 transitions, 601 flow [2022-12-13 00:52:06,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 67 transitions, 601 flow [2022-12-13 00:52:07,004 INFO L130 PetriNetUnfolder]: 513/947 cut-off events. [2022-12-13 00:52:07,004 INFO L131 PetriNetUnfolder]: For 5162/5441 co-relation queries the response was YES. [2022-12-13 00:52:07,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5199 conditions, 947 events. 513/947 cut-off events. For 5162/5441 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 5847 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 5159. Up to 649 conditions per place. [2022-12-13 00:52:07,010 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 67 transitions, 601 flow [2022-12-13 00:52:07,010 INFO L226 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-13 00:52:07,471 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [327] $Ultimate##0-->L755: Formula: (and (= |v_P2Thread1of1ForFork2_#in~arg.offset_9| v_P2Thread1of1ForFork2_~arg.offset_9) (= v_~__unbuffered_p2_EAX~0_50 v_~x~0_103) (= v_~y~0_92 1) (= v_P2Thread1of1ForFork2_~arg.base_9 |v_P2Thread1of1ForFork2_#in~arg.base_9|)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_9|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_9|, ~x~0=v_~x~0_103} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_9|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_9, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_50, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_9|, ~y~0=v_~y~0_92, ~x~0=v_~x~0_103} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0] and [249] $Ultimate##0-->L767: Formula: (and (= v_~y~0_15 2) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_15, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] [2022-12-13 00:52:07,497 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [328] $Ultimate##0-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork2_#res.base_33| 0) (= v_P2Thread1of1ForFork2_~arg.offset_11 |v_P2Thread1of1ForFork2_#in~arg.offset_11|) (= |v_P2Thread1of1ForFork2_#res.offset_33| 0) (= v_~y~0_94 1) (= (+ v_~__unbuffered_cnt~0_362 1) v_~__unbuffered_cnt~0_361) (= |v_P2Thread1of1ForFork2_#in~arg.base_11| v_P2Thread1of1ForFork2_~arg.base_11) (= v_~__unbuffered_p2_EAX~0_52 v_~x~0_105)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_362, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_11|, ~x~0=v_~x~0_105} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_11|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_11, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_11, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_361, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_11|, ~y~0=v_~y~0_94, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_33|, ~x~0=v_~x~0_105} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, ~__unbuffered_p2_EAX~0, ~y~0, P2Thread1of1ForFork2_#res.offset] and [249] $Ultimate##0-->L767: Formula: (and (= v_~y~0_15 2) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_15, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] [2022-12-13 00:52:07,538 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] $Ultimate##0-->P2EXIT: Formula: (and (= v_P2Thread1of1ForFork2_~arg.offset_13 |v_P2Thread1of1ForFork2_#in~arg.offset_13|) (= |v_P2Thread1of1ForFork2_#res.offset_35| 0) (= |v_P2Thread1of1ForFork2_#res.base_35| 0) (= v_~__unbuffered_p2_EAX~0_54 v_~x~0_107) (= v_~__unbuffered_cnt~0_365 (+ v_~__unbuffered_cnt~0_366 1)) (= |v_P2Thread1of1ForFork2_#in~arg.base_13| v_P2Thread1of1ForFork2_~arg.base_13) (= v_~y~0_96 1)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_366, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_13|, ~x~0=v_~x~0_107} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_13|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_13, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_365, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_13|, ~y~0=v_~y~0_96, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_35|, ~x~0=v_~x~0_107} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, ~__unbuffered_p2_EAX~0, ~y~0, P2Thread1of1ForFork2_#res.offset] and [249] $Ultimate##0-->L767: Formula: (and (= v_~y~0_15 2) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_15, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] [2022-12-13 00:52:07,578 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [330] $Ultimate##0-->L760: Formula: (and (= v_~__unbuffered_cnt~0_369 (+ v_~__unbuffered_cnt~0_370 1)) (= v_~__unbuffered_p2_EAX~0_56 v_~x~0_109) (= |v_P2Thread1of1ForFork2_#in~arg.base_15| v_P2Thread1of1ForFork2_~arg.base_15) (= v_~y~0_98 1) (= v_P2Thread1of1ForFork2_~arg.offset_15 |v_P2Thread1of1ForFork2_#in~arg.offset_15|)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_370, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|, ~x~0=v_~x~0_109} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_15, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_369, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_56, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|, ~y~0=v_~y~0_98, ~x~0=v_~x~0_109} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~__unbuffered_cnt~0, ~__unbuffered_p2_EAX~0, ~y~0] and [249] $Ultimate##0-->L767: Formula: (and (= v_~y~0_15 2) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_15, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~y~0, P3Thread1of1ForFork0_~arg.base] [2022-12-13 00:52:07,666 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 00:52:07,667 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 709 [2022-12-13 00:52:07,667 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 62 transitions, 858 flow [2022-12-13 00:52:07,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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:52:07,667 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:07,667 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:07,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:52:07,668 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:52:07,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2020836162, now seen corresponding path program 1 times [2022-12-13 00:52:07,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:07,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106735160] [2022-12-13 00:52:07,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:07,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:07,744 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:52:07,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:07,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106735160] [2022-12-13 00:52:07,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106735160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:07,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:07,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:52:07,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753269838] [2022-12-13 00:52:07,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:07,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:52:07,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:07,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:52:07,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:52:07,747 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2022-12-13 00:52:07,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 62 transitions, 858 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:07,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:07,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2022-12-13 00:52:07,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:07,824 INFO L130 PetriNetUnfolder]: 537/818 cut-off events. [2022-12-13 00:52:07,824 INFO L131 PetriNetUnfolder]: For 10460/10468 co-relation queries the response was YES. [2022-12-13 00:52:07,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6104 conditions, 818 events. 537/818 cut-off events. For 10460/10468 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 3630 event pairs, 0 based on Foata normal form. 89/572 useless extension candidates. Maximal degree in co-relation 6078. Up to 661 conditions per place. [2022-12-13 00:52:07,828 INFO L137 encePairwiseOnDemand]: 35/41 looper letters, 0 selfloop transitions, 0 changer transitions 67/67 dead transitions. [2022-12-13 00:52:07,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 67 transitions, 982 flow [2022-12-13 00:52:07,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:52:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:52:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-13 00:52:07,829 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2022-12-13 00:52:07,829 INFO L175 Difference]: Start difference. First operand has 78 places, 62 transitions, 858 flow. Second operand 4 states and 63 transitions. [2022-12-13 00:52:07,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 67 transitions, 982 flow [2022-12-13 00:52:07,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 374 flow, removed 48 selfloop flow, removed 33 redundant places. [2022-12-13 00:52:07,837 INFO L231 Difference]: Finished difference. Result has 47 places, 0 transitions, 0 flow [2022-12-13 00:52:07,837 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=47, PETRI_TRANSITIONS=0} [2022-12-13 00:52:07,838 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2022-12-13 00:52:07,839 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:07,839 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 0 transitions, 0 flow [2022-12-13 00:52:07,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 00:52:07,839 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 00:52:07,839 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:07,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 00:52:07,839 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 00:52:07,839 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 00:52:07,839 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:07,840 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 00:52:07,840 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 00:52:07,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:07,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 00:52:07,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 00:52:07,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 00:52:07,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 00:52:07,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 00:52:07,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:52:07,844 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:07,846 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:52:07,846 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:52:07,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:52:07 BasicIcfg [2022-12-13 00:52:07,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:52:07,849 INFO L158 Benchmark]: Toolchain (without parser) took 68010.29ms. Allocated memory was 176.2MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 150.8MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-13 00:52:07,849 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:52:07,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.41ms. Allocated memory is still 176.2MB. Free memory was 150.4MB in the beginning and 126.5MB in the end (delta: 23.9MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-13 00:52:07,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.96ms. Allocated memory is still 176.2MB. Free memory was 126.5MB in the beginning and 124.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:52:07,849 INFO L158 Benchmark]: Boogie Preprocessor took 26.11ms. Allocated memory is still 176.2MB. Free memory was 124.4MB in the beginning and 123.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 00:52:07,850 INFO L158 Benchmark]: RCFGBuilder took 367.63ms. Allocated memory is still 176.2MB. Free memory was 123.1MB in the beginning and 109.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-13 00:52:07,850 INFO L158 Benchmark]: TraceAbstraction took 67197.62ms. Allocated memory was 176.2MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 108.0MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-13 00:52:07,851 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 176.2MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 378.41ms. Allocated memory is still 176.2MB. Free memory was 150.4MB in the beginning and 126.5MB in the end (delta: 23.9MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.96ms. Allocated memory is still 176.2MB. Free memory was 126.5MB in the beginning and 124.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.11ms. Allocated memory is still 176.2MB. Free memory was 124.4MB in the beginning and 123.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 367.63ms. Allocated memory is still 176.2MB. Free memory was 123.1MB in the beginning and 109.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 67197.62ms. Allocated memory was 176.2MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 108.0MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 92 PlacesBefore, 45 PlacesAfterwards, 80 TransitionsBefore, 33 TransitionsAfterwards, 1542 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 60 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1668, independent: 1607, independent conditional: 1607, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1668, independent: 1607, independent conditional: 0, independent unconditional: 1607, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1668, independent: 1607, independent conditional: 0, independent unconditional: 1607, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1668, independent: 1607, independent conditional: 0, independent unconditional: 1607, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1212, independent: 1175, independent conditional: 0, independent unconditional: 1175, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1212, independent: 1154, independent conditional: 0, independent unconditional: 1154, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1668, independent: 432, independent conditional: 0, independent unconditional: 432, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 1212, unknown conditional: 0, unknown unconditional: 1212] , Statistics on independence cache: Total cache size (in pairs): 2234, Positive cache size: 2197, Positive conditional cache size: 0, Positive unconditional cache size: 2197, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, 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.0s, 45 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 728 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 4, Positive conditional cache size: 1, Positive unconditional cache size: 3, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 48 PlacesBefore, 48 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 694 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 6, Positive conditional cache size: 1, Positive unconditional cache size: 5, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 766 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 6, Positive conditional cache size: 1, Positive unconditional cache size: 5, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 764 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 6, Positive conditional cache size: 1, Positive unconditional cache size: 5, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 812 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, 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: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 6, Positive conditional cache size: 1, Positive unconditional cache size: 5, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 63 PlacesBefore, 62 PlacesAfterwards, 73 TransitionsBefore, 63 TransitionsAfterwards, 1496 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 456, independent: 456, independent conditional: 456, 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: 456, independent: 456, independent conditional: 456, 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: 456, independent: 456, independent conditional: 372, independent unconditional: 84, 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: 456, independent: 456, independent conditional: 372, independent unconditional: 84, 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: 77, independent: 77, independent conditional: 65, independent unconditional: 12, 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: 77, independent: 77, independent conditional: 0, independent unconditional: 77, 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: 456, independent: 379, independent conditional: 307, independent unconditional: 72, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 77, unknown conditional: 65, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 83, Positive conditional cache size: 66, Positive unconditional cache size: 17, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 84, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.3s, 69 PlacesBefore, 69 PlacesAfterwards, 88 TransitionsBefore, 87 TransitionsAfterwards, 1932 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 16, independent unconditional: 8, 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: 24, independent: 24, independent conditional: 16, independent unconditional: 8, 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: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 24, independent: 19, independent conditional: 12, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 88, Positive conditional cache size: 70, Positive unconditional cache size: 18, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.5s, 76 PlacesBefore, 76 PlacesAfterwards, 109 TransitionsBefore, 108 TransitionsAfterwards, 2040 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, 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: 22, independent: 22, independent conditional: 22, 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: 22, independent: 22, independent conditional: 14, independent unconditional: 8, 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: 22, independent: 22, independent conditional: 14, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 92, Positive conditional cache size: 74, Positive unconditional cache size: 18, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 1436 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): 94, Positive cache size: 92, Positive conditional cache size: 74, Positive unconditional cache size: 18, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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.0s, 79 PlacesBefore, 79 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 1550 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): 94, Positive cache size: 92, Positive conditional cache size: 74, Positive unconditional cache size: 18, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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.7s, 83 PlacesBefore, 78 PlacesAfterwards, 67 TransitionsBefore, 62 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 422, independent: 422, independent conditional: 422, 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: 422, independent: 422, independent conditional: 422, 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: 422, independent: 422, independent conditional: 151, independent unconditional: 271, 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: 422, independent: 422, independent conditional: 151, independent unconditional: 271, 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: 72, independent: 72, independent conditional: 49, independent unconditional: 23, 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: 72, independent: 72, independent conditional: 0, independent unconditional: 72, 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: 422, independent: 350, independent conditional: 102, independent unconditional: 248, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 72, unknown conditional: 49, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 178, Positive conditional cache size: 136, Positive unconditional cache size: 42, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 271, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 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): 180, Positive cache size: 178, Positive conditional cache size: 136, Positive unconditional cache size: 42, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 127 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 67.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 453 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 453 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1150 IncrementalHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 16 mSDtfsCounter, 1150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1027occurred in iteration=8, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 00:52:07,882 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...