/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 --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix004.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:58:34,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:58:34,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:58:34,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:58:34,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:58:34,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:58:34,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:58:34,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:58:34,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:58:34,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:58:34,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:58:34,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:58:34,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:58:34,525 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:58:34,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:58:34,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:58:34,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:58:34,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:58:34,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:58:34,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:58:34,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:58:34,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:58:34,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:58:34,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:58:34,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:58:34,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:58:34,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:58:34,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:58:34,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:58:34,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:58:34,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:58:34,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:58:34,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:58:34,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:58:34,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:58:34,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:58:34,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:58:34,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:58:34,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:58:34,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:58:34,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:58:34,540 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-06 00:58:34,554 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:58:34,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:58:34,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:58:34,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:58:34,559 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:58:34,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:58:34,559 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:58:34,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:58:34,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:58:34,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:58:34,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:58:34,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:58:34,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:58:34,561 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:58:34,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:58:34,561 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:58:34,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:58:34,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:58:34,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:58:34,561 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:58:34,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:58:34,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:58:34,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:58:34,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:58:34,562 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:58:34,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:58:34,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:58:34,562 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:58:34,562 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 00:58:34,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:58:34,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:58:34,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:58:34,804 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:58:34,805 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:58:34,805 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix004.oepc.i [2022-12-06 00:58:35,642 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:58:35,862 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:58:35,862 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix004.oepc.i [2022-12-06 00:58:35,873 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f8d4df4/ea348661dbc14ad9b159e502ad428194/FLAGac4772705 [2022-12-06 00:58:35,884 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f8d4df4/ea348661dbc14ad9b159e502ad428194 [2022-12-06 00:58:35,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:58:35,886 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:58:35,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:58:35,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:58:35,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:58:35,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:58:35" (1/1) ... [2022-12-06 00:58:35,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4011feea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:58:35, skipping insertion in model container [2022-12-06 00:58:35,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:58:35" (1/1) ... [2022-12-06 00:58:35,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:58:35,937 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:58:36,041 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/mix004.oepc.i[945,958] [2022-12-06 00:58:36,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:58:36,239 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:58:36,249 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/mix004.oepc.i[945,958] [2022-12-06 00:58:36,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:58:36,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:58:36,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:58:36,345 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:58:36,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:58:36 WrapperNode [2022-12-06 00:58:36,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:58:36,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:58:36,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:58:36,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:58:36,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:58:36" (1/1) ... [2022-12-06 00:58:36,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:58:36" (1/1) ... [2022-12-06 00:58:36,407 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-12-06 00:58:36,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:58:36,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:58:36,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:58:36,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:58:36,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:58:36" (1/1) ... [2022-12-06 00:58:36,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:58:36" (1/1) ... [2022-12-06 00:58:36,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:58:36" (1/1) ... [2022-12-06 00:58:36,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:58:36" (1/1) ... [2022-12-06 00:58:36,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:58:36" (1/1) ... [2022-12-06 00:58:36,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:58:36" (1/1) ... [2022-12-06 00:58:36,439 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:58:36" (1/1) ... [2022-12-06 00:58:36,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:58:36" (1/1) ... [2022-12-06 00:58:36,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:58:36,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:58:36,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:58:36,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:58:36,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:58:36" (1/1) ... [2022-12-06 00:58:36,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:58:36,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:58:36,485 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-06 00:58:36,491 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-06 00:58:36,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:58:36,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:58:36,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:58:36,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:58:36,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:58:36,517 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 00:58:36,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 00:58:36,518 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 00:58:36,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 00:58:36,518 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 00:58:36,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 00:58:36,518 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 00:58:36,519 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 00:58:36,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:58:36,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:58:36,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:58:36,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:58:36,520 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 00:58:36,662 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:58:36,663 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:58:36,938 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:58:37,089 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:58:37,090 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 00:58:37,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:58:37 BoogieIcfgContainer [2022-12-06 00:58:37,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:58:37,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:58:37,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:58:37,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:58:37,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:58:35" (1/3) ... [2022-12-06 00:58:37,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643d05ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:58:37, skipping insertion in model container [2022-12-06 00:58:37,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:58:36" (2/3) ... [2022-12-06 00:58:37,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643d05ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:58:37, skipping insertion in model container [2022-12-06 00:58:37,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:58:37" (3/3) ... [2022-12-06 00:58:37,101 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.oepc.i [2022-12-06 00:58:37,121 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:58:37,121 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 00:58:37,122 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:58:37,189 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 00:58:37,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 288 flow [2022-12-06 00:58:37,257 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2022-12-06 00:58:37,258 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:58:37,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 00:58:37,263 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 288 flow [2022-12-06 00:58:37,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2022-12-06 00:58:37,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:58:37,282 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 130 transitions, 272 flow [2022-12-06 00:58:37,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 272 flow [2022-12-06 00:58:37,314 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2022-12-06 00:58:37,314 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:58:37,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 00:58:37,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 130 transitions, 272 flow [2022-12-06 00:58:37,318 INFO L188 LiptonReduction]: Number of co-enabled transitions 3286 [2022-12-06 00:58:41,446 INFO L203 LiptonReduction]: Total number of compositions: 99 [2022-12-06 00:58:41,457 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:58:41,461 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;@154bd397, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:58:41,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 00:58:41,463 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 00:58:41,463 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:58:41,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:58:41,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 00:58:41,463 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:58:41,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:58:41,467 INFO L85 PathProgramCache]: Analyzing trace with hash 553515, now seen corresponding path program 1 times [2022-12-06 00:58:41,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:58:41,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040653744] [2022-12-06 00:58:41,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:58:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:58:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:58:41,703 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-06 00:58:41,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:58:41,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040653744] [2022-12-06 00:58:41,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040653744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:58:41,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:58:41,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:58:41,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561465140] [2022-12-06 00:58:41,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:58:41,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:58:41,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:58:41,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:58:41,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:58:41,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-06 00:58:41,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 00:58:41,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:58:41,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-06 00:58:41,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:58:42,580 INFO L130 PetriNetUnfolder]: 6050/8337 cut-off events. [2022-12-06 00:58:42,580 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-06 00:58:42,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16736 conditions, 8337 events. 6050/8337 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 42888 event pairs, 3098 based on Foata normal form. 0/7584 useless extension candidates. Maximal degree in co-relation 16724. Up to 6574 conditions per place. [2022-12-06 00:58:42,614 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 41 selfloop transitions, 2 changer transitions 10/58 dead transitions. [2022-12-06 00:58:42,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 243 flow [2022-12-06 00:58:42,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:58:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:58:42,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-06 00:58:42,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6576576576576577 [2022-12-06 00:58:42,623 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2022-12-06 00:58:42,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:58:42,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 58 transitions, 243 flow [2022-12-06 00:58:42,654 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 58 transitions, 243 flow [2022-12-06 00:58:42,654 INFO L188 LiptonReduction]: Number of co-enabled transitions 326 [2022-12-06 00:58:42,961 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:58:42,962 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 338 [2022-12-06 00:58:42,963 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 55 transitions, 237 flow [2022-12-06 00:58:42,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 00:58:42,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:58:42,963 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:58:42,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:58:42,963 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:58:42,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:58:42,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1778545351, now seen corresponding path program 1 times [2022-12-06 00:58:42,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:58:42,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73743205] [2022-12-06 00:58:42,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:58:42,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:58:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:58:43,256 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-06 00:58:43,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:58:43,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73743205] [2022-12-06 00:58:43,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73743205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:58:43,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:58:43,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:58:43,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556361197] [2022-12-06 00:58:43,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:58:43,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:58:43,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:58:43,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:58:43,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:58:43,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:58:43,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 55 transitions, 237 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-06 00:58:43,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:58:43,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:58:43,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:58:44,398 INFO L130 PetriNetUnfolder]: 10090/13719 cut-off events. [2022-12-06 00:58:44,398 INFO L131 PetriNetUnfolder]: For 539/539 co-relation queries the response was YES. [2022-12-06 00:58:44,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40118 conditions, 13719 events. 10090/13719 cut-off events. For 539/539 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 67773 event pairs, 3282 based on Foata normal form. 0/12675 useless extension candidates. Maximal degree in co-relation 40103. Up to 12131 conditions per place. [2022-12-06 00:58:44,451 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 63 selfloop transitions, 8 changer transitions 32/103 dead transitions. [2022-12-06 00:58:44,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 103 transitions, 646 flow [2022-12-06 00:58:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:58:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:58:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-06 00:58:44,454 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2022-12-06 00:58:44,454 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2022-12-06 00:58:44,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:58:44,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 103 transitions, 646 flow [2022-12-06 00:58:44,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 103 transitions, 646 flow [2022-12-06 00:58:44,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:58:44,502 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:58:44,503 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 00:58:44,504 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 103 transitions, 646 flow [2022-12-06 00:58:44,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-06 00:58:44,504 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:58:44,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:58:44,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:58:44,505 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:58:44,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:58:44,505 INFO L85 PathProgramCache]: Analyzing trace with hash -214900601, now seen corresponding path program 1 times [2022-12-06 00:58:44,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:58:44,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796135613] [2022-12-06 00:58:44,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:58:44,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:58:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:58:44,688 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-06 00:58:44,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:58:44,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796135613] [2022-12-06 00:58:44,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796135613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:58:44,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:58:44,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:58:44,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955519845] [2022-12-06 00:58:44,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:58:44,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:58:44,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:58:44,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:58:44,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:58:44,696 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:58:44,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 103 transitions, 646 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-06 00:58:44,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:58:44,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:58:44,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:58:45,841 INFO L130 PetriNetUnfolder]: 9514/12967 cut-off events. [2022-12-06 00:58:45,841 INFO L131 PetriNetUnfolder]: For 574/574 co-relation queries the response was YES. [2022-12-06 00:58:45,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50942 conditions, 12967 events. 9514/12967 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 65412 event pairs, 918 based on Foata normal form. 0/12099 useless extension candidates. Maximal degree in co-relation 50924. Up to 11379 conditions per place. [2022-12-06 00:58:45,883 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 92 selfloop transitions, 5 changer transitions 56/153 dead transitions. [2022-12-06 00:58:45,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 153 transitions, 1254 flow [2022-12-06 00:58:45,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:58:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:58:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-06 00:58:45,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2022-12-06 00:58:45,884 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2022-12-06 00:58:45,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:58:45,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 153 transitions, 1254 flow [2022-12-06 00:58:45,928 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 153 transitions, 1254 flow [2022-12-06 00:58:45,928 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:58:45,932 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:58:45,933 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 00:58:45,933 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 153 transitions, 1254 flow [2022-12-06 00:58:45,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-06 00:58:45,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:58:45,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:58:45,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:58:45,933 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:58:45,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:58:45,933 INFO L85 PathProgramCache]: Analyzing trace with hash -214900508, now seen corresponding path program 1 times [2022-12-06 00:58:45,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:58:45,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719149660] [2022-12-06 00:58:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:58:45,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:58:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:58:46,050 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-06 00:58:46,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:58:46,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719149660] [2022-12-06 00:58:46,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719149660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:58:46,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:58:46,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:58:46,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81816319] [2022-12-06 00:58:46,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:58:46,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:58:46,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:58:46,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:58:46,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:58:46,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:58:46,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 153 transitions, 1254 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-06 00:58:46,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:58:46,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:58:46,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:58:47,217 INFO L130 PetriNetUnfolder]: 9210/12567 cut-off events. [2022-12-06 00:58:47,217 INFO L131 PetriNetUnfolder]: For 535/535 co-relation queries the response was YES. [2022-12-06 00:58:47,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61958 conditions, 12567 events. 9210/12567 cut-off events. For 535/535 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 61736 event pairs, 270 based on Foata normal form. 0/11795 useless extension candidates. Maximal degree in co-relation 61937. Up to 10979 conditions per place. [2022-12-06 00:58:47,263 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 121 selfloop transitions, 7 changer transitions 89/217 dead transitions. [2022-12-06 00:58:47,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 217 transitions, 2196 flow [2022-12-06 00:58:47,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:58:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:58:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 00:58:47,264 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-06 00:58:47,265 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2022-12-06 00:58:47,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:58:47,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 217 transitions, 2196 flow [2022-12-06 00:58:47,322 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 217 transitions, 2196 flow [2022-12-06 00:58:47,322 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:58:47,327 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:58:47,334 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 00:58:47,334 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 217 transitions, 2196 flow [2022-12-06 00:58:47,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-06 00:58:47,334 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:58:47,334 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:58:47,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:58:47,335 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:58:47,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:58:47,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1928019802, now seen corresponding path program 1 times [2022-12-06 00:58:47,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:58:47,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862714646] [2022-12-06 00:58:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:58:47,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:58:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:58:47,585 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-06 00:58:47,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:58:47,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862714646] [2022-12-06 00:58:47,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862714646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:58:47,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:58:47,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:58:47,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722069284] [2022-12-06 00:58:47,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:58:47,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:58:47,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:58:47,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:58:47,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:58:47,587 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 00:58:47,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 217 transitions, 2196 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-06 00:58:47,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:58:47,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 00:58:47,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:58:48,624 INFO L130 PetriNetUnfolder]: 7482/10529 cut-off events. [2022-12-06 00:58:48,624 INFO L131 PetriNetUnfolder]: For 979/979 co-relation queries the response was YES. [2022-12-06 00:58:48,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62050 conditions, 10529 events. 7482/10529 cut-off events. For 979/979 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 53483 event pairs, 134 based on Foata normal form. 480/10291 useless extension candidates. Maximal degree in co-relation 62026. Up to 9590 conditions per place. [2022-12-06 00:58:48,658 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 177 selfloop transitions, 21 changer transitions 258/459 dead transitions. [2022-12-06 00:58:48,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 459 transitions, 5531 flow [2022-12-06 00:58:48,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:58:48,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:58:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-06 00:58:48,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 00:58:48,660 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2022-12-06 00:58:48,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:58:48,660 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 459 transitions, 5531 flow [2022-12-06 00:58:48,699 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 459 transitions, 5531 flow [2022-12-06 00:58:48,699 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:58:48,703 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:58:48,705 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 00:58:48,705 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 459 transitions, 5531 flow [2022-12-06 00:58:48,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-06 00:58:48,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:58:48,706 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:58:48,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:58:48,706 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:58:48,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:58:48,706 INFO L85 PathProgramCache]: Analyzing trace with hash -979171807, now seen corresponding path program 1 times [2022-12-06 00:58:48,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:58:48,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583666533] [2022-12-06 00:58:48,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:58:48,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:58:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:58:49,207 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-06 00:58:49,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:58:49,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583666533] [2022-12-06 00:58:49,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583666533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:58:49,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:58:49,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:58:49,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312763323] [2022-12-06 00:58:49,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:58:49,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:58:49,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:58:49,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:58:49,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:58:49,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 00:58:49,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 459 transitions, 5531 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-06 00:58:49,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:58:49,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 00:58:49,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:58:50,663 INFO L130 PetriNetUnfolder]: 8329/11885 cut-off events. [2022-12-06 00:58:50,663 INFO L131 PetriNetUnfolder]: For 1565/1565 co-relation queries the response was YES. [2022-12-06 00:58:50,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81473 conditions, 11885 events. 8329/11885 cut-off events. For 1565/1565 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 63284 event pairs, 108 based on Foata normal form. 300/11347 useless extension candidates. Maximal degree in co-relation 81446. Up to 11257 conditions per place. [2022-12-06 00:58:50,708 INFO L137 encePairwiseOnDemand]: 20/34 looper letters, 246 selfloop transitions, 90 changer transitions 453/792 dead transitions. [2022-12-06 00:58:50,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 792 transitions, 11084 flow [2022-12-06 00:58:50,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:58:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:58:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2022-12-06 00:58:50,710 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5668449197860963 [2022-12-06 00:58:50,710 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2022-12-06 00:58:50,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:58:50,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 792 transitions, 11084 flow [2022-12-06 00:58:50,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 792 transitions, 11084 flow [2022-12-06 00:58:50,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:58:50,872 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:58:50,873 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 00:58:50,873 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 792 transitions, 11084 flow [2022-12-06 00:58:50,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-06 00:58:50,873 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:58:50,873 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:58:50,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:58:50,873 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:58:50,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:58:50,874 INFO L85 PathProgramCache]: Analyzing trace with hash 628553645, now seen corresponding path program 1 times [2022-12-06 00:58:50,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:58:50,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903807140] [2022-12-06 00:58:50,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:58:50,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:58:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:58:51,030 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-06 00:58:51,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:58:51,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903807140] [2022-12-06 00:58:51,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903807140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:58:51,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:58:51,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:58:51,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102341312] [2022-12-06 00:58:51,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:58:51,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:58:51,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:58:51,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:58:51,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:58:51,034 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 00:58:51,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 792 transitions, 11084 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-06 00:58:51,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:58:51,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 00:58:51,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:58:52,724 INFO L130 PetriNetUnfolder]: 7527/10839 cut-off events. [2022-12-06 00:58:52,724 INFO L131 PetriNetUnfolder]: For 2498/2498 co-relation queries the response was YES. [2022-12-06 00:58:52,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84701 conditions, 10839 events. 7527/10839 cut-off events. For 2498/2498 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 58245 event pairs, 52 based on Foata normal form. 180/10223 useless extension candidates. Maximal degree in co-relation 84671. Up to 10448 conditions per place. [2022-12-06 00:58:52,766 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 267 selfloop transitions, 59 changer transitions 604/933 dead transitions. [2022-12-06 00:58:52,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 933 transitions, 14909 flow [2022-12-06 00:58:52,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:58:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:58:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2022-12-06 00:58:52,768 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6134453781512605 [2022-12-06 00:58:52,768 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2022-12-06 00:58:52,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:58:52,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 933 transitions, 14909 flow [2022-12-06 00:58:52,845 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 933 transitions, 14909 flow [2022-12-06 00:58:52,845 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:58:52,849 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:58:52,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 00:58:52,850 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 933 transitions, 14909 flow [2022-12-06 00:58:52,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-06 00:58:52,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:58:52,850 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:58:52,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:58:52,850 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:58:52,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:58:52,851 INFO L85 PathProgramCache]: Analyzing trace with hash 397605546, now seen corresponding path program 1 times [2022-12-06 00:58:52,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:58:52,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520024686] [2022-12-06 00:58:52,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:58:52,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:58:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:58:53,015 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-06 00:58:53,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:58:53,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520024686] [2022-12-06 00:58:53,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520024686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:58:53,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:58:53,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:58:53,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591637898] [2022-12-06 00:58:53,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:58:53,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:58:53,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:58:53,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:58:53,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:58:53,018 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 00:58:53,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 933 transitions, 14909 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-06 00:58:53,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:58:53,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 00:58:53,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:58:54,762 INFO L130 PetriNetUnfolder]: 7045/10095 cut-off events. [2022-12-06 00:58:54,763 INFO L131 PetriNetUnfolder]: For 3676/3676 co-relation queries the response was YES. [2022-12-06 00:58:54,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88565 conditions, 10095 events. 7045/10095 cut-off events. For 3676/3676 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 53321 event pairs, 23 based on Foata normal form. 99/9443 useless extension candidates. Maximal degree in co-relation 88532. Up to 9879 conditions per place. [2022-12-06 00:58:54,793 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 264 selfloop transitions, 72 changer transitions 696/1035 dead transitions. [2022-12-06 00:58:54,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 1035 transitions, 18592 flow [2022-12-06 00:58:54,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:58:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:58:54,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2022-12-06 00:58:54,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5915032679738562 [2022-12-06 00:58:54,795 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2022-12-06 00:58:54,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:58:54,796 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 1035 transitions, 18592 flow [2022-12-06 00:58:54,846 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 1035 transitions, 18592 flow [2022-12-06 00:58:54,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:58:54,850 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:58:54,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 00:58:54,851 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 1035 transitions, 18592 flow [2022-12-06 00:58:54,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-06 00:58:54,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:58:54,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:58:54,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:58:54,851 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:58:54,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:58:54,852 INFO L85 PathProgramCache]: Analyzing trace with hash 732456632, now seen corresponding path program 1 times [2022-12-06 00:58:54,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:58:54,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728691409] [2022-12-06 00:58:54,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:58:54,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:58:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:58:54,968 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-06 00:58:54,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:58:54,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728691409] [2022-12-06 00:58:54,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728691409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:58:54,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:58:54,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:58:54,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135406629] [2022-12-06 00:58:54,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:58:54,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:58:54,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:58:54,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:58:54,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:58:54,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 00:58:54,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 1035 transitions, 18592 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-06 00:58:54,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:58:54,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 00:58:54,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:58:57,050 INFO L130 PetriNetUnfolder]: 9144/13316 cut-off events. [2022-12-06 00:58:57,050 INFO L131 PetriNetUnfolder]: For 5179/5179 co-relation queries the response was YES. [2022-12-06 00:58:57,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129473 conditions, 13316 events. 9144/13316 cut-off events. For 5179/5179 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 75894 event pairs, 13 based on Foata normal form. 0/12329 useless extension candidates. Maximal degree in co-relation 129437. Up to 13081 conditions per place. [2022-12-06 00:58:57,099 INFO L137 encePairwiseOnDemand]: 31/34 looper letters, 441 selfloop transitions, 28 changer transitions 1511/1983 dead transitions. [2022-12-06 00:58:57,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 1983 transitions, 39576 flow [2022-12-06 00:58:57,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:58:57,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:58:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-06 00:58:57,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6102941176470589 [2022-12-06 00:58:57,101 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 36 predicate places. [2022-12-06 00:58:57,101 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:58:57,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 1983 transitions, 39576 flow [2022-12-06 00:58:57,183 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 1983 transitions, 39576 flow [2022-12-06 00:58:57,183 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:58:57,191 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:58:57,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 00:58:57,191 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 1983 transitions, 39576 flow [2022-12-06 00:58:57,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-06 00:58:57,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:58:57,192 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:58:57,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 00:58:57,192 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:58:57,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:58:57,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1945939380, now seen corresponding path program 2 times [2022-12-06 00:58:57,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:58:57,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942134924] [2022-12-06 00:58:57,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:58:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:58:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:58:57,940 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-06 00:58:57,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:58:57,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942134924] [2022-12-06 00:58:57,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942134924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:58:57,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:58:57,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 00:58:57,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991628931] [2022-12-06 00:58:57,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:58:57,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:58:57,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:58:57,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:58:57,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:58:57,942 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 00:58:57,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 1983 transitions, 39576 flow. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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-06 00:58:57,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:58:57,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 00:58:57,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:59:01,595 INFO L130 PetriNetUnfolder]: 9078/13172 cut-off events. [2022-12-06 00:59:01,595 INFO L131 PetriNetUnfolder]: For 6915/6915 co-relation queries the response was YES. [2022-12-06 00:59:01,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140688 conditions, 13172 events. 9078/13172 cut-off events. For 6915/6915 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 74674 event pairs, 10 based on Foata normal form. 29/12225 useless extension candidates. Maximal degree in co-relation 140649. Up to 12978 conditions per place. [2022-12-06 00:59:01,643 INFO L137 encePairwiseOnDemand]: 20/34 looper letters, 212 selfloop transitions, 97 changer transitions 1660/1972 dead transitions. [2022-12-06 00:59:01,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 1972 transitions, 43306 flow [2022-12-06 00:59:01,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 00:59:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 00:59:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 287 transitions. [2022-12-06 00:59:01,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49653979238754326 [2022-12-06 00:59:01,646 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 52 predicate places. [2022-12-06 00:59:01,646 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:59:01,646 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 1972 transitions, 43306 flow [2022-12-06 00:59:01,772 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 1972 transitions, 43306 flow [2022-12-06 00:59:01,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:59:01,779 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:59:01,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-06 00:59:01,781 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 1972 transitions, 43306 flow [2022-12-06 00:59:01,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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-06 00:59:01,781 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:59:01,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:59:01,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 00:59:01,782 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:59:01,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:59:01,782 INFO L85 PathProgramCache]: Analyzing trace with hash -283099640, now seen corresponding path program 1 times [2022-12-06 00:59:01,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:59:01,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386619006] [2022-12-06 00:59:01,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:59:01,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:59:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:59:02,652 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-06 00:59:02,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:59:02,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386619006] [2022-12-06 00:59:02,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386619006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:59:02,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:59:02,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:59:02,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917097805] [2022-12-06 00:59:02,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:59:02,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:59:02,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:59:02,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:59:02,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:59:02,655 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:59:02,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 1972 transitions, 43306 flow. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-06 00:59:02,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:59:02,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:59:02,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:59:08,255 INFO L130 PetriNetUnfolder]: 14068/20833 cut-off events. [2022-12-06 00:59:08,255 INFO L131 PetriNetUnfolder]: For 6960/6960 co-relation queries the response was YES. [2022-12-06 00:59:08,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244172 conditions, 20833 events. 14068/20833 cut-off events. For 6960/6960 co-relation queries the response was YES. Maximal size of possible extension queue 1083. Compared 133265 event pairs, 13 based on Foata normal form. 0/19272 useless extension candidates. Maximal degree in co-relation 244130. Up to 20635 conditions per place. [2022-12-06 00:59:08,321 INFO L137 encePairwiseOnDemand]: 20/34 looper letters, 477 selfloop transitions, 57 changer transitions 3060/3594 dead transitions. [2022-12-06 00:59:08,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 3594 transitions, 85969 flow [2022-12-06 00:59:08,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:59:08,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:59:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2022-12-06 00:59:08,323 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4542483660130719 [2022-12-06 00:59:08,323 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 60 predicate places. [2022-12-06 00:59:08,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:59:08,324 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 3594 transitions, 85969 flow [2022-12-06 00:59:08,494 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 3594 transitions, 85969 flow [2022-12-06 00:59:08,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:59:08,506 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:59:08,506 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:59:08,506 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 3594 transitions, 85969 flow [2022-12-06 00:59:08,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-06 00:59:08,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:59:08,507 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:59:08,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 00:59:08,507 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:59:08,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:59:08,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1626402012, now seen corresponding path program 2 times [2022-12-06 00:59:08,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:59:08,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267994564] [2022-12-06 00:59:08,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:59:08,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:59:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:59:08,625 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-06 00:59:08,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:59:08,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267994564] [2022-12-06 00:59:08,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267994564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:59:08,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:59:08,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:59:08,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191262204] [2022-12-06 00:59:08,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:59:08,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:59:08,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:59:08,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:59:08,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:59:08,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:59:08,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 3594 transitions, 85969 flow. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-06 00:59:08,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:59:08,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:59:08,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:59:20,910 INFO L130 PetriNetUnfolder]: 20746/31014 cut-off events. [2022-12-06 00:59:20,911 INFO L131 PetriNetUnfolder]: For 7071/7071 co-relation queries the response was YES. [2022-12-06 00:59:20,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393817 conditions, 31014 events. 20746/31014 cut-off events. For 7071/7071 co-relation queries the response was YES. Maximal size of possible extension queue 1740. Compared 215597 event pairs, 21 based on Foata normal form. 0/28723 useless extension candidates. Maximal degree in co-relation 393772. Up to 30810 conditions per place. [2022-12-06 00:59:21,017 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 395 selfloop transitions, 20 changer transitions 5784/6199 dead transitions. [2022-12-06 00:59:21,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 6199 transitions, 160713 flow [2022-12-06 00:59:21,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:59:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:59:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 00:59:21,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-06 00:59:21,019 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 63 predicate places. [2022-12-06 00:59:21,019 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:59:21,019 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 6199 transitions, 160713 flow [2022-12-06 00:59:21,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 6199 transitions, 160713 flow [2022-12-06 00:59:21,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:59:21,302 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:59:21,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 284 [2022-12-06 00:59:21,303 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 6199 transitions, 160713 flow [2022-12-06 00:59:21,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-06 00:59:21,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:59:21,303 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:59:21,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 00:59:21,303 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:59:21,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:59:21,304 INFO L85 PathProgramCache]: Analyzing trace with hash -477238264, now seen corresponding path program 3 times [2022-12-06 00:59:21,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:59:21,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687435631] [2022-12-06 00:59:21,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:59:21,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:59:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:59:21,435 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-06 00:59:21,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:59:21,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687435631] [2022-12-06 00:59:21,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687435631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:59:21,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:59:21,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:59:21,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855122892] [2022-12-06 00:59:21,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:59:21,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:59:21,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:59:21,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:59:21,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:59:21,437 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:59:21,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 6199 transitions, 160713 flow. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-06 00:59:21,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:59:21,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:59:21,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:59:57,769 INFO L130 PetriNetUnfolder]: 26537/40029 cut-off events. [2022-12-06 00:59:57,769 INFO L131 PetriNetUnfolder]: For 8264/8264 co-relation queries the response was YES. [2022-12-06 00:59:57,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548356 conditions, 40029 events. 26537/40029 cut-off events. For 8264/8264 co-relation queries the response was YES. Maximal size of possible extension queue 2299. Compared 292774 event pairs, 13 based on Foata normal form. 0/37073 useless extension candidates. Maximal degree in co-relation 548308. Up to 39819 conditions per place. [2022-12-06 00:59:57,906 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 206 selfloop transitions, 28 changer transitions 9608/9842 dead transitions. [2022-12-06 00:59:57,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 9842 transitions, 274933 flow [2022-12-06 00:59:57,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:59:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:59:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-06 00:59:57,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5705882352941176 [2022-12-06 00:59:57,907 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 67 predicate places. [2022-12-06 00:59:57,908 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:59:57,908 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 9842 transitions, 274933 flow [2022-12-06 00:59:58,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 9842 transitions, 274933 flow [2022-12-06 00:59:58,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 00:59:58,367 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:59:58,368 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 461 [2022-12-06 00:59:58,368 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 9842 transitions, 274933 flow [2022-12-06 00:59:58,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-06 00:59:58,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:59:58,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:59:58,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 00:59:58,368 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 00:59:58,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:59:58,369 INFO L85 PathProgramCache]: Analyzing trace with hash -931623328, now seen corresponding path program 4 times [2022-12-06 00:59:58,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:59:58,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123315708] [2022-12-06 00:59:58,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:59:58,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:59:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:59:58,528 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-06 00:59:58,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:59:58,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123315708] [2022-12-06 00:59:58,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123315708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:59:58,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:59:58,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:59:58,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351872355] [2022-12-06 00:59:58,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:59:58,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:59:58,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:59:58,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:59:58,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:59:58,530 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:59:58,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 9842 transitions, 274933 flow. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-06 00:59:58,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:59:58,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:59:58,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:01:44,409 INFO L130 PetriNetUnfolder]: 33456/50877 cut-off events. [2022-12-06 01:01:44,409 INFO L131 PetriNetUnfolder]: For 14053/14053 co-relation queries the response was YES. [2022-12-06 01:01:44,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747983 conditions, 50877 events. 33456/50877 cut-off events. For 14053/14053 co-relation queries the response was YES. Maximal size of possible extension queue 3008. Compared 391780 event pairs, 13 based on Foata normal form. 0/47116 useless extension candidates. Maximal degree in co-relation 747932. Up to 50658 conditions per place. [2022-12-06 01:01:44,605 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 0 selfloop transitions, 0 changer transitions 12697/12697 dead transitions. [2022-12-06 01:01:44,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 12697 transitions, 380072 flow [2022-12-06 01:01:44,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:01:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:01:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-06 01:01:44,610 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5245098039215687 [2022-12-06 01:01:44,610 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 71 predicate places. [2022-12-06 01:01:44,610 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:01:44,610 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 12697 transitions, 380072 flow [2022-12-06 01:01:45,214 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 12697 transitions, 380072 flow [2022-12-06 01:01:45,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:01:45,240 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:01:45,241 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 631 [2022-12-06 01:01:45,241 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 12697 transitions, 380072 flow [2022-12-06 01:01:45,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-06 01:01:45,243 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 01:01:45,244 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 01:01:45,244 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 01:01:45,248 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 01:01:45,248 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 01:01:45,248 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 01:01:45,248 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 01:01:45,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 01:01:45,248 INFO L458 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:01:45,252 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:01:45,252 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:01:45,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:01:45 BasicIcfg [2022-12-06 01:01:45,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:01:45,258 INFO L158 Benchmark]: Toolchain (without parser) took 189371.25ms. Allocated memory was 204.5MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 179.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-06 01:01:45,258 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 204.5MB. Free memory is still 181.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:01:45,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.21ms. Allocated memory is still 204.5MB. Free memory was 179.4MB in the beginning and 150.9MB in the end (delta: 28.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 01:01:45,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.21ms. Allocated memory is still 204.5MB. Free memory was 150.9MB in the beginning and 148.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 01:01:45,258 INFO L158 Benchmark]: Boogie Preprocessor took 34.76ms. Allocated memory is still 204.5MB. Free memory was 148.3MB in the beginning and 146.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:01:45,259 INFO L158 Benchmark]: RCFGBuilder took 632.38ms. Allocated memory is still 204.5MB. Free memory was 146.2MB in the beginning and 107.9MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 01:01:45,259 INFO L158 Benchmark]: TraceAbstraction took 188164.49ms. Allocated memory was 204.5MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 107.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-06 01:01:45,260 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.09ms. Allocated memory is still 204.5MB. Free memory is still 181.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 458.21ms. Allocated memory is still 204.5MB. Free memory was 179.4MB in the beginning and 150.9MB in the end (delta: 28.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.21ms. Allocated memory is still 204.5MB. Free memory was 150.9MB in the beginning and 148.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.76ms. Allocated memory is still 204.5MB. Free memory was 148.3MB in the beginning and 146.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 632.38ms. Allocated memory is still 204.5MB. Free memory was 146.2MB in the beginning and 107.9MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 188164.49ms. Allocated memory was 204.5MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 107.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 141 PlacesBefore, 49 PlacesAfterwards, 130 TransitionsBefore, 37 TransitionsAfterwards, 3286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 45 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2533, independent: 2456, independent conditional: 2456, independent unconditional: 0, dependent: 77, dependent conditional: 77, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2533, independent: 2456, independent conditional: 0, independent unconditional: 2456, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2533, independent: 2456, independent conditional: 0, independent unconditional: 2456, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2533, independent: 2456, independent conditional: 0, independent unconditional: 2456, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2062, independent: 2011, independent conditional: 0, independent unconditional: 2011, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2062, independent: 1985, independent conditional: 0, independent unconditional: 1985, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 263, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 235, dependent conditional: 0, dependent unconditional: 235, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2533, independent: 445, independent conditional: 0, independent unconditional: 445, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 2062, unknown conditional: 0, unknown unconditional: 2062] , Statistics on independence cache: Total cache size (in pairs): 3336, Positive cache size: 3285, Positive conditional cache size: 0, Positive unconditional cache size: 3285, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 49 PlacesBefore, 46 PlacesAfterwards, 58 TransitionsBefore, 55 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 48 PlacesBefore, 48 PlacesAfterwards, 103 TransitionsBefore, 103 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 51 PlacesBefore, 51 PlacesAfterwards, 153 TransitionsBefore, 153 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 54 PlacesBefore, 54 PlacesAfterwards, 217 TransitionsBefore, 217 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 58 PlacesBefore, 58 PlacesAfterwards, 459 TransitionsBefore, 459 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 68 PlacesBefore, 68 PlacesAfterwards, 792 TransitionsBefore, 792 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 74 PlacesBefore, 74 PlacesAfterwards, 933 TransitionsBefore, 933 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 82 PlacesBefore, 82 PlacesAfterwards, 1035 TransitionsBefore, 1035 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 85 PlacesBefore, 85 PlacesAfterwards, 1983 TransitionsBefore, 1983 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 101 PlacesBefore, 101 PlacesAfterwards, 1972 TransitionsBefore, 1972 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 109 PlacesBefore, 109 PlacesAfterwards, 3594 TransitionsBefore, 3594 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 112 PlacesBefore, 112 PlacesAfterwards, 6199 TransitionsBefore, 6199 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 116 PlacesBefore, 116 PlacesAfterwards, 9842 TransitionsBefore, 9842 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 120 PlacesBefore, 120 PlacesAfterwards, 12697 TransitionsBefore, 12697 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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 - 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, 172 locations, 7 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: 188.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 177.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1193 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1193 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2602 IncrementalHoareTripleChecker+Invalid, 2780 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 11 mSDtfsCounter, 2602 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=380072occurred in iteration=14, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1670 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 01:01:45,280 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...